US 7,433,307 B2Grant
Flow control in a network environment
Issue Date:2008-10-07
•52 Claims
•6 Drawing Sheets
Abstract
Providing flow control includes receiving at a router an indication of the ability of each one of multiple ports not directly connected to the router to receive data from the router and controlling transmission of data from the router to the multiple ports based at least on the indication.
Metadata
Assignee
- Intel Corporation
Inventors
- Donald F. Hooper
- Myles J. Wilde
- Matthew J. Adiletta
- Gilbert Wolrich
Application Information
Application Number:US 10/290,040
Filing Date:2002-11-05
Priority Date:2002-11-05
Art Unit:2619
Classifications
IPC:
G01R31/08
Patent Drawings (6 sheets)
Description
Background
[0001] Networking products such as routers use high-speed components for packet movement, i.e., collecting packet data from incoming network device ports and queuing the packet data for transmission to appropriate forwarding device ports. The networking products may also use high-speed special controllers for processing the packets and making forwarding decisions.
Description of Drawings
[0002] FIG. 1 is a block diagram of a network configuration.
[0003] FIG. 2 is a flowchart illustrating a process of flow control.
[0004] FIG. 3 is a block diagram of a dual chip router.
[0005] FIG. 4 is a block diagram of a dual chip router including shared memory.
[0006] FIG. 5 is a block diagram of an alternate network configuration.
Description
[0007] Referring to FIG. 1 , an example network configuration 100 includes a router device 102 (“router 102”) that transmits network packets to multiple ports 104(1)-104(N) via a physical port 106 and a multiplexer device 108 (“multiplexer 108”). (N can represent any positive whole number; N is typically on the order of thousands). The ports 104(1)-104(N) in this example are considered “virtual ports” because they are not directly connected to the router 102, e.g., they are physically separated by another mechanism such as the multiplexer 108. The ports 104(1)-104(N) can buffer the packets for transmission through a network 110 to their respective destinations, e.g., customer premises equipment.
[0008] Each of the ports 104(1)-104(N) has a maximum bit rate at which it can accept and buffer packets. The router 102 can be configured to know the maximum bit rate of the ports 104(1)-104(N), but the router 102 may not know if any of a port's bandwidth is being used for purposes other than receiving packets from the router 102. The ports 104(1)-104(N) can be bi-directional and use bandwidth for receiving and for transmitting packets.
[0009] If the router 102 transmits packets to one of the ports 104(1)-104(N) beyond the port's maximum bit rate, then the port's buffer can overflow. Overflow can result in decreased network performance, lost packets, delayed transmission of packets, and/or other similar effects. Furthermore, as the ports 104(1)-104(N) buffer data, the available bit rates of the ports 104(1)-104(N) (the actual, real time bit rates acceptable to the ports 104(1)-104(N) without causing overflow) becomes less than their maximum bit rates. The available bit rates for each of the ports 104(1)-104(N) may unpredictably change with network conditions such as with data sent by devices other than the router 102 and buffered by the ports 104(1)-104(N) and with other bit patterns associated with the multiplexer 108.
[0010] The multiplexer 108 can provide the router 102 with information about each port's available bit rate, e.g., by assembling and sending a ready vector 112 on the physical port 106 to the router 102. The router 102 can store the ready vector 112 and read the ready vector 112 before sending data to one of the ports 104(1)-104(N). In this way, the router 102 can know to which of the ports 104(1)-104(N), if any, the router 102 may transmit packets to without causing overflow. The ready vector 112 can also inform the router 102 as to the bit rate the router 102 may use to transmit packets to different ones of the ports 104(1)-104(N).
[0011] The ready vector 112 may be a go/no-go vector including multiple bits, where each bit is associated with one of the ports 104(1)-104(N) and indicates whether that port can accept data or not. Either a “one” or a “zero” can indicate that a port has room for more data while the opposite state can indicate that the port is fully buffered and cannot accept more data without overflowing.
[0012] Alternatively, the ready vector 112 may be a rate control vector including multiple bits, where two bits are associated with each of the ports 104(1)-104(N). The two bits can indicate four encodings: zero/zero, zero/one, one/zero, and one/one. These encodings can indicate that the port associated with those bits can accept data at a faster bit rate than the current bit rate (a speed-up encoding), can accept data at the current bit rate (a constant encoding), can accept data at a slower bit rate than the current bit rate (a slow-down encoding), and cannot accept any data at all (a no-transmission encoding). The speed-up encoding, the constant encoding, the slow-down encoding, and the no-transmission encoding can each be associated with any of the four bit position encodings. For simplicity in programming, the encoding is typically the same for each of the ports 104(1)-104(N) represented in the ready vector 112, e.g., the code zero/zero always indicates speed-up.
[0013] Whether the multiplexer 108 sends the router 102 a go/no-go vector or a rate control vector, the ready vector 112 can indicate the status of multiple ports in one ready vector. For example, a 128-byte ready vector can carry up to 512 port indications using a rate control vector or up to 1024 port indications using a go/no-go vector. In this way, the amount of bandwidth used on the physical port 106 for flow control can be less than that used for sending individual flow-control messages or packets for each of the ports 104(1)-104(N).
[0014] Furthermore, the multiplexer 108 may transmit the ready vector 112 in one or more packets, the packets forming a segment. By using a packet-based ready vector, the multiplexer 108 can transmit the status for a large number of ports in one data transmission. For example, the ready vector may include segments 114a, 114b, 114c, etc., each segment including (in this example) sixteen bits of information that may be transmitted as one or more packets or frames. The multiplexer 108 may assemble the ready vector 112 based on information (typically header information) included with the segments 114a, 114b, 114c, etc. indicating the proper order of the segments.
[0015] Referring to FIG. 2 , a flow control process 200 is an example of using the ready vector 112 to control flow of data to the ports 104(1)-104(N). Although the flow control process 200 is described with reference to the elements included in the network configuration 100 of FIG. 1 , this or a similar process may be performed in another, similar network configuration including the same or similar elements.
[0016] In the flow control process 200, the router 102 receives data at block 202 on the physical port 106 from the multiplexer 108. On the physical port 106, the router 102 can receive both ordinary data packets for routing to one of the ports 104(1)-104(N) and ready vectors. Thus, an encapsulation at the front of the data includes a bit that specifies whether the data received by the router 102 includes ordinary packet data or a ready vector by using a “one” for one type of data and a “zero” for the other. The data received by the router 102 could otherwise be identified, e.g., by another encapsulation or header technique, by sending different types of data on different communication links between the router 102 and the multiplexer 108, or by another similar technique.
[0017] The router 102 determines at block 204 what type of data it received from the multiplexer 108, e.g., by reading the encapsulation bit. If the data includes a ready vector, then the router 102 handles the data as explained further below.
[0018] If the data includes packet data, then the router 102 selects at block 206 one of the ports 104(1)-104(N) for data transmission. The router 102 chooses one of the ports 104(1)-104(N) based on any routing technique. For example, the router 102 may look up a next-hop destination of the packet in a router look-up table included in or accessible to the router 102 and select one of the ports 104(1)-104(N) that services that destination. In this example, assume that the router 102 selects the first port, port 104(1) (“selected port 104”).
[0019] The router 102 also reads at block 208 the ready vector 112, or part of the ready vector 112, from a previous test of received data. The router 102 uses the ready vector 112 to determine whether and/or how to transmit the packet to the selected port 104. (That is, the router 102 previously received the ready vector 112 and stored it locally or in an accessible storage mechanism, as described further below.) The router 102 may read the ready vector 112 a certain number of bits at a time. In this example, the router 102 can read thirty-two bits of the ready vector 112 at a time, which corresponds to reading information for thirty-two ports (for a go/no-go ready vector) or for sixteen ports (for a rate control ready vector) at a time.
[0020] One way that the router 102 may access the part of the ready vector 112 that includes information on the selected port 104 includes reading thirty-two bits of the ready vector 112 at a base storage address of the ready vector 112 plus the port number of the selected port 104 shifted by five. In this way, the router can obtain a ready vector for thirty-two ports, including the selected port 104.
[0021] The router 102 may not read the ready vector 112 after every received packet but rather at a certain rate. The rate at which the router 102 reads the ready vector 112 may depend on a response requirement in transmitting the packets to the ports 104(1)-104(N).
[0022] For example, if transmission of data from the router 102 to the multiplexer 108 occurs every fifty cycles, it takes the router 102 sixteen hundred cycles to transmit data to thirty-two ports. If a cycle time equals five nanoseconds, then such transmission can incur a latency of eight microseconds (us). Accounting for reading and, if necessary, assembling the ready vector 112 and for gating data for transmission to the multiplexer 108, this latency could increase from 8 us to 10 us. Adding network latency to this 10 us provides the total bit response latency. Multiplying the total bit response latency by the port rate results in the buffering needed at the ports 104(1)-104(N). This computation may be run in reverse order: given a fixed buffering at the ports 104(1)-104(N), the router 102 can calculate the required ready bit response latency, subtract the network latency, and calculate the number of port ready bits needed to read in one cycle.
[0023] For simplicity in this example, assume that the router 102 reads the ready vector 112 after receiving each packet received from the multiplexer 108.
[0024] From the ready vector 112 (or the part of the ready vector 112 read that includes information on the selected port 104), the router 102 tests at block 210 the ready vector 112 to determine the readiness of the selected port 104 to receive data from the router 102. If the ready vector 112 is a go/no-go vector, then the router 102 performs a go/no-go process 212, while if the ready vector 112 is a rate control vector, then the router 102 performs a rate control process 214.
[0025] In the go/no-go process 212, the router 102 determines if the router 102 may transmit data to the selected port 104 by checking the bit included in the ready vector 112 that corresponds to the selected port 104. The router 102 determines at block 216 if the selected port's ready bit is on or off. Typically, a “one” indicates that a port is on and can accept data while a “zero” indicates that a port is off and cannot accept any more data without overflowing.
[0026] If the selected port 104 is on, then the router 102 transmits at block 218 the packet to the selected port 104. Generally, a port is “on” or “off” depending on the one or zero bit state associated with the selected port in the ready vector 112 where one state corresponds to on and the other state corresponds to off. If the selected port 104 is off, then the router 102 skips at block 220 the selected port, either selecting another one of the ports 104(1)-104(N) to transmit the packet to or waiting to transmit the packet to the selected port 104 until a later time, e.g., after a subsequent check of the ready vector 112 reveals that the selected port 104 is on.
[0027] Another way that the router 102 may determine if the ready bit for the selected port 104 is on or off includes performing a logic operation on bits of the ready vector 112. In one example, the router 102 performs a logical AND operation on the thirty-two bit ready vector 112 (where a “one” indicates that a port is on) read from storage and a thirty-two bit string of ones. Every “one” in the resulting bit string indicates that the port associated with that bit position can accept data. In this way, the router 102 can identify on and off positions for multiple ports with one operation. The operation may be more efficient than individually checking each bit included in the ready vector 112.
[0028] In the rate control process 214, the router 102 determines at block 222 from the ready vector 112 (or a portion of the ready vector 112) if the encoding for the selected port 104 indicates permissibility of transmission to the selected port 104 and, if so, what bit rate to use in the transmission. If the ready vector 112 includes a speed-up encoding, a constant encoding, or a slow-down encoding for the selected bit 104, then the selected port 104 can accept data. The router 102 transmits at block 224 the packet to the selected port 104 at the bit rate indicated by the encoding.
[0029] More specifically, the router 102 may increase the current bit rate (for speed-up encoding) or decrease the current bit rate (for slow-down encoding) by a fixed amount or by an amount determined on the fly (e.g., in real time). For example, if the encoding indicates speed-up encoding, then the router 102 can transmit data to the selected port 104 at an “x+1” rate. For every “x” transmissions to the selected port 104, the router 102 can perform another transmission to the selected port 104. Similarly, if the encoding indicates slow-down encoding, then the router 102 can transmit data to the selected port 104 at an “x−−1” rate where for every “x” transmissions to the selected port 104, the router 102 can skip the selected port 104 for transmission one time. (In these examples, “x” represents any positive whole number.)
[0030] If the selected port 104 indicates no-transmission encoding, then the selected port 104 cannot accept any more data without possibly overflowing the port buffer, so the router 102 skips at block 226 the selected port 104. The router 102 may select another one of the ports 104(1)-104(N) or wait as described above.
[0031] If the router 102 determines at block 204 that the data it received from the multiplexer 108 includes a ready vector, then the router 102 determines 228 if it received a vector subset. A vector subset is, for example, a portion of the ready vector 112 that includes information for some but not all of the ports 104(1)-104(N). The router 102 may store vector subsets differently than a full ready vector.
[0032] If the router 102 did not receive a vector subset, then the router 102 stores 230 the received ready vector 112 at a storage location. The storage location may be internal to the router 102, e.g., include temporary or local memory such as a memory cache, a collection of data such as a database, random access memory (RAM), or other similar memory mechanism, or otherwise be accessible to the router 102, e.g., include a collection of data such as a database, a fast memory mechanism such as static RAM (SRAM), a memory cache, or other similar memory mechanisms. The router 102 may then read the ready vector 112 from this storage location as necessary.
[0033] If the router 102 did receive a vector subset, then the router 102 assembles 232 the vector subset with other vector subsets. This assembling can include storing the vector subset at a storage location so that the vector subset is stored at an address contiguous to an address including other vector subsets at the storage location that make up the ready vector 112.
[0034] Including a segment index with the ready vector 112 sent by the multiplexer 108 to the router 102 can help the router 102 assemble the vector subsets in correct contiguous order. For example, if a full ready vector includes 512 bits, each vector subset sent by the multiplexer 108 could include thirty-six bits: a four bit segment index and a thirty-two bit vector subset. The segment index can indicate the position of the vector subset in the sixteen vector subsets included in the full ready vector, from first (bit indicator 0000) to sixteenth (bit indicator 1111). Using the segment index may be particularly helpful if the router 102 receives vector subsets out of order, i.e., receives a vector subset for bits thirty-three to sixty-four before a vector subset for bits one to thirty-two.
[0035] The router 102 may include mechanisms configured to aid in the receipt and transmission of packets. One mechanism can receive, assemble, and classify packets from the multiplexer 108 while the other can transmit the packets to the multiplexer 108 after the router 102 has selected one of the ports 104(1)-104(N).
[0036] Referring to FIG. 3 , in an example router setup 300, the router 102 is set up as a dual-chip router/shaper including a receive processor 302 and a transmit processor 304. Generally, the receive processor 302 handles packet assembly and classification while the transmit processor 304 handles packet transmission and shaping.
[0037] The router 102 receives data, e.g., packets and ready vectors from the multiplexer 108 (see FIG. 1 ), at the receive processor 302. Upon receiving and identifying a ready vector, the receive processor 302 transmits the ready vector to the transmit processor 304 over an inter-chip high bandwidth bus 306 or over a dedicated ready bus 308.
[0038] The receive processor 304 and the transmit processor 304 may use an arbitration system in receiving and transmitting packets that include the ready vector to and from ports such that receiving and/or transmitting may be decided with arbitration, such as through a round robin technique, priority queuing, weighted fair queuing, or other similar type of arbitration technique. In another example, the receive processor 304 and the transmit processor 304 may receive and/or transmit packets to and from the ports based on service rates and maximum port rates. Examples of service rates include constant bit rate (CBR), real-time and non-real-time variable bit rate (rt-VBR and nrt-VBR, respectively), unspecified bit rate (UBR), and other similar types of rates.
[0039] The router 102 may include both the inter-chip high bandwidth bus 306 and the dedicated ready bus 308 or the router 102 may include only one of the buses 306, 308. The receive processor 302 may transmit ready vectors to the transmit processor 304 as individual ready vectors or as an assembled ready vector. Sending an assembled ready vector to the transmit processor 304 may enable the transmit processor 304 to more efficiently locate information for particular packet destinations, e.g., ports.
[0040] Upon receiving and identifying a packet, the receive processor 302 assembles the packet with other packets included in the same packet stream (if the packet is a packet segment) and classifies the packet. Classifying the packet can include identifying transmission requirements for the packet, such as Quality of Service (QoS) terms, necessary bandwidth, etc. The receive processor 302 transmits the packet (alone or as part of an assembled packet stream) and any associated classification information to the transmit processor 304 on the high bandwidth bus 306 or on the ready bus 308. Typically, the receive processor 302 transmits ready vectors and packets to the transmit processor 304 on the same bus.
[0041] The transmit processor 304 can receive ready vectors and packets on the high bandwidth bus 306 and/or the ready bus 308. The transmit processor 304 determines where and how to transmit the packets, e.g., as described in the flow control process 200 (see FIG. 2 ), and transmits the packets to their appropriate destinations.
[0042] Referring to FIG. 4 , another example router setup 400 illustrates how the router 102 may be set up to receive and transmit data. The router 102 in this example is set up as a dual-chip router/shaper with shared SRAM including a receive processor 402, a transmit processor 404, and a dual-port SRAM 406. The receive processor 402 and the transmit processor 404 generally function as like-named processors described above with reference to the example router setup 300 (see FIG. 3 ).
[0043] The receive processor 402 receives and identifies ready vectors and packets and transmits them to the transmit processor 404 or to the dual-port SRAM 406. The receive processor 402 transmits packets (and any associated classification information) to the transmit processor 404 on an inter-chip bus 408.
[0044] The receive processor 402 transmits ready vectors to the dual-port SRAM 406 either as assembled vector arrays or as individual ready vectors (vector subsets). If the receive processor 402 transmits individual ready vectors, the receive processor 402 may transmit the individual ready vectors for storage at particular storage locations in the dual-port SRAM 406 so that the dual-port SRAM 406 consecutively stores ready vectors, e.g., the ready vector for bits one to thirty-two at location X 410, the ready vector for bits thirty-three to sixty-four at location X plus thirty-two bits 412, the ready vector for bits sixty-five to ninety-six at location X plus sixty-four bits 414, etc. Such consecutive storage can help the transmit processor 404 more efficiently locate information for particular packet destinations.
[0045] The dual-port SRAM 406 stores the ready vectors, and the transmit processor 404 reads the ready vectors from the dual-port SRAM 406. The transmit processor 404 can use data from the ready vectors in determining where and how to transmit packets.
[0046] Referring to FIG. 5 , another example network configuration 500 includes a router device 502 (“router 502”) that can transmit packets to multiple ports 504(1)-504(M) via a multiplexer device 506 (“multiplexer 506”) and a physical port 508 and/or a sideband (out-of-band) bus 510 (“ready bus 510”). (M can represent any positive whole number; M is typically on the order of thousands). The ready bus 510 typically has less bandwidth than the physical port 508 and is used primarily or exclusively for transmission of control messages between the router 502 and devices such as the multiplexer 506. The ports 504(1)-504(N) can buffer the packets for transmission through a network 512 to their respective destinations, e.g., customer premises equipment. The router 502, the ports 504(1)-504(N), the multiplexer 506, the physical port 508, and the network 512 can be implemented as described above with reference to like-named elements included in FIG. 1 and elements described with reference to FIG. 5 may be similarly implemented for like-named elements in FIG. 1 . The ready bus 510 may serve as the ready bus 308 of FIG. 3 .
[0047] In the network configuration 500, the multiplexer 506 can transmit a ready vector 514 on the ready bus 510. The ready vector 514 can be implemented as described for the ready vector 112 of FIG. 1 . The multiplexer 506 may also transmit ready vectors to the router 502 using the physical port 508. For simplicity in this example, assume that the multiplexer 506 transmits all ready vectors on the ready bus 510.
[0048] The router 502 periodically reads the ready bus 510, by issuing select signals (not shown) to the multiplexer 506 in response to fetching data, such as by executing a get command. In response to the select signals, the multiplexer 506 returns the ready vector 514 from a selected one of the ports 504(1)-504(M) to the router 502 over the ready bus 510. The ready vector 514 may include a full ready vector or multiple sixteen-bit ready vector subsets (although the subsets may be of any bit size).
[0049] If the multiplexer 506 transmits vector subsets, after a series of get commands and multiplexer responses, the router 502 can receive all of the ready bits for a full ready vector. For example, if M equals 256, there are 256 ports 504(1)-504(256), and sixteen get commands would return all ready bits if each get command response sends sixteen bits of data on the ready bus 510 from the multiplexer 506 to the router 502. Typically, the multiplexer 506 sends consecutive vector subsets, e.g., a vector subset for bits one to thirty-two, then for bits thirty-three to sixty-four, etc., although vector subsets may be transmitted and/or received out of sequence.
[0050] Furthermore, the reading sequence on the ready bus 510 typically repeats. After the router 502 issues get commands for the full ready vector, the router 502 typically issues a get command starting over with bits for the first port or ports 504(1)-504(M), e.g., after issuing a get command for bits 251-256 of a 256 bit ready vector, the next get command would be for bits one to sixteen.
[0051] After receiving and assembling the ready vector 514, the router 502 can write the ready vector 514 to SRAM 516. The SRAM 516 may serve as the dual-port SRAM 406 of FIG. 4 .
[0052] The elements described with reference to FIGS. 1-5 can be implemented in a variety of ways.
[0053] The routers 102 and 502 can each include a device capable of directing information to and/or from the physical ports 106 and 508, respectively. Examples of the routers 102 and 502 include devices capable of forwarding network traffic and/or making decisions on where to send network traffic on its way to its destination such as router devices, traffic shapers, combination router and traffic shapers, and other similar devices.
[0054] The ports 104(1)-104(N) and 504(1)-504(M) can each include any mechanism capable of accepting and buffering data for transmission to another mechanism or device. Examples of the ports 104(1)-104(N) and 504(1)-504(M) include sockets, logical channels, channel endpoints, and other similar mechanisms.
[0055] The networks 110 and 512 can each include any kind and any combination of networks such as an Internet, a local area network (LAN), a wide area network (WAN), a private network, a public network, or other similar network. The networks 110 and 512 may each include a LAN set up as an Ethernet. Examples of an Ethernet include a 10BaseT Ethernet, a Fast Ethernet, a Gigabit Ethernet, a ten Gigabit Ethernet, and other similar faster and slower Ethernets. A 10BaseT Ethernet generally refers to an Ethernet setup that transmits information at ten Megabits per second (Mbps). A Fast Ethernet generally refers to an Ethernet setup using a 100BaseT Ethernet, also called the Fast Ethernet standard (Institute of Electrical and Electronics Engineers (IEEE) standard 802.3u, adopted 1995), that transmits information at one hundred Mbps. A Gigabit Ethernet generally refers to an Ethernet setup that transmits information at 1000 Mbps using IEEE standard 802.3z (adopted 1998). A ten Gigabit Ethernet generally refers to an Ethernet setup that transmits information ten times as fast as a Gigabit Ethernet using IEEE standard 802.3ae (first draft adopted 2000).
[0056] The multiplexers 108 and 506 can each include any device capable of combining multiple transmissions into a single transmission and/or vice versa. The multiplexers 108 and 506 are shown as digital subscriber links access multiplexers (DSLAM), but other similar devices (with or without DSL capabilities) may be used.
[0057] The dual-port SRAM 406 and the SRAM 516 can each include any memory mechanism capable of storing data, usually at a relatively fast access rate, without needing to be refreshed.
[0058] Information transmitted between elements may be transmitted as blocks of data generally referred to as packets. The unit of packet data could include an entire network packet (e.g., an Ethernet packet) or a portion of such a packet. The packets may have a variable or a fixed size. Packets with a fixed size are called cells. Each sent packet may be part of a packet stream, where each of the packets, called a segment, included in the packet stream fits together to form a contiguous stream of data.
[0059] Data can be communicated between elements on communication links. The communication links can include any kind and any combination of communication links such as buses, physical ports, modem links, Ethernet links, cables, point-to-point links, infrared connections, fiber optic links, wireless links, cellular links, Bluetooth, satellite links, and other similar links. Additionally, each of the communication links may include one or more individual communication links. For bus communication links, the buses can have any width, e.g., sixteen bits, thirty-two bits, sixty-four bits, etc, and may run at any speed, e.g., thirty-three Mega Hertz (MHz), 100 MHz, etc. A bus may have a sideband feature in which the bus includes parallel channels that can each simultaneously carry data and/or address information.
[0060] Furthermore, the network configurations 100 and 500 are simplified for ease of explanation. The network configurations 100 and 500 may each include more or fewer additional elements such as networks, communication links, proxy servers, hubs, bridges, switches, routers, processors, storage locations, firewalls or other security mechanisms, Internet Service Providers (ISPs), and other elements.
[0061] The techniques described here are not limited to any particular hardware or software configuration; they may find applicability in any computing or processing environment. The techniques may be implemented in hardware, software, or a combination of the two. The techniques may be implemented in programs executing on programmable machines such as mobile or stationary computers, personal digital assistants, and similar devices that each include a processor, a storage medium readable by the processor (including volatile and non-volatile memory and/or storage elements), at least one input device, and one or more output devices. Program code is applied to data entered using the input device to perform the functions described and to generate output information. The output information is applied to one or more output devices.
[0062] Each program may be implemented in a high level procedural or object oriented programming language to communicate with a machine system. However, the programs can be implemented in assembly or machine language, if desired. In any case, the language may be a compiled or interpreted language.
[0063] Each such program may be stored on a storage medium or device, e.g., compact disc read only memory (CD-ROM), hard disk, magnetic diskette, or similar medium or device, that is readable by a general or special purpose programmable machine for configuring and operating the machine when the storage medium or device is read by the computer to perform the procedures described in this document. The system may also be considered to be implemented as a machine-readable storage medium, configured with a program, where the storage medium so configured causes a machine to operate in a specific and predefined manner.
[0064] Furthermore, elements of the processes presented may be executed in a different order than that shown to produce an acceptable result.
[0065] Other embodiments are within the scope of the following claims.
Claims
What is claimed is:
1. A method for providing flow control comprising:
receiving multiple vectors at a router, each of the multiple vectors comprising an indication of an availability of a collection of multiple ports not directly connected to the router to receive data from the router;
assembling the multiple vectors into a composite; and
controlling transmission of data from the router to the multiple ports based at least on the composite.
2. The method of claim 1 further comprising transmitting data from the multiple ports to a network.
3. The method of claim 1 further comprising storing the indication at a storage location.
4. The method of claim 1 further comprising transmitting data from the router to one of the multiple ports if the indication indicates that the one of the multiple ports can accept data.
5. The method of claim 1 further comprising changing a rate of data transmission to the multiple ports based on at least the indication.
6. The method of claim 1 in which the indication includes bits indicating whether or not the multiple ports include can accept data.
7. The method of claim 1 further comprising
receiving at the router an additional indication of the availability of additional ports to accept data from the router, and
controlling transmission of data from the router to the additional ports based at least on the additional indication.
8. The method of claim 7 further comprising storing the additional indication at a storage location address contiguous to another storage location address that stores the indication.
9. The method of claim 1 further comprising receiving the indication at the router on a physical port from a device having access to the multiple ports.
10. The method of claim 1 further comprising receiving the indication at the router on a sideband bus from a device having access to the multiple ports.
11. The method of claim 1 further comprising receiving the indication at the router from a Digital Subscriber Line Access Multiplexer having access to the multiple ports.
12. The method of claim 1 in which the data includes a packet.
13. The method of claim 1 in which the multiple ports comprise virtual ports.
14. An article for providing flow control, the article including a machine readable medium having machine executable instructions, the instructions when executed by a machine causing the machine to perform operations comprising:
receiving at a router a first indication of an availability of each one of a first collection of multiple ports that are not directly connected to the router to receive data from the router;
receiving at the router a second indication of an availability of each one of a second collection of multiple ports that are not directly connected to the router to receive data from the router;
storing the first indication and the second indication at contiguous storage location addresses; and
controlling transmission of data from the router to the first collection of multiple ports based at least on the first indication and to the second collection of multiple ports based at least on the second indication.
15. The article of claim 14 further comprising transmitting data from the multiple ports to a network.
16. The article of claim 14 further comprising storing the indication at a storage location.
17. The article of claim 14 further comprising transmitting data from the router to one of the multiple ports if the indication indicates that the one of the multiple ports can accept data.
18. The article of claim 14 further comprising changing a rate of data transmission to the multiple ports based on at least the indication.
19. The article of claim 14 in which the indication includes bits indicating whether or not the multiple ports include can accept data.
20. The article of claim 14 further comprising receiving the indication at the router on a physical port from a device having access to the multiple ports.
21. The article of claim 14 further comprising receiving the indication at the router on a sideband bus from a device having access to the multiple ports.
22. The article of claim 14 further comprising receiving the indication at the router from a Digital Subscriber Line Access Multiplexer having access to the multiple ports.
23. The article of claim 14 further comprising
receiving multiple vectors at the router, each of the multiple vectors indicating the availability of a subset of the multiple ports to receive data from the router;
assembling the multiple vectors into one vector; and
using the one vector to control transmission of data from the router to the multiple ports.
24. The article of claim 14 in which the data includes a packet.
25. The article of claim 14 in which the multiple ports comprise virtual ports.
26. A system for providing flow control comprising:
a device configured to provide multiple ports, each configured to transmit data to a network; and
a router not directly connected to the multiple ports and configured to receive separate indications of an availability of each of the multiple ports to accept data from the router and configured to control transmission of information from the router to the multiple ports based at least on the indication, wherein the router includes a memory mechanism that is accessible by the router and configured to store the indication.
27. The system of claim 26 in which the device includes a Digital Subscriber Line Access Multiplexer.
28. The system of claim 26 in which the memory mechanism includes a fast memory mechanism accessible by the router.
29. The system of claim 26 in which the multiple ports comprise virtual ports.
30. An apparatus for providing flow control comprising:
a receiver processor configured to receive separate indications of an availability of each one of multiple ports not directly connected to the apparatus to accept data from the apparatus;
a transmitter processor configured to control transmission of data from the apparatus to the multiple ports based at least on the indication;
a memory mechanism accessible to the receiver processor and to the transmitter processor and configured to store the indication; and
a bus capable of carrying information between the receiver processor and the transmitter processor.
31. The apparatus of claim 30 in which the transmitter processor is also configured to retrieve information about the indication from the memory mechanism and to use the information in controlling transmission of data from the apparatus to multiple ports.
32. The apparatus of claim 30 in which the memory mechanism includes static random access memory.
33. The apparatus of claim 30 in which the receiver processor is also configured to receive multiple indicators, each of the multiple indicators indicating the availability of a subset of the multiple ports to accept data from the apparatus, and to assemble the multiple indicators to form the indication.
34. The apparatus of claim 30 in which the bus includes a high bandwidth bus internal to the apparatus.
35. The apparatus of claim 30 in which the receiver processor is also configured to receive a packet and the transmitter processor is also configured to determine which one of the multiple ports to transmit the packet to based at least on the indication.
36. The apparatus of claim 30 further comprising a microengine configured to execute program threads, the threads implementing the receiver processor and the transmitter processor.
37. The apparatus of claim 30 in which the multiple ports comprise virtual ports.
38. An apparatus comprising:
a receiver processor configured to receive multiple indicators and to assemble the multiple indicators to form an indication of an availability of each one of multiple ports to accept data from the apparatus, wherein
each of the multiple indicators indicates the availability of a subset of the multiple ports to accept data from the apparatus, and
each of the multiple ports is not directly connected to the apparatus.
39. The apparatus of claim 38 in which the multiple ports comprise virtual ports.
40. An apparatus comprising:
a transmitter processor configured to
control transmission of data from the apparatus to each one of multiple ports based at least on separate indications of an availability of each one of the multiple ports to accept data from the apparatus,
retrieve information about the indication from a memory mechanism, and
use the information in controlling transmission of data from the apparatus to the multiple ports,
wherein the multiple ports are not directly connected to the apparatus.
41. The apparatus of claim 40 in which the multiple ports comprise virtual ports.
42. A method for providing flow control comprising:
receiving, at a router on a sideband bus from a device having access to the multiple ports, separate indications of an availability of each one of multiple ports not directly connected to the router to receive data from the router; and
controlling transmission of data from the router to the multiple ports based at least on the indication.
43. The method of claim 42 in which the multiple ports comprise virtual ports.
44. A method for providing flow control comprising:
receiving at a router a first indication of an availability of each one of a first collection of multiple ports that are not directly connected to the router to receive data from the router;
receiving at the router a second indication of an availability of each one of a second collection of multiple ports that are not directly connected to the router to receive data from the router;
storing the first indication and the second indication at contiguous storage location addresses; and
controlling transmission of data from the router to the first collection of multiple ports based at least on the first indication and to the second collection of multiple ports based at least on the second indication.
45. The method of claim 44 in which the multiple ports comprise virtual ports.
46. An article for providing flow control, the article including a machine-readable medium having machine-executable instructions, the instructions when executed by a machine causing the machine to perform operations comprising:
receiving at a router multiple vectors each indicating an availability of a different collection of multiple ports not directly connected to the router to receive data from the router;
assembling the multiple vectors into a composite; and
controlling transmission of data from the router to the multiple ports based at least on the composite.
47. The article of claim 46 in which the multiple ports comprise virtual ports.
48. An apparatus for providing flow control comprising:
a receiver processor configured to receive a data packet and separate indicators of an availability of each one of multiple ports not directly connected to the apparatus to accept data from the apparatus;
a transmitter processor configured to determine which one of the multiple ports to transmit the packet to based at least on the indication; and
a bus capable of carrying information between the receiver processor and the transmitter processor.
49. The apparatus of claim 48 in which the multiple ports comprise virtual ports.
50. An apparatus for providing flow control comprising:
a microengine configured to execute program threads, the threads implementing a receiver processor and a transmitter processor, wherein the receiver processor is configured to receive separate indications of an availability of each one of multiple ports not directly connected to the apparatus to accept data from the apparatus and the transmitter processor is configured to control transmission of data from the apparatus to the multiple ports based at least on the indication.
51. The apparatus of claim 50 in which the multiple ports comprise virtual ports.
52. An apparatus for providing flow control comprising:
a collection of bi-directional virtual ports;
a router comprising
a receive processor comprising one or more inputs to receive data packets and control message packets,
a transmit processor configured to handle packet transmission over a physical output port based at least in part on an availability of each of the bi-directional virtual ports to receive data from the router, and
a memory accessible to the receive processor and to the transmit processor and configured to store one or more indications of the availability of each of the bi-directional virtual ports; and
an access multiplexer configured to receive packets transmitted by the transmit processor over the physical output port and to convey, to the receive processor in a control message packet, one or more indications of the availability of the bi-directional virtual ports in the collection,
wherein the router is not directly connected to the collection of the bi-directional virtual ports.
Patent Citations (410)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3373408(A) | 1968-03-01 | Ling | Applicant |
| US3478322(A) | 1969-11-01 | Evans | Applicant |
| US3623001(A) | 1971-11-01 | Kleist et al. | Applicant |
| US3736566(A) | 1973-05-01 | Anderson et al. | Applicant |
| US3792441(A) | 1974-02-01 | Wymore et al. | Applicant |
| US3889243(A) | 1975-06-01 | Drimak | 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 |
| US4658351(A) | 1987-04-01 | Teng | 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 |
| US4858108(A) | 1989-08-01 | Ogawa 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 |
| US5313454(A) | 1994-05-01 | Bustini et al. | Applicant |
| US5347648(A) | 1994-09-01 | Stamm et al. | Applicant |
| US5367678(A) | 1994-11-01 | Lee et al. | Applicant |
| US5379295(A) | 1995-01-01 | Yonehara | Applicant |
| US5379432(A) | 1995-01-01 | Orton 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 et al. | Applicant |
| US5404482(A) | 1995-04-01 | Stamm 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 |
| US5452452(A) | 1995-09-01 | Gaetner et al. | Applicant |
| US5459842(A) | 1995-10-01 | Begun et al. | Applicant |
| US5459843(A) | 1995-10-01 | Davis et al. | Applicant |
| US5463625(A) | 1995-10-01 | Yasrebi | Applicant |
| US5467452(A) | 1995-11-01 | Blum et al. | Applicant |
| US5475856(A) | 1995-12-01 | Kogge | 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 |
| US5539737(A) | 1996-07-01 | Lo 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 |
| US5617327(A) | 1997-04-01 | Duncan | Applicant |
| US5623489(A) | 1997-04-01 | Cotton et al. | Applicant |
| US5627829(A) | 1997-05-01 | Gleeson et al. | Applicant |
| US5630074(A) | 1997-05-01 | Beltran | Applicant |
| US5630130(A) | 1997-05-01 | Perotto et al. | Applicant |
| US5633865(A) | 1997-05-01 | Short | Applicant |
| US5644623(A) | 1997-07-01 | Gulledge | Applicant |
| US5649110(A) | 1997-07-01 | Ben-Nun et al. | 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 |
| US5692126(A) | 1997-11-01 | Templeton et al. | Examiner |
| 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 |
| US5724574(A) | 1998-03-01 | Stratigos et al. | 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. | Applicant |
| 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 et al. | 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 |
| US5805816(A) | 1998-09-01 | Picazo, Jr. 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 |
| US5828881(A) | 1998-10-01 | Wang | Applicant |
| US5828901(A) | 1998-10-01 | O'Toole et al. | Applicant |
| US5832215(A) | 1998-11-01 | Kato et al. | Applicant |
| US5835755(A) | 1998-11-01 | Stellwagen, Jr. | Applicant |
| US5838988(A) | 1998-11-01 | Panwar et al. | Applicant |
| US5850399(A) | 1998-12-01 | Ganmukhi et al. | Applicant |
| US5850530(A) | 1998-12-01 | Chen et al. | Applicant |
| US5854922(A) | 1998-12-01 | Gravenstein et al. | Applicant |
| US5857188(A) | 1999-01-01 | Douglas | Examiner |
| US5860138(A) | 1999-01-01 | Engebretsen 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 |
| US5898686(A) | 1999-04-01 | Virgile | 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 |
| US5909686(A) | 1999-06-01 | Muller et al. | Applicant |
| US5915123(A) | 1999-06-01 | Mirsky et al. | Applicant |
| US5918235(A) | 1999-06-01 | Kirshenbaum et al. | 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 |
| US5953336(A) | 1999-09-01 | Moore et al. | Applicant |
| US5958031(A) | 1999-09-01 | Kim | Applicant |
| US5961628(A) | 1999-10-01 | Nguyen et al. | Applicant |
| US5968169(A) | 1999-10-01 | Pickett | Applicant |
| US5970013(A) | 1999-10-01 | Fischer et al. | Applicant |
| US5974518(A) | 1999-10-01 | Nogradi | 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 |
| US6032218(A) | 2000-02-01 | Lewin et al. | Applicant |
| US6047002(A) | 2000-04-01 | Hartmann et al. | Applicant |
| US6049867(A) | 2000-04-01 | Eickemeyer 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 |
| US6085248(A) | 2000-07-01 | Sambamurthy 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 |
| US6104700(A) | 2000-08-01 | Haddock et al. | Applicant |
| US6111886(A) | 2000-08-01 | Stewart | Applicant |
| US6112016(A) | 2000-08-01 | MacWilliams et al. | Applicant |
| US6122251(A) | 2000-09-01 | Shinohara | Examiner |
| US6128669(A) | 2000-10-01 | Moriarty 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 |
| US6175927(B1) | 2001-01-01 | Cromer et al. | Examiner |
| 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 |
| US6212544(B1) | 2001-04-01 | Borkenhagen et al. | Applicant |
| US6212604(B1) | 2001-04-01 | Tremblay | 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 |
| US6223243(B1) | 2001-04-01 | Ueda 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 |
| US6269391(B1) | 2001-07-01 | Gillespie | Applicant |
| US6272109(B1) | 2001-08-01 | Pei 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 | 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 |
| US6320861(B1) | 2001-11-01 | Adam et al. | Applicant |
| US6324624(B1) | 2001-11-01 | Wolrich et al. | Applicant |
| US6335932(B2) | 2002-01-01 | Kadambi 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 |
| US6349331(B1) | 2002-02-01 | Andra et al. | Applicant |
| US6356962(B1) | 2002-03-01 | Kasper et al. | Applicant |
| US6359911(B1) | 2002-03-01 | Movshovich et al. | Applicant |
| US6360262(B1) | 2002-03-01 | Guenthner et al. | Applicant |
| US6360277(B1) | 2002-03-01 | Ruckley et al. | Applicant |
| US6366998(B1) | 2002-04-01 | Mohamed | Applicant |
| US6373848(B1) | 2002-04-01 | Allison et al. | Applicant |
| US6377998(B2) | 2002-04-01 | Noll et al. | Applicant |
| US6389031(B1) | 2002-05-01 | Chao 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 |
| US6404737(B1) | 2002-06-01 | Novik et al. | Applicant |
| US6415338(B1) | 2002-07-01 | Habot | Applicant |
| US6418488(B1) | 2002-07-01 | Chilton et al. | Applicant |
| US6424657(B1) | 2002-07-01 | Voit et al. | Applicant |
| US6424659(B2) | 2002-07-01 | Viswanadham et al. | Applicant |
| US6426940(B1) | 2002-07-01 | Seo et al. | Applicant |
| US6426943(B1) | 2002-07-01 | Spinney 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 |
| US6438132(B1) | 2002-08-01 | Vincent et al. | Applicant |
| US6438134(B1) | 2002-08-01 | Chow et al. | Applicant |
| US6448812(B1) | 2002-09-01 | Bacigalupo | Applicant |
| US6453404(B1) | 2002-09-01 | Bereznyi et al. | Applicant |
| US6457015(B1) | 2002-09-01 | Eastham | Applicant |
| US6463035(B1) | 2002-10-01 | Moore | Examiner |
| US6463072(B1) | 2002-10-01 | Wolrich et al. | Applicant |
| US6463480(B2) | 2002-10-01 | Kikuchi et al. | Applicant |
| US6463527(B1) | 2002-10-01 | Vishkin | Applicant |
| US6466898(B1) | 2002-10-01 | Chan | Applicant |
| US6477562(B2) | 2002-11-01 | Nemirovsky et al. | Applicant |
| US6484224(B1) | 2002-11-01 | Robins et al. | Applicant |
| US6501731(B1) | 2002-12-01 | Chong et al. | Applicant |
| US6507862(B1) | 2003-01-01 | Joy et al. | Applicant |
| US6522188(B1) | 2003-02-01 | Poole | Applicant |
| US6526451(B2) | 2003-02-01 | Kasper | Applicant |
| US6526452(B1) | 2003-02-01 | Petersen 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(B2) | 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(B2) | 2003-06-01 | Wolrich et al. | Applicant |
| US6584522(B1) | 2003-06-01 | Wolrich et al. | Applicant |
| US6587906(B2) | 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 |
| US6628668(B1) | 2003-09-01 | Hutzli et al. | Applicant |
| US6629147(B1) | 2003-09-01 | Grow | 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 |
| US6657963(B1) | 2003-12-01 | Paquette et al. | Examiner |
| US6658551(B1) | 2003-12-01 | Berenbaum et al. | Applicant |
| US6661774(B1) | 2003-12-01 | Lauffenburger et al. | Applicant |
| US6661794(B1) | 2003-12-01 | Wolrich et al. | Applicant |
| US6665699(B1) | 2003-12-01 | Hunter et al. | Applicant |
| US6665755(B2) | 2003-12-01 | Modelski et al. | Applicant |
| US6667920(B2) | 2003-12-01 | Wolrich et al. | Applicant |
| US6668317(B1) | 2003-12-01 | Bernstein et al. | Applicant |
| US6671827(B2) | 2003-12-01 | Guilford et al. | Applicant |
| US6675190(B1) | 2004-01-01 | Schabernack et al. | Applicant |
| US6675192(B2) | 2004-01-01 | Emer et al. | Applicant |
| US6678746(B1) | 2004-01-01 | Russell et al. | Applicant |
| US6680933(B1) | 2004-01-01 | Cheesman et al. | Applicant |
| US6681300(B2) | 2004-01-01 | Wolrich et al. | Applicant |
| US6684326(B1) | 2004-01-01 | Cromer et al. | Applicant |
| US6694380(B1) | 2004-02-01 | Wolrich et al. | Applicant |
| US6697379(B1) | 2004-02-01 | Jacquet et al. | Applicant |
| US6721325(B1) | 2004-04-01 | Duckering et al. | Applicant |
| US6724767(B1) | 2004-04-01 | Chong et al. | Applicant |
| US6728845(B2) | 2004-04-01 | Adiletta et al. | Applicant |
| US6732187(B1) | 2004-05-01 | Lougheed et al. | Examiner |
| US6754211(B1) | 2004-06-01 | Brown | Applicant |
| US6754222(B1) | 2004-06-01 | Joung et al. | Applicant |
| US6768717(B1) | 2004-07-01 | Reynolds et al. | Applicant |
| US6775284(B1) | 2004-08-01 | Calvignac et al. | Applicant |
| US6792488(B2) | 2004-09-01 | Wolrich et al. | Applicant |
| US6798744(B1) | 2004-09-01 | Loewen et al. | Examiner |
| US6826615(B2) | 2004-11-01 | Barrall et al. | Applicant |
| US6834053(B1) | 2004-12-01 | Stacey et al. | Applicant |
| US6850521(B1) | 2005-02-01 | Kadambi et al. | Applicant |
| US6856622(B1) | 2005-02-01 | Calamvokis et al. | Applicant |
| US6873618(B1) | 2005-03-01 | Weaver | Applicant |
| US6876561(B2) | 2005-04-01 | Wolrich et al. | Applicant |
| US6895457(B2) | 2005-05-01 | Wolrich et al. | Applicant |
| US6925637(B2) | 2005-08-01 | Thomas et al. | Applicant |
| US6931641(B1) | 2005-08-01 | Davis et al. | Applicant |
| US6934780(B2) | 2005-08-01 | Modelski et al. | Applicant |
| US6934951(B2) | 2005-08-01 | Wilkinson et al. | Applicant |
| US6938147(B1) | 2005-08-01 | Joy et al. | Applicant |
| US6944850(B2) | 2005-09-01 | Hooper et al. | Applicant |
| US6947425(B1) | 2005-09-01 | Hooper et al. | Applicant |
| US6952824(B1) | 2005-10-01 | Hooper et al. | Applicant |
| US6959002(B2) | 2005-10-01 | Wynne et al. | Applicant |
| US6967963(B1) | 2005-11-01 | Houh et al. | Applicant |
| US6976095(B1) | 2005-12-01 | Wolrich et al. | Applicant |
| US6981077(B2) | 2005-12-01 | Modelski et al. | Applicant |
| US6983350(B1) | 2006-01-01 | Wheeler et al. | Applicant |
| US7006495(B2) | 2006-02-01 | Hooper | Applicant |
| US7065569(B2) | 2006-06-01 | Teraslinna | Applicant |
| US7069548(B2) | 2006-06-01 | Kushlis | Applicant |
| US7096277(B2) | 2006-08-01 | Hooper | Applicant |
| US7100102(B2) | 2006-08-01 | Hooper et al. | Applicant |
| US7111296(B2) | 2006-09-01 | Wolrich et al. | Applicant |
| US7124196(B2) | 2006-10-01 | Hooper | Applicant |
| US7126952(B2) | 2006-10-01 | Hooper et al. | Applicant |
| US7149786(B1) | 2006-12-01 | Bohringer et al. | Applicant |
| US7181742(B2) | 2007-02-01 | Hooper | Applicant |
| US7191321(B2) | 2007-03-01 | Bernstein et al. | Applicant |
| US7206858(B2) | 2007-04-01 | Hooper et al. | Applicant |
| US7248584(B2) | 2007-07-01 | Hooper | Applicant |
| US7305500(B2) | 2007-12-01 | Adiletta et al. | Applicant |
| US7328289(B2) | 2008-02-01 | Wolrich et al. | Applicant |
| US7352769(B2) | 2008-04-01 | Hooper et al. | Applicant |
| US2001/0023487(A1) | 2001-09-01 | Kawamoto | Applicant |
| US2002/0027448(A1) | 2002-03-01 | Bacigalupo | Applicant |
| US2002/0041520(A1) | 2002-04-01 | Wolrich et al. | Applicant |
| US2002/0075878(A1) | 2002-06-01 | Lee et al. | Applicant |
| US2002/0118692(A1) | 2002-08-01 | Oberman et al. | Applicant |
| US2002/0150047(A1) | 2002-10-01 | Knight et al. | Applicant |
| US2002/0181194(A1) | 2002-12-01 | Ho et al. | Examiner |
| US2003/0043803(A1) | 2003-03-01 | Hooper | Applicant |
| US2003/0067934(A1) | 2003-04-01 | Hooper et al. | Applicant |
| US2003/0086434(A1) | 2003-05-01 | Kloth | Examiner |
| US2003/0105901(A1) | 2003-06-01 | Wolrich et al. | Applicant |
| US2003/0105917(A1) | 2003-06-01 | Ostler et al. | Examiner |
| US2003/0110166(A1) | 2003-06-01 | Wolrich et al. | Applicant |
| US2003/0115347(A1) | 2003-06-01 | Wolrich et al. | Applicant |
| US2003/0115426(A1) | 2003-06-01 | Rosenbluth et al. | Applicant |
| US2003/0131198(A1) | 2003-07-01 | Wolrich et al. | Applicant |
| US2003/0140196(A1) | 2003-07-01 | Wolrich et al. | Applicant |
| US2003/0145159(A1) | 2003-07-01 | Adiletta et al. | Applicant |
| US2003/0147409(A1) | 2003-08-01 | Wolrich et al. | Applicant |
| US2003/0161303(A1) | 2003-08-01 | Mehrvar et al. | Applicant |
| US2003/0161337(A1) | 2003-08-01 | Weinman | Applicant |
| US2003/0196012(A1) | 2003-10-01 | Wolrich et al. | Applicant |
| US2003/0210574(A1) | 2003-11-01 | Wolrich et al. | Applicant |
| US2003/0231635(A1) | 2003-12-01 | Kalkunte et al. | Applicant |
| US2004/0039895(A1) | 2004-02-01 | Wolrich et al. | Applicant |
| US2004/0052269(A1) | 2004-03-01 | Hooper et al. | Applicant |
| US2004/0054880(A1) | 2004-03-01 | Bernstein et al. | Applicant |
| US2004/0059828(A1) | 2004-03-01 | Hooper 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. | Applicant |
| US2004/0162933(A1) | 2004-08-01 | Adiletta et al. | Applicant |
| US2004/0252686(A1) | 2004-12-01 | Hooper et al. | Applicant |
| US2005/0033884(A1) | 2005-02-01 | Wolrich et al. | Applicant |
| US2005/0149665(A1) | 2005-07-01 | Wolrich et al. | Applicant |
| US2006/0007871(A1) | 2006-01-01 | Welin | Applicant |
| US2006/0069882(A1) | 2006-03-01 | Wheeler et al. | Applicant |
| US2006/0156303(A1) | 2006-07-01 | Hooper et al. | Applicant |
| EP379709 | 1990-08-01 | Applicant | |
| EP464715 | 1992-01-01 | Applicant | |
| EP633678 | 1995-01-01 | Applicant | |
| EP745933 | 1996-12-01 | Applicant | |
| EP773648 | 1997-05-01 | Applicant | |
| EP809180 | 1997-11-01 | Applicant | |
| EP959602 | 1999-11-01 | Applicant | |
| JP59-111533 | 1984-06-01 | Applicant | |
| WO94/15287 | 1994-07-01 | Applicant | |
| WO97/38372 | 1997-10-01 | Applicant | |
| WO98/20647 | 1998-05-01 | Applicant | |
| WO/38376 | 2000-06-01 | Applicant | |
| WO/56024 | 2000-09-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 | 2001-03-01 | Applicant | |
| WO1/31856 | 2001-05-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 (43)
- Vuppala, V., et al., “Layer-3 Switching Using Virtual Network Ports”, Computer Communications and Networks 1999. Proc. 8th International Conf., Boston, MA, USA, Oct. 11-13, 1999, pp. 642-648.Applicant
- “10-/100-Mbps Ethernet Media Access Controller (MAC) Core”, NEC, 1998, pp. 1-5.Applicant
- “Enterprise Hardware, Intel Expected to Unveil New Networking Chip,” News.Com, Aug. 26, 1999, <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
- “The ATM Forum Technical Committee Traffic Management Specification Version 4.1”, The ATM Forum (Mar. 1999).Applicant
- Agarwal et al., “April: A Processor Architecture for Multiprocessing,” Proceedings of the 17th Annual International Symposium on Computer Architecutre, IEEE, pp. 104-114, (1990).Applicant
- Beckerle, M.J., “Overview of the Start (*T) multithreaded computer” (abstract only), Publication Date: Feb. 22-26, 1993.Applicant
- Byrd et al., “Multithread Processor Architectures,” IEEE Spectrum, 32(8):38-46, New York, 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
- Chappell, et al., “Simultaneous Subordinate Microthreading (SSMT)”, IEEE, p. 186-195 (1999).Applicant
- Dictionary of Computer Words: An A to Z Guide to Today's Computers, Revised Edition, 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., Microsoft Press Computer Dictionary, 2nd ed., Microsoft Press, Redmond, Washington, USA, p. 326, (1994).Applicant
- Farrens, et al., “Strategies for Achieving Improved Processor Throughput”, ACM, p. 362-369 (1991).Applicant
- Fillo et al., “The M-Machine Multicomputer,” IEEE Proceedings of MICRO-28, pp. 146-156, (1995).Applicant
- Frazier, Howard, “Gigabit Ethernet: From 100 to 1,000 Mbps”, IEEE Internet Computing, pp. 24-31, (1999).Applicant
- Frazier, Howard, “The 802.3z Gigabit Ethernet Standard”, IEEE Network, pp. 6-7, (1998).Applicant
- Giroux, N., et al., “Queuing and Scheduling: Quality of Service in ATM Networks, Chapter 5”, Quality of Service in ATM Networks: State-of-the-Art Traffic Management, pp. 96-121 (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, Academic Press, Duluth, Minnesota, USA, 40(1):103-117, Jan. 1997.Applicant
- Govind, et al., “Performance modeling and architecture exploration of network processors”, Quantitative Evaluation of Systems, abstract only (1 page), Sep. 2005.Applicant
- Haug et al., “Reconfigurable 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., “Overview of Memory Management,” Byte, 13(4):219-225, (1988).Applicant
- Ippoliti, A., et al., “Parallel Media Access Controller for Packet Communications at Gb/s Rates”, IEEE, pp. 991-996, (1990).Applicant
- Jenks, S., et al., “Nomadic Threads: A migrating multithread approach to remote memory accesses in multiprocessors” (abstract only), Publication Date: Oct. 20-23, 1996.Applicant
- Kaiserswerth, M., “The Parallel Protocol Engine”, IEEE/ACM Transactions on Networking, 1(6):650-663, Dec. 1993.Applicant
- Khailany, B., et al., “Imagine: Media Processing with Streams,” IEEE Micro, Mar.-Apr. 2001, pp. 35-46.Applicant
- Leon-Garcia, A., Communication Networks: Fundamental Concepts and Key Architectures, McGraw-Hill Higher Education, Copyright 2000, pp. 195-198, 215-219, & 380-385.Applicant
- Lim, A., et al., “Improving Performance of Adaptive Media Access Control Protocols for High-Density Wireless Networks”, Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), pp. 316-321, Jun. 1999.Applicant
- Litch et al., “StrongARMing Portable Communications,” IEEE Micro, 18(2):48-55, Mar. 1998.Applicant
- Mollenauer, J.F., et al., “An Efficient Media Access Control Protocol for Broadband Wireless Access Systems”, IEEE Standard, IEEE 802.16 Broadband Wireless Access Working Group, 19 pages, Oct. 1999.Applicant
- Ocheltree, K.B., et al., “A comparison of fibre channel and 802 MAC services”, Proceedings of 18th Conference on Local Computer Networks, abstract only, 1 page, Sep. 1993.Applicant
- Schmidt et al., “The Performance of Alternative Threading Architectures for Parallel Communication Subsystems,” Internet Document, Online!, Nov. 13, 1998, pp. 1-19.Applicant
- Shaw, M.C., et al., UNIX Internals: A Systems Operations Handbook, Windcrest Books, pp. 30-37, 1987.Applicant
- Thistle et al., “A Processor Architecture for Horizon,” IEEE Proc. Supercomputing '88, pp. 35-41, Nov. 1988.Applicant
- Todorova, P., et al., “Quality-of-Service-Oriented Media Access Control for Advanced Mobile Multimedia Satellite Systems”, Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03), 8 pages, Jan. 2003.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, (1997).Applicant
- Turner et al., “Design of a High Performance Active Router,” Internet Document, Online!, 20 pages, Mar. 18, 1999.Applicant
- Vibhatavanij 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., “PRSIM-II computer and architecture,” IEEE Proceedings, Workshop on FPGAs for Custom Computing Machines, pp. 9-16, (1993).Applicant
- Wikipedia entry, “Media Access Control”, retrieved from http://en.wikipedia.org/wiki/Media—access—control, 2 pages, Jul. 31, 2007.Applicant
- U.S. Appl. No. 09/473,571, filed Dec. 28, 1999, Wolrich et al.Applicant
- U.S. Appl. No. 09/475,614, filed Dec. 30, 1999, Wolrich et al.Applicant