US7584286B2 - Flexible and extensible receive side scaling - Google Patents

Flexible and extensible receive side scaling Download PDF

Info

Publication number
US7584286B2
US7584286B2 US11/478,147 US47814706A US7584286B2 US 7584286 B2 US7584286 B2 US 7584286B2 US 47814706 A US47814706 A US 47814706A US 7584286 B2 US7584286 B2 US 7584286B2
Authority
US
United States
Prior art keywords
packet
protocol
layer
hash value
hash
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active, expires
Application number
US11/478,147
Other languages
English (en)
Other versions
US20080005352A1 (en
Inventor
Stephen D. Goglin
Linden Cornett
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Intel Corp
Original Assignee
Intel Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Intel Corp filed Critical Intel Corp
Priority to US11/478,147 priority Critical patent/US7584286B2/en
Priority to CN200780019526.2A priority patent/CN101455040B/zh
Priority to PCT/US2007/072165 priority patent/WO2008002945A1/fr
Priority to DE112007001529T priority patent/DE112007001529T5/de
Priority to TW096123337A priority patent/TWI400910B/zh
Publication of US20080005352A1 publication Critical patent/US20080005352A1/en
Assigned to INTEL CORPORATION reassignment INTEL CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: CORNETT, LINDEN, GOGLIN, STEPHEN D.
Priority to US12/549,891 priority patent/US8150981B2/en
Application granted granted Critical
Publication of US7584286B2 publication Critical patent/US7584286B2/en
Priority to US13/438,780 priority patent/US8874767B2/en
Active legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/74—Address processing for routing
    • H04L45/745—Address table lookup; Address filtering
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control

Definitions

  • Embodiments of this invention relate to flexible and extensible receive side scaling.
  • RSS Receive Side Scaling
  • NDIS 6.0 provides for a device driver that enables a single network controller to support multiple network protocols, or that enables multiple network controllers to support multiple network protocols. NDIS 6.0 is currently still in the works, but information about it is available from Microsoft® Corporation of Redmond, Wash.
  • RSS Systems that implement RSS currently only support a limited number of protocols supported by RSS. For example, in current RSS designs, only IPv4/v6 protocols at Network Layer, and TCP and UDP at Transport Layer, are supported. Generally, packets that conform to one of the supported protocols are hashed to determine which processor will process a given packet, and packets that do not conform to one of the supported protocols are sent to a default processor. Packets that do not conform to one of the supported protocols, therefore, may accumulate and result in bottlenecks of the default processor.
  • FIG. 1 illustrates a system according to an embodiment.
  • FIG. 2 is a block diagram that illustrates a system according to an embodiment.
  • FIG. 3 is a flowchart illustrating a method according to an embodiment.
  • FIG. 4 a protocol table according to an embodiment.
  • FIG. 5 is a flowchart illustrating a method according to an embodiment.
  • FIG. 1 illustrates a system in an embodiment.
  • System 100 may comprise one or more processors 102 A, 102 B, . . . , 102 N, host memory 104 , busses 106 , 110 , 112 and network controller 126 .
  • System 100 may comprise more than one, and other types of memories, buses, and network controllers; however, those illustrated are described for simplicity of discussion.
  • Processors 102 A, 102 B, . . . , 102 N, host memory 104 , and busses 106 , 110 , 112 may be comprised in a single circuit board, such as, for example, a system motherboard 118 .
  • a “processor” as discussed herein relates to a combination of hardware and software resources for accomplishing computational tasks.
  • a processor may comprise a system memory and processing circuitry (e.g., a central processing unit (CPU) or microcontroller) to execute machine-readable instructions for processing data according to a predefined instruction set.
  • a processor may comprise just the processing circuitry (e.g., CPU).
  • a processor may comprise a multi-core processor having a plurality of computational engines.
  • a processor may comprise a computational engine that may be comprised in the multi-core processor, where an operating system may perceive the computational engine as a discrete processor with a full set of execution resources. Other possibilities exist.
  • Logic 130 may comprise hardware, software, or a combination of hardware and software (e.g., firmware).
  • logic 130 may comprise circuitry (i.e., one or more circuits), to perform operations described herein.
  • logic 130 may comprise one or more digital circuits, one or more analog circuits, one or more state machines, programmable logic, and/or one or more ASIC's (Application-Specific Integrated Circuits).
  • Logic 130 may be hardwired to perform the one or more operations.
  • logic 130 may be embodied in machine-executable instructions 132 stored in a memory, such as memory 104 , to perform these operations.
  • logic 130 may be embodied in firmware.
  • Logic may be comprised in various components of system 100 , including network controller 126 , chipset 108 , processors 102 A, 102 B, . . . , 102 N, and/or on motherboard 118 .
  • Logic 130 may be used to perform various functions by various components as described herein.
  • Chipset 108 may comprise one or more integrated circuit chips, such as those selected from integrated circuit chipsets commercially available from Intel® Corporation (e.g., graphics, memory, and I/O controller hub chipsets), although other one or more integrated circuit chips may also, or alternatively, be used. According to an embodiment, chipset 108 may comprise an input/output control hub (ICH), and/or a memory control hub (MCH), although embodiments of the invention are not limited by this. Chipset 108 may comprise a host bridge/hub system that may couple processor 102 A, 102 B, . . . , 102 N, and host memory 104 to each other and to local bus 106 .
  • ICH input/output control hub
  • MCH memory control hub
  • Chipset 108 may communicate with memory 104 via memory bus 112 and with processors 102 A, 102 B, . . . , 102 N via system bus 110 .
  • processor 102 and host memory 104 may be coupled directly to bus 106 , rather than via chipset 108 .
  • Local bus 106 may comprise a bus that complies with the Peripheral Component Interconnect (PCI) Local Bus Specification, Revision 2.2, Dec. 18, 1998 available from the PCI Special Interest Group, Portland, Oreg., U.S.A. (hereinafter referred to as a “PCI bus”).
  • PCI bus Peripheral Component Interconnect
  • bus 106 may comprise a bus that complies with the PCI Express Base Specification, Revision 1.0a, Apr. 15, 2003 available from the PCI Special Interest Group (hereinafter referred to as a “PCI Express bus”).
  • Bus 106 may comprise other types and configurations of bus systems.
  • Network controller 126 may be comprised in a circuit card 124 (i.e., network interface card or NIC) that may be inserted into a circuit card slot 114 .
  • a “network controller” as referred to herein relates to a device which may be coupled to a data transmission medium to transmit data to or receive data from other devices coupled to the data transmission medium.
  • a network controller may be designed to transmit data to or receive data from devices coupled to a network such as a local area network.
  • Such a network controller may communicate with the other devices according to any one of several data communication formats such as, for example, communication formats according versions of IEEE Std. 802.3 (Ethernet), IEEE Std. 802.11, IEEE Std.
  • a network controller may comprise any one of other I/O devices such as, for example, a controller to a data storage system.
  • I/O devices such as, for example, a controller to a data storage system.
  • these are merely examples of a network controller and embodiments of the present invention are not limited in these respects.
  • Network controller 126 may comprise logic 130 to perform operations described herein as being performed by network controller 126 and/or system 100 .
  • PCI bus connector (not shown) on circuit card slot 114 may become electrically and mechanically coupled to PCI bus connector (not shown) on circuit card 124 .
  • logic 130 in circuit card 124 may become electrically coupled to bus 106 .
  • any of processors 102 A, 102 B, . . . , 102 N may exchange data and/or commands with logic 130 via bus 106 that may permit one or more processors 102 A, 102 B, . . .
  • network controller 126 may instead be comprised on system motherboard 118 .
  • network controller 126 may be integrated into a chipset 108 .
  • Host memory 104 may store machine-executable instructions 132 that are capable of being executed, and/or data capable of being accessed, operated upon, and/or manipulated by logic, such as logic 130 .
  • Host memory 104 may, for example, comprise read only, mass storage, random access computer-accessible memory, and/or one or more other types of machine-accessible memories.
  • the execution of program instructions 132 and/or the accessing, operation upon, and/or manipulation of this data by logic 130 for example, may result in, for example, system 100 and/or logic 130 carrying out some or all of the operations described herein.
  • FIG. 2 is a block diagram in accordance with an embodiment of the invention.
  • protocol table(s) 202 may be implemented on network controller 126 , and receive queues 212 A, 212 B, . . . , 212 N may be implemented in host memory 104 .
  • FIG. 3 illustrates a method in accordance with an embodiment of the invention.
  • the method begins at block 300 and continues to block 302 where the method may comprise in response to receiving a packet, looking up a packet characteristic in one of at least one protocol table to determine one or more fields of the packet to use as a hash value.
  • a “packet” refers to a sequence of one or more symbols and/or values that may be encoded by one or more signals transmitted from at least one sender to at least one receiver.
  • a packet may be processed by a particular protocol stack.
  • An example of a protocol stack is the TCP/IP (Transport Control Protocol/Internet Protocol) stack.
  • a packet may comprise one or more fields, including a header, data, and a trailer. Within the header may be additional fields.
  • the header may include an IP version, packet length, source IP address, and destination IP address. Fields may be identified by a set of bits.
  • the IP version field may comprise the first 4 bits of the IP header, and the source and destination IP addresses may comprise the last 64 bits of the IP header.
  • a packet may be encapsulated in many layers, where each layer may be associated with a protocol.
  • a packet that is associated with a protocol refers to a packet within a particular layer that is associated with a particular protocol.
  • packet 200 may comprise an Ethernet packet that includes, for example, a TCP packet (having a header, data, and trailer, for example) that is encapsulated within an IP packet (having a header, data, and trailer, for example, where the data portion of the IP packet comprises the TCP packet).
  • packet 200 may be associated with the IP protocol as well as the TCP protocol.
  • a “packet characteristics” refers to a characteristic of a packet. These characteristics may, for example, by seen in one or more layers. For example, several layers may have packet characteristics including the protocol for the layer, and source and destination addresses or ports.
  • each of at least one protocol table(s) 202 may comprise entries 400 A, 400 B, . . . , 400 X, where each entry may comprise a packet characteristic 402 A, 402 B, . . . , 402 X corresponding to an offset 404 A, 404 B, . . . , 404 X and mask 406 A, 406 B, . . . , 406 X.
  • Protocol table(s) 202 may be configured to comprise any number of packet characteristics, and the packet characteristics may differ (e.g., protocol, destination port, etc.).
  • Protocol table(s) 202 may comprise a single table to accommodate all protocols.
  • protocol table(s) 202 may comprise multiple tables, where each protocol table(s) 202 may correspond to a packet characteristic for a given layer. Furthermore, the packet characteristics for each layer may differ.
  • the offset 404 A, 404 B, . . . , 404 X may specify a distance (e.g., bits) from a start bit in packet 200 (e.g., end of a packet header) to which mask 406 A, 406 B, . . . , 406 X (e.g., bitmask) may be applied to ascertain hash value 204 .
  • the start bit may comprise the beginning of a packet (e.g., byte 0 )
  • the offset may specify 20 bits
  • the bitmask may comprise 32 bits.
  • bits 19 to 50 may be hashed to generate hash value 204 .
  • the start bit may comprise the end of packet 200 header (e.g., bit 112 ), the offset may specify 0 bits, and the bitmask may comprise 32 bits. In this case, bits 112 - 143 may be masked to generate hash value 204 .
  • the start bit may be specified by default. For example, the beginning of the packet may be specified as the start bit. Furthermore, the start bit may be dependent on the layer. Alternatively, the start bit may be programmable. For example, start bit may be defined in a table, such as any of protocol table(s) 202 .
  • Protocol table(s) 202 may comprise an entry, for example entry 400 A for the MPLS packet characteristic 402 A, where offset 404 A may comprise “OFFSET: 0x0”, and mask 406 A may comprise “MASK: 0xFF:FF:F0:00”. If the start bit comprises the end of the packet header (e.g., bit 112 ), then this entry would result in masking the bits 112 - 143 , which would result in hash value 204 comprising the top label of the MPLS stack.
  • a packet characteristic in one of at least one protocol table( 2 ) 202 to determine one or more fields of the packet 200 to use as a hash value 204 may comprise an iterative process.
  • a next layer of packet 200 may be revealed until there are no further layers to reveal.
  • there are no further layers to reveal if a given implementation designates a particular layer as the last layer in which to examine the packet characteristics (e.g., after Transport Layer is exposed, there are no further layers to reveal).
  • An “exposed protocol” may refer to the protocol for the currently revealed layer, or a next layer protocol that may be indicated in the currently revealed layer.
  • the exposed protocol is a supported protocol
  • one or more default fields of the packet may be obtained.
  • the default fields may be the IP source and destination addresses for the IP protocol at the Network Layer, or the TCP source and destination ports for the TCP protocol at the Transport Layer.
  • an “unsupported protocol” refers to a protocol that the system does not natively support.
  • the packet characteristic corresponding to the last revealed layer may be looked up in one of the at least one protocol table to obtain an offset and a mask. If the packet characteristic is found, the offset and the mask may then be applied to the packet. If the packet characteristic is not found in the one of at least one protocol table(s) 202 , then the one or more default fields obtained in the iterative process above may be used as hash value 204 . If no default fields were obtained the packet may be sent to a default one of the plurality of processors.
  • the fields used for hash value 204 may be customized, allowing packet 200 to be classified in different ways. For example, rather than send TCP packets to processors based on their source/destination port, a particular system may want all SYN and FIN packets sent to a particular processor. To do this, an entry 400 A, 400 B, . . . , 400 X in one of protocol table(s) 202 may be set to the IP protocol number for TCP, where the offset and mask for the entry could be defined to result in masking out all bits of the TCP packet except for the SYN and FIN flags.
  • protocol table(s) 202 may be configured to include an entry for different TCP destination ports, where the entry would result in masking out the source port field (i.e., bits) and allow all connections from the same TCP port to hash to the same processor. Other protocol table(s) 202 configurations to achieve this are possible.
  • the method may comprise applying a hash function to the hash value to obtain a hash result.
  • hash value 204 may be hashed using hash function 206 to obtain hash result 208 .
  • the hash function may comprise a Toeplitz hash as described in the WinHEC Apr. 19, 2005 white paper.
  • the method may comprise using the hash result to determine one of a plurality of processors on which to process the packet.
  • indirection table 210 may be used to direct packets 200 to a receive queue 212 A, 212 B, . . . , 212 N.
  • Indirection table 210 may comprise one or more entries, where each entry may comprise a hash result 208 that corresponds to a receive queue 212 A, 212 B, . . . , 212 N.
  • Each receive queue 212 A, 212 B, . . . , 212 N may store one or more receive packets 200 and may correspond to one of processors 102 A, 102 B, . . .
  • Indirection table 210 may be configured so that certain hash results (corresponding to particular packets 200 ) may correspond to particular processors (so that the corresponding packets 200 are sent to those processors.
  • the method may end at block 308 .
  • the method described above may be employed in an RSS environment. As illustrated in FIG. 5 , such method may begin at block 500 and continue to block 502 where in response to receiving a packet, the method may comprise determining if a first layer protocol associated with the packet is a supported first layer protocol.
  • the first layer may comprise Network Layer
  • supported Network Layer protocols in RSS may include IPv4/v6.
  • the method may comprise if the first layer protocol is not associated with a supported first layer protocol, looking up the first layer protocol in a first protocol table to determine which bits of the packets to use as a hash value. For example, if the Network Layer protocol of the packet is not an IPv4/v6 packet, the Network Layer protocol associated with the packet may be looked up in a protocol table.
  • the first protocol table may comprise an Ethernet Type table that comprises unsupported Network Layer protocols, such as MPLS (Multiprotocol Label Switching).
  • a first set of bits associated with the first layer protocol may be obtained, and it may then be determined if a second layer protocol associated with the packet is a supported second layer protocol.
  • the second layer protocol is looked up in a second protocol table to determine a hash value.
  • the second layer may comprise the Transport Layer, and supported Transport Layer protocols in RSS may include TCP and UDP. Therefore, for example, if the Transport Layer protocol of the packet is not a TCP or UDP packet, the unsupported Transport Layer protocol may be looked up in a second protocol table.
  • the second protocol table may comprise an IP table that comprises specific Transport Layer protocols, such as IPSec (Internet Protocol Security).
  • Protocol table(s) 202 may comprise an entry, for example entry 400 B for the IPSec protocol 402 B, where offset 404 B may comprise “offset: 0x0”, and mask 406 B may comprise “mask: 0xFF:FF:FF:FF”. If the start bit comprises the end of the IP header, then this entry would result in hashing only the bits of the SPI (Security Parameter Index) of the packet.
  • SPI Security Parameter Index
  • the second layer protocol is associated with a supported second layer protocol
  • a second set of bits associated with the second layer protocol may be obtained, and then the second layer protocol may be looked up in a third protocol table to determine a hash value.
  • the second layer may comprise Transport Layer
  • supported Transport Layer protocols in RSS may include TCP and UDP. Therefore, for example, if the Transport Layer protocol of the packet is a TCP or UDP packet, the Transport Layer protocol may be looked up in a protocol table.
  • the method may comprise applying a hash function to the hash value to obtain a hash result.
  • hash value 204 may be derived from one of protocol table(s) 202 .
  • hash value 204 may be obtained from default fields only, or a combination of default fields and one of protocol table(s) 202 .
  • the method may comprise using the hash result to determine one of a plurality of processors on which to process the packet.
  • hash result 208 may be mapped to an entry in an indirection table 210 to obtain a result.
  • the result may be added to another variable to obtain a value corresponding to a receive queue 212 A, 212 B, . . . , 212 N.
  • the other variable may comprise, for example, a base processor number which may indicate the lowest number of processors that can be used in RSS, and which may be implementation-specific.
  • the base processor number may be, for example, 0.
  • Network controller 126 may transfer the packet 200 to the receive queue 212 A, 212 B, . . . , 212 N corresponding to hash result 208 .
  • the method may end at block 510 .
  • a method may comprise in response to receiving a packet, looking up a packet characteristic in one of at least one protocol table to determine one or more fields of the packet to use as a hash value, applying a hash function to the hash value to obtain a hash result, and using the hash result to determine one of a plurality of processors on which to process the packet.
  • Embodiments of the invention may enable a receive side processing of packets to be scaled to the number of processors in a system in a flexible and extensible manner. Rather than limit the supported protocols to what is already hardwired, or otherwise programmed into the system, embodiments of the invention provide a way for the protocols to be easily added and easily configured. Furthermore, embodiments of the invention enable multi-processor systems to be optimized by not only supporting different protocols, but also by enabling the classification of packets in a way that allows the packets to be distributed across different processors.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Communication Control (AREA)
US11/478,147 2006-06-28 2006-06-28 Flexible and extensible receive side scaling Active 2027-10-08 US7584286B2 (en)

Priority Applications (7)

Application Number Priority Date Filing Date Title
US11/478,147 US7584286B2 (en) 2006-06-28 2006-06-28 Flexible and extensible receive side scaling
PCT/US2007/072165 WO2008002945A1 (fr) 2006-06-28 2007-06-26 Mise à l'échelle extensible et flexible d'un côté récepteur
DE112007001529T DE112007001529T5 (de) 2006-06-28 2007-06-26 Flexibles und erweiterbares Receive Side Scaling
CN200780019526.2A CN101455040B (zh) 2006-06-28 2007-06-26 灵活且可扩展的接收端调节
TW096123337A TWI400910B (zh) 2006-06-28 2007-06-27 用於接收端調整之方法與裝置
US12/549,891 US8150981B2 (en) 2006-06-28 2009-08-28 Flexible and extensible receive side scaling
US13/438,780 US8874767B2 (en) 2006-06-28 2012-04-03 Enqueuing received network packets based, at least in part, on at least one programmable mask

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US11/478,147 US7584286B2 (en) 2006-06-28 2006-06-28 Flexible and extensible receive side scaling

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US12/549,891 Continuation US8150981B2 (en) 2006-06-28 2009-08-28 Flexible and extensible receive side scaling

Publications (2)

Publication Number Publication Date
US20080005352A1 US20080005352A1 (en) 2008-01-03
US7584286B2 true US7584286B2 (en) 2009-09-01

Family

ID=38845976

Family Applications (3)

Application Number Title Priority Date Filing Date
US11/478,147 Active 2027-10-08 US7584286B2 (en) 2006-06-28 2006-06-28 Flexible and extensible receive side scaling
US12/549,891 Active 2027-04-15 US8150981B2 (en) 2006-06-28 2009-08-28 Flexible and extensible receive side scaling
US13/438,780 Active 2026-09-11 US8874767B2 (en) 2006-06-28 2012-04-03 Enqueuing received network packets based, at least in part, on at least one programmable mask

Family Applications After (2)

Application Number Title Priority Date Filing Date
US12/549,891 Active 2027-04-15 US8150981B2 (en) 2006-06-28 2009-08-28 Flexible and extensible receive side scaling
US13/438,780 Active 2026-09-11 US8874767B2 (en) 2006-06-28 2012-04-03 Enqueuing received network packets based, at least in part, on at least one programmable mask

Country Status (5)

Country Link
US (3) US7584286B2 (fr)
CN (1) CN101455040B (fr)
DE (1) DE112007001529T5 (fr)
TW (1) TWI400910B (fr)
WO (1) WO2008002945A1 (fr)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080086575A1 (en) * 2006-10-06 2008-04-10 Annie Foong Network interface techniques
US20100061377A1 (en) * 2006-06-28 2010-03-11 Intel Corporation Flexible and extensible receive side scaling
US20100169528A1 (en) * 2008-12-30 2010-07-01 Amit Kumar Interrupt technicques
US20110142064A1 (en) * 2009-12-15 2011-06-16 Dubal Scott P Dynamic receive queue balancing
US20110153935A1 (en) * 2009-12-17 2011-06-23 Yadong Li Numa-aware scaling for network devices
US8307105B2 (en) 2008-12-30 2012-11-06 Intel Corporation Message communication techniques
US8842562B2 (en) 2011-10-25 2014-09-23 Dell Products, Lp Method of handling network traffic through optimization of receive side scaling
US8874786B2 (en) 2011-10-25 2014-10-28 Dell Products L.P. Network traffic control by association of network packets and processes
US20170093792A1 (en) * 2015-09-30 2017-03-30 Radware, Ltd. System and method for stateless distribution of bidirectional flows with network address translation
US10860325B1 (en) * 2019-07-05 2020-12-08 Nokia Solutions And Networks Oy Dynamic control of processor instruction sets

Families Citing this family (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080059720A1 (en) * 2006-09-05 2008-03-06 Rothman Michael A System and method to enable prioritized sharing of devices in partitioned environments
US8639833B1 (en) * 2006-10-06 2014-01-28 Nvidia Corporation Dynamic control of scaling in computing devices
GB0802126D0 (en) * 2008-02-05 2008-03-12 Level 5 Networks Inc Scalable sockets
US8949472B2 (en) * 2008-09-10 2015-02-03 International Business Machines Corporation Data affinity based scheme for mapping connections to CPUs in I/O adapter
US8626955B2 (en) 2008-09-29 2014-01-07 Intel Corporation Directing packets to a processor unit
US8239699B2 (en) * 2009-06-26 2012-08-07 Intel Corporation Method and apparatus for performing energy-efficient network packet processing in a multi processor core system
US8082359B2 (en) * 2009-12-23 2011-12-20 Citrix Systems, Inc. Systems and methods for determining a good RSS key
US8819245B2 (en) * 2010-11-22 2014-08-26 Ixia Processor allocation for multi-core architectures
US10353631B2 (en) 2013-07-23 2019-07-16 Intel Corporation Techniques for moving data between a network input/output device and a storage device
US9473405B2 (en) * 2014-03-10 2016-10-18 Palo Alto Research Center Incorporated Concurrent hashes and sub-hashes on data streams
US9396154B2 (en) 2014-04-22 2016-07-19 Freescale Semiconductor, Inc. Multi-core processor for managing data packets in communication network
US10721160B2 (en) 2014-05-15 2020-07-21 Samsung Electronics Co., Ltd. Method of distributing data and device supporting the same
CN104375841B (zh) * 2014-12-03 2018-04-20 广州广电运通金融电子股份有限公司 一种基于linux系统的CEN/XFS标准的架构以及实现方法
US9553853B2 (en) * 2014-12-23 2017-01-24 Intel Corporation Techniques for load balancing in a packet distribution system
US9755972B1 (en) * 2015-06-09 2017-09-05 Google Inc. Protocol-independent receive-side scaling
US10469569B2 (en) 2018-03-22 2019-11-05 International Business Machines Corporation Optimizing receive side scaling key selection using flow data
US11095495B2 (en) * 2019-04-05 2021-08-17 Arista Networks, Inc. Multi-result lookups

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6085328A (en) 1998-01-20 2000-07-04 Compaq Computer Corporation Wake up of a sleeping computer using I/O snooping and imperfect packet filtering
US20030018691A1 (en) 2001-06-29 2003-01-23 Jean-Pierre Bono Queues for soft affinity code threads and hard affinity code threads for allocation of processors to execute the threads in a multi-processor system
WO2003036902A2 (fr) 2001-10-22 2003-05-01 Sun Microsystems, Inc. Procede et dispositif pour classificateur de paquets
US20040024873A1 (en) 2002-07-31 2004-02-05 Dimambro Francesco R. Load balancing the servicing of received packets
US20050243827A1 (en) * 2001-02-14 2005-11-03 John Rhoades Lookup engine
US20070115982A1 (en) * 2005-10-20 2007-05-24 Level 5 Networks, Inc. Hashing algorithm for network receive filtering

Family Cites Families (35)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4839891A (en) 1987-07-24 1989-06-13 Nec Corporation Method for controlling data flow
JPH0286245A (ja) 1988-09-21 1990-03-27 Hitachi Ltd データリンクレイヤ処理方式
US5528605A (en) 1991-10-29 1996-06-18 Digital Equipment Corporation Delayed acknowledgement in an asymmetric timer based LAN communications protocol
US5222061A (en) 1991-10-31 1993-06-22 At&T Bell Laboratories Data services retransmission procedure
US5444718A (en) 1993-11-30 1995-08-22 At&T Corp. Retransmission protocol for wireless communications
FI98174C (fi) 1995-05-09 1997-04-25 Nokia Telecommunications Oy Datansiirtojärjestelmä, jossa on liukuvaan ikkunaan perustuva datavuonohjaus
US5712860A (en) 1995-09-22 1998-01-27 Cirrus Logic, Inc. Methods and system for using multi-block bursts in half duplex subscriber unit transmissions
US5838563A (en) 1996-04-12 1998-11-17 Fisher-Rosemont Systems, Inc. System for configuring a process control environment
US6008805A (en) 1996-07-19 1999-12-28 Cisco Technology, Inc. Method and apparatus for providing multiple management interfaces to a network device
US6023698A (en) 1996-12-05 2000-02-08 International Business Machines Corporation System and method for transparently registering and updating information over the internet
US5970063A (en) 1997-07-31 1999-10-19 Telefonaktiebolaget Lm Ericsson Method for unacknowledged data frame delivery in a noisy wireless environment
WO1999011012A1 (fr) 1997-08-26 1999-03-04 Telefonaktiebolaget Lm Ericsson (Publ) Systemes de telecommunications sans fil et procedes mettant en oeuvre un accuse de reception de trames de groupe
US5872777A (en) 1997-09-30 1999-02-16 Motorola, Inc. Method and apparatus for conveying data packets in a packet data communication system
US6128296A (en) * 1997-10-03 2000-10-03 Cisco Technology, Inc. Method and apparatus for distributed packet switching using distributed address tables
US6115390A (en) 1997-10-14 2000-09-05 Lucent Technologies, Inc. Bandwidth reservation and collision resolution method for multiple access communication networks where remote hosts send reservation requests to a base station for randomly chosen minislots
US6111877A (en) * 1997-12-31 2000-08-29 Cisco Technology, Inc. Load sharing across flows
US7466703B1 (en) * 1998-05-01 2008-12-16 Alcatel-Lucent Usa Inc. Scalable high speed router apparatus
DE19844702C2 (de) 1998-09-29 2002-11-21 Siemens Ag Verfahren, Empfangseinrichtung und Funkstation zur Erkennung eines Nutzdatenblocks mit fehlerhaften Nutzdatensymbolen
US6650640B1 (en) 1999-03-01 2003-11-18 Sun Microsystems, Inc. Method and apparatus for managing a network flow in a high performance network interface
US6400724B1 (en) 1999-07-16 2002-06-04 Qualcomm Inc. Method and apparatus for efficient data transmission in a voice-over-data communication system
CN1137559C (zh) 1999-09-20 2004-02-04 诺基亚公司 错误控制方法和设备
US6775707B1 (en) 1999-10-15 2004-08-10 Fisher-Rosemount Systems, Inc. Deferred acknowledgment communications and alarm management
US7058064B2 (en) * 2000-02-08 2006-06-06 Mips Technologies, Inc. Queueing system for processors in packet routing operations
US6977930B1 (en) * 2000-02-14 2005-12-20 Cisco Technology, Inc. Pipelined packet switching and queuing architecture
US20020116527A1 (en) * 2000-12-21 2002-08-22 Jin-Ru Chen Lookup engine for network devices
US6909713B2 (en) 2001-09-05 2005-06-21 Intel Corporation Hash-based data frame distribution for web switches
CN100379236C (zh) * 2003-03-17 2008-04-02 华为技术有限公司 地址解析协议表项的处理方法
JP4196732B2 (ja) 2003-05-26 2008-12-17 日本電気株式会社 データ転送装置及びプログラム
US7400627B2 (en) * 2003-06-05 2008-07-15 Brooktree Broadband Holding, Inc. ATM header compression using hash tables
US7366092B2 (en) * 2003-10-14 2008-04-29 Broadcom Corporation Hash and route hardware with parallel routing scheme
US7620046B2 (en) * 2004-09-30 2009-11-17 Intel Corporation Dynamically assigning packet flows
US7765405B2 (en) * 2005-02-25 2010-07-27 Microsoft Corporation Receive side scaling with cryptographically secure hashing
CN1842051A (zh) * 2005-03-30 2006-10-04 国际商业机器公司 流量均衡设备和方法以及使用它们的网络转发设备和方法
US7701849B1 (en) * 2006-06-23 2010-04-20 Juniper Networks, Inc. Flow-based queuing of network traffic
US7584286B2 (en) 2006-06-28 2009-09-01 Intel Corporation Flexible and extensible receive side scaling

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6085328A (en) 1998-01-20 2000-07-04 Compaq Computer Corporation Wake up of a sleeping computer using I/O snooping and imperfect packet filtering
US20050243827A1 (en) * 2001-02-14 2005-11-03 John Rhoades Lookup engine
US20030018691A1 (en) 2001-06-29 2003-01-23 Jean-Pierre Bono Queues for soft affinity code threads and hard affinity code threads for allocation of processors to execute the threads in a multi-processor system
WO2003036902A2 (fr) 2001-10-22 2003-05-01 Sun Microsystems, Inc. Procede et dispositif pour classificateur de paquets
US20040024873A1 (en) 2002-07-31 2004-02-05 Dimambro Francesco R. Load balancing the servicing of received packets
US20070115982A1 (en) * 2005-10-20 2007-05-24 Level 5 Networks, Inc. Hashing algorithm for network receive filtering

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Microsoft Corporation, "Scalable Networking With RSS", WinHEC 2005 Update, Apr. 19, 2005, 16 pages.
P23866PCT International Search Report dated Nov. 13, 2007.

Cited By (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8150981B2 (en) 2006-06-28 2012-04-03 Intel Corporation Flexible and extensible receive side scaling
US20100061377A1 (en) * 2006-06-28 2010-03-11 Intel Corporation Flexible and extensible receive side scaling
US8874767B2 (en) 2006-06-28 2014-10-28 Intel Corporation Enqueuing received network packets based, at least in part, on at least one programmable mask
US20080086575A1 (en) * 2006-10-06 2008-04-10 Annie Foong Network interface techniques
US8751676B2 (en) 2008-12-30 2014-06-10 Intel Corporation Message communication techniques
US8307105B2 (en) 2008-12-30 2012-11-06 Intel Corporation Message communication techniques
US8645596B2 (en) 2008-12-30 2014-02-04 Intel Corporation Interrupt techniques
US20100169528A1 (en) * 2008-12-30 2010-07-01 Amit Kumar Interrupt technicques
US8346999B2 (en) 2009-12-15 2013-01-01 Intel Corporation Dynamic receive queue balancing with high and low thresholds
US20110142064A1 (en) * 2009-12-15 2011-06-16 Dubal Scott P Dynamic receive queue balancing
US20110153935A1 (en) * 2009-12-17 2011-06-23 Yadong Li Numa-aware scaling for network devices
US8446824B2 (en) 2009-12-17 2013-05-21 Intel Corporation NUMA-aware scaling for network devices
US9069722B2 (en) 2009-12-17 2015-06-30 Intel Corporation NUMA-aware scaling for network devices
US8874786B2 (en) 2011-10-25 2014-10-28 Dell Products L.P. Network traffic control by association of network packets and processes
US8842562B2 (en) 2011-10-25 2014-09-23 Dell Products, Lp Method of handling network traffic through optimization of receive side scaling
US9569383B2 (en) 2011-10-25 2017-02-14 Dell Products, Lp Method of handling network traffic through optimization of receive side scaling
US10007544B2 (en) 2011-10-25 2018-06-26 Dell Products, Lp Network traffic control by association of network packets and processes
US20170093792A1 (en) * 2015-09-30 2017-03-30 Radware, Ltd. System and method for stateless distribution of bidirectional flows with network address translation
US11394804B2 (en) * 2015-09-30 2022-07-19 Radware, Ltd. System and method for stateless distribution of bidirectional flows with network address translation
US10860325B1 (en) * 2019-07-05 2020-12-08 Nokia Solutions And Networks Oy Dynamic control of processor instruction sets
US11675596B2 (en) 2019-07-05 2023-06-13 Nokia Solutions And Networks Oy Dynamic control of processor instruction sets

Also Published As

Publication number Publication date
CN101455040A (zh) 2009-06-10
TW200818782A (en) 2008-04-16
US20120189013A1 (en) 2012-07-26
US20100061377A1 (en) 2010-03-11
WO2008002945A1 (fr) 2008-01-03
TWI400910B (zh) 2013-07-01
US8874767B2 (en) 2014-10-28
US20080005352A1 (en) 2008-01-03
DE112007001529T5 (de) 2009-07-30
US8150981B2 (en) 2012-04-03
CN101455040B (zh) 2012-04-18

Similar Documents

Publication Publication Date Title
US7584286B2 (en) Flexible and extensible receive side scaling
US8661160B2 (en) Bidirectional receive side scaling
US8937944B2 (en) Scaling egress network traffic
US11221972B1 (en) Methods and systems for increasing fairness for small vs large NVMe IO commands
US8949472B2 (en) Data affinity based scheme for mapping connections to CPUs in I/O adapter
US7987307B2 (en) Interrupt coalescing control scheme
US9450780B2 (en) Packet processing approach to improve performance and energy efficiency for software routers
US7480303B1 (en) Pseudo-ethernet switch without ethernet media-access-controllers (MAC's) that copies ethernet context registers between PCI-express ports
US6570884B1 (en) Receive filtering for communication interface
US7126952B2 (en) Multiprotocol decapsulation/encapsulation control structure and packet protocol conversion method
US7983257B2 (en) Hardware switch for hypervisors and blade servers
US20030185220A1 (en) Dynamically loading parsing capabilities
WO2017000593A1 (fr) Procédé et dispositif de traitement de paquet
US7979573B2 (en) Smart routing between peers in a point-to-point link based system
US11995004B2 (en) Methods and systems for using a packet processing pipeline to accelerate InfiniBand administrative operations
WO2008005696A1 (fr) Gestion de congestion non modifiable basée sur point final
US20060153215A1 (en) Connection context prefetch
US20170104697A1 (en) Dynamic Optimization for IP Forwarding Performance
US7940764B2 (en) Method and system for processing multicast packets
US20070121662A1 (en) Network performance scaling
US20070005920A1 (en) Hash bucket spin locks
EP4027594B1 (fr) Dispositif de traitement d'informations, procédé de traitement d'informations et programme de traitement d'informations
KR20040075597A (ko) 네트워크 라인 인터페이스 시스템의 정보 저장 방법 및 그장치

Legal Events

Date Code Title Description
AS Assignment

Owner name: INTEL CORPORATION, CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:GOGLIN, STEPHEN D.;CORNETT, LINDEN;REEL/FRAME:022911/0284;SIGNING DATES FROM 20060921 TO 20060922

Owner name: INTEL CORPORATION, CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:GOGLIN, STEPHEN D.;CORNETT, LINDEN;SIGNING DATES FROM 20060921 TO 20060922;REEL/FRAME:022911/0284

STCF Information on status: patent grant

Free format text: PATENTED CASE

CC Certificate of correction
FPAY Fee payment

Year of fee payment: 4

FPAY Fee payment

Year of fee payment: 8

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

Year of fee payment: 12