US 7,126,952 B2Grant
Multiprotocol decapsulation/encapsulation control structure and packet protocol conversion method
Issue Date:2006-10-24
•31 Claims
•11 Drawing Sheets
Abstract
A network packet may be forwarded by reading a table containing a plurality of flags to determine which of the plurality of flags is set or cleared and performing an operation on the packet to decapsulate or encapsulate the packet in accordance with values of the flags.
Metadata
Assignee
- Intel Corporation
Inventors
- Donald F. Hooper
- Stephanie L. Hirnak
Application Information
Application Number:US 09/966,349
Filing Date:2001-09-28
Priority Date:2001-09-28
Art Unit:2616
Classifications
IPC:
H04L12/28H04J3/22
Patent Drawings (11 sheets)
Description
BACKGROUND
[0001] This invention relates to forwarding network packets between network domains.
[0002] Packets are routed through a series of router devices, each of which stores and forwards packets on its way from a source to a destination. For example, a packet may start out as an Internet packet, be forwarded over an ATM (asynchronous transfer mode path) and then back to Ethernet onto a corporate network to its final intended recipient. As the network passes through these network domains, various header encapsulations may be added to or removed from the packet. Some connections use point-to-point protocol (PPP) whereas others use multiprotocol label switching MPLS, layer to tunneling protocol LTTP, ATM and so forth.
DESCRIPTION OF DRAWINGS
[0003] FIG. 1 is a block diagram of a communication system employing a hardware based multithreaded processor.
[0004] FIGS. 2-1 to 2-4 are a detailed block diagram of a hardware based multithreaded processor of FIG. 1 .
[0005] FIG. 3 is a block diagram depicting a functional arrangement of the multithreaded processor of FIG. 2 .
[0006] FIG. 4 is a block diagram depicting data structures in memory used for the processor of FIG. 1 .
[0007] FIG. 5 is a block diagram depicting formats for forwarding tables used in the tables of FIG. 4 .
[0008] FIG. 6 is a flow chart depicting a generic packet forwarding process.
[0009] FIG. 7 is a flow chart depicting an alternative aspect of the packet forwarding process of FIG. 6 .
DETAILED DESCRIPTION
[0010] Referring to FIG. 1 , a communication system 10 includes a parallel, hardware-based multithreaded processor 12. The hardware-based multithreaded processor 12 is coupled to a bus such as a PCI bus 14, a memory system 16 and a second bus 18. The system 10 is especially useful for tasks that can be broken into parallel subtasks or functions. Specifically hardware-based multithreaded processor 12 is useful for tasks that are bandwidth oriented rather than latency oriented. The hardware-based multithreaded processor 12 has multiple microengines 22 each can be simultaneously active and work on multiple hardware controlled threads that independently work on a task.
[0011] The hardware-based multithreaded processor 12 also includes a central controller 20 that assists in loading microcode control for other resources of the hardware-based multithreaded processor 12 and performs other general purpose computer type functions such as handling protocols, exceptions, extra support for packet processing where the microengines pass the packets off for more detailed processing such as in boundary conditions. In one embodiment, the processor 20 is a Strong Arm® based architecture. The general purpose microprocessor 20 has an operating system. Through the operating system the processor 20 can call functions to operate on microengines 22a–22f. The processor 20 can use any supported operating system preferably a real time operating system such as, MicrosoftNT real-time, VXWorks.
[0012] The hardware-based multithreaded processor 12 also includes a plurality of function microengines 22a–22f. Functional microengines (microengines) 22a–22f each maintain a plurality of program counters in hardware and states associated with the program counters. Effectively, a corresponding plurality of sets of threads can be simultaneously active on each of the microengines 22a–22f while only one is actually operating at any one time.
[0013] In one embodiment, there are six microengines 22a–22f as shown. Each microengines 22a–22f has capabilities for processing four hardware threads. The six microengines 22a–22f operate with shared resources including memory system 16 and bus interfaces 24 and 28. The memory system 16 includes a Synchronous Dynamic Random Access Memory (SDRAM) controller 26a and a Static Random Access Memory (SRAM) controller 26b. SDRAM memory 16a and SDRAM controller 26a are typically used for processing large volumes of data, e.g., processing of network payloads from network packets. The SRAM controller 26b and SRAM memory 16b are used in a networking implementation for low latency, fast access tasks, e.g., accessing look-up tables, memory for the core processor 20, and so forth.
[0014] The six microengines 22a–22f access either the SDRAM 16a or SRAM 16b based on characteristics of the data. Thus, low latency, low bandwidth data is stored in and fetched from SRAM, whereas higher bandwidth data for which latency is not as important, is stored in and fetched from SDRAM. The microengines 22a–22f can execute memory reference instructions to either the SDRAM controller 26a or SRAM controller 16b.
[0015] Advantages of hardware multithreading can be explained by SRAM or SDRAM memory accesses. As an example, an SRAM access requested by a Thread—0, from a microengine will cause the SRAM controller 26b to initiate an access to the SRAM memory 16b. The SRAM controller controls arbitration for the SRAM bus, accesses the SRAM 16b, fetches the data from the SRAM 16b, and returns data to a requesting microengine 22a–22b. During an SRAM access, if the microengine e.g., 22a had only a single thread that could operate, that microengine would be dormant until data was returned from the SRAM. By employing hardware context swapping within each of the microengines 22a–22f, the hardware context swapping enables other contexts with unique program counters to execute in that same microengine. Thus, another thread e.g., Thread—1 can function while the first thread, e.g., Thread—0, is awaiting the read data to return. During execution, Thread—1 may access the SDRAM memory 16a. While Thread—1 operates on the SDRAM unit, and Thread—0 is operating on the SRAM unit, a new thread, e.g., Thread—2 can now operate in the microengine 22a. Thread—2 can operate for a certain amount of time until it needs to access memory or perform some other long latency operation, such as making an access to a bus interface. Therefore, simultaneously, the processor 12 can have a bus operation, SRAM operation and SDRAM operation all being completed or operated upon by one microengine 22a and have one more thread available to process more work in the data path.
[0016] The hardware context swapping also synchronizes completion of tasks. For example, two threads could hit the same shared resource e.g., SRAM. Each one of these separate functional units, e.g., the FBUS interface 28, the SRAM controller 26a, and the SDRAM controller 26b, when they complete a requested task from one of the microengine thread contexts reports back a flag signaling completion of an operation. When the flag is received by the microengine, the microengine can determine which thread to turn on.
[0017] One example of an application for the hardware-based multithreaded processor 12 is as a network processor. As a network processor, the hardware-based multithreaded processor 12 interfaces to network devices such as a media access controller device e.g., a 10/100BaseT Octal MAC 13a or a Gigabit Ethernet device 13b. In general the network process can interface to any type of communication device or interface that receives/sends large amounts of data. Communication system 10 functioning in a networking application could receive a plurality of network packets from the devices 13a, 13b and process those packets in a parallel manner. With the hardware-based multithreaded processor 12, each network packet can be independently processed. Another example for use of processor 12 is a print engine for a postscript processor or as a processor for a storage subsystem, i.e., RAID disk storage. A further use is as a matching engine. In the securities industry for example, the advent of electronic trading requires the use of electronic matching engines to match orders between buyers and sellers. These and other parallel types of tasks can be accomplished on the system 10.
[0018] The processor 12 includes a bus interface 28 that couples the processor to the second bus 18. Bus interface 28 in one embodiment couples the processor 12 to the so-called FBUS 18 (FIFO bus). The FBUS interface 28 is responsible for controlling and interfacing the processor 12 to the FBUS 18. The FBUS 18 is a 64-bit wide FIFO bus, which is currently gaining acceptance as the best bus for Media Access Controller (MAC) devices.
[0019] The processor 12 includes a second interface e.g., a PCI bus interface 24 that couples other system components that reside on the PCI 14 bus to the processor 12. The PCI bus interface 24, provides a high speed data path 24a to memory 16 e.g., the SDRAM memory 16a. Through that path data can be moved quickly from the SDRAM 16a through the PCI bus 14, via direct memory access (DMA) transfers. Additionally, the PCI bus interface 24 supports target and master operations. Target operations are operations where slave devices on bus 14 access SDRAMs through reads and writes that are serviced as a slave to target operation. In master operations, the processor core 20 sends data directly to or receives data directly from the PCI interface 24.
[0020] Each of the functional units are coupled to one or more internal buses. The processor includes an AMBA bus that couples the processor core 20 to the memory controller 26a, 26c and to an AMBA translator 30 described below. The processor also includes a private bus 34 that couples the microengine units to SRAM controller 26b, AMBA translator 30 and FBUS interface 28. A memory bus 38 couples the memory controller 26a, 26b to the bus interfaces 24 and 28 and memory system 16 including flashrom 16c used for boot operations and so forth.
[0021] Referring to FIGS. 2-1 to 2-4, each of the microengines 22a–22f includes an arbiter that examines flags to determine the available threads to be operated upon. Any thread from any of the microengines 22a–22f can access the SDRAM controller 26a, SDRAM controller 26b or FBUS interface 28. The memory controllers 26a and 26b each include a plurality of queues to store outstanding memory reference requests. The queues either maintain order of memory references or arrange memory references to optimize memory bandwidth. For example, if a thread—0 has no dependencies or relationship to a thread—1, there is no reason that thread 1 and 0 cannot complete their memory references to the SRAM unit out of order. The microengines 22a–22f issue memory reference requests to the memory controllers 26a and 26b. The microengines 22a–22f flood the memory subsystems 26a and 26b with enough memory reference operations such that the memory subsystems 26a and 26b become the bottleneck for processor 12 operation.
[0022] If the memory subsystem 16 is flooded with memory requests that are independent in nature, the processor 12 can perform memory reference sorting. Memory reference sorting improves achievable memory bandwidth. Memory reference sorting, as described below, reduces dead time or a bubble that occurs with accesses to SRAM. With memory references to SRAM, switching current direction on signal lines between reads and writes produces a bubble or a dead time waiting for current to settle on conductors coupling the SRAM 16b to the SRAM controller 26b.
[0023] That is, the drivers that drive current on the bus need to settle out prior to changing states. Thus, repetitive cycles of a read followed by a write can degrade peak bandwidth. Memory reference sorting allows the processor 12 to organize references to memory such that long strings of reads can be followed by long strings of writes. This can be used to minimize dead time in the pipeline to effectively achieve closer to maximum available bandwidth. Reference sorting helps maintain parallel hardware context threads. On the SDRAM, reference sorting allows hiding of pre-charges from one bank to another bank. Specifically, if the memory system 16b is organized into an odd bank and an even bank, while the processor is operating on the odd bank, the memory controller can start precharging the even bank. Precharging is possible if memory references alternate between odd and even banks. By ordering memory references to alternate accesses to opposite banks, the processor 12 improves SDRAM bandwidth.
[0024] The FBUS interface 28 supports Transmit and Receive flags for each port that a MAC device supports, along with an Interrupt flag indicating when service is warranted. The FBUS interface 28 also includes a controller 28a that performs header processing of incoming packets from the FBUS 18. The controller 28a extracts the packet headers and performs a microprogrammable source/destination/protocol hashed lookup (used for address smoothing) in SRAM. If the hash does not successfully resolve, the packet header is sent to the processor core 20 for additional processing. The FBUS interface 28 supports the following internal data transactions:
[0025]
| FBUS unit | (via AMBA bus) | to/from processor Core. | |
| FBUS unit | (via private bus) | to/from SRAM Unit. | |
| FBUS unit | (via Mbus) | to/from SDRAM. | |
[0026] The FBUS 18 is a standard industry bus and includes a data bus, e.g., 64 bits wide and sideband control for address and read/write control. The FBUS interface 28 provides the ability to input large amounts of data using a series of input and output FIFO's 29a–29b. From the FIFOs 29a–29b, the microengines 22a–22f fetch data from or command the SDRAM controller 26a to move data from a receive FIFO in which data has come from a device on bus 18, into the FBUS interface 28. The data can be sent through memory controller 26a to SDRAM memory 16a, via a direct memory access. Similarly, the microengines can move data from the SDRAM 26a to interface 28, out to FBUS 18, via the FBUS interface 28.
[0027] Data functions are distributed amongst the microengines. Connectivity to the SRAM 26a, SDRAM 26b and FBUS 28 is via command requests. A command request can be a memory request or a FBUS request. For example, a command request can move data from a register located in a microengine 22a to a shared resource, e.g., an SDRAM location, SRAM location, flash memory or some MAC address. The commands are sent out to each of the functional units and the shared resources. However, the shared resources do not need to maintain local buffering of the data. Rather, the shared resources access distributed data located inside of the microengines. This enables microengines 22a–22f, to have local access to data rather than arbitrating for access on a bus and risk contention for the bus. With this feature, there is a 0 cycle stall for waiting for data internal to the microengines 22a–22f.
[0028] The data buses, e.g., AMBA bus 30, SRAM bus 34 and SDRAM bus 38 coupling these shared resources, e.g., memory controllers 26a and 26b are of sufficient bandwidth such that there are no internal bottlenecks. Thus, in order to avoid bottlenecks, the processor 12 has an bandwidth requirement where each of the functional units is provided with at least twice the maximum bandwidth of the internal buses. As an example, the SDRAM can run a 64 bit wide bus at 83 MHz. The SRAM data bus could have separate read and write buses, e.g., could be a read bus of 32 bits wide running at 166 MHz and a write bus of 32 bits wide at 166 MHz. That is, in essence, 64 bits running at 166 MHz which is effectively twice the bandwidth of the SDRAM.
[0029] The core processor 20 also can access the shared resources. The core processor 20 has a direct communication to the SDRAM controller 26a to the bus interface 24 and to SRAM controller 26b via bus 32. However, to access the microengines 22a–22f and transfer registers located at any of the microengines 22a–22f, the core processor 20 access the microengines 22a–22f via the AMBA Translator 30 over bus 34. The AMBA translator 30 can physically reside in the FBUS interface 28, but logically is distinct. The AMBA Translator 30 performs an address translation between FBUS microengine transfer register locations and core processor addresses (i.e., AMBA bus) so that the core processor 20 can access registers belonging to the microengines 22a–22c.
[0030] The processor core 20 includes a RISC core 50 implemented in a five stage pipeline performing a single cycle shift of one operand or two operands in a single cycle, provides multiplication support and 32 bit barrel shift support. This RISC core 50 is a standard Strong Arm® architecture but it is implemented with a five stage pipeline for performance reasons. The processor core 20 also includes a 16 kilobyte instruction cache 52, an 8 kilobyte data cache 54 and a prefetch stream buffer 56. The core processor 20 performs arithmetic operations in parallel with memory writes and instruction fetches. The core processor 20 interfaces with other functional units via the ARM defined AMBA bus. The AMBA bus is a 32-bit bi-directional bus 32.
[0031] Referring to FIG. 3 , the multiprocessor 12 is shown performing network routing functions. In one example, an asynchronous transfer mode (ATM), Ethernet and other types of packets enter through the network interface MAC devices and are sent to the network processor 12. These packets are processed in an application on the general purpose microprocessor 20 or on another processor that is coupled through the PCI bus interface (not shown). For reception and transmission of such packets, the application running on that processor 20 or the processor coupled through the PCI bus, makes use of a network stack 72, which includes network management, control and signaling processes 74 to manage network communications.
[0032] The network stack 72 and the application run in the processor 20 that controls the microengines, or another processor coupled to the PCI bus. The paths of receive, transmit and data forwarding represent the transport of the packets through the processor 12. The management control, signaling, and the network stack 72 usually are not involved in data forwarding. Essentially, the processor 20 receives and transmits. The processor 20 generates new packets that are transmitted over the network. The processor 20 can be involved in data forwarding in the exceptional case. This would involve very unusual packets, which may need special handling and complex processing.
[0033] For data forwarding processes, the microengines 22a–22f are used. In some instances, data forwarding may occur at the general purpose processor 20 level. The signals Init is programmer's interface for initialization of microengine code. The signal Fini is used for termination (to put control info in a known state). The microengines 22a–22f provide fast, store and forward capabilities. The engines use a multilayer generic look-up process that performs validation, classification, policing and filtering using parallel hardware supported threads of the process. Exceptions and control packets are passed to the processor 20 for processing at the network stack 72. A ternary network stack (not shown) can be located off-chip at a host via the PCI port or device port. This can be used to off-load the processor 20 or centralized management and control for one place. In some embodiments, the microengine is a compact RISC processor and can have limited instruction space. For this reason and for other reasons, it is desirable to reduce instruction code size when running multiple protocols. The network processor 12 implements a generic forwarding process that can be used to handle various protocol types (both existing and future types) without exceeding instruction storage limits.
[0034] Referring now to FIG. 4 , an management arrangement 80 for forwarding table structures 90 that are stored in memory is shown. The forwarding table structure management 80 includes a control and management structure 82 including a network stack interface 84 and table managers 86. The table managers 86 manage routing tables 90 that are stored in SRAM and can include a plurality of tables such as shown in FIG. 4 including a layer 4 connection table 92, a layer 3 destination table 94, a layer 2 bridge table 96 and a layer 2 connection table 98. Additionally, data structures stored in memory can include a packet buffer 100, which is stored in DRAM. The microengines acting as packet data forwarding processors retrieve information from the routing tables 90 in SRAM and store and forward the packet information from the packet buffer in DRAM. The multiple tables 90 are set up by the control management processor 20. For example, a layer 2 connection table 96 can be used for ATM virtual circuits, frame relay connections MPLS labels or other low level connections. A layer 2 bridge table 96 could be used for Ethernet bridging. A layer 3 destination table 94 could be used for Internet protocol (IP) forwarding based on a destination IP address. The layer 3 connection table 92 could be used for IP forwarding based on source and destination ports, addresses and protocol. All these tables may require that the packet be decapsulated or encapsulated.
[0035] Once the tables 90 are populated with forwarding information in a generally conventional manner, packet data forwarding processors can receive packets, perform table look-ups to obtain information and convert packets as required by the table entry. The control management process sets up the tables 90 with a common format for the purpose of decapsulation and encapsulation.
[0036] Referring now to FIG. 5 , exemplary table entries, a subset of which are included in each of the tables 90, is shown. The table entries include the following fields:
Forwarding Table Format
-
- [0037] Decap Flag. Indicates whether the bytes should be stripped from the packet. If this flag is asserted, then the number of bytes to strip is in Decap Byte Count field.
- [0038] Decap To Layer. This field specifies decapsulation of header layers up to the specified layer. The length of the layer and hence the decapsulation is determined by parsing the packet header.
- [0039] Decap Byte Count. This field specifies the number of bytes to remove from the front of the packet. Decap is performed by adjusting the packet start offset in the packet buffer.
- [0040] Current Encap. This field specifies an identifier of the current packet encapsulation type.
- [0041] Encap Flag. Indicates whether bytes should be prepended to the packet. If this flag is asserted, then the number of bytes is in Encap Byte Count field, and the bytes to be encapsulated is in the Encap Header field.
- [0042] Encap Byte Count. Number of bytes to be prepended to the packet.
- [0043] Encap Header. The actual bytes to be prepended.
- [0044] Next Table Type. If non-zero, this indicated that a further lookup is required. This gives the table type. For example, layer 3 routing or layer 3 connection table type. A layer 3 routing lookup would use a longest prefix match lookup algorithm using the destination IP address. A layer 3 connection lookup would use a 104 bit hash algorithm using source and destination addresses, source and destination ports, and protocol.
- [0045] Next Table Addr. There can be multiple next tables, and multiple next tables of the same type. This field specifies the base address of the table.
[0046] The flags get set or cleared by the management process. Signaling and setting up connections are part of the network system that will determine that a certain path through the network requires a change of the header. There can be many reasons why a header can change. Usually a header change is used when the protocol changes from one network domain to another.
[0047] Referring now to FIG. 6 , a process 110 for encapsulating/decapsulating generic protocols is shown. Initially one of the microengines 22a–22f receives 112 a packet from the network interface. The packet is comprised of one or more headers followed by a payload. The microengine, e.g., 22a copies the payload portion of the packet to a packet buffer in DRAM and it may place the packet at an offset in the buffer to make room for any new header that could be prepended to the packet for packet forwarding. The packet offset parameter for that packet is set to a default value determined at the offset into the buffer. The microengine reads 114 in the first header of the packet and performs a layer 2 look-up. The layer 2 look-up will read the table layer 2 bridge table and/or layer 2 connection table. The tables will return various parameters such as decap or encap flags. The process 110 will determine 116 if the decap or encap flags are set. If the decap and encap flags are set, the process will add 118 the decap byte count to the packet start offset and will subtract 120 the encap byte count from the packet start offset and prepend the encap bytes to the packet. The process 110 tests 122 if there is a next table to examine by looking at the blank field in the currently read table. If there is a next table, the process 110 will parse the next header 124, fetch and read the next table. The process 110 continues looking to test the decap or encap flags being set.
[0048] If, however, the process did not determine that the decap and encap flags were set (116, above), it would determine 130 if the encap flag or the decap flag were set 132. If the encap flag was set, it will subtract 120 the encap flag byte count from the start offset and prepend the encap bytes to the packet. On the other hand, if the decap flag was only set 132, the process will add 134 a decap byte count to the buffer offset and, in any event, will check the next table 112. When the process determines that it is at the end of checking the tables, it will then classify and forward 136 the packet in a conventional manner. That is, the “no” condition indicates that the process can classify and forward. Forwarding the header can have the microengine take the header and send it to the processor 20 or elsewhere, so that it can get reassembled with the payload. Forwarding the header could also involve forwarding the packet, etc.
[0049] Referring now to FIG. 7 , in addition to specifying byte dissemination counts obtained from the look-up table. The look-up table may have the decap to layer field set in the table. This field specifies that the front portion of a packet should be decapsulated up to a certain layer. As known, packets are defined in protocol layers used in the OSI (Open Systems Interconnect) seven layer network protocol. After passing through physical layer 1, the first software layer seen by the network processor layer is layer 2, also referred to as the link layer. The length of the bytes to be decapsulated is determined by parsing the packet layers prior to the layer that is to be the new start of the packet. The length can be added to the packet start offset.
[0050] FIG. 7 shows a variation where the decapsulation length is not specified in the table, but is determined by reading the packet itself. In other words, this would be a set of routines that would be inserted into the processing of FIG. 6 substitute encapsulated byte count from the packet into the offset.
[0051] A process 140 to determine this offset is shown in FIG. 7 . The process 140 includes reading the table 142, determining that the decap to packet layer bit 144 has been set, and if set, retrieve the length of the layer to be removed by parsing the header 146 and adding the length to the packet start offset 148. If the decap layer has not been set then the process simply skips. In any event, this process can be prepended to the process described in conjunction with FIG. 6 .
[0052] A typical use of a decap to layer bit is to specify a decapsulation up to the layer 3 IP header. If the packet encapsulation is a multiprotocol over an ATM network such as the RFC 1483 standard, the layer 2 header length is determined by parsing the layer to header itself using the RFC 1483 length rules. However, if the packet encapsulation is classical IP the layer 2 length is determined by following the classical IP layer length rules. The packet encapsulation may be known by the port type it came in on from the prepended custom header from that port or may be obtained from the first look-up table in the current encap field.
[0053] Rather that each network protocol defining a separate protocol conversion this technique provides a generic approach. The approach saves code space and software development time-to-market. In an alternative embodiment, this technique can be implemented as a software library routine, e.g., a generic software building block for decapsulation/encapsulation, where customers can insert their proprietary header encapsulation and a customer's vendor need not get involved with customer's proprietary protocol designs.
[0054] A number of embodiments of the invention have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. Accordingly, other embodiments are within the scope of the following claims.
Claims
What is claimed is:
1. A method of forwarding a network packet comprising:
reading a table containing a plurality of flags to determine which of the plurality of flags is set or cleared;
determining if the table returned decapsulate and encapsulate flags;
adding a decapsulate byte count to a packet start offset and subtracting an encapsulate byte count from the packet start offset if the decapsulate and encapsulate flags are set; and
prepending encapsulate bytes to the packet.
2. The method of claim 1 wherein the table is populated with forwarding information.
3. The method of claim 1 wherein a forwarding table structures includes a control and management structure including a network stack interface and table managers.
4. The method of claim 3 wherein the table managers manage routing tables and can include a plurality of tables including a layer 3 connection table, a layer 3 destination table, a layer 2 bridge table and a layer 2 connection table.
5. The method of claim 1 wherein the table includes a flag to indicates whether the bytes should be stripped from the packet and a field that indicates the number of bytes to be stripped.
6. The method of claim 1 wherein the tables includes a field that specifies decapsulation of header layers up to a specified layer.
7. The method of claim 1 wherein the tables includes a field that specifies an identifier of the current packet encapsulation type.
8. The method of claim 1 wherein the tables includes a flag that indicates whether bytes should be prepended to the packet, a field that specifies the number of bytes and the bytes to be encapsulated.
9. The method of claim 1 wherein the tables includes a Next Table Type field which indicates that a further lookup is required and identifies the table type.
10. A method for encapsulating/decapsulating packets comprising:
receiving a packet;
reading in a first header of the packet and performing a layer 2 look-up reading a connection table which returns parameters;
determining if the table returned decapsulate and encapsulate flags;
adding a decapsulate byte count to a packet start offset and subtracting an encapsulate byte count from the packet start offset if the decapsulate and encapsulate flags are set; and
prepending the encapsulate bytes to the packet.
11. The method of claim 10 further comprising:
determining if there is a next table to examine by looking at a blank field in the currently read table.
12. The method of claim 11 wherein if there is a next table,
parsing the next header and fetch and read the next table.
13. The method of claim 10 wherein if the decapsulate and encapsulate flags were not set,
determine if the encapsulate flag or the decapsulate flag were set.
14. The method of claim 10 wherein if the encapsulate flag was set,
subtract the encapsulate flag byte count from the start offset and prepend the encapsulate flags to the packet.
15. The method of claim 10 wherein if the decapsulate flag was set add a decapsulate byte count to the buffer offset and check the next table.
16. The method of claim 10 wherein the packet is comprised of one or more headers followed by a payload, the method further comprises:
copying the payload portion of the packet to a packet buffer.
17. The method of claim 16 wherein copying may place the packet at an offset in the buffer to make room for any new header that could be prepended to the packet for packet forwarding.
18. A computer program product residing on a computer readable media for forwarding a network packet comprises instructions to cause a computer to:
read a table containing a plurality of flags to determine, which of the plurality of flags is set or cleared;
determine if the table returned decapsulate and encapsulate flags;
add a decapsulate byte count to a packet start offset and subtract an encapsulate byte count from the packet start offset if the decapsulate and encapsulate flags are set; and
prepend encapsulate bytes to the packet.
19. The computer program product of claim 18 wherein the table is populated with forwarding information.
20. The computer program product of claim 18 wherein a forwarding table structures include a control and management structure including a network stack interface and table managers.
21. A computer program product residing on a computer readable media for forwarding a network packet comprises instructions to cause a computer to:
receive a packet;
read in a first header of the packet and perform a layer 2 look-up reading a connection table which return parameters;
determine if the table returned decapsulate and encapsulate flags;
add a decapsulate byte count to a packet start offset and subtracting an encapsulate byte count from the packet start offset if the decapsulate and encapsulate flags are set; and
prepend encapsulate bytes to the packet.
22. The computer program product of claim 21 further comprising instructions to:
determine if there is a next table to examine by looking at a blank field in the currently read table.
23. The computer program product of claim 22 wherein if there is a next table, the computer program executes instructions to:
parse the next header and fetch and read the next table.
24. The computer program product of claim 21 wherein the packet is comprised of one or more headers followed by a payload, the computer program product further executes instructions to:
copy the payload portion of the packet to a packet buffer.
25. The computer program product of claim 24 wherein instructions to copy place the packet at an offset in the buffer to make room for any new header that could be prepended to the packet for packet forwarding.
26. A processor for processing a network packet comprises:
a computer storage media storing instructions to cause a computer to:
read a table containing a plurality of flags to determine, which of the plurality of flags is set or cleared; end
determine if the table returned decapsulate and encapsulate flags;
add a decapsulate byte count to a packet start offset and subtract an encapsulate byte count from the packet start offset if the decapsulate and encapsulate flags are set; and
prepend the encapsulate bytes to the packet.
27. The processor of claim 26 wherein the table contains forwarding information.
28. An apparatus comprising:
means for reading a table containing a plurality of flags to determine which of the plurality of flags is set or cleared;
means for determining if the table returned decapsulate and encapsulate flags;
means for adding a decapsulate byte count to a packet start offset and for subtracting an encapsulate byte count from the packet start offset if the decapsulate and encapsulate flags are set; and
means for prepending the encapsulate bytes to the packet.
29. The apparatus of claim 28 wherein the table is populated with forwarding information.
30. The apparatus of claim 28 wherein a forwarding table structure includes a control and management structure including a network stack interface and table managers.
31. The apparatus of claim 30 wherein the table managers manage routing tables and can include a plurality of tables including a layer 3 connection table, a layer 3 destination table, a layer 2 bridge table and a layer 2 connection table.
Patent Citations (266)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3373408(A) | 1968-03-01 | Ling | Applicant |
| US3478322(A) | 1969-11-01 | Evans | Applicant |
| US3736566(A) | 1973-05-01 | Anderson et al. | Applicant |
| US3792441(A) | 1974-02-01 | Wymore et al. | Applicant |
| US3940745(A) | 1976-02-01 | Sajeva | Applicant |
| US4016548(A) | 1977-04-01 | Law et al. | Applicant |
| US4032899(A) | 1977-06-01 | Jenny et al. | Applicant |
| US4075691(A) | 1978-02-01 | Davis et al. | Applicant |
| US4130890(A) | 1978-12-01 | Adam | Applicant |
| US4400770(A) | 1983-08-01 | Chan et al. | Applicant |
| US4514807(A) | 1985-04-01 | Nogi | Applicant |
| US4523272(A) | 1985-06-01 | Fukunaga et al. | Applicant |
| US4709347(A) | 1987-11-01 | Kirk | Applicant |
| US4745544(A) | 1988-05-01 | Renner et al. | Applicant |
| US4788640(A) | 1988-11-01 | Hansen | Applicant |
| US4831358(A) | 1989-05-01 | Ferrio et al. | Applicant |
| US4866664(A) | 1989-09-01 | Burkhardt, Jr. et al. | Applicant |
| US4890218(A) | 1989-12-01 | Bram | Applicant |
| US4890222(A) | 1989-12-01 | Kirk | Applicant |
| US4991112(A) | 1991-02-01 | Callemyn | Applicant |
| US5115507(A) | 1992-05-01 | Callemyn | Applicant |
| US5140685(A) | 1992-08-01 | Sipple et al. | Applicant |
| US5142683(A) | 1992-08-01 | Burkhardt, Jr. et al. | Applicant |
| US5155831(A) | 1992-10-01 | Emma et al. | Applicant |
| US5155854(A) | 1992-10-01 | Flynn et al. | Applicant |
| US5168555(A) | 1992-12-01 | Byers et al. | Applicant |
| US5173897(A) | 1992-12-01 | Schrodi et al. | Applicant |
| US5251205(A) | 1993-10-01 | Callon et al. | Applicant |
| US5255239(A) | 1993-10-01 | Taborn et al. | Applicant |
| US5263169(A) | 1993-11-01 | Genusov et al. | Applicant |
| US5347648(A) | 1994-09-01 | Stamm et al. | Applicant |
| US5367678(A) | 1994-11-01 | Lee et al. | Applicant |
| US5390329(A) | 1995-02-01 | Gaertner et al. | Applicant |
| US5392391(A) | 1995-02-01 | Caulk, Jr. et al. | Applicant |
| US5392411(A) | 1995-02-01 | Ozaki | Applicant |
| US5392412(A) | 1995-02-01 | McKenna | Applicant |
| US5404464(A) | 1995-04-01 | Bennett | Applicant |
| US5404469(A) | 1995-04-01 | Chung | Applicant |
| US5404482(A) | 1995-04-01 | Stamm et al. | Applicant |
| US5404484(A) | 1995-04-01 | Schlansker et al. | Applicant |
| US5432918(A) | 1995-07-01 | Stamm | Applicant |
| US5448702(A) | 1995-09-01 | Garcia, Jr. et al. | Applicant |
| US5450351(A) | 1995-09-01 | Heddes | Applicant |
| US5452437(A) | 1995-09-01 | Richey et al. | Applicant |
| US5459842(A) | 1995-10-01 | Begun et al. | Applicant |
| US5459843(A) | 1995-10-01 | Davis | Applicant |
| US5463625(A) | 1995-10-01 | Yasrebi | Applicant |
| US5467452(A) | 1995-11-01 | Blum et al. | Applicant |
| US5485455(A) | 1996-01-01 | Dobbins et al. | Applicant |
| US5515296(A) | 1996-05-01 | Agarwal | Applicant |
| US5517648(A) | 1996-05-01 | Bertone et al. | Applicant |
| US5542070(A) | 1996-07-01 | LeBlanc et al. | Applicant |
| US5542088(A) | 1996-07-01 | Jennings, Jr. et al. | Applicant |
| US5544236(A) | 1996-08-01 | Andruska et al. | Applicant |
| US5550816(A) | 1996-08-01 | Hardwick et al. | Applicant |
| US5557766(A) | 1996-09-01 | Takiguchi et al. | Applicant |
| US5568476(A) | 1996-10-01 | Sherer et al. | Applicant |
| US5568617(A) | 1996-10-01 | Kametani | Applicant |
| US5574922(A) | 1996-11-01 | James | Applicant |
| US5581729(A) | 1996-12-01 | Nistala et al. | Applicant |
| US5592622(A) | 1997-01-01 | Isfeld et al. | Applicant |
| US5613071(A) | 1997-03-01 | Rankin et al. | Applicant |
| US5613136(A) | 1997-03-01 | Casavant et al. | Applicant |
| US5623489(A) | 1997-04-01 | Cotton et al. | Applicant |
| US5627829(A) | 1997-05-01 | Gleeson et al. | Applicant |
| US5630130(A) | 1997-05-01 | Perotto et al. | Applicant |
| US5630641(A) | 1997-05-01 | Mori et al. | Applicant |
| US5644623(A) | 1997-07-01 | Gutledge | Applicant |
| US5649157(A) | 1997-07-01 | Williams | Applicant |
| US5651002(A) | 1997-07-01 | Van Seters et al. | Applicant |
| US5659687(A) | 1997-08-01 | Kim et al. | Applicant |
| US5680641(A) | 1997-10-01 | Sidman | Applicant |
| US5689566(A) | 1997-11-01 | Nguyen | Applicant |
| US5699537(A) | 1997-12-01 | Sharangpani et al. | Applicant |
| US5701434(A) | 1997-12-01 | Nakagawa | Applicant |
| US5717898(A) | 1998-02-01 | Kagan et al. | Applicant |
| US5721870(A) | 1998-02-01 | Matsumoto | Applicant |
| US5740402(A) | 1998-04-01 | Bratt et al. | Applicant |
| US5742587(A) | 1998-04-01 | Zornig et al. | Applicant |
| US5742782(A) | 1998-04-01 | Ito et al. | Applicant |
| US5742822(A) | 1998-04-01 | Motomura | Applicant |
| US5745913(A) | 1998-04-01 | Pattin et al. | Applicant |
| US5751987(A) | 1998-05-01 | Mahant-Shetti et al. | Applicant |
| US5754764(A) | 1998-05-01 | Davis et al. | Examiner |
| US5761507(A) | 1998-06-01 | Govett | Applicant |
| US5761522(A) | 1998-06-01 | Hisanaga et al. | Applicant |
| US5764915(A) | 1998-06-01 | Heimsoth et al. | Applicant |
| US5768528(A) | 1998-06-01 | Stumm | Applicant |
| US5781551(A) | 1998-07-01 | Born | Applicant |
| US5781774(A) | 1998-07-01 | Krick | Applicant |
| US5784649(A) | 1998-07-01 | Begur | Applicant |
| US5784712(A) | 1998-07-01 | Byers et al. | Applicant |
| US5796413(A) | 1998-08-01 | Shipp et al. | Applicant |
| US5797043(A) | 1998-08-01 | Lewis et al. | Applicant |
| US5809235(A) | 1998-09-01 | Sharma et al. | Applicant |
| US5809237(A) | 1998-09-01 | Watts et al. | Applicant |
| US5809530(A) | 1998-09-01 | Samra et al. | Applicant |
| US5812868(A) | 1998-09-01 | Moyer et al. | Applicant |
| US5828746(A) | 1998-10-01 | Ardon | Applicant |
| US5828863(A) | 1998-10-01 | Barrett et al. | Applicant |
| US5832215(A) | 1998-11-01 | Kato et al. | Applicant |
| US5835755(A) | 1998-11-01 | Stellwagen, Jr. | Applicant |
| US5850530(A) | 1998-12-01 | Chen et al. | Applicant |
| US5854922(A) | 1998-12-01 | Gravenstein et al. | Applicant |
| US5860158(A) | 1999-01-01 | Pai et al. | Applicant |
| US5886992(A) | 1999-03-01 | Raatikainen et al. | Applicant |
| US5887134(A) | 1999-03-01 | Ebrahim | Applicant |
| US5890208(A) | 1999-03-01 | Kwon | Applicant |
| US5892979(A) | 1999-04-01 | Shiraki et al. | Applicant |
| US5898701(A) | 1999-04-01 | Johnson | Applicant |
| US5905876(A) | 1999-05-01 | Pawlowski et al. | Applicant |
| US5905889(A) | 1999-05-01 | Wilhelm, Jr. | Applicant |
| US5915123(A) | 1999-06-01 | Mirsky et al. | Applicant |
| US5918235(A) | 1999-06-01 | Kirshenbaum et al. | Applicant |
| US5928736(A) | 1999-07-01 | Parekh | Applicant |
| US5933627(A) | 1999-08-01 | Parady | Applicant |
| US5937187(A) | 1999-08-01 | Kosche et al. | Applicant |
| US5938736(A) | 1999-08-01 | Muller et al. | Applicant |
| US5940612(A) | 1999-08-01 | Brady et al. | Applicant |
| US5940866(A) | 1999-08-01 | Chisholm et al. | Applicant |
| US5946487(A) | 1999-08-01 | Dangelo | Applicant |
| US5948081(A) | 1999-09-01 | Foster | Applicant |
| US5958031(A) | 1999-09-01 | Kime | Applicant |
| US5961628(A) | 1999-10-01 | Nguyen et al. | Applicant |
| US5970013(A) | 1999-10-01 | Fischer et al. | Applicant |
| US5978838(A) | 1999-11-01 | Mohamed et al. | Applicant |
| US5983274(A) | 1999-11-01 | Hyder et al. | Applicant |
| US5995513(A) | 1999-11-01 | Harrand et al. | Applicant |
| US6012151(A) | 2000-01-01 | Mano | Applicant |
| US6014729(A) | 2000-01-01 | Lannan et al. | Applicant |
| US6023742(A) | 2000-02-01 | Ebeling et al. | Applicant |
| US6032190(A) | 2000-02-01 | Bremer et al. | Applicant |
| US6058168(A) | 2000-05-01 | Braband | Applicant |
| US6061710(A) | 2000-05-01 | Eickemeyer et al. | Applicant |
| US6067300(A) | 2000-05-01 | Baumert et al. | Applicant |
| US6067585(A) | 2000-05-01 | Hoang | Applicant |
| US6070231(A) | 2000-05-01 | Ottinger | Applicant |
| US6072781(A) | 2000-06-01 | Feeney et al. | Applicant |
| US6073215(A) | 2000-06-01 | Snyder | Applicant |
| US6079008(A) | 2000-06-01 | Clery, III | Applicant |
| US6085215(A) | 2000-07-01 | Ramakrishnan et al. | Applicant |
| US6085294(A) | 2000-07-01 | Van Doren et al. | Applicant |
| US6092127(A) | 2000-07-01 | Tausheck | Applicant |
| US6092158(A) | 2000-07-01 | Harriman et al. | Applicant |
| US6111886(A) | 2000-08-01 | Stewart | Applicant |
| US6112016(A) | 2000-08-01 | MacWilliams et al. | Applicant |
| US6134665(A) | 2000-10-01 | Klein et al. | Applicant |
| US6141677(A) | 2000-10-01 | Hanif et al. | Applicant |
| US6141689(A) | 2000-10-01 | Yasrebi | Applicant |
| US6141765(A) | 2000-10-01 | Sherman | Applicant |
| US6144669(A) | 2000-11-01 | Williams et al. | Applicant |
| US6145054(A) | 2000-11-01 | Mehrotra et al. | Applicant |
| US6157955(A) | 2000-12-01 | Narad et al. | Applicant |
| US6160562(A) | 2000-12-01 | Chin et al. | Applicant |
| US6170051(B1) | 2001-01-01 | Dowling | Applicant |
| US6182177(B1) | 2001-01-01 | Harriman | Applicant |
| US6195676(B1) | 2001-02-01 | Spix et al. | Applicant |
| US6199133(B1) | 2001-03-01 | Schnell | Applicant |
| US6201807(B1) | 2001-03-01 | Prasanna | Applicant |
| US6212542(B1) | 2001-04-01 | Kahle et al. | Applicant |
| US6212611(B1) | 2001-04-01 | Nizar et al. | Applicant |
| US6216220(B1) | 2001-04-01 | Hwang | Applicant |
| US6223207(B1) | 2001-04-01 | Lucovsky et al. | Applicant |
| US6223238(B1) | 2001-04-01 | Meyer et al. | Applicant |
| US6223274(B1) | 2001-04-01 | Catthoor et al. | Applicant |
| US6223279(B1) | 2001-04-01 | Nishimura et al. | Applicant |
| US6247025(B1) | 2001-06-01 | Bacon | Applicant |
| US6256713(B1) | 2001-07-01 | Audityan et al. | Applicant |
| US6272520(B1) | 2001-08-01 | Sharangpani et al. | Applicant |
| US6272616(B1) | 2001-08-01 | Fernando et al. | Applicant |
| US6275505(B1) | 2001-08-01 | O'Loughlin et al. | Applicant |
| US6279113(B1) | 2001-08-01 | Vaidya | Applicant |
| US6282169(B1) | 2001-08-01 | Kiremidjian | Applicant |
| US6286083(B1) | 2001-09-01 | Chin et al. | Applicant |
| US6289011(B1) | 2001-09-01 | Seo et al. | Applicant |
| US6295600(B1) | 2001-09-01 | Parady et al. | Applicant |
| US6298370(B1) | 2001-10-01 | Tang et al. | Applicant |
| US6307789(B1) | 2001-10-01 | Wolrich et al. | Applicant |
| US6311261(B1) | 2001-10-01 | Chamdani et al. | Applicant |
| US6324624(B1) | 2001-11-01 | Wolrich et al. | Applicant |
| US6338078(B1) | 2002-01-01 | Chang et al. | Applicant |
| US6345334(B1) | 2002-02-01 | Nakagawa et al. | Applicant |
| US6347344(B1) | 2002-02-01 | Baker et al. | Applicant |
| US6356692(B1) | 2002-03-01 | Ido et al. | Applicant |
| US6360262(B1) | 2002-03-01 | Guenthner et al. | Applicant |
| US6366998(B1) | 2002-04-01 | Mohamed | Applicant |
| US6373848(B1) | 2002-04-01 | Allison et al. | Applicant |
| US6389449(B1) | 2002-05-01 | Nemirovsky et al. | Applicant |
| US6393026(B1) | 2002-05-01 | Irwin | Applicant |
| US6393483(B1) | 2002-05-01 | Latif et al. | Applicant |
| US6415338(B1) | 2002-07-01 | Habot | Applicant |
| US6424659(B1) | 2002-07-01 | Viswanadham et al. | Applicant |
| US6426940(B1) | 2002-07-01 | Seo et al. | Applicant |
| US6427196(B1) | 2002-07-01 | Adiletta et al. | Applicant |
| US6430626(B1) | 2002-08-01 | Witkowski et al. | Applicant |
| US6434145(B1) | 2002-08-01 | Opsasnick et al. | Applicant |
| US6453404(B1) | 2002-09-01 | Bereznyi et al. | Applicant |
| US6463072(B1) | 2002-10-01 | Wolrich et al. | Applicant |
| US6463480(B1) | 2002-10-01 | Kikuchi et al. | Applicant |
| US6463527(B1) | 2002-10-01 | Vishkin | Applicant |
| US6466898(B1) | 2002-10-01 | Chan | Applicant |
| US6477562(B1) | 2002-11-01 | Nemirovsky et al. | Applicant |
| US6484224(B1) | 2002-11-01 | Robins et al. | Applicant |
| US6526451(B1) | 2003-02-01 | Kasper et al. | Applicant |
| US6529983(B1) | 2003-03-01 | Marshall et al. | Applicant |
| US6532509(B1) | 2003-03-01 | Wolrich et al. | Applicant |
| US6535878(B1) | 2003-03-01 | Guedalia et al. | Applicant |
| US6552826(B1) | 2003-04-01 | Adler et al. | Applicant |
| US6553406(B1) | 2003-04-01 | Berger et al. | Applicant |
| US6560667(B1) | 2003-05-01 | Wolrich et al. | Applicant |
| US6570850(B1) | 2003-05-01 | Gutierrez et al. | Applicant |
| US6577542(B1) | 2003-06-01 | Wolrich et al. | Applicant |
| US6584522(B1) | 2003-06-01 | Wolrich et al. | Applicant |
| US6587906(B1) | 2003-07-01 | Wolrich et al. | Applicant |
| US6604125(B1) | 2003-08-01 | Belkin | Applicant |
| US6606704(B1) | 2003-08-01 | Adiletta et al. | Applicant |
| US6625654(B1) | 2003-09-01 | Wolrich et al. | Applicant |
| US6629236(B1) | 2003-09-01 | Aipperspach et al. | Applicant |
| US6631422(B1) | 2003-10-01 | Althaus et al. | Applicant |
| US6631430(B1) | 2003-10-01 | Wolrich et al. | Applicant |
| US6631462(B1) | 2003-10-01 | Wolrich et al. | Applicant |
| US6661794(B1) | 2003-12-01 | Wolrich et al. | Applicant |
| US6667920(B1) | 2003-12-01 | Wolrich et al. | Applicant |
| US6668317(B1) | 2003-12-01 | Bernstein et al. | Applicant |
| US6671827(B1) | 2003-12-01 | Guilford et al. | Applicant |
| US6675190(B1) | 2004-01-01 | Schabernack et al. | Applicant |
| US6678746(B1) | 2004-01-01 | Russell et al. | Applicant |
| US6681300(B1) | 2004-01-01 | Wolrich et al. | Applicant |
| US6694380(B1) | 2004-02-01 | Wolrich et al. | Applicant |
| US6792488(B1) | 2004-09-01 | Wolrich et al. | Applicant |
| US6826615(B1) | 2004-11-01 | Barrall et al. | Examiner |
| US6876561(B1) | 2005-04-01 | Wolrich et al. | Applicant |
| US6895457(B1) | 2005-05-01 | Wolrich et al. | Applicant |
| US6925637(B1) | 2005-08-01 | Thomas et al. | Applicant |
| US6952824(B1) | 2005-10-01 | Hooper et al. | Applicant |
| US6976095(B1) | 2005-12-01 | Wolrich et al. | Applicant |
| US6983350(B1) | 2006-01-01 | Adiletta et al. | Applicant |
| US2004/0039895(A1) | 2004-02-01 | Wolrich et al. | Applicant |
| US2004/0054880(A1) | 2004-03-01 | Bernstein et al. | Applicant |
| US2004/0071152(A1) | 2004-04-01 | Wolrich et al. | Applicant |
| US2004/0073728(A1) | 2004-04-01 | Wolrich et al. | Applicant |
| US2004/0073778(A1) | 2004-04-01 | Adiletta et al. | Applicant |
| US2004/0098496(A1) | 2004-05-01 | Wolrich et al. | Applicant |
| US2004/0109369(A1) | 2004-06-01 | Wolrich et al. | Applicant |
| US2004/0148382(A1) | 2004-07-01 | Narad et al. | Examiner |
| EP379709 | 1990-08-01 | Applicant | |
| EP464715 | 1992-01-01 | Applicant | |
| EP633678 | 1995-01-01 | Applicant | |
| EP745933 | 1996-12-01 | Applicant | |
| EP809180 | 1997-11-01 | Applicant | |
| EP959602(A1) | 1999-11-01 | Applicant | |
| JP59111533 | 1984-06-01 | Applicant | |
| WO94/15287 | 1994-07-01 | Applicant | |
| WO97/38372 | 1997-10-01 | Applicant | |
| WO98/20647 | 1998-05-01 | Applicant | |
| WO1/16718 | 2001-03-01 | Applicant | |
| WO1/16769 | 2001-03-01 | Applicant | |
| WO1/16770 | 2001-03-01 | Applicant | |
| WO1/16782 | 2001-03-01 | Applicant | |
| WO1/17179(A1) | 2001-03-01 | Applicant | |
| WO1/48596 | 2001-07-01 | Applicant | |
| WO1/48606 | 2001-07-01 | Applicant | |
| WO1/48619 | 2001-07-01 | Applicant | |
| WO1/50247 | 2001-07-01 | Applicant | |
| WO1/50679 | 2001-07-01 | Applicant | |
| WO3/030461 | 2003-04-01 | Applicant |
Non-Patent Literature (26)
- “10-/100-Mbps Ethernet Media Access Controller (MAC) Core”; NEC Electronics Inc., pp. 1-5, (Dec. 1998).Applicant
- Beckerle, M.J., “Overview of the START (*T) multithreaded computer” Compcon Spring '93, Digest of Papers, Feb. 22-26, 1993, San Francisco, California, pp. 148-156 (1993), (abstract only).Applicant
- Byrd et al., “Multithreaded Processor Architectures,” IEEE Spectrum, 32(8): 38-46, (Aug. 1995).Applicant
- Chandranmenon, G.P. et al., “Trading Packet Headers for Packet Processing,” IEEE/ACM Transactions on Networking 4(2): 141-152 (Apr. 1996).Applicant
- Dictionary of Computer Words: An A to Z Guide to Today's Computers, Revised Editors, Houghton Mifflin Company: Boston, Massachusetts, pp. 220, (1995).Applicant
- Digital Semiconductor 21140A PCI Fast Ethernet LAN Controller, Hardware Reference Manual, Digital Equipment Corporation, pp. i-x, 1-1 through 1-5, 2-1 throught 2-12, 3-1 through 3-38, 4-31 through 5-2, 6-1 through 6-24 (Mar. 1998).Applicant
- Doyle et al. (Eds.), Microsoft Press Computer Dictionary, 2nd ed., Microsoft Press: Redmond: Washington, USA, pp. 326, (1994).Applicant
- English language abstract of Japanese Patent Application JP59111533, published Jun. 27, 1984, entitled: “Digital Data Arithmetic Circuit”.Applicant
- Fillo et al., “The M-Machine Multicomputer,” IEEE Proceedings of MICRO-28, pp. 146-156, (1995).Applicant
- Frazier, H., “Gigabit Ethernet: From 100 to 1,000 Mbps”, IEEE Internet Computing, pp. 24-31, (Jan./Feb. 1999).Applicant
- Frazier, H., “The 802.3z Gigabit Ethernet Standard”, IEEE Network, pp. 6-7, (May/Jun. 1998).Applicant
- Gomez et al., “Efficient Multithreaded User-Space Transport for Network Computing: Design and Test of the TRAP Protocol,” Journal of Parallel and Distributed Computing, 40(1):103-117, (1997).Applicant
- Haug et al., “Reconfiguration hardware as shared resource for parallel threads,” IEEE Symposium on FPGAs for Custom Computing Machines, 2 pages, (1998).Applicant
- Hauser et al., “Garp: a MIPS processor with a reconfigurable coprocessor,” Proceedings of the 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 12-21, (1997).Applicant
- Hyde, R.L., “Overview of Memory Management,” Byte, 13(4):219-225, (1998).Applicant
- Ippoliti et al., “Parallel Media Access Controller for Packet Communications at Gb/S Rates”, ICC/Supercom'90, Atlanta, Georgia, Apr. 15, 1990, IEEE , pp. 991-996 (1990).Applicant
- Jenks, G. and J.L. Gaudiot, “Nomatic Threads: A migrating multithread approach to remote memory accesses in multiprocessors”, Proceedings of the 1996 Conference on Parallel Architecture and Compilation Techniques, Oct. 20-23, 1996, Boston, Massachusetts, (abstract only).Applicant
- Litch, T. and J. Slaton, “StrongARMing Portable Communications,” IEEE Micro, pp. 48-55 (Mar./Apr. 1998).Applicant
- News.Com, Aug. 26, 1999. “Enterprise Hardware, Intel Expected to Unveil New Networking Chip,” http://new.com.com/Intel+expected+to+unveil+new+networking+chip/2100-1001 3-230315.html (accessed on Aug. 23, 2005), pp. 1-5.Applicant
- Schmidt et al., “The Performance of Alternative Threading Architectures for Parallel Communication Subsytems,” http://www/cs.wustl.edu/˜schmidt/PDF/JPDC-96.pdf#search =The%20Performance%20of%20Alternative%20Threading%20Architectures%20for%20Parallel%20Communication%20Subsytems' Nov. 13, 1998., pp. 1-19.Applicant
- Thistle et al., “A Processor Architecture for Horizon,” Proceedings Supercomputing '88, IEEE Computer Society, Nov. 14-18, 1988, Orlando, Florida, pp. 35-41 (1988).Applicant
- Tremblay et al., “A Three Dimensional Register File for Superscalar Processors,” IEEE Proceedings of the 28th Annual Hawaii International Conference on System Sciences, pp. 191-201 (1995).Applicant
- Trimberger et al, “A time-multiplexed FPGA,” Proceedings of the 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 22-28, (1998).Applicant
- Turner et al., “Design of a High Performance Active Router,” Washington University in Saint Louis, Applied Research Lab, Online Internet Document, Mar. 18, 1999 (20 pages).Applicant
- Vibhatavanijt et al., “Simultaneous Multithreading-Based Routers,” Proceedings of the 2000 International Conference of Parallel Processing, Toronto, Ontario, Canada, Aug. 21-24, 2000, pp. 362-369.Applicant
- Wazlowski et al., “PRISM-II computer and architecture,” IEEE Workshop on FPGAs for Custom Computing Machines, pp. 9-16, (1993).Applicant