|Publication number||US6604147 B1|
|Application number||US 09/567,371|
|Publication date||Aug 5, 2003|
|Filing date||May 9, 2000|
|Priority date||May 9, 2000|
|Publication number||09567371, 567371, US 6604147 B1, US 6604147B1, US-B1-6604147, US6604147 B1, US6604147B1|
|Inventors||Thomas Y Woo|
|Original Assignee||Lucent Technologies Inc.|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (8), Referenced by (61), Classifications (12), Legal Events (4)|
|External Links: USPTO, USPTO Assignment, Espacenet|
This invention relates to data communications routers, and more particularly, to a scalable architecture for enterprise-class data communications routers.
Enterprise-class data communications networks serve a varied class of users having both local-area and wide-area networking needs. FIG. 1 depicts a typical enterprise class network 102. Enterprise-class routers are typically deployed at two positions in the network. An enterprise backbone router (EBR) 104 provides data packet routing among a plurality of local area subnetworks (intranets). The EBR functions primarily to provide efficient routing of packets travelling between the intranets.
In addition to the EBR, an enterprise edge router (EER) 100 functions primarily to concentrate data traffic arriving from one or more interconnected enterprise intranets so that this traffic may be efficiently forwarded over T1 or other wide area data communications facilities to an access provider edge router 114. The access provider edge router 114 typically routes enterprise traffic to one or more internet service providers (ISPs) for transport to other networks.
In addition to concentrating data traffic from a number of interconnected intranets, the EER 102 may provide a variety of value-added functions including but not limited to packet recognition, packet filtering, packet classification for quality of service (QoS) features, internet protocol (IP) address look-up and translation, buffer management, packet scheduling, data encryption and compression, load balancing, traffic monitoring, traffic billing and multicast support. The bundle of such functions provided in a given enterprise application will depend on the size and nature of the application. For example, an enterprise network deployed in a public school may comprise a small number of intranets with basic features and low-bandwidth concentration (often, for example, at fractional T1 rates). In sharp contrast, an enterprise network deployed by a large commercial enterprise such as a financial institution may comprise a large intranet base with more sophisticated features and with high-bandwidth concentration (often at T3 and OC3 rates). Also, intranet architectures and data protocols will vary widely with enterprise class. For example, banking networks may support “legacy” protocols such as IPX and SNA, while “internet company” networks may be based entirely on IP protocols.
FIG. 2 illustrates a typical architecture used currently for edge routers. The edge router 200 of FIG. 2 includes a central processing unit (CPU) 206, a memory 208, and one or more line interface cards 212, each interconnected by a bus 216. Each line interface card 212 further includes a local memory 213.
In the edge router 200 of FIG. 2, an arriving packet is received at a line interface card 212 and stored in an associated local memory 213. The line interface card 212 then signals the CPU 206 that a packet has arrived for processing. In response, the CPU 206 retrieves the stored-packet and places it in the memory 208. The CPU 206 processes the packet (for example, by computing a “next hop” address for the packet on the basis of the packet's end destination address). After the packet is processed, the CPU 206 selects a line interface card 212 to be used to transmit the processed packet from the edge router 204, retrieves the stored packet, and transfers the retrieved packet to the selected line interface card 212 for transmission to the next hop address.
Because the CPU 206 may be programmed to perform a variety of functions, the router architecture illustrated in FIG. 2 provides significant flexibility. However, router performance and capacity will be strongly dictated by the performance characteristics of individual router components such as the CPU 206, the memory 208 and the bus 216. As a result, to serve a variety of application environments, router manufactures employing this architecture are generally forced to provide a variety of different router products. This creates inefficiency for the router manufacturers, as well as added cost for enterprises that are forced to replace routers as their networks grow in size and their feature requirements change.
Accordingly, it would be desirable to develop a more flexible router architecture that allows a variety of enterprise network feature and capacity requirements to be more easily met.
Improved flexibility in features and performance is achieved by an improved architecture for enterprise data communications routers. According to a first embodiment of the invention, the architecture comprises a buffer for storing data packets, a processing engine for processing information associated with the stored data packets, and one or more line interface cards (LICs) each having one or more ports for receiving and transmitting data packets. Source LICs receive data packets at source ports, store received packets in the buffer, and transmit packet tags incorporating a selected subset of information from the data packets to the processing engine for processing. Packet storage and tag processing are accomplished largely in parallel for improved router efficiency.
The processing engine processes and transmits the processed packet tags to destination LICs. The destination LICs, in response to information contained in processed tags, retrieve associated data packets from the buffer, modify the retrieved data packets, and deliver the modified data packets to associated LIC destination ports.
In a second embodiment of the invention, the processing engine further includes one or more serially arranged pipeline processing modules (PPMs) to process the header information. The serially arranged PPMs are each programmed to perform a dedicated processing function. In addition, a system controller is coupled to the serially arranged PPMs to receive and process header information associated with control and signaling data packets, and to dynamically update stored program control software in the serially arranged PPMs.
A more complete understanding of the invention may be obtained by reading the following description of specific illustrative embodiments of the invention in conjunction with the appended drawing in which:
FIG. 1 depicts a typical enterprise network employing edge and backbone routers;
FIG. 2 shows a schematic diagram illustrating a prior art architecture for edge routers;
FIGS. 3A and 3B show schematic diagrams illustrating two embodiments of the present invention;
FIG. 4 shows a process flow diagram illustrating the operation of the embodiment of FIGS. 3A;
FIG. 5 shows a schematic diagram of line interface card elements according to the embodiment of FIG. 3A;
FIG. 6 illustrates the relationship between the linked list manager and the buffer memory of the embodiment of FIG. 3A;
FIGS. 7A and 7B show process flow diagrams for storing received packets in the buffer of FIG. 3A;
FIG. 8 depicts a packet tag created according to the process of FIG. 4; and
FIGS. 9A-9E illustrate three applications of the invention according to the embodiments described by FIGS. 3A and 3B.
For consistency and ease of understanding, those elements of each figure that are similar or equivalent share identification numbers that are identical in the two least significant digit positions (for example, edge router 100 of FIG. 1 and edge router 200 of FIG. 2).
An embodiment of the present invention is illustrated as edge router 300 of FIG. 3A. Edge router 300 comprises a buffer 310 for storing received data packets, a processing engine 320 for processing header information associated with the received data packets, and one or more line interface cards 330 for receiving and transmitting data packets over associated data network terminations.
Operation of the edge router 300 is summarized with reference to FIG. 3A and the process flow diagram of FIG. 4. At step 402 of FIG. 4, a data packet is received at a network termination port in one of the line interface cards (LICs) 330. LIC 330 places the received packet in buffer 310 at step 404, and creates a tag for the received packet at step 406. The packet includes information copied from the received packet, and in particular, from the packet header.
At step 408, LIC 330 transmits the tag to processing engine 320. Processing engine processes the packet tag at step 410, and then transmits the processed packet tag to a destination LIC 330 at step 412. Destination LIC 330 may be the LIC 330 that received the packet initially, or another one of the one or more LICs 330.
At step 414, destination LIC 330 identifies the subject data packet from information in the processed packet tag, and retrieves the subject data packet from the buffer. Destination LIC 330 then uses information in the processed packet tag to modify the retrieved data packet. For example, destination LIC 330 may replace a destination address in the retrieved data packet with a revised destination address contained in the packet tag. After completing packet modifications, destination LIC 330 transmits the modified data packet from a LIC network termination port at step 418.
According to the method of FIG. 4, and in contrast to the prior art architecture illustrated in FIG. 2, the edge router 300 of FIG. 3 requires only a portion of each received data packet to be processed by its central processing unit (processing engine 320). This portion to be processed is encapsulated by the receiving LIC 330 in a packet tag. Importantly, this allows for increased efficiency over the prior art architecture of FIG. 2, as tag processing by processing engine 320 proceeds largely in parallel with storage of the received data packet by LIC 330 and buffer 310.
Elements of line interface circuits 330 are illustrated with greater particularity in FIG. 5. Line interface circuit 530 of FIG. 5 includes one or more ports 531 that each provide a physical termination between the line interface circuit 530 and a path in the data network. Port 531 is interconnected to a physical layer interface 532, which operates both to condition received data packets for processing in the router 300 of FIG. 3 and to condition data packets processed by the router 300 for transmission over the data network. The conditioning provided by physical layer interface 532 includes, for example, converting between packet bit streams in the router 300 and signal formats particular to the interconnecting network or subnetwork. For example, a LIC 330 interconnecting an Ethernet-based subnetwork would include an Ethernet transceiver in physical layer interface 532. Ethernet transceivers of this sort are commercially available, for example, such as the Intel 82559 Ethernet controller.
Received packets are transferred by the physical layer interface 532 to ingress packet handler 533, which interacts with the buffer 310 of FIG. 3 to store the received packet. In parallel with data packet transfer to ingress packet handler 533, packet tag builder 534 retrieves information from the received data packet, encapsulates the retrieved information within a packet tag, and transmits the packet tag to a processing engine 320 of FIG. 3 for further processing.
Tag information processed by processing engine 320 is received by tag receiver 536 of FIG. 5. Tag receiver 536 interprets the processed packet tag and instructs egress packet handler 535 to retrieve an associated data packet from buffer memory 310 of FIG. 3. Egress packet handler 535 may be further instructed by packet tag receiver 536, to modify the retrieved packet (for example, by replacing information in a destination field with information included in the processed packet tag). Egress packet handler 535 modifies the retrieved packet and provides the modified packet to physical layer interface 532 for conditioning and transmission over port 531. Packet handlers 533 and 535, tag builder 534 and tag receiver 536 may be readily implemented as field programmable gate arrays (FPGAs).
As illustrated in FIG. 3A, packet tags transmitted to processing engine 320 by LICs 330 are serially sequenced by multiplexer 302. Similarly, packet tags processed by processing engine 320 are demultiplexed by demultiplexer 304 and provided appropriately to destination LICs. In order to reduce the possibility of resource contention, the multiplexer 302 and the demultiplexer 304 to may be equipped with buffers for each interfacing LIC 330. Multiplexer 302 and demultiplexer 304 536 may also be readily implemented as FPGAs.
Another important aspect of the present invention concerns the architecture of processing engine 320. Processing engine 320 incorporates an innovative “pipeline” architecture incorporating one or more pipeline processing modules (PPMs) 322 and system controller 325. Each PPM 322 includes a central processing unit (CPU) 321 and a memory 323. CPU 321 may consist of a commercially available processor such as Motorola's POWERPC 750. Memory 323 may be configured using conventional dynamic random access memory (DRAM). Optionally, each PPM may incorporate a multiprocessor in place of CPU 321.
The memory 323 contains stored program control instructions for the CPU 321, and may also contain data associated with the processing of packet tags. PPMs 322 are chained together in a serial (“pipelined”) fashion, optionally separated by one or more first-in-first-out (FIFO) buffers 324 to manage slight asynchronies in the operation of PPMs 322. Suitable buffers are commercially available, for example, from lntegrated Device Technology, Inc.
As a consequence of this architecture, and in sharp contrast to the prior art architecture of FIG. 2, the number of PPMs employed and the breakdown of functions performed by each PPM may be easily and flexibly tailored according to specific user requirements.
In addition to the one or more PPMs 332, processing engine includes a system controller 325. System controller 325 includes a Host CPU 326 and a memory 327 containing stored program control and data elements, and may be programmed, for example, to dynamically download stored program control instructions and data to one or more of the PPMs 322 via a pipeline bus 329. System controller 325 may also retrieve data from one or more of the PPMs 322 via pipeline bus 329. Pipeline bus 329 also enables data transfer between memories 323 in two or more of the PPMs 322.
Optionally, system controller 325 may be interconnected to pipeline bus 329 via bridge router 328. This optional configuration has the advantage, for example, of reducing traffic reaching system controller 325 that pertains only to PPMs 322. Bridge router 328 may be implemented, for example, using commercially available devices such as the Motorola MPC106 PCI Bridge/Memory Controller or IBM CPC700 PCI Bridge.
As illustrated by FIG. 3B, LICs 330 are further interconnected to processing engine 320 via signal paths 337. As shown in FIG. 3B, signal paths 337 interconnect to a PPM 322′ positioned at a downstream end of the pipeline for the purpose of signaling processing engine 320 when each LIC 330 is ready to receive one or more processed packet tags. One skilled in the art will readily recognize that signal paths 337 may alternatively interconnect to a variety of other components (for example, system controller 325) in processing engine 320 to provide this function.
As shown in FIG. 3B, end of pipeline LIC 322′ also includes one or more queues 339 that may be used to sequence the delivery of processed packet tags to the LICs 330 according to the placement of packet tags in the one or more queues 339. Queues 339 may transfer packet tags to demultiplexer 304 in a “round robin” manner, or alternatively, according to various schemes granting different priorities to ones of the one or more queues 339. A queue may be selected for a packet tag on the basis of an assigned priority recorded in the packet tag. For example, a priority scheme may be constructed allowing very low latency for a class of packet tags associated with “voice over IP” packets. The significance of this queueing feature is discussed in greater detail for two examples illustrated by FIGS. 9C through 9E.
Edge router 300 of FIG. 3A may also optionally include an encryption/compression processor 306. Suitable encryption/decryption processors are commercially available, for example, from Hi/fn Inc.
Several elements of buffer 310 enable efficient storage and retrieval of data packets. Buffer 310 includes a buffer memory 312 that stores data packet information, a buffer manager 314 that controls access to portions of the buffer memory 312, a linked list manager 316 that tracks areas of buffer memory (termed “pages”) that are allocated to store data packet information, and a free memory list that keeps track of empty buffer memory pages which are available to be assigned for data packet storage. The operation of buffer 310 is further illustrated with additional reference to FIGS. 3A, 5 and 6.
Upon receipt of a data packet, ingress packet handler 533 of FIG. 5 communicates a request to linked list manager 316 of FIG. 3A for a page in buffer memory 312 to begin storing the data packet. In response to this request, linked list manager 316 communicates with free memory list 318 to determine a starting page in buffer memory 312 for storing at least a portion of the data packet, and records the memory address as a starting memory address for the data packet. As shown in FIG. 6, buffer memory 612 includes an array of buffer memory pages 613 that may be allocated for storing data packets. In a buffer memory capable of storing between 32 and 128 megabytes of packet data, for example, each buffer memory page 613 may be configured to store 64 bytes of packet data.
Linked list manager 316 of FIG. 3 communicates the page number of starting page 617 of FIG. 6 to buffer manager 314, records the starting page number in a linked list record 615, and signals ingress packet handler 533 of FIG. 5 to begin transmitting up to 64 bytes (one buffer memory page) of packet data to buffer manager 314. Buffer manager 314 writes the data provided by ingress packet handier 533 to memory page 617, and communicates the starting memory address recorded in record 615 to ingress packet handler 533. Ingress packet handler 533 communicates the starting address to tag builder 534, where it is incorporated in the packet tag.
If the data packet has not yet been fully stored in buffer memory 312, packet handler 533 of FIG. 5 communicates another request to linked list manager 316 of FIG. 3 for memory space. Linked list manager queries free memory list 318 to obtain the address for a new empty buffer memory page 627, creates a record 619 identifying the associated address, and establishes a pointer 621 in record 615 linking record 615 to record 619.
Requests for additional buffer memory pages continue until the data packet has been completely stored in buffer memory 613. As illustrated in FIG. 6, record 623 stores the address for a final buffer memory page 629. The pointer field 625 of the record 623 is marked to indicate that record 623 is the last record in the linked list of records 615, 619 and 623.
The interaction between LICs 330 of FIG. 3 and buffer 310 in storing a received data packet is further shown in the flow diagrams of FIGS. 7A and 7B. FIG. 7A depicts action taken by one of the LICs 330 to store a received data packet. After receiving a data packet at step 702, a LIC 330 at step 704 a makes a request to linked list manager 316 to obtain a starting page address for placing the packet in buffer memory 312. After the starting address is received, LIC 330 transmits a first portion of the data packet at step 704 b to buffer manager 314 for storage at the starting page (page 617 of FIG. 6) in buffer memory 312 of FIG. 3A. The transmitted portion may not exceed the capacity of the selected buffer memory page. At step 705, LIC 330 stores the starting address of the selected buffer memory page within the packet tag it is preparing to transmit to processing engine 320. The packet tag thereby is later delivered to a destination LIC 330 with the starting buffer memory address for retrieving the associated data packet.
After transmitting the first portion of the data packet, LIC 330 determines at step 706 a whether the entire received data packet has been stored. If storage of the entire packet has been completed, the process ends at step 706 e. Otherwise, the process resumes at step 706 b with a request to link list manager 316 for another memory page for storing a next portion of the received data packet. Upon receipt of an indication that another memory page is available from linked list manager 316, line interface circuit 330 transmits a next portion of the received data packet to the buffer manager at step 706 c. The process then again checks to see if the data packet has been fully store at step 706 d, and if not, resumes at step 706 b. Once storage of the entire packet has been completed, the process ends at step 706 e.
FIG. 7B illustrates actions undertaken by linked list manager 316 to store a received data packet. These actions complement the actions of LIC 330 illustrated in FIG. 7A. Upon receipt of a request for buffer memory from line interface circuit 330 at step 703 a of FIG. 7B, linked list manager 316 proceeds to examine free memory list 318 at step 703 b to determine whether a free buffer memory page is available. If no page is available, linked list manager 316 informs line interface circuit 330 and ends the process at step 703 j. If a free page is identified, linked list manager 316 proceeds to remove the page from free memory list 318 at step 703 c and to record its address in a starting record for the linked list.
At step 703 d, linked list manager 316 transmits the starting memory page address to LIC 330, which causes LIC 330 to begin to transmit a portion of the received data packet to buffer manager 314. At step 703 e, linked list manager 316 waits for a next request from LIC 330 for additional memory space. If the request is not received (either because an end of packet message is transmitted by LIC 330 or because no message is transmitted during a prescribed wait period), the process terminates at step 703 j. Otherwise, with the receipt of a memory space request, linked list manager 316 proceeds to determine from free memory list 318 whether a free buffer memory page is available.
If no page is available, linked list manager 316 informs LIC 330 and ends the process at step 703 j. If a free page is identified, linked list manager 316 proceeds at step 703 g to remove the page from free memory list 318, to record the memory page address in a new linked list record, and to update the pointer field in the previous linked list record to point to the new record. At step 703 h, the linked list manager may temporarily mark the pointer field in the new record to indicate that the selected memory page contains the end of the received data packet. The linked list manager then returns to step 703 e to wait for a next request from LIC 330 for additional buffer memory space. If a request for a new record is granted, the end of packet mark in the previous record is replaced with a pointer to the new record. If no additional request is received, the end-of-packet marking becomes permanent.
Processes similar to those described in conjunction with FIGS. 7A and 7B may also used by destination LICs 330 for retrieving data packets from the buffer memory.
FIG. 8 illustrates a general structure for a packet tag 860 created by the process of FIG. 7A. Received data packet 850 of FIG. 8 includes a packet header 852 and a packet payload 854. Portions of the packet header 852 are written by a LIC 330 into a tag payload 864 in packet tag 860. In addition to tag payload 864, packet tag 860 includes a tag header 862.
Tag header 862 provides a work space for processing engine 320 during tag processing. Upon its creation, tag header 862 may, for example, identify the receiving LIC 530 of FIG. 5, an associated LIC port 531, and a buffer memory address where the beginning portion of the data packet is stored. As it is processed, tag header 862, may further incorporate a variety of additional pieces of information including but not limited to the identity of a destination LIC and associated port, information indicative of service priority, and various control information.
Tag payload 864 typically includes information from packet header 852 that will be used to update the associated data packet before it is retransmitted by a LIC 530 over the data network. In an Internet protocol (IP) environment, for example, tag payload 864 may include IP source and destination addresses as well as transmission control protocol (TCP) source and destination port addresses.
Several examples illustrate by FIGS. 9A-9E illustrate how data tags are formed for a variety of edge router service applications. FIGS. 9A and 9B illustrate how a packet tag 970 may be used to support Ethernet-to-Ethernet communications.
FIG. 9A illustrates a typical Ethernet-based Intranet 970. Intranet 970 includes network backbone 971, routers 973, 977 and 979, and a server 975. Routers 977 and 979 provide connectivity to networks 976 and 978, respectively. Each of the routers 973, 977 and 979 is able to route a data packet within the Intranet 970 by determining a next hop address associated with one of the other routers or with the server 975.
Consistent with the principles of the present invention, FIG. 9B illustrates a packet tag 960 that is organized to facilitate determining a next hop address used for routing data packets in the intranet 970 of FIG. 9A. As illustrated in FIG. 9B, packet tag 960 includes a header portion 962 and a payload portion 964. Payload portion 964 includes Ethernet and TCP/IP addresses for an associated data packet source and destination. With respect to one of the routers 973, 977 and 979 of FIG. 9A that has received the data packet for routing, header portion 962 of FIG. 9B includes a field 961 for source and destination LIC addresses, a field 963 for source and destination LIC port addresses, a control flag field 965, a starting buffer address field 967, and a next hop address field 969.
Ethernet and TCP/IP addresses stored in payload portion 964 may be used to compute next hop address 969. For example, consider a data packet that is being processed by router 973 of FIG. 9A. Processing engine 320 of FIG. 3A associated with router 973 performs a table look-up in an TCP/IP address table stored in one of its memories 323 to determine that the TCP/IP destination address of the data packet is associated with network 976. Processing engine 320 then performs a second table look-up in a router map table stored in one of its memories 323 to determine that router 977 provides intranet interconnection to network 976. The Intranet address for router 977 is determined and written by processing engine 320 into header portion 962 as next hop address 969. It should be noted that a variety of known methods for fast table look-ups (including, for example, hashing) may be employed to ensure satisfactory processing speeds by processing engine 320 (such methods are described, for example, in M. Degermark et al., “Small Forwarding Tables for Fast Routing Lookups,” and M. Waldvogel et al., “Scalable High Speed IP Routing Lookup,” Proceedings of SIGCOMM, September 1997).
Processing engine 320 next determines a destination LIC address and destination port address on the basis of next hop address 969. Processing engine 320 performs a third table look-up to determine one or more LICs and LIC ports that provide physical interconnection to router 977, and then performs a fourth table look-up to select among physically interconnected LICs and LIC ports on the basis of class of service or utilization. Alternatively, as illustrated in FIG. 3B, a physically interconnected LIC and LIC port may be selected on the basis of a “next available” signal provided by the associated LIC 330 over signal paths 337.
In addition to processing tasks associated with header portion 962, processing engine 320 also appropriately updates payload portion 964. For example, processing engine 320 may complete routine processing tasks such as decrementing the time to life (TTL) field of the TCP/IP header. Once processing of packet tag 970 has been completed, it is forwarded to the selected LIC 330 of FIG. 3. Selected LIC 330 receives the updated packet tag, retrieves the associated data packet from buffer 310 beginning with starting buffer memory address 967, and modifies the retrieved data packet in accordance with information in the updated data tag 970. For example, the data packet may be modified by replacing the stored TCP/IP header with an updated TCP/IP header from the packet tag 970.
Control flag field 965 is used primarily for recording information related to the processing of packet tag 970 by the individual PPMs 322 comprising processing engine 320 and the destination LICs 330. For example, a first PPM 322 may set a flag in control flag field 965 that instructs a subsequent PPM 322 to “skip” its processing of packet tag 970. This would be appropriate, for example, when subsequent PPM 322 is programmed to select a destination LIC on the basis of class of service and the first PPM 322 has determined that packet tag 970 has a premium class of service and is entitled to be delivered to the next available destination LIC.
Control flag field 965 of packet tag 970 may also be used, for example, to store a control flag for destination LIC 330 indicating that the associated data packet should be retrieved from buffer memory 310 and discarded. This would be appropriate when packet tag 970 is associated with a source that has exceeded its authorized packet transfer rate.
FIGS. 9C and 9D illustrates a second example of how the present invention may be used to direct data packets for service within a server farm. FIG. 9C shows server farm 980 including servers 982. Each of the servers 982 performs similar processing functions, and is electrically interconnected to router 900 via one of m LICs 930 b. Any number of servers 982 may be supported by this arrangement so long as each server 982 is associated with a LIC 930 b.
Consistent with the principles of the present invention, FIG. 9D illustrates a packet tag 960 that is organized to facilitate distributing data packets among servers 982. As in the example of FIG. 9B, packet tag 960 includes a header portion 962 and a payload portion 964. However, the header portion 962 of FIG. 9D differs from the header portion 962 of FIG. 9B. Specifically, in header portion 962 of FIG. 9D, next hop address field 969 is omitted and queue ID field 966 is added.
Processing engine 920 performs a table look-up in a TCP/IP address table stored in a memory 923 to assign a service priority for the associated data packet. Based upon the assigned service priority, processing engine 920 performs a second table look-up to select a server 982 associated with the assigned service priority, and performs a third table look-up to select a destination LIC address and a destination LIC port that provide interconnection to the selected server 982. Processing engine 920 then respectively writes the addresses of the selected LIC 930 b and LIC port in LIC field 961 and LIC port field 963 of packet tag 960.
Processing engine 920 then performs a fourth table look-up to select one of the queues 939 based on the assigned service priority, and writes the selected queue address in queueID field 966 of packet tag 960. Each of the queues 939 has an associated waiting time to service packet tags placed in the queue, and may be associated with a specified service priority. Processing engine 920 then uses the address in queueID field 966 to place packet tag 960 in the selected queue 939 to await further processing.
FIG. 9E illustrates a third example in which packet tag 960 is arranged to support a so-called “layer 7” switching feature in the router 900 of FIG. 9C. Layer 7 switching may be used as illustrated to determine service priority for an internet web transaction on the basis of a web page address (referred to as a “uniform resource locator,” or URL) provided by the user. As in the example of FIG. 9D, packet tag 960 of FIG. 9E includes a header portion 962 and a payload portion 964. Data fields in the header portions 962 of FIGS. 9D and 9E are equivalent. However, the payload portion 964 of FIG. 9E in comparison to FIG. 9D adds a URL field 968. The URL may be retrieved, for example, from a “Get URL” user command field typically positioned in the data packet payload after the TCP/IP header.
In contrast to the example of FIG. 9D, processing engine 920 performs a table look-up in a memory 923 of FIG. 9C to assign a service priority for the associated data packet on the basis of the URL stored in field 968 rather than on the basis of the TCP/IP addresses stored in payload portion 964. As the number of URLs used should be substantially less than the number of users having distinct TCP/IP addresses, processing engine performance in determining service priority may be significantly improved over the example of FIG. 9D.
The exemplary embodiments described above are but a number of alternative embodiments of the invention that will be apparent to those skilled in the art in view of the foregoing description. Accordingly, this description is to be construed as illustrative only, and is for the purpose of teaching those skilled in the art the best mode of carrying out the invention. Various other alternatives can be devised by a worker skilled in the art without departing from the teachings of this invention.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5572533 *||Jun 28, 1995||Nov 5, 1996||Fujitsu Limited||Method and apparatus for monitoring and fault-analyzing networks|
|US6009528 *||Dec 30, 1996||Dec 28, 1999||Sony Corporation||Communication system and communication apparatus|
|US6262983 *||Sep 8, 1999||Jul 17, 2001||Hitachi, Ltd||Programmable network|
|US6292489 *||Jan 6, 2000||Sep 18, 2001||Hitachi, Ltd.||Router device and network system using the same|
|US6292836 *||Sep 28, 1998||Sep 18, 2001||Sony Corporation||Communication method and communication apparatus|
|US6353614 *||Mar 5, 1998||Mar 5, 2002||3Com Corporation||Method and protocol for distributed network address translation|
|US6421734 *||Nov 28, 2000||Jul 16, 2002||3Com Corporation||System for managing dynamic processing resources in a network|
|US6510164 *||Nov 16, 1998||Jan 21, 2003||Sun Microsystems, Inc.||User-level dedicated interface for IP applications in a data packet switching and load balancing system|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US6839359 *||May 20, 2002||Jan 4, 2005||Pluris, Inc.||Method and apparatus for mapping data packets between lines of differing capacity at a router interface|
|US6928482 *||Jun 29, 2000||Aug 9, 2005||Cisco Technology, Inc.||Method and apparatus for scalable process flow load balancing of a multiplicity of parallel packet processors in a digital communication network|
|US6959346 *||Dec 22, 2000||Oct 25, 2005||Mosaid Technologies, Inc.||Method and system for packet encryption|
|US7027394||Sep 13, 2001||Apr 11, 2006||Narad Networks, Inc.||Broadband system with traffic policing and transmission scheduling|
|US7072360||Sep 13, 2001||Jul 4, 2006||Narad Networks, Inc.||Network architecture for intelligent network elements|
|US7092392 *||Mar 11, 2002||Aug 15, 2006||Hitachi, Ltd.||Packet routing apparatus|
|US7116659 *||Mar 29, 2001||Oct 3, 2006||Infineon Technologies Ag||Data transmission memory|
|US7139247||Sep 13, 2001||Nov 21, 2006||Narad Networks, Inc.||Broadband system with topology discovery|
|US7146630||Sep 13, 2001||Dec 5, 2006||Narad Networks, Inc.||Broadband system with intelligent network devices|
|US7177310||Mar 11, 2002||Feb 13, 2007||Hitachi, Ltd.||Network connection apparatus|
|US7424017 *||Apr 7, 2005||Sep 9, 2008||At&T Corp.||Techniques for introducing in-band network management packets in multi-protocol label switching networks|
|US7466711 *||Dec 20, 2003||Dec 16, 2008||Accton Technology Corporation||Synchronous system and method for processing a packet|
|US7516236 *||Dec 21, 2001||Apr 7, 2009||Nokia Corporation||Method to improve perceived access speed to data network content using a multicast channel and local cache|
|US7586916||Apr 28, 2006||Sep 8, 2009||Hitachi, Ltd.||Packet routing apparatus and method of efficiently routing packets among network equipment|
|US7609704 *||Jun 9, 2006||Oct 27, 2009||Hitachi, Ltd.||Packet routing apparatus|
|US7631116||Oct 25, 2005||Dec 8, 2009||Mosaid Technologies Incorporated||Method and system for packet encryption|
|US7835379||Jul 12, 2005||Nov 16, 2010||Ciena Corporation||Network architecture for intelligent network elements|
|US7873027 *||Jul 11, 2007||Jan 18, 2011||International Business Machines Corporation||Database management system and method of using it to transmit packets|
|US7876748 *||Sep 7, 2000||Jan 25, 2011||International Business Machines Corporation||Stable hash-based mapping computation for a dynamically varying target set|
|US7983283||Sep 16, 2009||Jul 19, 2011||Hitachi, Ltd.||Packet routing apparatus|
|US8184643||Sep 14, 2005||May 22, 2012||Ciena Corporation||Device, system, and method for transporting data using combined broadband and legacy network infrastructures|
|US8295308 *||Aug 15, 2008||Oct 23, 2012||Vmware, Inc.||Systems and methods of configuring a resource pool as a network end point|
|US8312292||Jul 31, 2008||Nov 13, 2012||Viasat, Inc.||Input output access controller|
|US8392983 *||Jul 31, 2008||Mar 5, 2013||Viasat, Inc.||Trusted labeler|
|US8514869||Apr 15, 2011||Aug 20, 2013||Hitachi, Ltd.||Packet routing apparatus|
|US8639912 *||Nov 16, 2009||Jan 28, 2014||Mosaid Technologies Incorporated||Method and system for packet processing|
|US8850089 *||Jun 18, 2010||Sep 30, 2014||Integrated Device Technology, Inc.||Method and apparatus for unified final buffer with pointer-based and page-based scheme for traffic optimization|
|US8995452||Aug 8, 2013||Mar 31, 2015||Hitachi, Ltd.||Packet routing apparatus|
|US20020075805 *||Sep 13, 2001||Jun 20, 2002||Narad Networks, Inc.||Broadband system with QOS based packet handling|
|US20020075814 *||Sep 13, 2001||Jun 20, 2002||Narad Networks, Inc.||Broadband system with topology discovery|
|US20020075875 *||Sep 13, 2001||Jun 20, 2002||Narad Networks, Inc.||Broadband system with transmission scheduling and flow control|
|US20020078464 *||Sep 13, 2001||Jun 20, 2002||Narad Networks, Inc.||Broadband system with intelligent network devices|
|US20020087708 *||Dec 22, 2000||Jul 4, 2002||Low Arthur John||Method of processing serial data,serial data processor and architecture therefore|
|US20020097674 *||Sep 13, 2001||Jul 25, 2002||Narad Networks, Inc.||System and method for call admission control|
|US20020101820 *||Sep 13, 2001||Aug 1, 2002||Narad Networks, Inc.||Broadband system with traffic policing and transmission scheduling|
|US20020105965 *||Sep 13, 2001||Aug 8, 2002||Narad Networks, Inc.||Broadband system having routing identification based switching|
|US20020126680 *||Mar 11, 2002||Sep 12, 2002||Yukihide Inagaki||Network connection apparatus|
|US20020136208 *||May 20, 2002||Sep 26, 2002||David Skirmont||Method and apparatus for mapping data packets between lines of differing capacity at a router interface|
|US20020138854 *||Sep 13, 2001||Sep 26, 2002||Narad Networks, Inc.||System and method for mapping end user identifiers to access device identifiers|
|US20020141410 *||Mar 29, 2001||Oct 3, 2002||Infineon Technologies Ag||Date transmission memory|
|US20020150088 *||Mar 11, 2002||Oct 17, 2002||Shigeki Yoshino||Packet routing apparatus|
|US20030112782 *||Dec 18, 2001||Jun 19, 2003||Mizell Jerry L.||Node, network and method for providing quality of service adjustments on a per-application basis|
|US20040019876 *||Sep 13, 2001||Jan 29, 2004||Narad Networks, Inc.||Network architecture for intelligent network elements|
|US20040258078 *||Dec 20, 2003||Dec 23, 2004||Shiuh-Pyng Shieh||Synchronous system and method for processing a packet|
|US20050180422 *||Apr 7, 2005||Aug 18, 2005||Samson Boodaghians||Techniques for introducing in-band network management packets in multi-protocol label switching networks|
|US20050246754 *||Jul 11, 2005||Nov 3, 2005||Narad Networks, Inc.||System and method for mapping end user identififiers to access device identifiers|
|US20050251846 *||Jul 12, 2005||Nov 10, 2005||Narad Networks, Inc.||Network architecture for intelligent network elements|
|US20060031557 *||Dec 21, 2001||Feb 9, 2006||Rod Walsh||Method to improve perceived access speed to data network content using a multicast channel and local cache|
|US20060064510 *||Oct 25, 2005||Mar 23, 2006||Low Arthur J||Method and system for packet encryption|
|US20060209835 *||Apr 28, 2006||Sep 21, 2006||Yoshitaka Sainomoto||Packet routing apparatus and method of efficiently routing packets among network equipment|
|US20060242313 *||Jun 7, 2006||Oct 26, 2006||Lewiz Communications||Network content processor including packet engine|
|US20060251048 *||Jun 9, 2006||Nov 9, 2006||Shigeki Yoshino||Packet routing apparatus|
|US20070076746 *||Sep 14, 2005||Apr 5, 2007||Faska Thomas S||Device, system, and method for transporting data using combined broadband and legacy network infrastructures|
|US20080016243 *||Jul 11, 2007||Jan 17, 2008||Claude Basso||Database Management System and Method of Using it to Transmit Packets|
|US20080298237 *||Aug 3, 2006||Dec 4, 2008||Latitude Broadband, Inc.||Methods, Systems, and Apparatus of Providing QoS and Scalability in the Deployment of Real-Time Traffic Services in Packet-based Networks|
|US20090034734 *||Jul 31, 2008||Feb 5, 2009||Viasat, Inc.||Multi-Level Key Manager|
|US20090037631 *||Jul 31, 2008||Feb 5, 2009||Viasat, Inc.||Input Output Access Controller|
|US20090158050 *||Jul 31, 2008||Jun 18, 2009||Viasat, Inc.||Trusted Labeler|
|US20100002713 *||Sep 16, 2009||Jan 7, 2010||Shigeki Yoshino||Packet routing apparatus|
|US20100040058 *||Aug 15, 2008||Feb 18, 2010||Vmware, Inc.||Systems and Methods of Configuring a Resource Pool as a Network End Point|
|US20100064116 *||Nov 16, 2009||Mar 11, 2010||Mosaid Technologies Incorporated||Method and system for packet encryption|
|U.S. Classification||709/240, 709/238, 370/351|
|Cooperative Classification||H04L47/32, H04L47/2433, H04L47/10, H04L45/60|
|European Classification||H04L47/32, H04L47/10, H04L47/24C1, H04L45/60|
|May 9, 2000||AS||Assignment|
Owner name: LUCENT TECHNOLOGIES INC., NEW JERSEY
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:WOO, THOMAS Y.;REEL/FRAME:010803/0405
Effective date: 20000508
|Jan 12, 2007||FPAY||Fee payment|
Year of fee payment: 4
|Jan 28, 2011||FPAY||Fee payment|
Year of fee payment: 8
|Jan 29, 2015||FPAY||Fee payment|
Year of fee payment: 12