|Publication number||US7765405 B2|
|Application number||US 11/064,941|
|Publication date||Jul 27, 2010|
|Filing date||Feb 25, 2005|
|Priority date||Feb 25, 2005|
|Also published as||US20060195698|
|Publication number||064941, 11064941, US 7765405 B2, US 7765405B2, US-B2-7765405, US7765405 B2, US7765405B2|
|Inventors||James T. Pinkerton, Sanjay N. Kaniyar, Bhupinder S. Sethi|
|Original Assignee||Microsoft Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (63), Referenced by (14), Classifications (11), Legal Events (3)|
|External Links: USPTO, USPTO Assignment, Espacenet|
The present invention generally relates to the area of computer networks and implementation of symmetrical multiprocessing in multiprocessor systems. More particularly, the present invention is directed to a secure hash mechanism for systematically and securely partitioning I/O tasks for network connections across processors in a multiprocessor system.
Today's traditional computer architectures enlist computer systems with multiple processors to perform receive-side processing of requests received across a network from remote clients. The requests are in the form of I/O tasks that are partitioned across multiple processors working in concert to execute the I/O tasks. Allowing multiple processors to simultaneously perform incoming I/O tasks provides an overall faster performance time for the computer system. One of the more challenging aspects of utilizing multiple processors is “scalability,” that is, partitioning the I/O tasks for connections across processors in a way that optimizes each processor individually and collectively.
A well-known computer hardware system for achieving scalability is a “symmetric multiprocessor” (SMP) system. An SMP system uses two or more identical processors that appear to the executing software to be a single processing unit. In an exemplary SMP system, multiple processors in one system share a global memory and I/O subsystem including a network interface card commonly referred to as a “NIC.” As is known in the art, the NIC enables communication between a host computer and remote computers located on a network such as the Internet. NICs communicate with remote computers through the use of a network communications protocol, for example, TCP (“Transmission Control Protocol”). TCP, like other protocols, allows two computers to establish a connection and exchange streams of data. In particular, TCP guarantees lossless delivery of data packets sent by the remote computer to the host computer (and vice-versa).
After a network connection is established between a host computer and a remote computer, the remote computer sends a data stream to the host computer. The data stream itself may comprise multiple data packets and ultimately entail sending more than one data packet from the remote computer to the host computer. When the NIC on the host computer receives a first data packet, the first data packet is stored in memory along with a packet descriptor that includes pointer information identifying the location of the data in memory. Thereafter, an interrupt is issued to one of the processors in the SMP system. As the interrupt service routine (ISR) runs, all further interrupts from the NIC are disabled and a deferred procedure call (DPC) is requested to run on the selected processor. Meanwhile, as more data packets are received by the NIC, the data packets are also stored in memory along with packet descriptors. No interrupts are generated, however, until the DPC for the first interrupt runs to completion.
As the DPC runs, the data packet descriptors and associated data packets are pulled from memory to build an array of received packets. Next, protocol receive-processing is invoked indirectly via calls to a device driver interface within the DPC routine. An exemplary interface is the Network Driver Interface Specification (NDIS), a Microsoft Windows device driver interface that enables a single NIC to support multiple network protocols. After the DPC runs to completion, interrupts are re-enabled and the NIC generates an interrupt to one of the processors in the multiprocessor system. Because only one DPC runs for any given NIC at any given time, when the scheduling processor is running a receive DPC other processors in the system are not conducting receive processing. This serialization problem limits scalabilty in the SMP system and degrades performance of the multiprocessor system. An alternate method may combine the ISR and DPC into a single routine.
Similarly, because data packets relating to a particular network connection are often received by the NIC at different intervals, receive-side processing of data packets may occur on different processors under the above-described scheme. When a processor processes data packets belonging to a particular network connection, the state for that network connection is modified. If data packets associated with this network connection were previously processed by a first processor, the network connection state resides in the first processor's cache. In order for a second processor to process packets related to a request previously processed by the first processor, the state is pulled from the first processor's cache to main memory, and the first processor's cache is invalidated. This process of copying the state and invalidating the cache results in performance degradation of the multiprocessor system. Similarly, with the above scheme, send and receive processing for the same network connection can occur simultaneously on different processors leading to contention and spinning that also causes performance degradation.
U.S. Pat. No. 7,219,121 provides a method and framework for implementing symmetrical multiprocessing in a multiprocessor system and increasing performance of the multiprocessor system. That application describes a receive-side scheduling framework including a network interface card, memory and two or more processors, communicably coupled to each other to handle network connections and I/O tasks associated with the network connections. An example of such an I/O task is a data stream associated with the Transmission Control Protocol (also referred to as “TCP”). The data packets received by a NIC in the multiprocessor system are stored, along with a data packet descriptor, in memory. A scheduling processor in the multiprocessor system, selected by a load-balancing algorithm, reads each data packet and applies a mapping algorithm to portions of the data packet yielding a map value. The map value, in conjunction with a processor selection policy, determines which “selected processor” in the multiprocessor is scheduled to manage the data stream.
The mapping algorithm is any acceptable algorithm, such as a hashing function, adopted by the system that ensures data packets received from the same network connection are routinely scheduled for processing by the same selected processor in the multiprocessor system. The scheduling processor then processes the data requests assigned to the scheduling processor itself. Thereafter, each of the other selected processors is requested to execute the data requests scheduled to that selected processor.
Moreover, data packets received by the NIC from a network connection are individually hashed, with the use of a hashing function, by the NIC. The hashing function yields a hash value that identifies which processor is selected to process the data packet. The hashing function is chosen such that the load is distributed optimally across the processors. The hash value is then stored along with a data packet descriptor and the data packet in memory. A scheduling processor, selected by a load-balancing algorithm, then reads each data packet descriptor to ascertain the hashing value. With the use of a processor selection policy, each data packet is queued for processing by the selected processor.
While this hash function successfully distributes packets across multiple processors, it does not prevent malicious users from purposefully causing packets to be directed to the same processor. That is, if the hash function is known to a malicious user, that user can design packets that will repeatedly produce the same hash. By doing this, the malicious user can overflow the queue on a specific processor. The hash bucket for each processor has a corresponding linked list of received packets. More computational resources are consumed as the length of that list grows. Accordingly, there is a need for secure receive-side scaling for symmetrical multiprocessing in a multiprocessor system.
In view of the foregoing, the invention provides a method for scheduling receive-side processing of data packets in a multiprocessor computer system comprising a network interface communicably coupled to a network to receive data streams, memory and at least two local processors. The method comprises the steps of establishing a network connection between a remote requesting client and the multiprocessor computer system; receiving a data packet from the remote requesting client over the network connection; applying a cryptographically secure hashing function to the data packet, the cryptographically secure hashing function producing a hash value; applying the hash value to a processor selection policy to identify the local processor as a selected processor to perform receive-side processing of the data packet; directing the received data packet to the selected processor; and processing the data packet.
Another embodiment of the invention provides a method for packet context lookup in a multiprocessor computer system comprising a network interface communicably coupled to a network to receive data streams, memory and at least two local processors. The method includes receiving a data packet from a remote requesting client over the network connection; applying a cryptographically secure hashing function to the data packet, the cryptographically secure hashing function producing a hash value; and finding a packet context associated with the hash value by utilizing a packet context lookup table mapping a plurality of hash values to a plurality of packet contexts. This embodiment of the invention may further include establishing a TCP connection between the remote requesting client and the multiprocessor system, wherein the packet context is a TCP packet context. The packet context lookup table may be partitioned among the at least two local processors, and a first portion of the hash value is used to identify a partition corresponding to one of the at least two local processors, and a second portion of the hash value is to lookup the packet context within the identified partition.
In one embodiment, the receiving step comprises receiving, by the network interface, the data packet from the network and storing the data packet and a data packet descriptor in memory. Applying a cryptographically secure hashing function may comprise reading, by a scheduling processor, the data packet descriptor and the data packet from memory and applying a cryptographically secure hashing function to the data packet yielding the hash value. Applying the hash value to a processor selection policy may comprise utilizing, by the scheduling processor, a map table to resolve a processor number indicating the selected processor using the hash value.
In another embodiment of the invention, a processor offset is applied by incrementing the processor number by the processor offset. In yet another embodiment of the invention, the network connection is a TCP connection. Furthermore, a hash mask may be applied to the hash value before applying the hash value to a processor selection policy.
Still another embodiment of the invention provides a method for TCP context lookup in a multiprocessor computer system comprising a network interface communicably coupled to a network to receive data streams, memory and at least two local processors. The method includes establishing a TCP network connection between a remote requesting client and the multiprocessor computer system; receiving a data packet from the remote requesting client over the network connection; applying a cryptographically secure hashing function to the data packet, the cryptographically secure hashing function producing a hash value; and finding a TCP context associated with the hash value by utilizing a TCP context lookup table mapping a plurality of hash values to a plurality of TCP contexts.
Additional features and advantages of the invention are made apparent from the following detailed description of illustrative embodiments which proceeds with reference to the accompanying figures.
The accompanying drawings incorporated in and forming a part of the specification illustrate several aspects of the present invention, and together with the description serve to explain the principles of the invention. In the drawings:
While the invention will be described in connection with certain preferred embodiments, there is no intent to limit it to those embodiments. On the contrary, the intent is to cover all alternatives, modifications, and equivalents as included within the spirit and scope of the invention as defined by the appended claims.
In some situations, it is beneficial if the same processor in a multiprocessor system performs receive-side processing of all I/O tasks relating to a particular connection. There is a need for a method and framework for systematically partitioning I/O tasks for connections across processors in a multiprocessor system such that the connection state lives on a single processor for the lifetime of a network connection.
In an embodiment of the present invention, a receive-side processing technique comprises communication system software executed within an SMP system computer operating environment such as the one depicted in
The operating environment is only one example of a suitable operating environment and is not intended to suggest any limitation as to the scope of use or functionality of the invention. Examples of well known computing systems, environments, and/or configurations that are suitable for use with the invention include, but are not limited to, personal computers, server computers, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like, either alone or in combination.
The invention is described in the general context of computer-executable instructions, such as program modules, being executed by a system computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
In its most basic configuration, SMP systems 100 a-b include two or more processing units 250 a-b, communication device(s) 225 and memory 240. Depending on the exact configuration and type of SMP system, the memory 240 may be volatile (such as RAM), non-volatile (such as ROM or flash memory) or some combination of the two. SMP systems 100 a-b also contain communication device(s) 225 that allows the SMP systems 100 a-b to communicate with other computers in the network. The communication device(s) include a network interface, such as a network interface card (NIC) 220, coupled to a network 215. Various and multiple NICs are employed in alternative embodiments of the invention including, but not limited to, cards that support Ethernet (802.3), Token Ring (802.5), ARCNET 878.2, Wireless and ATM. Communication device(s) and media typically embody computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media. The term computer readable media as used herein includes both storage media and communication media. This most basic configuration is illustrated in
Additionally, the SMP systems 100 a-b may also have additional features/functionality. For example, SMP systems 100 a-b may also include additional storage (removable and/or non-removable) including, but not limited to, magnetic or optical disks or tape. Computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules, or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by the SMP systems 100 a-b. Any such computer storage media may be part of the SMP systems 100 a-b. SMP systems 100 a-b may also have input devices such as a keyboard, mouse, pen, voice input device, touch input device, etc. Output devices such as a display 270, speakers, a printer, etc. may also be included. All these devices are well known in the art and need not be discussed at length here.
Having described an exemplary computing environment for executing a method for scheduling receive-side processing in a multiprocessor system embodying the present invention, attention is directed to
As is known in the art, communication between the remote computer(s) 310 and the multiprocessor system 300 requires the use of a communications protocol. In an embodiment of the present invention, connections are established through the use of TCP (“Transmission Control Protocol), a communications protocol that enables two networked computers to establish a connection and exchange streams of data. Various communications protocols are employed in alternative embodiments of the invention such as IPX/SPX, NetBEUI and AppleTalk. With continued reference to
As will be explained further herein below, when a first packet of data is received by the NIC 320 from the network 315, the data packet is stored in a pre-allocated pool of memory 343 located in the main memory 340 of the multiprocessor system 300. Direct memory access (DMA), a method by which memory access is accomplished without the use of a processor, is used by the NIC 320 to store the data packet in memory 343. At the same time or shortly after the data packet is stored in the memory pool 343, a data packet descriptor, including pointer information identifying the location of the data packet in memory pool 343, is stored in a memory array 345. After the data packet and data packet descriptor are stored in memory 340, an interrupt request (IRQ) is sent from the NIC 320 to a “scheduling processor,” one of the processors 350 a, 350 b in the multiprocessor system 300 chosen through the use of a load-balancing algorithm for the purpose of handling original requests. Ideally, the scheduling processor chosen by the load-balancing algorithm is the least busy processor in the multiprocessor system 300. Alternatively, the interrupt request rotates between the available processors on a round-robin basis or the NIC 320 could be affinitized to a certain processor in the system such that all interrupt requests from a certain network connection routinely proceed to the same processor. In the example of
As is known in the art, interrupt servicing can typically consist of either two driver-provided components, an “interrupt service routine” (ISR) and a “deferred procedure call” (DPC), or a model that combines the two. By way of example and not limitation, the two-component model is assumed in the proceeding description of embodiments of the invention. Both the ISR and DPC use costly processor cycles that degrade performance of the system if not used economically. ISRs and DPCs are well known in the art and need not be discussed at length here. After the interrupt is generated by the NIC 320, the ISR disables generation of further interrupts by the NIC 320. Thereafter, ISR requests a DPC to execute scheduling of the data packet by placing a DPC object in the DPC queue 355 a of the scheduling processor 350 a. For purposes of illustration, the DPC queue is shown logically with the processor, however those skilled in the art will recognize the DPC queue may be implemented in physical memory. While the DPC object is removed from the DPC queue 355 a, additional data packets associated with the data stream and other data streams are received by the NIC 320 from the network 315. All additional data packets are also stored in the memory pool 343 via the use of DMA and associated packet descriptors are stored in the memory array 345. No interrupts, however, are generated because the DPC is still running on scheduling processor 350 a and interrupts from the NIC have been disabled. Only after the DPC runs to completion on processor 350 a are interrupts on the NIC 320 re-enabled.
As the DPC runs on processor 350 a, both the packet descriptors from memory array 345 and the data packet from the memory pool 343 are read. Processor 350 a, by way of the miniport driver 327, then runs a secure mapping algorithm to determine which processor in the multiprocessor system 300 will process the data packet. The secure mapping algorithm is any acceptable algorithm, such as a secure hashing function, adopted by the system that ensures data packets received from the same network connection are routinely scheduled for processing by the same selected processor in the multiprocessor system, such that the mapping is cryptographically secure. In this embodiment, the secure hashing function 356 a uses any part of the communication header or data packet descriptor, alone or in combination, as a method for determining a hash value. The hash value, in conjunction with a processor selection policy, identifies which processor 350 a or 350 b (as shown in
After determining the selected processor, the scheduling processor 350 a builds a per-CPU packet using the information in the data packet and data packet descriptor. The per-CPU packet is then queued up on the selected processor by way of placing the per-CPU packet in the selected processor's per-CPU packet array. In the example of
As will be explained further herein below, the process of applying the secure hashing function to the data packets to determine a hash value is performed at different steps in the method and by different framework components according to the various embodiments of the invention. In an alternative embodiment depicted in
In another embodiment of the present invention depicted in
In yet another embodiment of the present invention depicted in
Having described the structures that support an exemplary receive-side DPC processing technique embodying the present invention, attention is now directed to
The procedure begins at step 400 where the NIC 320 receives a data packet from a remote computer 310. The data packet includes data such as a source port address, a destination port address and other data related specifically to the request. At step 402, the data packet is stored using DMA in the pre-allocated memory pool 343 depicted in
Attention is now directed to
If the data packet is not of the type that should be scaled, in step 508, the selected processor is chosen based on other load-balancing criteria. Next, in step 510, the procedure queues up a packet descriptor for the data packet in the per-CPU packet array of the selected processor previously identified in either step 506 or 508. Thereafter, in step 512, the procedure determines whether any additional packet descriptors remain in the memory array 345. If yes, the procedure returns to step 502 where the process of reading the packet descriptor and data packet continues.
If no additional packet descriptors are in the memory array 345 or the number of packets processed in this DPC has reached some threshold, the procedure continues to step 514 where the scheduling processor initializes a counter to N, where N is the number of processors upon which a DPC will be scheduled (i.e. the number of CPUs whose corresponding per-CPU packet array is non-empty). At step 516, the scheduling processor causes DPCs to be run on the selected processors. If it is determined that there are no packets in the per-CPU packet array of the scheduling processor, the procedure ends. Otherwise, each processor runs the scheduled DPC as illustrated in
Attention is now directed to
Attention is now directed to
With the use of a processor selection policy, the hash value identifies a selected processor in the system at step 708. An exemplary processor selection policy includes any acceptable manner of cross-referencing the hash value to a processor in the multiprocessor system, including a processor identification table. The processor identification table is used to map the masked hash value to a processor. In an alternative embodiment of the invention, the scheduling processor further bounds the number of CPUs to which hash values can be mapped. Thus, at step 710 a CPU number offset is applied to the CPU number produced by the processor identification table in step 708. In one embodiment of the invention, the CPU number offset is a function that is applied to the CPU number to limit which CPUs are used for received packet processing. The function yields a one-to-one mapping between the CPU number produced by the processor identification table and the set of processors that specified to receive incoming packets. By way of example and not limitation, the CPU number offset may be an increment function implemented by an adder, thereby effectively limiting the base and bounds of the number of CPUs that are used for received packet processing.
In another embodiment of the invention, the hash value of the packet is made available to the rest of the computer. Attention is now directed to
The foregoing description of various embodiments of the invention has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise embodiments disclosed. Numerous modifications or variations are possible in light of the above teachings. The embodiments discussed were chosen and described to provide the best illustration of the principles of the invention and its practical application to thereby enable one of ordinary skill in the art to utilize the invention in various embodiments and with various modifications as are suited to the particular use contemplated. All such modifications and variations are within the scope of the invention as determined by the appended claims when interpreted in accordance with the breadth to which they are fairly, legally, and equitably entitled.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5608870 *||Jun 2, 1995||Mar 4, 1997||The President And Fellows Of Harvard College||System for combining a plurality of requests referencing a common target address into a single combined request having a single reference to the target address|
|US5655103||Feb 13, 1995||Aug 5, 1997||International Business Machines Corporation||System and method for handling stale data in a multiprocessor system|
|US5872972||Jul 5, 1996||Feb 16, 1999||Ncr Corporation||Method for load balancing a per processor affinity scheduler wherein processes are strictly affinitized to processors and the migration of a process from an affinitized processor to another available processor is limited|
|US5892829 *||Jan 8, 1998||Apr 6, 1999||Bell Communications Research, Inc.||Method and apparatus for generating secure hash functions|
|US5914938 *||Nov 19, 1996||Jun 22, 1999||Bay Networks, Inc.||MAC address table search unit|
|US5966543||Jun 26, 1997||Oct 12, 1999||International Business Machines Corporation||Method of using collaborative spinlocks to provide exclusive access to a resource in a multiprocessor computer system|
|US6038651||Mar 23, 1998||Mar 14, 2000||International Business Machines Corporation||SMP clusters with remote resource managers for distributing work to other clusters while reducing bus traffic to a minimum|
|US6052733||Oct 1, 1997||Apr 18, 2000||3Com Corporation||Method of detecting errors in a network|
|US6179489||Apr 4, 1997||Jan 30, 2001||Texas Instruments Incorporated||Devices, methods, systems and software products for coordination of computer main microprocessor and second microprocessor coupled thereto|
|US6230151||Apr 16, 1998||May 8, 2001||International Business Machines Corporation||Parallel classification for data mining in a shared-memory multiprocessor system|
|US6249845||Aug 19, 1998||Jun 19, 2001||International Business Machines Corporation||Method for supporting cache control instructions within a coherency granule|
|US6314501||Dec 18, 1998||Nov 6, 2001||Unisys Corporation||Computer system and method for operating multiple operating systems in different partitions of the computer system and for allowing the different partitions to communicate with one another through shared memory|
|US6327614 *||Sep 16, 1998||Dec 4, 2001||Kabushiki Kaisha Toshiba||Network server device and file management system using cache associated with network interface processors for redirecting requested information between connection networks|
|US6356951||Mar 1, 1999||Mar 12, 2002||Sun Microsystems, Inc.||System for parsing a packet for conformity with a predetermined protocol using mask and comparison values included in a parsing instruction|
|US6389468 *||Mar 1, 1999||May 14, 2002||Sun Microsystems, Inc.||Method and apparatus for distributing network traffic processing on a multiprocessor computer|
|US6470389||Mar 14, 1997||Oct 22, 2002||Lucent Technologies Inc.||Hosting a network service on a cluster of servers using a single-address image|
|US6470442 *||Jul 30, 1999||Oct 22, 2002||International Business Machines Corporation||Processor assigning data to hardware partition based on selectable hash of data address|
|US6480876||May 28, 1998||Nov 12, 2002||Compaq Information Technologies Group, L.P.||System for integrating task and data parallelism in dynamic applications|
|US6502141||Dec 14, 1999||Dec 31, 2002||International Business Machines Corporation||Method and system for approximate, monotonic time synchronization for a multiple node NUMA system|
|US6516429||Nov 4, 1999||Feb 4, 2003||International Business Machines Corporation||Method and apparatus for run-time deconfiguration of a processor in a symmetrical multi-processing system|
|US6567806 *||Sep 20, 2000||May 20, 2003||Hitachi, Ltd.||System and method for implementing hash-based load-balancing query processing in a multiprocessor database system|
|US6578131 *||Apr 27, 1999||Jun 10, 2003||Microsoft Corporation||Scaleable hash table for shared-memory multiprocessor system|
|US6618386||Aug 10, 1999||Sep 9, 2003||Webtv Networks, Inc.||Hosting a cable modem in a computer using a virtual bridge|
|US6643636||Jun 5, 2001||Nov 4, 2003||Ncr Corporation||Optimizing a query using a non-covering join index|
|US6754222 *||Jun 12, 2000||Jun 22, 2004||Samsung Electronic Co., Ltd.||Packet switching apparatus and method in data network|
|US6763519||May 5, 1999||Jul 13, 2004||Sychron Inc.||Multiprogrammed multiprocessor system with lobally controlled communication and signature controlled scheduling|
|US6772333||Sep 1, 1999||Aug 3, 2004||Dickens Coal Llc||Atomic session-start operation combining clear-text and encrypted sessions to provide id visibility to middleware such as load-balancers|
|US6823471 *||Jul 30, 1999||Nov 23, 2004||International Business Machines Corporation||Method for providing high availability within a data processing system via a reconfigurable hashed storage subsystem|
|US6888797 *||Mar 25, 2000||May 3, 2005||Lucent Technologies Inc.||Hashing-based network load balancing|
|US6981074 *||Oct 14, 2003||Dec 27, 2005||Broadcom Corporation||Descriptor-based load balancing|
|US6981110 *||Oct 6, 2002||Dec 27, 2005||Stephen Waller Melvin||Hardware enforced virtual sequentiality|
|US7003574||Nov 1, 2000||Feb 21, 2006||Microsoft Corporation||Session load balancing and use of VIP as source address for inter-cluster traffic through the use of a session identifier|
|US7203747 *||May 25, 2001||Apr 10, 2007||Overture Services Inc.||Load balancing system and method in a multiprocessor system|
|US7219121 *||Mar 29, 2002||May 15, 2007||Microsoft Corporation||Symmetrical multiprocessing in multiprocessor systems|
|US7225219 *||Nov 29, 2000||May 29, 2007||Broadspider Networks, Inc.||Distributed caching architecture for computer networks|
|US7366092 *||Oct 14, 2003||Apr 29, 2008||Broadcom Corporation||Hash and route hardware with parallel routing scheme|
|US20020054567||Jul 2, 2001||May 9, 2002||Fan Kan Frankie||Dynamic network load balancing over heterogeneous link speed|
|US20020091748||May 28, 1998||Jul 11, 2002||James Mathew Rehg||System for learning and applying integrated task and data parallel strategies in dynamic applications|
|US20020110134 *||Dec 15, 2000||Aug 15, 2002||Glenn Gracon||Apparatus and methods for scheduling packets in a broadband data stream|
|US20020112076||Jan 31, 2001||Aug 15, 2002||Rueda Jose Alejandro||Internet protocol-based computer network service|
|US20020124104||Mar 1, 2001||Sep 5, 2002||Yigal Rappaport||Network element and a method for preventing a disorder of a sequence of data packets traversing the network|
|US20030009559 *||Jul 8, 2002||Jan 9, 2003||Naoya Ikeda||Network system and method of distributing accesses to a plurality of server apparatus in the network system|
|US20030037093 *||May 25, 2001||Feb 20, 2003||Bhat Prashanth B.||Load balancing system and method in a multiprocessor system|
|US20030058862 *||Aug 15, 2002||Mar 27, 2003||Broadcom Corporation||Apparatus and method for hardware creation of a DOCSIS header|
|US20030061495 *||Sep 26, 2001||Mar 27, 2003||Linden Minnick||Security association management through the use of lookup tables|
|US20030063611||Sep 28, 2001||Apr 3, 2003||Marc Schaub||Flexible application of mapping algorithms within a packet distributor|
|US20030067930||Oct 5, 2001||Apr 10, 2003||International Business Machines Corporation||Packet preprocessing interface for multiprocessor network handler|
|US20030137978||Jan 18, 2002||Jul 24, 2003||Hitachi.Ltd.||Method and apparatus for composing virtual links in a label switched network|
|US20030167346||Mar 7, 2001||Sep 4, 2003||Alacritech, Inc.||Port aggregation for network connections that are offloaded to network interface devices|
|US20030187914 *||Mar 29, 2002||Oct 2, 2003||Microsoft Corporation||Symmetrical multiprocessing in multiprocessor systems|
|US20030195919 *||Mar 21, 2003||Oct 16, 2003||Tatsuya Watanuki||Packet distributing system and method for distributing access packets to a plurality of server apparatuses|
|US20040010545 *||Jun 10, 2003||Jan 15, 2004||Pandya Ashish A.||Data processing system using internet protocols and RDMA|
|US20040030770 *||Jun 10, 2003||Feb 12, 2004||Pandya Ashish A.||IP storage processor and engine therefor using RDMA|
|US20040037319 *||Jun 10, 2003||Feb 26, 2004||Pandya Ashish A.||TCP/IP processor and engine using RDMA|
|US20050027793 *||Aug 31, 2004||Feb 3, 2005||Hass David T.||Advanced processor with mechanism for packet distribution at high line rate|
|US20050071843||Jan 24, 2002||Mar 31, 2005||Hong Guo||Topology aware scheduling for a multiprocessor system|
|US20050078601 *||Oct 14, 2003||Apr 14, 2005||Broadcom Corporation||Hash and route hardware with parallel routing scheme|
|US20050078669 *||Oct 14, 2003||Apr 14, 2005||Broadcom Corporation||Exponential channelized timer|
|US20050078696 *||Oct 14, 2003||Apr 14, 2005||Broadcom Corporation||Descriptor write back delay mechanism to improve performance|
|US20050080952 *||Oct 14, 2003||Apr 14, 2005||Broadcom Corporation||Descriptor-based load balancing|
|US20060072563 *||Oct 5, 2004||Apr 6, 2006||Regnier Greg J||Packet processing|
|US20070214266 *||Jul 30, 2004||Sep 13, 2007||Telefonaktiebolaget Lm Ericsson (Pub)||Secure load balancing in a network|
|US20080198867 *||Apr 25, 2008||Aug 21, 2008||Broadcom Corporation||Hash and Route Hardware with Parallel Routing Scheme|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US8204480 *||Oct 1, 2010||Jun 19, 2012||Viasat, Inc.||Method and apparatus for secured access|
|US8301119||May 21, 2012||Oct 30, 2012||Viasat, Inc.||Method and apparatus for validating integrity of a mobile communication device|
|US8307105||Jun 30, 2011||Nov 6, 2012||Intel Corporation||Message communication techniques|
|US8498619||Oct 10, 2012||Jul 30, 2013||Viasat, Inc.||Method and apparatus for validating integrity of a mobile communication|
|US8635352 *||Feb 22, 2011||Jan 21, 2014||Qwilt, Inc.||System and method for symmetric receive-side scaling (RSS)|
|US8645596||Dec 30, 2008||Feb 4, 2014||Intel Corporation||Interrupt techniques|
|US8751676 *||Oct 29, 2012||Jun 10, 2014||Intel Corporation||Message communication techniques|
|US9113499||May 31, 2013||Aug 18, 2015||Viasat, Inc.||Multiple domain smartphone|
|US9396154||Apr 22, 2014||Jul 19, 2016||Freescale Semiconductor, Inc.||Multi-core processor for managing data packets in communication network|
|US20080086575 *||Oct 6, 2006||Apr 10, 2008||Annie Foong||Network interface techniques|
|US20100169528 *||Dec 30, 2008||Jul 1, 2010||Amit Kumar||Interrupt technicques|
|US20110113218 *||Oct 18, 2010||May 12, 2011||Electronics And Telecommunications Research Institute||Cross flow parallel processing method and system|
|US20120215932 *||Feb 22, 2011||Aug 23, 2012||Qwilt, Inc.||System and method for symmetric receive-side scaling (rss)|
|US20130055263 *||Oct 29, 2012||Feb 28, 2013||Steven King||Message communication techniques|
|U.S. Classification||713/181, 713/151, 711/216, 713/189, 370/393|
|Cooperative Classification||H04L9/3236, H04L63/12, H04L2209/043|
|European Classification||H04L63/12, H04L9/32L|
|May 20, 2005||AS||Assignment|
Owner name: MICROSOFT CORPORATION, WASHINGTON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:PINKERTON, JAMES T.;KANIYAR, SANJAY N.;SETHI, BHUPINDER S.;REEL/FRAME:016039/0588;SIGNING DATES FROM 20050218 TO 20050225
Owner name: MICROSOFT CORPORATION, WASHINGTON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:PINKERTON, JAMES T.;KANIYAR, SANJAY N.;SETHI, BHUPINDER S.;SIGNING DATES FROM 20050218 TO 20050225;REEL/FRAME:016039/0588
|Dec 30, 2013||FPAY||Fee payment|
Year of fee payment: 4
|Dec 9, 2014||AS||Assignment|
Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC, WASHINGTON
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MICROSOFT CORPORATION;REEL/FRAME:034543/0001
Effective date: 20141014