SYSTEM AND METHOD FOR HANDLING OUT-OF-ORDER FRAMES

• US 20100142534A1
• Filed: 02/15/2010
• Published: 06/10/2010
• Est. Priority Date: 08/30/2002
• Status: Active Grant

• Current Assignee: Avago Technologies International Sales Pte Limited (Broadcom, Inc.)
• Original Assignee: Uri Elzur
• Inventors: Elzur, Uri
• Granted Patent: US 7,929,540 B2
• Time in Patent Office: Days
• US Class Current: 370/394
• CPC Class Codes: H04L 12/2856 Access arrangements, e.g. Internet access asynchronous transfer mode networks H04L12/5601; broadband local area networks H04L12/2801; optical access or distribution networks H04Q11/0067; access to open networks H04L12/5691; digital subscriber line end-user equipment and bit-level processing of data on a PSTN-based network H04M11/00; home network gateways H04L12/2834; wireless access networks H04W
• CPC Class Codes: H04L 12/2898 Subscriber equipments DSL modems H04M11/062; cable modems H04L12/2801
• CPC Class Codes: H04L 12/4633 Interconnection of networks using encapsulation techniques, e.g. tunneling
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/193 at the transport layer, e.g. TCP related
• CPC Class Codes: H04L 47/2441 relying on flow classification, e.g. using integrated services [IntServ]
• CPC Class Codes: H04L 47/27 Evaluation or update of window size, e.g. using information derived from acknowledged [ACK] packets
• CPC Class Codes: H04L 47/32 by discarding or delaying data units, e.g. packets or frames
• CPC Class Codes: H04L 47/34 ensuring sequence integrity, e.g. using sequence numbers
• CPC Class Codes: H04L 49/90 Buffering arrangements
• CPC Class Codes: H04L 49/9063 Intermediate storage in different physical parts of a node or terminal
• CPC Class Codes: H04L 63/1458 Denial of Service
• CPC Class Codes: H04L 69/10 Streamlined, light-weight or high-speed protocols, e.g. express transfer protocol [XTP] or byte stream
• CPC Class Codes: H04L 69/12 Protocol engines
• CPC Class Codes: H04L 69/16 Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
• CPC Class Codes: H04L 69/161 Implementation details of TCP/IP or UDP/IP stack architecture; Specification of modified or new header fields
• CPC Class Codes: H04L 69/162 involving adaptations of sockets based mechanisms secure socket layer H04L63/168
• CPC Class Codes: H04L 69/163 In-band adaptation of TCP data exchange; In-band control procedures
• CPC Class Codes: H04L 69/166 IP fragmentation; TCP segmentation
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

A system for reordering frames may include at least one processor that enable receiving of an out-of-order frame via a network subsystem. The at least one processor may enable placing data of the out-of-order frame in a host memory, and managing information relating to one or more holes resulting from the out-of-order frame in a receive window. The at least one processor may enable setting a programmable limit with respect to a number of holes allowed in the receive window. The out-of-order frame is received via a TCP offload engine (TOE) of the network subsystem or a TCP-enabled Ethernet controller (TEEC) of the network subsystem. The network subsystem may not store the out-of-order frame on an onboard memory, and may not store one or more missing frames relating to the out-of-order frame. The network subsystem may include a network interface card (NIC).

Claims

1-29. -29. (canceled)

30. A system for reordering frames in a network, the system comprising:

at least one processor operable to place data from a frame into a host memory window, wherein the frame is received out-of-order and/or fills a hole in the host memory window; and

the at least one processor is operable to manage information relating to holes in the host memory window, wherein the size of the host memory window is controllable, the number of holes allowed in the host memory window is controllable, and the size of each hole is controllable.

31. The system according to claim 30, wherein the frame is received via a TCP offload engine (TOE) or a TCP-enabled Ethernet controller (TEEC).

32. The system according to claim 30, wherein the at least one processor is operable to not store the frame on an onboard memory if it is received out-of-order.

33. The system according to claim 32, wherein the at least one processor is operable to not store the frame on an onboard memory if it fills a hole in the host memory window.

34. The system according to claim 30, wherein the at least one processor is on a network interface card (NIC).

35. The system according to claim 30, wherein the at least one processor is operable to place data from the frame into the host memory window if the frame is determined to be within the limits of the host memory window.

36. The system according to claim 30, wherein the at least one processor is operable to drop the frame, if the frame is determined to be outside the limits of the host memory window.

37. The system according to claim 30, wherein the at least one processor is operable to place a portion of the data of the frame in the host memory window, wherein the portion of the data is within the limits of the host memory window.

38. The system according to claim 30, wherein the at least one processor enables one or more of:

storing information relating to a new hole created by the placement of the data of the frame,

updating information relating to an existing hole modified by the placement of the data of the frame, and/or

deleting information relating to a plugged hole created by the placement of the data of the frame.

39. The system according to claim 38,

wherein the stored information resides on a network subsystem,

wherein the updated information resides on a network subsystem, and

wherein the deleted information resided on a network subsystem.

40. The system according to claim 30, wherein the managed information resides on a network subsystem.

41. The system according to claim 30, wherein the at least one processor is operable to update the size of the host memory window based upon the placement of the data of the frame.

42. The system according to claim 30, wherein the at least one processor is operable to map TCP space into host buffer space.

43. The system according to claim 30, wherein a network subsystem comprises a memory whose memory usage scales with a number of holes in the host memory window.

44. The system according to claim 30, wherein a network subsystem comprises a memory whose memory usage does not scale with a number of frames received.

45. A method for reordering frames in a network, the method comprising:

placing data from a frame into a host memory window, wherein the frame is received out-of-order and/or fills a hole in the host memory window; and

managing information relating to holes in the host memory window, wherein the size of the host memory window is controllable, the number of holes allowed in the host memory window is controllable, and the size of each hole is controllable.

46. The method according to claim 45, wherein the method comprises determining whether the frame is within the limits of the host memory window prior to placing data from the frame into a host memory window.

47. The method according to claim 45, wherein the method comprises dropping the frame, if the frame is determined to be outside the limits of the host memory window.

48. The method according to claim 45, wherein the method comprises determining whether a portion of the frame is within the limits of the host memory window prior to placing data from the frame into a host memory window.

49. The method according to claim 45, wherein managing information relating to holes comprises one or more of:

storing information relating to a new hole created by the placement of the data of the frame,

updating information relating to an existing hole modified by the placement of the data of the frame, and/or

deleting information relating to a plugged hole created by the placement of the data of the frame.

50. The method according to claim 45, wherein managing information relating to holes comprises updating the size of the host memory window based upon the placement of the data of the frame.

51. The method according to claim 45, wherein the method comprises mapping TCP space into host buffer space.