Source: http://www.google.com/patents/US20030058870?dq=5166694
Timestamp: 2014-09-23 13:17:10
Document Index: 690913380

Matched Legal Cases: ['art 126', 'art 134', 'art 136', 'art 126', 'art 128', 'art 130', 'art 126', 'art 126', 'art 126']

Patent US20030058870 - ISCSI receiver implementation - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign in<nobr>Advanced Patent Search</nobr>PatentsApparatus for receiving a sequence of Transmission Control Protocol (TCP) segments, including a parsing machine which is adapted to parse at least one TCP segment so as to recover an Internet Small Computer Systems Interface Protocol Data Unit (iSCSI PDU), the PDU including a header and at least part...http://www.google.com/patents/US20030058870?utm_source=gb-gplus-sharePatent US20030058870 - ISCSI receiver implementationAdvanced Patent SearchPublication numberUS20030058870 A1Publication typeApplicationApplication numberUS 10/236,768Publication dateMar 27, 2003Filing dateSep 6, 2002Priority dateSep 6, 2001Also published asUS7620692, US8150935, US20100241725Publication number10236768, 236768, US 2003/0058870 A1, US 2003/058870 A1, US 20030058870 A1, US 20030058870A1, US 2003058870 A1, US 2003058870A1, US-A1-20030058870, US-A1-2003058870, US2003/0058870A1, US2003/058870A1, US20030058870 A1, US20030058870A1, US2003058870 A1, US2003058870A1InventorsShay Mizrachi, Rafi Shalom, Ron GrinfeldOriginal AssigneeSiliquent Technologies Inc.Export CitationBiBTeX, EndNote, RefManReferenced by (26), Classifications (15), Legal Events (5) External Links: USPTO, USPTO Assignment, EspacenetISCSI receiver implementationUS 20030058870 A1Abstract Apparatus for receiving a sequence of Transmission Control Protocol (TCP) segments, including a parsing machine which is adapted to parse at least one TCP segment so as to recover an Internet Small Computer Systems Interface Protocol Data Unit (iSCSI PDU), the PDU including a header and at least part of a payload. The apparatus further includes at least one analysis machine which is adapted to receive and evaluate the header and to receive and route the at least part of the payload for the iSCSI PDU, the parsing machine and the at least one analysis machine operating substantially autonomously. Images(11) Claims(81)
FIELD OF THE INVENTION [0002] The present invention relates generally to network communications, and specifically to optimizing receiving SCSI traffic using an iSCSI protocol over TCP/IP networks. BACKGROUND OF THE INVENTION [0003] The need for fast access to massive amounts of shared data in today's networked computing environment has given rise to a data storage and retrieval technology called Storage Area Networks (SANs). Increasingly, SAN deployments depend on existing Transmission Control Protocol/Internet Protocol (TCP/IP) networks via an emerging standard Internet Small Computer Systems Interface (iSCSI) protocol. The Internet Engineering Task Force (IETF) Internet Protocol Storage Working Group has proposed a standard for iSCSI, which was submitted in June, 2002 as an Internet-Draft on the standards track of the IETF. The Internet-Draft, titled �iSCSI� by Julian Satran, et al., can be found at http://ietf.org/internet-drafts/draft-ietf-ips-iscsi-13.txt, and is incorporated herein by reference, and is herein referred to as the IETF iSCSI Internet-Draft. Dependence on existing TCP/IP networks creates a need to streamline communication of SCSI commands over TCP/IP networks, in order to achieve maximal performance levels. [0004] In a traditional approach to data storage, called Direct Attached Storage (DAS), storage devices are linked to a server with a fixed, dedicated connection. Only one server can normally access data on a particular disk, via a local bus, commonly using a Small Computer Systems Interface (SCSI) protocol. The original SCSI protocol was standardized in 1986 by the American National Standards Institute (ANSI) as X3.131-1986. The current evolving SCSI standard is described in a document titled �SCSI Architecture Model�2 (SAM-2),� produced by T10, Technical Committee of the National Committee on Information Technology Standards, which may be found on the T10 Internet site at ftp://ftp.t10.org/t10/drafts/sam2, and which is incorporated herein by reference. DAS suffers from a number of limitations, for example, the SCSI protocol limits the length of a bus connecting to a device to about 6 meters. Additional limitations and drawbacks include upper limits on speed, and number of attached storage devices, limited scalability and reliability, and limitations of exclusive ownership of attached storage. These limitations are addressed by SANs. [0005]FIG. 1 is a schematic block diagram depicting an architecture 10 for a Storage Area Network (SAN), as is known in the art. Architecture 10 comprises one or more users 20 operating one or more applications on one or more hardware platforms. The one or more applications generate requests for retrieval or storage of data. These requests are transferred via a LAN 26 to a server. In architecture 10, three different servers are present: a mail server 28, an application server 30, and a database server 32. Each server is designed to handle user requests of a specified type. For example, database server 32 is designed to handle requests to retrieve data from a centralized database. Each server communicates with a SAN 40 to satisfy its requests. Mail server 28, application server 30, and database server 32 generate commands to storage devices 42, 44, 46, and 48 in a format comprehensible to the devices, typically using the SCSI protocol. Storage devices 42, 44, 46, and 48 are also herein termed storage devices A, B, C, and D respectively. The commands are routed through SAN 40 via hubs and switches 34 and 36, which provide one or more connection ports for the storage devices. Storage devices A, B, C, and D comprise SCSI controllers which carry out the actions specified in the SCSI commands. A variety of storage devices and media are known in the art, including redundant arrays of independent disks (RAID), tapes, and optical storage arrays. [0006] SANs handle communication between storage devices and storage clients. As noted above, the SCSI protocol acts as a common, standard interface to storage devices. Devices using the SCSI protocol include input/output (I/O) devices, hard drives, tape drives, CD and DVD drives, printers, and scanners. As well as defining hardware characteristics of an SCSI bus, the SCSI protocol specifies the formats and rules governing commands and responses communicated between storage devices, called �targets� in SCSI terminology, and storage clients, known as �initiators.�
[0007] In an article entitled �Overview and History of the SCSI Interface� by Charles M. Kozierok, published in the PC Guide which can be found at http://www.pcguide.com/ref/hdd/if/scsi/over-c.html, and which is incorporated herein by reference, the author emphasizes the general nature of the SCSI interface: �It's important to remember that SCSI is, at its heart, a system interface, as the name suggests. It was first developed for hard disks, is still used most for hard disks . . . For those reasons, SCSI is sometimes thought of as a hard disk interface . . . However, SCSI is not an interface tied specifically to hard disks. Any type of device can be present on the bus . . . �
[0008] A SAN containing SCSI-based storage devices has at its core the task of SCSI transport: facilitating the transmission of SCSI commands and responses between targets and initiators. The first technology released for SCSI transport in the SAN environment was Fibre Channel, using special-purpose hardware, optimized for storage and other high-speed applications. The high costs associated with Fibre Channel installation, management, maintenance, and interoperability, together with the availability of Gigabit Ethernet and 10-Gigabit Ethernet, which are not limited to Fibre Channel fabrics, inter alia gave rise to the iSCSI protocol. Gigabit Ethernet and 10-Gigabit Ethernet provide data rates of one gigabit per second and 10 gigabits per second respectively, based on Ethernet frame formats and protocols, for example, the IEEE 802.3(Z) Ethernet protocol, issued by the Institute of Electrical and Electronics Engineers, Inc., N.J. [0009] The iSCSI protocol is a transport protocol for SCSI commands over TCP networks. TCP is described by Postel in Request For Comments (RFC) 793 of the U.S. Defense Advanced Research Projects Agency (DARPA), entitled �Transmission Control Protocol: DARPA Internet Program Protocol Specification� (1981), which is incorporated herein by reference. The IETF iSCSI Internet-Draft document defines methods for encapsulating SCSI command descriptor blocks (CDBs) and responses into iSCSI messages, known as Protocol Data Units (PDUs), controlling flow, establishing iSCSI sessions, identifying PDUs in the TCP stream, mapping a session to multiple connections, and adding correction code on top of the TCP protocol, among other protocol elements. [0010] A related, informational Internet-Draft by the IP Storage Working Group entitled �iSCSI Requirements and Design Considerations� by Marjorie Krueger, et al. can be found at http://ietf.org/internet-drafts/draft-ietf-ips-iscsi-reqmts-05.txt, and is incorporated herein by reference. Krueger, et al. describe the charter of the IP Storage Working Group as �developing comprehensive technology to transport block storage data over IP protocols . . . The initial version of the iSCSI protocol will define a mapping of SCSI transport protocol over TCP/IP so that SCSI storage controllers (principally disk and tape arrays and libraries) can be attached to IP networks, notably Gigabit Ethernet (GbE) and 10 Gigabit Ethernet (10 GbE).�
[0011] The benefits to SAN implementations based on iSCSI derive primarily from the large body of experience, knowledge, tools, and equipment that exist in the industry in both the fields of SCSI and TCP/IP. As Krueger, et al. go on to note, the IP Storage working Group �has chosen to focus the first version of the protocol to work with the existing SCSI architecture and commands, and the existing TCP/IP transport layer. Both these protocols are widely deployed and well understood. The thought is that using these mature protocols will entail a minimum of new invention, the most rapid possible adoption, and the greatest compatibility with Internet architecture, protocols, and equipment.�
[0012] The standard layered architectural model for communications between two users in a network is known as the International Standards Organization's Open Systems Interconnection (ISO/OSI) and is specified in standard ISO/IEC 7498-1:1994, �Open, Systems Interconnection�Basic Reference Model: The Basic Model.� An overview of the OSI reference model is provided in an article entitled �OSI,� which can be found at the Internet site http://searchnetworking.techtarget.com/sDefinition/0,,sid 7_gci212725,00.html, and which is incorporated herein by reference. [0013] The OSI reference model (OSI-RM) is well known to those skilled in the art, and describes layers of functions which are comprised in network communications. A layer comprises one or more protocols which work together to provide a set of network functions, with each intermediate protocol layer using the layer below it to provide services to the layer above it. The hierarchical aggregation of these protocols is known as a protocol stack. [0014] Reference is now made to FIG. 2, which is a schematic block diagram depicting a five-layer protocol stack 60 used in iSCSI, as is known in the art. Protocol stack 60 is a set of protocol layers required to transfer SCSI commands over a TCP/IP network. Each layer may be implemented in software or hardware, or a combination of both. A SCSI highest layer 62 comprises formulating and interpreting SCSI CDBs and responses 72, and is typically implemented in an operating system or SCSI controller. CDBs and responses 72 pass to an iSCSI layer 64 responsible for implementing the iSCSI protocol, and create iSCSI Protocol Data Units (PDUs) 73, by adding to the SCSI CDBs and responses. Additions may comprise headers and other information needed to facilitate transport in a network, e.g., a length of the iSCSI PDU. [0015] Optionally, PDUs contain a header digest and data digest. A digest, as is known in the art, is a string of digits calculated by a function such as a one-way hash formula applied to a stream of data, and is used to verify data integrity. A digest is calculated, for example, by a transmitter and appended to a transmission. A receiver re-calculates the digest based on the data received, and compares it to the received digest. If the receiver-calculated digest does not match the transmitted digest, intentional or unintentional corruption of the transmitted data has occurred. Use of digests is optional and is determined by negotiations between an initiator and target during a login process. [0016] PDUs 73 are transferred to a TCP layer 66, which implements functions of the OSI-RM Transport Layer, e.g., error checking and flow control, and generates one or more TCP segments 74 from PDUs 73. An IP layer 68 performs the functions of the OSI-RM Network Layer, e.g., routing and forwarding of packets in a network, producing IP packets 75. Finally, a lowest level Ethernet layer 70 implements the OSI-RM Data-Link Layer, performing synchronization for the physical transmission and handling low-level communications functions. Ethernet layer 70 transmits and receives data via a physical transmission medium (not shown in FIG. 2). Protocol stack 60 depicts transmitting, when viewed from SCSI layer 60 downward, and receiving, when viewed from Ethernet layer 70 upward. [0017]FIG. 3 is a schematic block diagram depicting a flow 80 of SCSI transactions between an initiator and a target in an iSCSI architecture, as is known in the art. Flow 80 uses a protocol stack similar to that depicted in FIG. 2. Transmission begins with a user 82 initiating a storage request. User 82 performs substantially the same functions as user 20 in FIG. 1. The storage request may specify retrieval or storage of data, and is passed to a server 84 comprising a SCSI controller 86, an iSCSI transmit/receive device 87, and a TCP/IP protocol device 88. Server 84 corresponds to one of mail server 28, application server 30, or database server 32 described in reference to FIG. 1. The iSCSI protocol stack presented in FIG. 2 is implemented in iSCSI transmit/receive device 87, which may be implemented in software (e.g., a part of a computer operating system), hardware (e.g., a dedicated chip or board), or a combination of software and hardware, together with physical links 91 and 93. [0018] SCSI controller 86 formulates the storage request in terms of one or more SCSI CDBs, substantially the same as CDBs 72 in FIG. 2. iSCSI transmit/receive device 87 constructs iSCSI PDUs, substantially the same as PDUs 73 in FIG. 2. TCP/IP protocol device 88 transforms the iSCSI PDUs into TCP segments, then into IP packets 92 (and also adds an Ethernet layer similar to layer 70), corresponding to TCP segments 74 and IP packets 75 in FIG. 2, respectively. IP packets 92 are transmitted in the direction of a target storage device 104 via physical links 91 and 93 and a TCP/IP network 90, which supports an Ethernet protocol corresponding to the Ethernet layer added. IP packets 92 are typically received by a storage server 100, which comprises a TCP/IP protocol device 96, an iSCSI receive/transmit device 98 and a SCSI controller 102, which are substantially similar in implementation to TCP/IP protocol device 88, iSCSI receive/transmit device 87 and SCSI controller 86. [0019] IP packets 92 are deciphered into TCP segments by TCP/IP protocol stack 96, and the resulting TCP segments are processed by iSCSI receive/transmit 98, which reconstructs iSCSI PDUs and handles iSCSI flow control. The SCSI commands are extracted from the resulting iSCSI PDUs, and passed to SCSI controller 102, which causes the execution of the commands on a storage device 104. [0020] Data returned from storage device 104, called a SCSI response, flows in a reverse order, from storage device 104, through the components of storage server 100, via IP network 90 to application server 84, and finally to user 82. It will be understood that FIG. 3 illustrates a sample configuration of an iSCSI architecture; numerous variations on this sample configuration are known in the art. [0021] It will be clear from an examination of FIG. 3 that implementation of the iSCSI protocol comprises implementing a transmitter and a receiver function for both user 82 as an initiator of SCSI commands and device 104 as a target. As well, it is noted that communications between user 82 and device 104 occur over one or more TCP connections, as indicated schematically by arrows 91, 93, 95, and 97. A collection of TCP connections comprising communications between a specific initiator and a specific target is called a session, and is uniquely identified by a session ID number. [0022]FIG. 4 is a schematic block diagram illustrating a mapping of TCP segments to iSCSI PDUs, assumed to be independent of each other, as is known in the art. FIG. 4 presents a stream of data 120, transmitted from server 84, which comprises three iSCSI PDUs: an iSCSI PDU 1, an iSCSI PDU 2, and an iSCSI PDU 3. Each iSCSI PDU comprises a header and, optionally, payload data, depending on the type of SCSI CDB or response contained in the PDU. Thus, iSCSI PDU 1 comprises Header 1 and Data 1, while iSCSI PDU 2 comprises only Header 2. To accomplish transmission over network 90 (FIG. 3), TCP/IP protocol device 88 partitions the three PDUs into five different TCP segments. Thus, TCP segment 1 comprises all of PDU 1's header and a portion 126 of its payload. TCP segment 2 comprises a further portion 128 of PDU 1's payload. TCP segment 3 comprises a last portion 130 of PDU 1's payload data, all of PDU 2's header (132), and a portion 134 of PDU 3's header. The IETF iSCSI Internet-Draft proposes mechanisms for delineating PDUs, i.e., determining beginning and ending boundaries for PDUs. [0023] Since speed and throughput are prime factors in any iSCSI implementation, many iSCSI receiver implementations comprise embedded logic on an integrated circuit, located, for example, in iSCSI receive/transmit 98 (FIG. 3). Furthermore, high line speeds of one Gbit/s and 10 Gb/s require multiple processors in order to avoid bottlenecks. [0024] Implementing iSCSI across multiple processors raises numerous questions and problems. For example, generating a complete iSCSI implementation on each processor results in significant duplication, and waste of integrated circuit resources. Deciding how to allocate incoming TCP segments among multiple processors raises additional problems. For example, if segments are allocated according to load balancing considerations only, race conditions could result from messages from a single connection being processed in different processors which access a shared memory. Thus, additional logic and data would be required to synchronize access from the different processors. Alternatively, allocating messages according to connection, i.e., all messages from a given connection A are allocated to processor A, could cause great inefficiencies in the case of a dominant connection using most of the line capacity. There is thus a need for an improved method for multiple processors to support iSCSI. SUMMARY OF THE INVENTION [0025] It is an object of some aspects of the present invention to provide a method and apparatus for partitioning tasks of an Internet Small Computer Systems Interface (iSCSI) receiver. [0026] It is a further object of some aspects of the present invention to provide a method and apparatus for partitioning tasks of an iSCSI receiver among multiple processors. [0027] In preferred embodiments of the present invention, a method and an apparatus for implementing an iSCSI receiver is defined. The receiver uses an architecture suited for implementation by more than one processor. The method comprises partitioning an iSCSI receiver algorithm into three logical event-driven tasks, each embodied by a different logical machine: a parsing, Protocol Data Unit (PDU) delineation machine, called a P-machine; a data processing machine, called a D-machine; and a header processing machine, called an H-machine. By thus partitioning the iSCSI receiver algorithm, partial PDUs can be processed immediately, without waiting for an entire PDU to be assembled. The three machines may be allocated among a plurality of physical processors, so that multiple incoming iSCSI messages can be processed in parallel, thereby increasing speed and throughput. [0028] The iSCSI receiver receives a Transmission Control Protocol (TCP) segment via a network interface, which may contain a part of an iSCSI PDU, a whole PDU, or multiple PDUs. Since SCSI transfers typically involve transfer of large quantities of data, it is common for a single PDU to comprise a lengthy data section, which is split into a plurality of TCP segments. In preferred embodiments of the present invention, the TCP segment is parsed by the P-machine to determine starting and ending boundaries of a header and optional data payload of the PDU, the iSCSI header is processed by the H-machine, and any data contained in the TCP segment is processed by the D-machine. Received data, even if it comprises only a fragment of the PDU's complete data payload, is sent directly to its intended destination via a device interface, without intermediate buffering In some preferred embodiments, additional data digest and header digest processing are performed, dependent on the D-machine and H-machine respectively, preferably as separate tasks. [0029] Unlike other methods known in the art for iSCSI receiver implementation, in preferred embodiments of the present invention: [0030] Incoming TCP segments are immediately parsed into whole or partial PDUs, which in turn are processed directly, without waiting to assemble a complete PDU; [0031] The iSCSI receiver processing is partitioned in such a way so as to enhance efficiency of a multi-processor implementation by minimizing inter-processor communication and shared parameters, thereby minimizing overhead resulting from synchronization requirements; [0032] TCP segments are processed directly and data is sent to its destination with no intermediate buffering, improving speed and minimizing resource use; [0033] Optimal use of multiple processors is facilitated, by allocating physical processors according to logical tasks to be performed on a TCP segment, rather than on the basis of connection or load balancing; and [0034] Duplication of logic among multiple processors is avoided, conserving integrated circuit resources. [0035] There is therefore provided, according to a preferred embodiment of the present invention, apparatus for receiving a sequence of Transmission Control Protocol (TCP) segments, including: [0036] a parsing machine which is adapted to parse at least one TCP segment so as to recover an Internet Small Computer Systems Interface Protocol Data Unit (iSCSI PDU), the PDU including a header and at least part of a payload; and [0037] at least one analysis machine which is adapted to receive and evaluate the header and to receive and route the at least part of the payload for the iSCSI PDU, the parsing machine and the at least one analysis machine operating substantially autonomously. [0038] Preferably, the TCP segments are generated by at least one of an iSCSI initiator and an iSCSI target. [0039] Preferably, the parsing machine and the at least one analysis machine are implemented using at least two separate physical processors. [0040] Preferably, the header is included in a plurality of incoming TCP segments. [0041] Further preferably, the payload is included in a plurality of incoming TCP segments. [0042] The apparatus preferably further includes a header-digest machine which is adapted to generate a computed-header-digest responsive to the header, the computed-header-digest being compared by the parsing machine to a header-segment-header-digest included in the header so as to verify error-free receipt of the header for the iSCSI PDU, the header-digest machine, the parsing machine, and the at least one analysis machine operating substantially autonomously. [0043] The apparatus preferably further includes a data-digest machine which is adapted to generate a computed-data-digest responsive to the payload, the computed-data-digest being compared by the at least one analysis machine to a header-segment-data-digest included in the header so as to verify error-free receipt of the payload of the iSCSI PDU, the data-digest machine, the parsing machine, and the at least one analysis machine operating substantially autonomously. [0044] Preferably, the parsing machine is adapted to generate a computed-header-digest, and to compare the computed-header-digest to a header-segment-header-digest included in the header for the iSCSI PDU so as to verify error-free receipt of the header. [0045] Preferably, the parsing machine is adapted to receive and route at least one parsing event and to execute parsing actions, responsive to the at least one parsing event. [0046] Further preferably, the at least one parsing event includes at least one of a receive-TCP-segment event indicative of receipt of the TCP segment and a received-pass-PDU event indicative of acknowledgement by the at least one analysis machine of receipt of an initial part of the payload. [0047] Further preferably, the parsing actions include: [0048] determining a starting header boundary and an ending header boundary so as to delineate the header; [0049] recovering the header from the at least one TCP segment; [0050] determining a starting payload boundary and an ending payload boundary so as to delineate the at least part of the payload; [0051] conveying the header and the at least part of the payload to the at least one analysis machine; [0052] identifying the at least part of the payload as an initial part of the payload for the iSCSI PDU; and [0053] receiving an acknowledgment of receipt of the initial part of the payload from the at least one analysis machine. [0054] Preferably, the at least one analysis machine includes: [0055] a header-processing machine which evaluates the header; and [0056] a data-processing machine which routes the at least part of the payload, the header-processing machine and the data-processing machine operating substantially autonomously. [0057] Preferably, the header-processing machine is adapted to receive and route at least one header event, and to execute header processing actions, responsive to the at least one header event. [0058] Further preferably, the at least one header event includes at least one of a pass-PDU-data event indicative of receipt by the parsing machine of an initial part of the payload of the iSCSI PDU, a handle-PDU-header event indicative of receipt by the parsing machine of the header, and a data-digest-result event indicative of completion of a data digest calculation by the data-processing machine. [0059] Further preferably, the header processing actions include: [0060] identifying the at least part of the payload as an initial part of the payload for the iSCSI PDU; [0061] determining a disposition of the initial part of the payload by computing a destination address in a system memory for the initial part of the payload; [0062] recovering iSCSI information from the header; and [0063] executing iSCSI actions responsive to the iSCSI information. [0064] Preferably, the data-processing machine is adapted to generate a computed-data-digest, and to compare the computed-data-digest to a header-segment-data-digest included in the header of the iSCSI PDU so as to verify error-free receipt of the payload. [0065] Preferably, the data-processing machine is adapted to receive and route at least one data event and to execute data processing actions responsive to the at least one data event. [0066] Further preferably, the data processing actions include computing a data digest responsive to the payload so as to verify error-free receipt of the payload for the iSCSI PDU. [0067] Further preferably, the at least one data event includes at least one of a handle-initial-PDU-data event indicative of receipt of an initial part of the payload, and a handle-PDU-data event indicative of receipt of a subsequent part of the payload. [0068] Further preferably, the data processing actions include: [0069] transferring data included in the at least part of the payload to a system memory; [0070] determining that the at least part of the payload is an initial part of the payload for the iSCSI PDU; and [0071] acknowledging receipt of the initial part of the payload. [0072] Further preferably, transferring the data includes: [0073] calculating a destination address in a system memory for the data, responsive to a disposition of the payload; moving a received-quantity-of-data from the at least part of the payload to the destination address; [0074] determining an expected-quantity-of-data for the iSCSI PDU; and [0075] evaluating a state of completion for the iSCSI PDU responsive to a comparison of the received-quantity-of-data to the expected-quantity-of-data. [0076] There is further provided, according to a preferred embodiment of the present invention, network interface apparatus, including: [0077] a device interface, adapted to communicate with a computing device, which is adapted to receive and execute Small Computer Systems Interface (SCSI) operations and has a system memory; [0078] a network interface, adapted to receive from a network a sequence of Transmission Control Protocol (TCP) segments that contains an Internet Small Computer Systems Interface Protocol Data Unit (iSCSI PDU), the iSCSI PDU including a header and a payload; and [0079] an analysis machine, adapted to parse at least one TCP segment so as to recover the header and at least part of the payload of the iSCSI PDU, to evaluate the header so as to determine a disposition of the payload, and to route the at least part of the payload to the system memory for processing by the computing device responsive to the disposition, independent of recovering a remainder of the payload beyond the recovered at least part of the payload. [0080] Preferably, the TCP segments are generated by at least one of an iSCSI initiator and an iSCSI target. [0081] Preferably, the analysis machine is implemented using at least two separate physical processors. [0082] Preferably, the header is included in a plurality of incoming TCP segments. [0083] Preferably, the payload is included in a plurality of incoming TCP segments. [0084] The apparatus preferably further includes a header-digest machine which is adapted to generate a computed-header-digest responsive to the header, the computed-header-digest being compared to a header-segment-header-digest included in the header so as to verify error-free receipt of the header for the iSCSI PDU. [0085] The apparatus preferably further includes a data-digest machine which is adapted to generate a computed-data-digest responsive to the payload, the computed-data-digest being compared to a header-segment-data-digest included in the header so as to verify error-free receipt of the payload for the iSCSI PDU. [0086] Preferably, the analysis machine includes: [0087] a parsing machine which is adapted to parse at least one TCP segment so as to recover the header and the at least part of the payload of the iSCSI PDU; [0088] a header-processing machine which is adapted to evaluate the header so as to determine a disposition of the payload; and [0089] a data-processing machine which is adapted to route the at least part of the payload to the system memory for processing by the computing device responsive to the disposition, independent of recovering a remainder of the payload beyond the recovered part. [0090] Preferably, the header-processing machine is adapted to receive and route at least one header event, and to execute header processing actions, responsive to the at least one header event. [0091] Further preferably, the at least one header event includes at least one of a pass-PDU-data event indicative of receipt by the parsing machine of an initial part of the payload of the iSCSI PDU, a handle-PDU-header event indicative of receipt by the parsing machine of a header, and a data-digest-result event indicative of completion of a data digest calculation by the data-processing machine. [0092] Further preferably, the header processing actions include: [0093] identifying the at least part of the payload as an initial part of the payload for each of the iSCSI PDU; [0094] determining a destination address in the system memory for the at least part of the payload; [0095] recovering iSCSI information from the header; and [0096] executing iSCSI actions responsive to the iSCSI information. [0097] Preferably, the data-processing machine is adapted to generate a computed-data-digest, and to compare the computed-data-digest to a header-segment-data-digest comprised in the header for the iSCSI PDU so as to verify error-free receipt of the payload. [0098] Preferably, the data-processing machine is adapted to receive and route at least one data event and to execute data processing actions responsive to the at least one data event. [0099] Preferably, the at least one data event includes at least one of a handle-initial-PDU-data event indicative of receipt of an initial part of the payload, and a handle-PDU-data event indicative of receipt of a subsequent part of the payload. [0100] Preferably, the data processing actions include: [0101] transferring data included in the at least part of the payload to the system memory; [0102] determining that the at least part of the payload is an initial part of the payload for the iSCSI PDU; and [0103] acknowledging receipt of the initial part. [0104] Further preferably, transferring the data includes: [0105] calculating a destination address in the system memory for the data, responsive to the disposition of the payload; [0106] moving a received-quantity-of-data from the at least part of the payload to the destination address; [0107] determining an expected-quantity-of-data for the iSCSI PDU; and [0108] evaluating a state of completion for the iSCSI PDU responsive to a comparison of the received-quantity-of-data to the expected-quantity-of-data. [0109] Preferably, the data processing actions include computing a data digest responsive to the payload so as to verify error-free receipt of the payload for the iSCSI PDU. [0110] Preferably, the parsing machine is adapted to receive and route at least one parsing event and to execute parsing actions, responsive to the at least one parsing event. [0111] Preferably, the at least one parsing event comprises at least one of receive-TCP-segment event indicative of receipt of the TCP segment, and a received-pass-PDU event indicative of acknowledgement of receipt of an initial part of payload. [0112] Preferably, the parsing actions comprise: [0113] determining a starting header-segment boundary and an ending header-segment boundary so as to delineate the header; [0114] recovering the header from the at least one TCP segment; [0115] determining a starting payload boundary and an ending payload boundary so as to delineate the at least part of the payload; [0116] conveying the header to the header-processing machine and the at least part of the payload to the data-processing machine, independent of delineating an entire payload; [0117] identifying the at least part of the payload as an initial part of the entire payload for the iSCSI PDU; and [0118] receiving an acknowledgment of receipt of the initial part from the data-processing machine. [0119] Preferably, the parsing machine is adapted to generate a computed-header-digest, and to compare the computed-header-digest to a header-segment-header-digest comprised in the header for the iSCSI PDU so as to verify error-free receipt of the header. [0120] There is further provided, according to a preferred embodiment of the present invention, a method for receiving a sequence of Transmission Control Protocol (TCP) segments, including: [0121] parsing in a parsing machine the at least one TCP segment into one or more Internet Small Computer Systems Interface Protocol Data Units (iSCSI PDUs), the parsing machine being adapted to recover a header and at least a part of a payload for the iSCSI PDU; and [0122] receiving and evaluating the header and receiving and routing the at least part of the payload for the iSCSI PDU in at least one analysis machine, so that the parsing machine and the at least one analysis machine operate substantially autonomously. [0123] Preferably, receiving the TCP segments includes receiving TCP segments generated by at least one of an iSCSI initiator and an iSCSI target. [0124] The method preferably includes implementing the parsing machine and the at least one analysis machine using at least two separate physical processors. [0125] Preferably, the header is included in a plurality of incoming TCP segments. [0126] Preferably, the payload is included in a plurality of incoming TCP segments. [0127] The method preferably further includes generating a computed-data-digest responsive to the payload in a data-digest machine and comparing the computed-data-digest to a header-segment-data-digest comprised in the header in the at least one analysis machine so as to verify error-free receipt of the payload for the iSCSI PDU. [0128] The method preferably further includes generating a computed-header-digest responsive to the header in a header-digest machine and comparing the computed-header-digest to a header-segment-header-digest comprised in the header in the parsing machine so as to verify error-free receipt of the header for the iSCSI PDU. [0129] Preferably, the parsing machine is adapted to receive and route at least one parsing event and to execute parsing actions, responsive to the at least one parsing event. [0130] Further preferably, the parsing events include at least one of a receive-TCP-segment event indicative of receipt of the TCP segment, and a received-pass-PDU event indicative of acknowledgement by the at least one analysis machine of receipt of an initial part of the payload included in the at least part of the payload. [0131] Preferably, the parsing actions include: [0132] determining a starting header boundary and an ending header boundary so as to delineate the header; [0133] recovering the header from the at least one TCP segment; [0134] determining a starting payload boundary and an ending payload boundary so as to delineate the at least part of the payload; [0135] conveying the header and the at least part of the payload to the at least one analysis machine; [0136] identifying the at least part of the payload as an initial part of the payload for the iSCSI PDU; and [0137] receiving an acknowledgment of receipt of the initial part of the payload from the at least one analysis machine. [0138] Preferably, the parsing actions include verifying error-free receipt of the header by comparing a computed-header-digest generated by the parsing machine to a header-segment-header-digest included in the header for the iSCSI PDU. [0139] Preferably, receiving and evaluating the header and receiving and routing the at least part of the payload includes: [0140] receiving and evaluating the header in a header-processing machine; and [0141] receiving and routing the at least part of the payload in a data-processing machine, the header-processing machine and the data-processing machine operating substantially autonomously. [0142] Preferably, the header-processing machine is adapted to receive and route at least one header event, and to execute header processing actions, responsive to the at least one header event. [0143] Preferably, the header events include at least one of a pass-PDU-data event indicative of receipt by the parsing machine of an initial part of the payload of the iSCSI PDU, a handle-PDU-header event indicative of receipt by the parsing machine of a header, and a data-digest-result event indicative of completion of a data digest calculation by the data-processing machine. [0144] Preferably, the header processing actions include: [0145] identifying the at least part of the payload as an initial part of the payload for the iSCSI PDU; [0146] determining a destination address in a system memory for the at least part of the payload; [0147] recovering iSCSI information from the header; and [0148] executing iSCSI actions responsive to the iSCSI information. [0149] Preferably, the header processing actions include verifying error-free receipt of the payload by comparing a computed-data-digest generated by the data-processing machine to a header-segment-data-digest included in the header. [0150] Preferably, the data-processing machine is adapted to receive and route at least one data event and to execute data processing actions, responsive to the at least one data event. [0151] Further preferably, the data events include at least one of a handle-initial-PDU-data event indicative of receipt of an initial part of the payload included in the at least part of the payload, and a handle-PDU-data event indicative of receipt of a subsequent part of the payload. [0152] Preferably, the data processing actions include: [0153] transferring data included in the at least part of the payload to a system memory; [0154] determining that the at least part of the payload is an initial part of the payload; and [0155] acknowledging receipt of the initial part. [0156] Preferably, transferring the data includes: [0157] calculating a destination address in the system memory for the data; [0158] moving a received-quantity-of-data from the at least part of the payload to the destination address; [0159] determining an expected-quantity-of-data for the iSCSI PDU; and [0160] evaluating a state of completion for the iSCSI PDU responsive to a comparison of the received-quantity-of-data to the expected-quantity-of-data. [0161] Preferably, the data processing actions include computing a data digest responsive to the payload so as to verify error-free receipt of the payload for the iSCSI PDU. [0162] There is further provided, according to a preferred embodiment of the present invention, a method for processing a sequence of Transmission Control Protocol (TCP) segments that contains an Internet Small Computer Systems Interface Protocol Data Unit (iSCSI PDU), the iSCSI PDU including a header and a payload, the method including: [0163] parsing the TCP segments so as to recover the header and at least a part of the payload of the iSCSI PDU; [0164] evaluating the header so as to determine a disposition of the payload; and [0165] routing the at least part of the payload responsive to the disposition, independent of recovering a remainder of the payload beyond the recovered part. [0166] Preferably, routing the at least part of the payload includes writing the payload to a memory of a computing device, for processing by the device in accordance with the header. [0167] Further preferably, parsing the TCP segments and evaluating the header include parsing and evaluating using a network interface device that receives the TCP segments over a network, and wherein routing the at least part of the payload includes transferring the payload from the network interface device to a memory of a computing device. [0168] The method preferably further includes implementing the parsing, recovering, receiving, and routing using at least two separate physical processors. [0169] Preferably, the header is included in a plurality of incoming TCP segments. [0170] Preferably, the payload is included in a plurality of incoming TCP segments. [0171] The method preferably further includes generating a computed-header-digest responsive to the header, and comparing the computed-header-digest to a header-segment-header-digest included in the header to verify error-free receipt of the header. [0172] The method preferably further includes generating a computed-data-digest responsive to the payload, and comparing the computed-data-digest to a header-segment-data-digest comprised in the header so as to verify error-free receipt of the payload for the iSCSI PDUs. [0173] Preferably, parsing the TCP segment includes receiving and routing at least one parsing event and executing parsing actions, responsive to the at least one parsing event. [0174] Preferably, the parsing events include at least one of a receive-TCP-segment event indicative of receipt of the TCP segment, and a received-pass-PDU event indicative of acknowledgement of receipt of an initial part of the payload included in the at least part of the payload. [0175] Preferably, the parsing actions include: [0176] determining a starting header boundary and an ending header boundary so as to delineate the header; [0177] recovering the header from the at least one TCP segment; [0178] determining a starting payload boundary and an ending payload boundary so as to delineate the part of the payload; [0179] conveying the header and the at least part of the payload for additional processing, independent of delineating an entire payload; [0180] identifying the at least part of the payload as an initial part of the entire payload; and [0181] receiving an acknowledgment of receipt of the initial part. [0182] Preferably, receiving and evaluating the header comprises receiving and routing at least one header event, and executing header processing actions responsive to the at least one header event. [0183] Further preferably, the header events include at least one of a pass-PDU-data event indicative of receipt of an initial part of the payload of the iSCSI PDU, a handle-PDU-header event indicative of receipt of a header, and a data-digest-result event indicative of completion of a data digest calculation. [0184] Preferably, the header processing actions include: [0185] identifying the at least part of the payload as an initial part of the payload; [0186] determining a disposition of the at least part of the payload by computing a destination address in a system memory for data included in the part; [0187] recovering iSCSI information from the header-segment; and [0188] executing iSCSI actions responsive to the iSCSI information. [0189] Preferably, receiving and routing the at least part of the payload includes receiving and routing at least one data event and executing data processing actions, responsive to the at least one data event. [0190] Preferably, the data events include at least one of a handle-initial-PDU-data event indicative of receipt of an initial part of the payload included in the at least part of the payload, and a handle-PDU-data event indicative of receipt of a subsequent part of the payload. [0191] Preferably, the data processing actions include: [0192] transferring data including in the at least part of the payload to a system memory; [0193] determining that the part of the payload is an initial part of the payload for the iSCSI PDU; and [0194] acknowledging receipt of the initial part. [0195] Preferably, transferring the data includes: [0196] calculating a destination address in the system memory for the data, responsive to a disposition of the payload; [0197] moving a received-quantity-of-data from the at least part of the payload to the destination address; [0198] determining an expected-quantity-of-data for the iSCSI PDU; and [0199] evaluating a state of completion for the iSCSI PDU responsive to a comparison of the received-quantity-of-data to the expected-quantity-of-data. [0200] The present invention will be more fully understood from the following detailed description of the preferred embodiments thereof, taken together with the drawings, in which: BRIEF DESCRIPTION OF THE DRAWINGS [0201]FIG. 1 is a schematic block diagram depicting an architecture for a Storage Area Network (SAN), as is known in the art; [0202]FIG. 2 is a schematic block diagram depicting a protocol stack used in an Internet Small Computer Systems Interface (iSCSI), as is known in the art; [0203]FIG. 3 is a schematic block diagram depicting a flow of SCSI transactions between an initiator and a target in an iSCSI architecture, as is known in the art; [0204]FIG. 4 is a schematic block diagram illustrating a mapping of TCP segments to iSCSI Protocol Data Units (PDUs), as is known in the art; [0205]FIG. 5 is a combined state diagram and data flow diagram that schematically shows states, processing, events, transitions, and data flow comprised in iSCSI receiver processing, according to a preferred embodiment of the present invention; [0206]FIGS. 6A and 6B are a flow chart that schematically illustrates logic comprised in the P-machine of FIG. 5, according to a preferred embodiment of the present invention; [0207]FIG. 7 is a flow chart that schematically illustrates logic comprised in the D-machine of FIG. 5, according to a preferred embodiment of the present invention; [0208]FIG. 8 is a flow chart that schematically illustrates logic comprised in the H-machine of FIG. 5, according to a preferred embodiment of the present invention; and [0209]FIG. 9 is a schematic block diagram depicting an allocation of iSCSI receiver processing to physical processors, according to a preferred embodiment of the present invention. DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS [0210] Reference is now made to FIG. 5, which is a combined state diagram and data flow diagram that schematically shows states, processing, events, transitions, and data flow comprised in iSCSI receiver processing, according to a preferred embodiment of the present invention. iSCSI receiver processing machine 150 handles a TCP segment from its arrival at the iSCSI receiver to its routing to a destination memory, and employs an event-driven design comprising three states, with each state handled in a machine: a Protocol Data Unit (PDU) delineation state 152, a header processing state 154, and a data processing state 156. [0211] In the context of the present patent application and the claims, the term �machine� is defined as a hardware processing unit, which may be implemented as a software-driven central processing unit (CPU) or as a hard-wired or programmable logic device, or as a combination of such elements. Multiple such �machines� may be provided on a single integrated circuit chip, each carrying out its assigned tasks substantially autonomously. Also in the context of the present patent application and the claims, the term �event� is defined as a message conveyed to a processing unit indicative of a significant activity or state change. Events typically comprise an identification indicating a type of activity or state change and additional parameters qualifying and detailing the activity or state change. Events may be implemented in hardware, e.g., via hard-wired signals, or in software, e.g., using operating system resources or shared memory, or in a combination of such methods. [0212] Thus, three machines, a P-machine 153, an H-machine 155, and a D-machine 157, are defined to process PDU delineation state 152, header processing state 154, and data processing state 156, respectively. Machine 150 is most preferably implemented as a part of a custom device such as an application specific integrated circuit (ASIC). Alternatively, machine 150 is implemented from industry-standard devices, or as a combination of standard and custom devices. [0213] A parsing event Handle-TCP-segment 162, generated during a TCP session in response to arrival of a TCP segment at an iSCSI receiver from a network interface 160, initiates iSCSI receiver processing, activating P-machine 153. Network interface 160 is substantially the same as TCP/IP Protocol 88 and 96 in FIG. 3. Event Handle-TCP-segment also conveys an incoming TCP segment as data associated with the event. The P-machine delineates the incoming TCP segment into iSCSI PDU headers and optional data payload. For example, referring back to FIG. 4, the P-machine parses TCP Segment 1 to Header 1 and a partial payload consisting of a part 126 of Data 1. Delineation is performed using header length and data length fields from an iSCSI header, and information from a synchronization and steering layer in the iSCSI protocol, i.e., a marker mechanism, as described in section 2.2.9 of the IETF iSCSI Internet Draft. P-machine 153 also recovers a complete PDU header from multiple parts of headers, as required, for example, to produce header 3 from a part 134 in TCP segment 3 and a part 136 in TCP segment 4 (FIG. 4). The header and optional data payload resulting from the P-machine's parsing of the TCP segment are sent as events to H-machine 155 and D-machine 157, respectively. If digests are defined in a login phase of the session, P-machine 153 preferably directs processing of a header digest 158. A further description of the operation of P-machine 153 is given below, with reference to FIG. 6. [0214] H-machine 155 receives a header event Handle-PDU-header 164 from P-machine 153 comprising each PDU header detected by the P-machine. The H-machine handles each Handle-PDU-header event by deciphering the contents of each respective PDU header and implementing corresponding iSCSI actions. Such actions, for example, comprise recording iSCSI command-related data such as command tags, iSCSI session tags, and task tags, handling iSCSI flow control, and routing SCSI commands to a device via a device interface 179. Device interface 179 is substantially the same as SCSI controller 86 and 102 in FIG. 3. The H-machine receives a respective header event Pass-PDU-data 166 from the P-machine comprising each data portion of an entire PDU payload. (The H-machine also interfaces to other blocks, as required for the iSCSI processing, such as interfacing with the iSCSI transmitter for sending iSCSI flow control parameters.) Each handle-PDU-header event 164 directs the H-machine to define a pointer to the beginning of the respective PDU in a destination memory 180 of server 84 or storage device 104 (FIG. 3). A further description of the operation of the H-machine is given below, with reference to FIG. 8. [0215] The pointer to the beginning of the PDU in the destination memory is subsequently passed to D-machine 157 via a data event Handle-initial-PDU-data 170, also comprising a partial PDU payload. After the D-machine has established that a first data portion has been handled for a given PDU (by setting a first_flag to false), subsequent data portions are processed via a data event Handle-PDU-data 172, received from the P-machine. The D-machine routes PDU data 178, comprising a partial PDU payload received in the data events, to destination memory 180 via device interface 179. D-machine 157 also manages processing of a data digest 160, if digests are defined in a login phase of the session. A further description of the operation of D-machine 157 is given below, with reference to FIG. 7. [0216] Tables I through VII below present each event shown in FIG. 5, along with principal parameters associated with each event. It is understood that Tables I through VII present principal parameters, and that additional parameters, as will be apparent to those skilled in the art, are likely to be present in preferred embodiments of the present invention. [0217] The parameters in Tables I through VII refer to elements generated in a preferred embodiment of the present invention. It will be appreciated that the data itself, described in the tables, may be sent to the P-machine, and forwarded to the other machines. Alternatively, the data may be stored in a central location, and pointers to the data are transferred between the machines. When pointers are used, the machines access the central location to read the data. [0218] Table I gives principal parameters and brief descriptions for Handle-TCP-segment event 162: TABLE I Principal Parameters Description TCP Unique identifier (ID) for the connection connection number TCP first The sequence number for the first sequence number byte in the TCP segment relevant to this message TCP last The sequence number for the last sequence number byte in the TCP segment relevant to this message [0219] Table II gives principal parameters and brief descriptions for Handle-PDU-data event 174: TABLE II Principal Parameters Description PDU number Identifying number for the PDU (internal to the implementation) PDU data of the The data of the PDU that is relevant to message or a this data message or a pointer to the pointer to its location of this data. location Marker existence Boolean indicating if a marker exists in range and in the data of this data-message and marker offset offset of the marker relative to the beginning of the data. Required to move-out the marker bytes when writing to destination memory. PDU offset Offset of the data relative to the start of the PDU. [0220] Table III gives principal parameters and brief descriptions for Handle-PDU-header event 164: TABLE III Principal Parameters Description TCP connection Unique identifier (ID) for the number connection. iSCSI header or The iSCSI header relevant to this a pointer to its message or a pointer to its location. location PDU number Identifying number for a PDU (internal to the implementation). [0221] Table IV gives principal parameters and brief descriptions for Pass-PDU-data event 166: TABLE IV Principal Parameters Description PDU number Identifying number for a PDU (internal to the implementation). First_flag Boolean�TRUE if this is the first data message sent for this message PDU. PDU data of the The data of the PDU that is relevant to message or this data message or a pointer to the pointer to its location of this data. location Marker existence Booiean indicating if a marker exists in range and in the data of this data-message and marker offset offset of the marker relative to the beginning of the data. PDU offset Offset of the data relative to start of the PDU. [0222] Table V gives principal parameters and brief descriptions for Handle-initial-PDU-data event 170: TABLE V Principal Parameters Description PDU number Identifying number for a PDU (internal to the implementation). First_flag Boolean�TRUE if this is the first data message sent for this message PDU. PDU data of the The data of the PDU that is relevant to message or this data message or a pointer to the pointer to its location of this data. location Marker existence Boolean indicating if a marker exists in range and in the data of this data-message and marker offset offset of the marker relative to the beginning of the data. PDU offset Offset of the data relative to start of the PDU. SCSI buffer Offset of the data relative to start of offset the SCSI block this PDU belongs to. Destination Pointer(s) to the place in the memory pointer destination memory that the start of the SCSI block has to be written to, or pointer to the place in the destination memory that the start of the PDU has to be written to. [0223] Table VI gives a principal parameter and brief description for Received-pass-PDU event 172: TABLE VI Principal Parameters Description PDU number Identifying number for the PDU (internal to the implementation). [0224] Table VII gives principal parameters and brief descriptions for Data-digest-result event 168: TABLE VII Principal Parameters Description PDU number Identifying number for the PDU (internal to the implementation). Data digest Boolean�TRUE if the computed data result digest is identical to that received in the packet (result of possibly cumulative operation over more than one TCP segment). [0225] Reference is now made to FIGS. 6A and 6B, which are a flow chart that schematically illustrates logic comprised in the P-machine of FIG. 5, according to a preferred embodiment of the present invention. P-machine 153 begins in a wait-for-parsing-event step 202. A condition 204 tests if an incoming event is a handle-TCP-segment event 162 (FIG. 5). If so, a parsing step 210 delineates an incoming TCP segment into one or more complete Protocol Data Units (PDUs). Step 210 also parses the TCP segment into complete or partial headers and data sections, using data from previous segments if necessary, by methods including those described in the IETF iSCSI Internet-Draft. Header and data sections are also referred to herein as header chunks and data chunks. An example of a delineation of TCP segments into iSCSI PDUs is given above, with reference to FIG. 4. [0226] If comparison 204 is false, the P-machine may also receive received-pass-PDU events, as checked in a condition 206. The received-pass-PDU event signifies that an initial portion or portions of a given PDU have been received, and that the D-machine is set up to receive subsequent parts of the payload directly from the P-machine. The P-machine indicates reception of a received-pass-PDU event by setting a variable ACK_rec to true in a step 208. A condition 214 tests if the section being handled is a header chunk. If so, a comparison 215 and a step 219 checks that the header is complete, and if not stores a partial header in a temporary buffer. In a comparison 217 and a step 221, the header digest is verified, and if the verification does not hold an error is declared. If the header is complete and the header digest verifies, a handle-PDU-header event is sent to H-machine 154 (FIG. 5) in a send event step 216. [0227] If comparison 214 is false, a comparison 223 is performed to check if the section is a data chunk, in which case, processing continues in a condition 222 which analyzes the section to determine whether it contains a portion of data in a range for an identified PDU. If not, a send data step 224 sends the data to a temporary buffer. If the data belongs to a known range, a condition 226 checks if ACK_rec is true. If so, the P-machine sends a pass-PDU-data event 228 to the D-machine. If ACK_rec is false, in a step 230 the P-machine sends a handle-PDU-data event to the H-machine, when first_flag (for the first data)=1. [0228] A comparison 225 checks that all chunks have been checked. If not, the process returns to comparison 214. If all chunks have been completed, the process returns to initial step 202. [0229] Reference is now made to FIG. 7, which is a flow chart that schematically illustrates logic comprised in the D-machine of FIG. 5, according to a preferred embodiment of the present invention. D-machine 157 begins in a wait-for-data-event step 242. A condition 244 tests if an incoming event is a handle-initial-PDU-data event 170 (FIG. 5). If so, a condition 248 queries first_flag to determine if it is the first handle-initial-PDU-data event received on that PDU. If first_flag is true, the D-machine sends a received-pass-PDU event to the P-machine. Processing continues in a calculation step 252 wherein a destination address is calculated for the portion of data received with the handle-initial-PDU-data or handle-PDU-data events. An optional compute data digest step 254 is executed, which maintains a running calculation of a data digest for one or more portions of a payload of the PDU. [0230] A transfer step 256 accomplishes a transfer of the PDU data to the address in a destination memory computed in calculation step 252. Since data for a single PDU commonly extends over multiple TCP segments, it is necessary to keep track of incomplete PDUs. Thus, a condition 258 checks if the data in the current TCP segment completes the expected PDU data. If only partial data is present in the current TCP segment, an entry is created or updated in an incomplete PDU table in step 260. If the data in the current TCP segment completes the data expected for the given PDU, the entry in the incomplete PDU table is deleted in a deletion step 266. In a complete digest computation step 268, the data digest calculation is finished, and the result (digest OK or wrong) is sent to the H-machine in a send data-digest-result event step 270. [0231] D-machine 157 can also receive a handle-PDU-data event 172, as determined in condition 246. The handle-PDU-data event is sent to the D-machine after it has acknowledged receiving a first portion of the data for the PDU, i.e., after the D-machine sends a received-pass-PDU event 174. Thus, handling of the handle-PDU-data event begins at calculate destination address step 252, and proceeds through steps 254, 256, 258, 260, 266, 268, and 270, substantially as described above for the handle-initial-PDU-data event. [0232] Reference is now made to FIG. 8, which is a flow chart that schematically illustrates logic comprised in the H-machine of FIG. 5, according to a preferred embodiment of the present invention. H-machine 155 begins in a wait-for-header-event step 282. A condition 284 tests if an incoming header event is a pass-PDU-data event 166. If so, a condition 290 tests the value of first_flag. If first_flag is true, i.e., the current event is among the first for the PDU, a determine pointer step 292 calculates a pointer to the start of the PDU's data in destination memory; The pointer is sent to the D-machine in a send event step 294, which sends a handle-initial-PDU-data event 170 to the D-machine. If condition 290 determined that first_flag is false, i.e., the pointer was already calculated for a prior pass-PDU-data event for the current PDU, processing continues in send event 294. [0233] H-machine 155 may also receive a handle-PDU-header event 164, as checked in condition 286. In case of this event, a process PDU header step 296 is executed. Process PDU header step 296 comprises, inter alia, identifying an embedded SCSI command, identifying an iSCSI session and task tag, and handling iSCSI flow control. The H-machine most preferably also stores a data base that is relevant to the processing of iSCSI headers according to the iSCSI protocol (e.g. data to connect a PDU to the entire task). H-machine 155 may receive a data-digest-result event 168 from D-machine 157 (the D-machine sends a flag to the H-machine after the D-machine has compared a calculated and a received digest). A condition 288 tests if a received event is a data-digest-result event 168. If the data-machine indicates an error in the data digest, the H-machine will initiate processing this error event as required in the system, according to step 298. [0234] It will be apparent to those skilled in the art that partitioning iSCSI receiver processing as described above enables immediate handling of partial PDUs arriving in TCP segments, without waiting to assemble an entire PDU. Handling of iSCSI PDU 1 in FIG. 4 illustrates this property of preferred embodiments of the present invention. PDU 1 is transmitted in three separate TCP segments: TCP segment 1 (comprising all of header 1 and an initial part 126 of PDU data 1), TCP segment 2 (comprising a second part 128 of PDU data 1), and TCP segment 3 (comprising a final part 130 of PDU data 1). When TCP segment 1 is received by P-machine 153, header 1 is parsed in parsing step 210 (FIG. 6A) and passed to H-machine 155 in send event step 216 (FIG. 6B). Since TCP segment 1 is the first event for PDU 1, first_flag is true, as set in step 230 (FIG. 6B). Thus, first part 126 of PDU 1's data is passed to the H-machine in a send event step 230 (FIG. 6). The H-machine processes iSCSI header 1 in process header step 296 (FIG. 8), and sends initial part 126 of PDU 1's data to D-machine 157 in send event step 294. The D-machine acknowledges receipt of initial part 126 in a send event step 250 (FIG. 7), transfers the data to destination memory in transfer step 256 (FIG. 7), and creates an entry in its incomplete PDU table in step 270 (FIG. 7). Therefore, TCP segment 1 is processed completely upon receipt, despite the fact that it contains only a fragment of PDU 1. [0235] Reference is now made to FIG. 9, which is a schematic block diagram depicting a possible allocation of iSCSI receiver processing to physical processors, according to a preferred embodiment of the present invention. A partition 320 comprises a first physical processor 322 and a second physical processor 324, also termed respectively processor A and processor B herein. Processor A and processor B are comprised in an iSCSI receive/transmit function such as iSCSI receive/transmit 98 (FIG. 3). Processor A runs P-machine 153 and generates header digest 158. Processor B executes H-machine 155, D-machine 157, and generates data digest 160 (FIG. 5). Communication among the logical tasks comprising the iSCSI receiver implementation depicted in state diagram 150 is accomplished by methods known in the art. For example, processor A and processor B may share a common memory space (not shown in the figure) for the purposes of exchanging events. It is appreciated that a variety of implementations of physical processor schemes are possible in preferred embodiments of the present invention, including, but not limited to, allocating a single physical processor for each machine, allocating a plurality of processors for each machine, implementing data and header digest functions in specialized hardware and interfacing to the P-machine and D-machines via hardware connections, as well as other combinations of the abovementioned possibilities. The method of partitioning iSCSI receiver processing herein described enables flexibility in hardware design, effective utilization of physical processors, and efficient handling of incoming data, promoting maximal performance levels. [0236] It will be appreciated that preferred embodiments of the present invention are able to handle both in-order and out-of-order segments by transferring TCP sequence numbers of segments with the segments, and there is no assumption that out-of-order segments have been reordered in a stage prior to the P-machine. Preferably, out-of-order segments are stored in a P-machine database until they can be fully processed. Furthermore, markers and/or other synchronization and steering layer information may be implemented so as to parse incoming segments when the segments are out-of-order segments. [0237] It will thus be appreciated that the preferred embodiments described above are cited by way of example, and that the present invention is not limited to what has been particularly shown and described hereinabove. Rather, the scope of the present invention includes both combinations and subcombinations of the various features described hereinabove, as well as variations and modifications thereof which would occur to persons skilled in the art upon reading the foregoing description and which are not disclosed in the prior art. Referenced byCiting PatentFiling datePublication dateApplicantTitleUS6683883 *Apr 9, 2002Jan 27, 2004Sancastle Technologies Ltd.ISCSI-FCP gatewayUS7050394 *Dec 18, 2002May 23, 2006Intel CorporationFramerUS7120837 *May 9, 2002Oct 10, 2006Cisco Technology, Inc.System and method for delayed error handlingUS7165258Apr 22, 2002Jan 16, 2007Cisco Technology, Inc.SCSI-based storage area network having a SCSI router that routes traffic between SCSI and IP networksUS7188194Apr 22, 2002Mar 6, 2007Cisco Technology, Inc.Session-based target/LUN mapping for a storage area network and associated methodUS7200610Apr 22, 2002Apr 3, 2007Cisco Technology, Inc.System and method for configuring fibre-channel devicesUS7240098May 9, 2002Jul 3, 2007Cisco Technology, Inc.System, method, and software for a virtual host bus adapter in a storage-area networkUS7263105 *Dec 18, 2002Aug 28, 2007Intel CorporationWLAN device and method for interfacing between a MAC sublayer and a physical layerUS7299266Sep 5, 2002Nov 20, 2007International Business Machines CorporationMemory management offload for RDMA enabled network adaptersUS7385971May 9, 2002Jun 10, 2008Cisco Technology, Inc.Latency reduction in network data transfer operationsUS7415535Apr 22, 2002Aug 19, 2008Cisco Technology, Inc.Virtual MAC address system and methodUS7447207 *Oct 27, 2003Nov 4, 2008Hewlett-Packard Development Company, L.P.Method of and apparatus for transporting SCSI data over a networkUS7475153Jul 16, 2004Jan 6, 2009International Business Machines CorporationMethod for enabling communication between nodesUS7526574Apr 21, 2004Apr 28, 2009International Business Machines CorporationMethod for communicating data transfer requests between data transfer protocolsUS7577707Apr 21, 2004Aug 18, 2009International Business Machines CorporationMethod, system, and program for executing data transfer requestsUS7761588Oct 3, 2008Jul 20, 2010International Business Machines CorporationSystem and article of manufacture for enabling communication between nodesUS7779081Jul 16, 2004Aug 17, 2010International Business Machines CorporationMethod, system, and program for forwarding messages between nodesUS7808996 *Jun 24, 2008Oct 5, 2010Industrial Technology Research InstitutePacket forwarding apparatus and method for virtualization switchUS7844753Nov 13, 2006Nov 30, 2010Intel CorporationTechniques to process integrity validation values of received network protocol unitsUS7966380May 17, 2010Jun 21, 2011International Business Machines CorporationMethod, system, and program for forwarding messages between nodesUS8176187May 4, 2010May 8, 2012International Business Machines CorporationMethod, system, and program for enabling communication between nodesUS8572289Apr 18, 2006Oct 29, 2013Nvidia CorporationSystem, method and computer program product for stateless offloading of upper level network protocol operationsUS8793399 *Aug 5, 2009Jul 29, 2014Qlogic, CorporationMethod and system for accelerating network packet processingEP2103038A1 *Dec 15, 2006Sep 23, 2009Thomson LicensingMedia access control protocol data unit aggregation in a time division multiple access media access control layerWO2003088580A1 *Apr 8, 2003Oct 23, 2003Sancastle Technologies LtdIscsi-fcp gatewayWO2008063826A1 *Oct 30, 2007May 29, 2008Intel CorpTechniques to process received network protocol units* Cited by examinerClassifications U.S. Classification370/395.52International ClassificationH04L29/08, H04L29/06Cooperative ClassificationH04L69/12, H04L69/16, H04L67/1097, H04L69/168, H04L69/22, H04L69/161European ClassificationH04L29/06J3, H04L29/06J17, H04L29/06N, H04L29/08N9S, H04L29/06G, H04L29/06JLegal EventsDateCodeEventDescriptionMay 17, 2013FPAYFee paymentYear of fee payment: 4May 3, 2011CCCertificate of correctionApr 13, 2006ASAssignmentOwner name: BROADCOM CORPORATION, CALIFORNIAFree format text: CHANGE OF NAME;ASSIGNOR:SILIQUENT TECHNOLOGIES, INC.;REEL/FRAME:017477/0524Effective date: 20050831Apr 12, 2006ASAssignmentOwner name: BROADCOM CORPORATION, CALIFORNIAFree format text: CHANGE OF NAME;ASSIGNOR:SILIQUENT TECHNOLOGIES, INC.;REEL/FRAME:017779/0571Effective date: 20050831Owner name: BROADCOM CORPORATION, CALIFORNIAFree format text: CHANGE OF NAME;ASSIGNOR:SILIQUENT TECHNOLOGIES, INC.;REEL/FRAME:017779/0611Free format text: CHANGE OF NAME;ASSIGNOR:SILIQUENT TECHNOLOGIES, INC.;REEL/FRAME:017779/0554Free format text: CHANGE OF NAME;ASSIGNOR:SILIQUENT TECHNOLOGIES, INC.;REEL/FRAME:017779/0581Free format text: CHANGE OF NAME;ASSIGNOR:SILIQUENT TECHNOLOGIES, INC.;REEL/FRAME:017779/0591Free format text: CHANGE OF NAME;ASSIGNOR:SILIQUENT TECHNOLOGIES, INC.;REEL/FRAME:017779/0601Free format text: CHANGE OF NAME;ASSIGNOR:SILIQUENT TECHNOLOGIES, INC.;REEL/FRAME:017779/0624Free format text: CHANGE OF NAME;ASSIGNOR:SILIQUENT TECHNOLOGIES, INC.;REEL/FRAME:017779/0650Effective date: 20050831Free format text: CHANGE OF NAME;ASSIGNOR:SILIQUENT TECHNOLOGIES, INC.;REEL/FRAME:017780/0016Sep 6, 2002ASAssignmentOwner name: SILIQUENT TECHNOLOGIES INC., CALIFORNIAFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:MIZRACHI, SHAY;SHALOM, RAFI;GRINFELD, RON;REEL/FRAME:013274/0757Effective date: 20020820RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services©2012 Google