The present invention relates generally to switching nodes and more particularly to a method and system for performing encapsulation and decapsulation on a per channel basis with hardware.
When conventional switches and routers receive input data, they must examine the contents of the input data stream to determine where to direct the data. In order to find the relevant switching and routing information within the stream of data, frames and cells in the data must be identified (i.e. “delineated”) and packets must be extracted from their digital “envelope” via a process known as “decapsulation.” Decapsulation is performed in conventional switches and routers by software that executes on a processor. Software directs the decapsulation to ensure that the decapsulation is performed properly.
The data must be re-encapsulated after it has been decapsulated so that it may be sent out of the switch or router in the digital envelope required by the outgoing link. In conventional routers the re-encapsulation is performed by software that executes on a processor.
Conventional routers perform decapsulation and encapsulation somewhat slowly. The slowness of conventional routers is attributable in part to the encapsulation and decapsulation being performed by software. The present invention addresses this limitation by performing the decapsulation and encapsulation in hardware. In one embodiment of the present invention, a firstASIC contains the intelligence for performing decapsulation and another ASIC contains the intelligence for performing encapsulation. This results in heightened speed for both decapsulation and encapsulation.
The present invention also does not tie the encapsulation of data that is output to the encapsulation of the data as input. Instead, there is independence between the encapsulation of data input and the encapsulation of data as output. The decapsulation occurs upon a per tributary or per “virtual channel” basis. Similarly, the encapsulation is performed per virtual channel or tributary. As a result, the encapsulation that is output may differ from the encapsulation that is input.
In accordance with one aspect of the present invention, a hardware device is found in a forwarding node for directing data towards a destination. The hardware device includes an input port for receiving data encapsulated in one of multiple formats from a source. The forwarding node also includes decapsulation logic for decapsulating the data into packet format used in the forwarding node without executing processor instructions.
In accordance with another aspect of the present invention, a hardware device is found in a forwarding node for directing data towards a destination and includes an port for outputting data to the destination. The hardware device also includes encapsulation logic for encapsulating the data in a format that is required by the destination using a programmable patent insertion.
In accordance with an additional aspect of the present invention, a forwarding node directs data from a source towards a destination. The forwarding node includes a decapsulation logic for decapsulating the data based on the source and encapsulation logic for encapsulating the data base to the destination independent of the source.
In accordance with a further aspect of the present invention, a method is practiced in the forwarding node that is a hardware device for performing decapsulation for directing data from a source to a destination. Per this method, the data is received at the forwarding node and the source of the data is determined. The hardware device is employed to decapsulate the data based on the source of the data.
In accordance with an additional aspect of the present invention, data to be encapsulated and output from a forwarding node toward a destination is provided. The destination is determined and the data is encapsulated by a hardware device and a format that is proper for the destination based upon the destination.
In accordance with yet another aspect of the present invention, a hardware device includes an input port for receiving data encapsulated, one of multiple formats from a source. The hardware device also includes decapsulation logic for decapsulating the data into a packet format used in a forwarding node using a pattern matching technique.
An illustrative embodiment of the present invention will be described below relative to the following drawings:
The illustrative embodiment of the present invention provides a single integrated system for switching, forwarding and/or routing data in a multitude of different possible encapsulations. The system decapsulates incoming data and converts the data into a canonical format. The canonical format is used to transmit the data internally until the transmit side of the device is, reached. The transmit side is capable of a wide range of different encapsulations. The transmit side encapsulates the data received in the canonical format to create the appropriate encapsulation for the output port. The decapsulation and encapsulation are performed in hardware. The decapsulation uses pattern matching and the encapsulation uses pattern insertion. In the illustrative embodiment, application specific integrated circuits (ASICs) are used to perform the decapsulation and encapsulation. The use of the hardware provides added speed in performing the operations of decapsulation and encapsulation.
The decapsulation and encapsulation rely upon per virtual circuit information. Based upon what virtual circuit a piece of data arrived on, an encapsulation for the virtual circuit may be determined and used to perform decapsulation. Similarly, the re-encapsulation of data is performed on a per virtual circuit basis based on the virtual circuit onto which the data is being output and the re-capsulation is independent of the virtual circuit on which the data arrived. For purposes of the present context, the virtual circuit refers to a communication link that appears to a user to be a dedicated point to point circuit. Virtual circuits may also be referred to as “channels” or “interfaces” in the discussion below.
The illustrative embodiment of the present invention provides a single integrated system for performing both Internet Protocol (IP) forwarding/routing and asynchronous transfer mode (ATM) switching/routing. The single device contains both an IP packet forwarding facility and an ATM switching facility. In this context, “forwarding” refers to the passing of packets between a source port and one or more destination ports in a communication node, such as a switch, a router or a switch/router. “Routing” refers to the accumulation of topology information to provide information to a forwarding table the accumulation of topology information to provide information to a forwarding table or similar structure by a communication node that is used for directing input data toward a destination. “Switching” refers to the directing of packets or other modularized information through intermediary switching nodes to connect a sender with a receiver in a connection-oriented environment.
The illustrative embodiment eliminates the need for having separate switches and routers. The device employed in the illustrative embodiment can handle both ATM cells and IP packets in a single device and also can handle IP packets carried by ATM cells. The illustrative embodiment can direct data encapsulated in a wide variety of encapsulations. The system of the illustrative embodiment may be employed in IP networks, such as the Internet, an intranet or an extranet, or more traditional switching environments, such as virtual private networks (VPNs), and private data networks. The system supports routing of IP packets over a SONET (Synchronous Optical Network), the routing of IP packets over ATM and pure ATM switching amongst other encapsulations. More generally, the illustrative embodiment eliminates the separation between layer 2 devices and layer 3 devices so that layer 2 data units and layer 3 data units may be directed toward their destinations by a single integrated system.
The illustrative embodiment employs a switch/router suitable for use in a communications network such as a computer network or a telephone network. More severally, the present invention may be practiced with a forwarding node, such as a router, switch, computer system or other device that can implement the methods of the present invention. The switch/router includes input ports for receiving input data traffic and output ports for directing the input data traffic towards destinations. Each input data port is tied to a communications line, such as a fiber optic line. Similarly, each output port is tied, likewise, to a communication line (e.g. a fiber optic line). An ATM cell forwarding facility and an IP packet forwarding facility are provided for each input port. The ATM cell forwarding facility determines, for each ATM cell received by the input port, which output port to use for outputting the ATM cell. The IP packet forwarding facility determines, for each IP packet received by the input port, which output port to use for outputting the IP packet. Hence, each input port may receive both ATM cells and IP packets and the switch/router will properly direct the ATM cells and IP packets.
The discussion below summarizes the architecture and operation of the switch/router device of the illustrative embodiment.
As can be seen in the above-identified table, OC-48 is one of the specified line rates. In the “Capacity” column of the table, references are made to DS-1 and DS-3 rates. These are SONET/SDH capacities expressed in terms of the line rates in the Plesiochronous Digital Hierarchy (PDH) of digital signal speeds that is used to classify capacities of lines or trunks. The fundamental speed level in the PDH is DS-0, which corresponds to 64 kilobits per second. DS-1 corresponds to 1.54 megabits per second, and DS-3 corresponds to 44.736 mbps.
The switching shelf 10 also contains switching module cards 18 that occupy three slots. Switching module cards 18 are printed circuit boards that provide switching capacity to facilitate communication between line cards. The switching module cards 18 form the core of the “interconnect,” which will be described in more detail below. Switch resource modules 16 occupy the remaining two slots in the switching shelf 10. These modules 16 manage board level status information for the switching shelf 10.
As was mentioned above, additional switching shelves 10 may be employed in the device to increase the switching capacity of the device.
The device of the illustrative embodiment provides a channelized SONET/SDH mode of operation, such that each OC-48 line card module can be configured for DS-3, OC-3 and OC-12 or OC-48 tributary configuration.
Those skilled in the art will appreciate that the depiction of the line card 59 shown in
The line cards 53 may have SONET multiplexers, such as multiplexers 50 and 52 positioned at the input of the input ports for the line cards to multiplex the incoming tributary data streams into OC-48 data streams. In the example depicted in
An example is helpful to illustrate data flow through the components depicted in
The illustrative embodiment leverages the infrastructure of SONET/SDH to support multiple data encapsulations. It is presumed that all incoming data is received within SONET frames. Additional types of frames and cells may be contained within the SONET frame.
The data in the respective tributaries may be in any of a number of different formats. The receive ASIC 70 delineates this data (step 112 in
The various types of frames that may be found in the data will be described in more detail below. In addition, the techniques used to perform the delineations will also be described in more detail below. In some instances it may be also necessary to locate a packet within a frame during decapsulation so that the packet may IP routed (forwarded). Such a packetization will be described in more detail below on a case by case basis.
The data may also be encapsulated in a PPP frame 222, such as shown in
The data may be encapsulated in an FR frame 232 (
One of the first steps of the decapsulation is to perform delineation. Delineation is the mechanism by which a data stream is organized into validated frames of cell by inspection of the bits and bytes within the data stream. The illustrative embodiment supports the following delineation:
With the first delineation listed above, HEC recognition is used to locate ATM cells within a SONET payload. Each ATM cell includes a HEC byte that is calculated as a cyclical redundancy check of the first four bytes of the header. The HEC byte is used to determine whether the beginning of an ATM cell has been found.
In some instances, the ATM cells may lie within a DS-3 PLCP frame. In such instances, a different approach to delineation must be used. As shown in
The third, fourth and fifth delineations identified above relate to delineating PPP frames. PPP frames are transmitted with a “7E” flag at the beginning and the end. Hence, the PPP frame may be located by first locating the initial “7E” flag (step 290 in
PPP may employ multiple framing techniques for use with different media. Two of these framing techniques are bit synchronous HDLC and octet synchronous HDLC. Thus, the third delineation concerns the instance where octet synchronous HDLC is used and the fourth delineation instance concerns when bit synchronous HDLC is used. The fifth delineation deals with an instance wherein the PPP frame includes MPLS information. The MPLS information is sub-channel information that is contained within the PPP frame.
The fifth, sixth, seventh and eighth delineation set forth above all deal with frame relay frame delineation.
The input data may have a number of different encapsulations. The illustrative embodiment seeks to locate IP packets within such encapsulations. For the ATM cells case, the ATM cells are delineated within the payload of the SONET frame and are located after deframing the SONET frame. The IP packet may however have much more complex encapsulations.
Encapsulation 320 is an instance wherein IP is encapsulated within frame relay and contains SNAP information. The frame relay is encapsulated within SONET. Encapsulation 322 is an instance wherein IP is encapsulated within PPP, which is encapsulated within frame relay, which, in turn, is encapsulated within SONET. This encapsulation 322 may be with or without protocol compression.
Encapsulation 324 is an instance wherein IP is encapsulated within PPP. The PPP is encapsulated within AAL5, which is encapsulated within SONET with or without protocol compression. The encapsulation 328 is an instance wherein IP is encapsulated within PPP that contains logical link control (LLC) information. The PPP is encapsulated within AAL5, which is encapsulated within SONET with or without protocol compression.
Encapsulation 332 is an instance wherein IP is encapsulated within frame relay. The frame relay is encapsulated within AAL5, and the AAL5 is encapsulated within SONET.
Encapsulation 334 is an instance wherein IP is encapsulated within PPP that contains MPLS information. The PPP is encapsulated within SONET.
Encapsulation 336 is an instance wherein IP is encapsulated within frame relay that includes MPLS information. The frame relay is encapsulated within SONET.
Lastly, encapsulation 338 is an instance wherein IP is encapsulated within AAL5 that holds MPLS information. The AAL5 is encapsulated within SONET.
Those skilled in the art will appreciate that additional encapsulations may be used at practicing the present invention. Moreover, not all of the encapsulations depicted in
As part of the decapsulation (step 112 in
For encapsulations where ATM cells are to be extracted, the data follows a different route. If the ATM cells are to be delineated by HEC delineation, the ATM BEC delineator 146 is enabled and locates the ATM cells as described above. However, if the data contains a PLCP frame, PLCP deframer 142 is enabled and deframes the PLCP frame which contains the ATM cells.
Once the ATM cells are located, ATM input processing must be performed on each ATM cell (see steps 114 and 116 in
A payload type 362 is included in the header 354 and includes a three bit field that indicates whether the cell contains user information or contains associated layer management information. A cell loss priority bit 364 allows the specification of explicit loss priority for the cell. The header 354 of the ATM cell 350 also contains a field 366 that is used by the physical layer of the network for bit errors in the cell header.
The results of the lookup 150 (i.e. a destination handle) are sent to the CRC module 164 (step 376 in
The decapsulation module 182 (
In step 118 of
In order to understand how processing proceeds, it is helpful to consider the case where the PPP frame contains an IP packet. In such an instance, the receive ASIC 70 shreds the IP packet in the PPP frame into pseudo-ATM cells sends the headers to the ATM lookup engine 150 and the data 48 data bytes to the receive FIFO 152. The PPP frame is aliased into ATM cells so that ATM lookup engine 150 is able to process them: Specifically, traffic coming over a PPP context has a VPI/VCI with a preconfigured value of 0/1. This value is inserted into headers of the internal cells generated by the AAL5 segmenter 148. The VPI/VCI value of 0/1 for the PPP context is configured as a circuit that is routed. For frame relay frames, the VPI/VCI is set according to the incoming DLCI value. When processing incoming header data, the ATM lookup engine 150 returns either a destination handle or a placeholder destination handle. The placeholder destination handles are an indication that the incoming header is for an IP packet and requires further IP processing. The presence of the placeholder destination handle output causes the header information to be placed in the pending cells queue 166.
The ATM lookup 150 determines whether the cell is for the first cell of an IP packet (step 412 in
The interconnect 62 delivers the internal cells to the transmit ASIC 64. The transmit ASIC is responsible for performing output processing (see 84 in
A ticket manager 552 manages the distribution of tickets. The ticket manager 552 has access to a ticket free list memory 556 and accesses the memory 556 to provide the interconnect 62 a free ticket pool 550 of locations in the transmit data parking lot 546 that are available for use. The interconnect 62 chooses one of the free tickets and presents the ticket to the ticket manager 552. The interconnect 62 also asks for the data to be stored at the location identified by the ticket in the transmit data parking lot 546.
The ticket manager 552 is provided with the destination handle (DH) for the internal cell and passes the DH to the cell chain manager 558. The cell chain manager 558 accumulates packets of cell chains. In the customary case, the cell chain manager 558 makes sure that all components (i.e. chunks of data) of an IP packet are available before the IP packet is transmitted. There may also be a cut-through case wherein this restriction is relaxed.
The output queue manager 570 provides scheduling for implementing quality of service (QOS) options. It manages various output queues which will be described in more detail below. The output queue manager 570 cooperates with a QOS table 574 and a calendar queue 572.
The output data stream need not be a unicast data stream but rather may be a multicast data stream such that the same data stream is sent to multiple destinations. Component 564 in
A calendar queue 540 is provided to shape or rate limit traffic. Data is regulated via the calendar queue 540 to be placed into the queues. If a cell or packet is to be shaped (i.e. output to QOS processing), then the cell or packet is passed through the calendar queue 540. As the calendar queue 540 delays outgoing traffic beyond the configurable threshold, the traffic is dropped. After the shaping is complete, the cell or packet in the input queue is transmitted to the specified output queue. The calendar queue 540 is a ring structure with slots corresponding to future moments in time. The calendar queue 540 has enqueue and dequeue pointers that are based on time. The dequeue pointers advance according to a time schedule based on the width of a slot and the calendar ring. The enqueue pointer points to the last slot that can safely be queued before the dequeue pointer gets to it. The two pointer advance together. Data is queued based on a desired rate such that a “future time” is calculated for the item to be queued based on the last transmit time. The “future time” cannot be less than the time slot pointed to by the enqueue pointer. The calendar queue 540 relies on the QOS table 524 to configure the calendar queue appropriately for the QOS being used
The dequeue process for the calendar queue 540 is asynchronous relative to the enqueue process. The dequeue process, removes all entries for the slot of the “current time” and advances the enqueue and dequeue pointers. The entries removed from the “current” slot” are placed into the queue specified by their QOS treatment.
A queue scheduler 544 (in the output queue manager 570) is responsible for dequeueing data from the output queues 542. The queue scheduler 544 is provided within the output queue manager 570. The scheduler 544 implements both priority queueing and weighted round robin queueing. A programmable threshold divides priority queues from weighted round robin queues. The scheduler 544 first processes the priority queues, transmitting traffic in strict priority order. The rest of the queues are processed in weighted round robin order. The output queues are typically assigned to QOS classes, and the priority in weights on the queues configured accordingly. The priority threshold can be used to select priority queuing only or weighted round robin queuing only for all of the output queues.
The output queue manager 570 passes a ticket list and a destination handle to the encapsulation selector 576. The encapsulation 576 selector then retrieves the appropriate data from the output queues 542. The encapsulation selector 576 passes the destination handle for the selected cells to the destination description manager 580. The destination description manager 580 works in conjunction with the encapsulation engine 590 to determine how to appropriately encapsulate the data that is to be output. The encapsulation is independent of the original encapsulation of the data that was received by the receive ASIC 70. The encapsulation is performed on a per tributary or virtual circuit basis. The destination description manager 580 accesses encapsulation RAM 578 to obtain information regarding the appropriate encapsulation for the destination. The destination handle (which accompanies every cell) is used by the destination description manager 580 to locate a destination descriptor. The destination handle contains a destination descriptor ID, which may be used to access a destination descriptor. The destination descriptor is a structure containing the information and state necessary to re-encapsulate data. The information contained therein may includes partial CRC's and an indication of the length of a frame to be created. The destination descriptor contains an Encap identifier that references an Encap descriptor in a table of encapsulation descriptors 592. The Encap descriptor contains a pattern to be inserted into the beginning of an outgoing frame that identifies the pattern encapsulation. As mentioned above, the encapsulation relies on a pattern insertion technique deriving patterns from a programmable insertion storage.
The destination handle and data retrieved from the transmit data parking lot 546 of the appropriate encapsulations are gathered for ATM output. The resulting ATM cells are sent to ATM output module 594. The ATM output modules creates a correct AAL5 trailer and sets various bits in the cell. OAM 596 may be generated or outgoing OAM cells, generated by the LCP or forwarded from the receive ASIC 70, may need to be formatted. The resulting data is transmitted to the PLCP module 598. If no PLCP encapsulation is required, the cells pass through to the port transmit queue 600 without modification. Otherwise, the cells are encapsulated into PLCP frames by the PLCP module 598.
IP packets are passed to the PPP/FR output module 604, which is responsible for creating PPP frames or FR frames for encapsulating the data. The resulting frames are passed through the port transmit queues 600. Certain packets my need to passed to the LCP. The LCP packet output 606 is passed through a LCP buffer 608 and ultimately passed onto the LCP.
A SONET framer/physical interface 602 is provided for framing the data into SONET frames and for performing parallel to serial conversion. The SONET framer/physical interface 602 provides a physical interface to the output lines. The resulting data is the output towards its descriptor.
While the present invention has been described with reference to an illustrative embodiment thereof, those skilled in the art will appreciate the various changes in form and detail may be made without departing from the intended scope of the present invention as in the appended claims.
This application claims the benefit of priority under 35 U.S.C. 119(e) to U.S. Provisional Application Ser. No. 60/090,028, filed Jun. 19, 1998, and is a continuation of U.S. patent application Ser. No. 10/665,349, filed Sep. 22, 2003, which is a divisional of U.S. patent application Ser. No. 09/335,947, filed Jun. 18, 1999 (now U.S. Pat. No. 6,658,021), and is related to U.S. patent application Ser. No. 09/237,128, filed Jan. 25, 1999 (now U.S. Pat. No. 6,975,631), U.S. patent application Ser. No. 09/336,090, filed Jun. 18, 1999 (now U.S. Pat. No. 6,980,543), U.S. patent application Ser. No. 09/336,311, filed Jun. 18, 1999 (now U.S. Pat. No. 6,611,522), and U.S. patent application Ser. No. 09/336,229, filed Jun. 18, 1999 (now U.S. Pat. No. 6,909,720). The entire contents of each of the applications are hereby incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
4998242 | Upp | Mar 1991 | A |
5081654 | Stephenson et al. | Jan 1992 | A |
5255264 | Cotton et al. | Oct 1993 | A |
5278824 | Kremer | Jan 1994 | A |
5367520 | Cordell | Nov 1994 | A |
5490252 | Macera et al. | Feb 1996 | A |
5526351 | Mochinaga et al. | Jun 1996 | A |
5533018 | De Jager et al. | Jul 1996 | A |
5568486 | Huscroft et al. | Oct 1996 | A |
5600653 | Chitre et al. | Feb 1997 | A |
5703879 | Proctor et al. | Dec 1997 | A |
5729546 | Gupta et al. | Mar 1998 | A |
5740156 | Tanabe et al. | Apr 1998 | A |
5751709 | Rathnavelu | May 1998 | A |
5764645 | Bernet et al. | Jun 1998 | A |
5802105 | Tiedemann, Jr. et al. | Sep 1998 | A |
5828844 | Civanlar et al. | Oct 1998 | A |
5920705 | Lyon et al. | Jul 1999 | A |
5936965 | Doshi et al. | Aug 1999 | A |
5940389 | Yang et al. | Aug 1999 | A |
6002692 | Wills | Dec 1999 | A |
6049542 | Prasad | Apr 2000 | A |
6052364 | Chalmers | Apr 2000 | A |
6052373 | Lau | Apr 2000 | A |
6052375 | Bass et al. | Apr 2000 | A |
6067298 | Shinohara | May 2000 | A |
6075630 | Nishio | Jun 2000 | A |
6075788 | Vogel | Jun 2000 | A |
6115373 | Lea | Sep 2000 | A |
6122251 | Shinohara | Sep 2000 | A |
6122281 | Donovan et al. | Sep 2000 | A |
6125112 | Koning et al. | Sep 2000 | A |
6134238 | Noh | Oct 2000 | A |
6185635 | O'Loughlin et al. | Feb 2001 | B1 |
6195346 | Pierson, Jr. | Feb 2001 | B1 |
6198751 | Dorsey et al. | Mar 2001 | B1 |
6205150 | Ruszczyk | Mar 2001 | B1 |
6205154 | Schmidt et al. | Mar 2001 | B1 |
6219728 | Yin | Apr 2001 | B1 |
6223301 | Santeler et al. | Apr 2001 | B1 |
6236660 | Heuer | May 2001 | B1 |
6237029 | Master et al. | May 2001 | B1 |
6266333 | Kartalopoulos | Jul 2001 | B1 |
6272151 | Gupta | Aug 2001 | B1 |
6314097 | Ohara | Nov 2001 | B1 |
6331978 | Ravikanth et al. | Dec 2001 | B1 |
6331989 | Tezuka | Dec 2001 | B1 |
6343326 | Acharya et al. | Jan 2002 | B2 |
6381244 | Nishimura et al. | Apr 2002 | B1 |
6408005 | Fan et al. | Jun 2002 | B1 |
6418145 | Isoyama et al. | Jul 2002 | B1 |
6463096 | Raleigh et al. | Oct 2002 | B1 |
6466591 | See et al. | Oct 2002 | B1 |
6466976 | Alles et al. | Oct 2002 | B1 |
6477168 | Delp et al. | Nov 2002 | B1 |
6487198 | Pierson, Jr. | Nov 2002 | B1 |
6498792 | Johnson et al. | Dec 2002 | B1 |
6611522 | Zheng et al. | Aug 2003 | B1 |
6647019 | McKeown et al. | Nov 2003 | B1 |
6658021 | Bromley et al. | Dec 2003 | B1 |
6667956 | Beshai et al. | Dec 2003 | B2 |
6771663 | Jha | Aug 2004 | B1 |
6909720 | Willis | Jun 2005 | B1 |
6975631 | Kastenholz | Dec 2005 | B1 |
6980543 | Kastenholz et al. | Dec 2005 | B1 |
7065037 | Viswanathan et al. | Jun 2006 | B1 |
7100020 | Brightman et al. | Aug 2006 | B1 |
7586919 | Willis | Sep 2009 | B2 |
7809015 | Willis et al. | Oct 2010 | B1 |
20020041604 | Ferguson | Apr 2002 | A1 |
20050201387 | Willis | Sep 2005 | A1 |
20100322242 | Willis et al. | Dec 2010 | A1 |
Number | Date | Country |
---|---|---|
A-4851197 | Jun 1998 | AU |
0797373 | Sep 1997 | EP |
WO 9403004 | Mar 1994 | WO |
WO 9748211 | Dec 1997 | WO |
WO 9813764 | Apr 1998 | WO |
WO 9813975 | Apr 1998 | WO |
Entry |
---|
Co-pending U.S. Appl. No. 10/665,349, filed Sep. 22, 2003 entitled “Bundling ATM and POS Data in a Single Optical Channel” by Steven R. Willis et al., 59 pages. |
Kato et al., “TCP Gateway Improving Throughput of TCT/IP Over Wide Area ATM Networks,” XVI World Telecom Congress Proceedings, vol. 1, 1997, pp. 35-42. |
Keshav, “Issues and Trends in Router Design,” IEEE Communications Magazine, vol. 36(5), 1998, pp. 144-151. |
Parulkar, “A Strategy for Integrating IP with ATM,” Computer Communications Review, vol. 25(4), 1995 pp. 49-58. |
White, “ATM Switching and IP Routing Integration: The Next Stage in Internet Evolution?,” IEEE Communications Magazine, vol. 36(4), 1998, pp. 79-83. |
Newton, Newton's Telecom Dictionary, Flatiron Publishing, a division of Miller Freeman, Inc., 14th Edition, pp. 663 and 664. |
ITU, Network Node Interface for the Synchronous Digital Hierarch (SDH) (ITU G.707) dated Mar. 1996, pp. ii-132. |
David E. McDysan et al., “ATM Theory and Application,” 1994. |
Office Action from U.S. Appl. No. 12/510,342 dated Dec. 17, 2010, 13 pages. |
Number | Date | Country | |
---|---|---|---|
20100322242 A1 | Dec 2010 | US |
Number | Date | Country | |
---|---|---|---|
60090028 | Jun 1998 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09335947 | Jun 1999 | US |
Child | 10665349 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10665349 | Sep 2003 | US |
Child | 12869571 | US |