US 6,356,530 B1Grant
Next hop selection in ATM networks
Issue Date:2002-03-12
•22 Claims
•2 Drawing Sheets
Abstract
The invention provides a method and system for selecting one particular interface between a pair of adjacent nodes in an ATM network for assignment to a call in that network. The cell rate available on each possible interface is examined and compared with the cell rate expected for the call, and one of the interfaces is selected and assigned responsive to those cell rates. (1) The interface can be chosen which preserves the maximum remaining cell rate for future calls. (2) The interface with the highest-speed available link can be chosen, so long as cell rate capacity is available on that interface for the call.
Metadata
Assignee
- Cisco Technology, Inc.
Inventors
- Marek Tomaszewski
- Ashok Chippa
- Ethan Spiegel
Application Information
Application Number:US 08/862,915
Filing Date:1997-05-23
Priority Date:1997-05-23
Art Unit:7
Classifications
IPC:
H04L 1226
Field of Search:
370395370397370399370227370230370232370233370234
Patent Drawings (2 sheets)
Description
Background of the Invention
[0002] 1. Field of the Invention
[0003] The invention relates to ATM networks.
[0004] 2. Related Art
[0005] In known ATM systems, each call is routed in a virtual circuit which is specified by the sending node. This circuit includes a plurality of ATM switches in a virtual circuit from the sending node to the receiving node. If two adjacent nodes in the virtual circuit have more than one interface connecting them, one of the plurality of interfaces must be specifically chosen and assigned to the call.
[0006] In some instances, the interface is specified by the sending node. However, when the particular interface is not specified by the sending node, the two adjacent nodes must select one of the plurality of interfaces. In known ATM systems, one interface is selected by round-robin assignment. While this method is effective to unambiguously select one of the plurality of interfaces, it has the drawback that the selected interface can be inappropriate for optimal call routing.
[0007] Accordingly, it would be desirable to provide a method and system for selecting one particular interface, which is more appropriate for optimal call routing. This advantage is achieved in an embodiment of the invention in which relative bandwidth or another characteristic of the plurality of interfaces, and in which relative size or another characteristic of the call, are examined and taken into account when one interface is specifically chosen and assigned to the call.
Summary of Invention
[0008] The invention provides a method and system for selecting one particular interface between a pair of adjacent nodes in an ATM network for assignment to a call in that network. The cell rate available on each possible interface is examined and compared with the cell rate expected for the call, and one of the interfaces is selected and assigned responsive to those cell rates.
[0009] In a first preferred embodiment, the interface is chosen which preserves the maximum remaining cell rate for future calls. In a second preferred embodiment, the interface with the highest-speed available link is chosen, so long as cell rate capacity is available on that interface for the call.
Brief Description of the Drawings
[0010] FIG. 1 shows a block diagram of an ATM network.
[0011] FIG. 2 shows a process flow diagram of a first method for selecting an interface for assignment to a call.
[0012] FIG. 3 shows a process flow diagram of a second method for selecting an interface for assignment to a call.
[0013] FIG. 4 shows a process flow diagram of a third method for selecting an interface for assignment to a call.
Detailed Description of the Preferred Embodiment
[0014] In the following description, a preferred embodiment of the invention is described with regard to preferred process steps and data structures. Those skilled in the art would recognize after perusal of this application that embodiments of the invention can be implemented using general purpose switching processors or special purpose switching processors or other circuits adapted to particular process steps and data structures described herein, and that implementation of the process steps and data structures described herein would not require undue experimentation or further invention.
[0015] Inventions described herein can be used in conjunction with inventions described in the following application:
[0016] Application No. 08/863,031, filed May 23, 1997, in the name of the same inventors, entitled Call Size Feedback on PNNI Operation, which issued as U.S. Pat. No. 6,122,272 on Sep. 19, 2000 and is assigned to the same assignee as the present application.
[0017] This application is hereby incorporated by reference as if fully set forth herein.
[0018] ATM Network Including Multiple Interfaces Between Adjacent Nodes
[0019] FIG. 1 shows a block diagram of an ATM network.
[0020] An ATM network 100 includes a plurality of ATM nodes 110, each of which is capable of transmitting ATM cells from a sending node 110 to a designated receiving node 110. Each pair of adjacent nodes 110 has at least one, and possibly more than one, interface 120. Each interface 120 is capable of transmitting ATM cells from a first adjacent node 110 to a second adjacent node 110.
[0021] When an incoming call is received at the sending node 110, that incoming call specifies a virtual circuit for the call, including the sending node 110, the designated receiving node 110, and a designated sequence of intermediate nodes 110, for transmitting ATM cells for the call from the sending node 110 to the receiving node 110. The incoming call may also specify other information about the call, such as a required cell transmission rate for the call.
[0022] When the virtual circuit for the call is set up, there may be one or more pairs of adjacent nodes 110 which have a plurality of interfaces 120 therebetween. In some cases, the incoming call will specify which of the interfaces 120 is to be included in the virtual circuit. In those case where the incoming call does not so specify, one of the methods shown herein is used to select one of the interfaces 120 for inclusion in the virtual circuit and thus for assignment to the call.
[0023] In preferred embodiments, the cell rate available on each possible interface is examined and compared with the cell rate expected for the call, and one of the interfaces is selected and assigned responsive to those cell rates.
[0024] First Method for Selecting Interface
[0025] FIG. 2 shows a process flow diagram of a first method for selecting an interface for assignment to a call.
[0026] A first method 200 applies to CBR (constant bit rate), RT-VBR (real time variable bit rate), and NRT-VBR (non-real time variable bit rate) traffic classes in an ATM network. The first method 200 includes the steps 211 through 214.
[0027] At a step 211, the method 200 identifies a plurality of interfaces 120 between the first adjacent node 110 and the second adjacent node 110.
[0028] At a step 212, the method 200 selects, from the interfaces 120 identified in the step 211, the ones which have sufficient AvCR (available cell rate) for the incoming call.
[0029] At a step 213, the method 200 orders the interfaces 120 selected in the step 212 in increasing order of AvCR.
[0030] At a step 214, the method 200 selects the first interface 120 in an ordered list generated by the step 213.
[0031] The first method thus choses the interface which preserves the maximum remaining cell rate for future calls.
[0032] Second Method for Selecting Interface
[0033] FIG. 3 shows a process flow diagram of a second method for selecting an interface for assignment to a call.
[0034] A second method 300 also applies to CBR (constant bit rate), RT-VBR (real time variable bit rate), and NRT-VBR (non-real time variable bit rate) traffic classes in an ATM network. The second method 300 includes the steps 311 through 313.
[0035] At a step 311 (like the step 211 performed by the method 200), the method 300 identifies a plurality of interfaces 120 between the first adjacent node 110 and the second adjacent node 110.
[0036] At a step 312, the method 300 orders the interfaces 120 identified in the step 311 in decreasing order of Maximum Cell Rate.
[0037] At a step 313, the method 300 selects the first interface 120 in an ordered list generated by the step 312.
[0038] The second method 300 thus choses the interface with the highest-speed available link is chosen, so long as cell rate capacity is available on that interface for the call.
[0039] Third Method for Selecting Interface
[0040] FIG. 4 shows a process flow diagram of a third method for selecting an interface for assignment to a call.
[0041] A third method 400 applies to ABR (available bit rate) and UBR (unspecified bit rate) traffic classes in an ATM network. The third method 400 includes the steps 411 through 414.
[0042] At a step 411 (like the step 211 performed by the method 200), the method 400 identifies a plurality of interfaces 120 between the first adjacent node 110 and the second adjacent node 110.
[0043] At a step 412, for each interface 120iidentified in the step 411, the method 400 determines the Available Cell Rate AvCR(i). The available cell rate is determined by subtracting, from the Maximum Cell Rate, the amount of bandwidth already reserved for that interface 120.
[0044] At a step 413, for each interface 120iidentified in the step 411, the method 400 determines the ratio AvCR(i)/(Ni+1), where Ni is the number of actual “best effort” virtual circuits which are using the interface 120 i.
[0045] At a step 414, the method 400 orders the interfaces identified in the step 411 in decreasing order of the ratio determined in the step 413.
[0046] At a step 415, the method 400 selects the first interface 120 in an ordered list generated by the step 414.
[0047] The third method 400 thus choses the interface which best balances the load of multiple calls across multiple interfaces, after subtracting reserved bandwidth from each interface.
[0048] Alternative Embodiments
[0049] Although preferred embodiments are disclosed herein, many variations are possible which remain within the concept, scope, and spirit of the invention, and these variations would become clear to those skilled in the art after perusal of this application.
Claims
What is claimed is:
1. A method comprising:
receiving a request for a virtual circuit in a node of a switching network;
retrieving an available cell rate to accommodate said virtual circuit for each interface of a plurality of interfaces between said node and a second node of said switching network, said second node being adjacent to said first node;
selecting said each interface having said available cell rate higher than a transmission cell rate for said virtual circuit; and
selecting an optimum interface from said each interface selected for inclusion in said virtual circuit, said optimum interface having a lowest available cell rate of said available cell rate of said each interface selected.
2. The method according to claim 1, wherein said switching network is an ATM network accommodating a constant bit rate (CBR) traffic class.
3. The method according to claim 1, wherein said switching network is an ATM network accommodating a real time variable bit rate (RT-VBR) traffic class.
4. The method according to claim 1, wherein said switching network is an ATM network accommodating a non real time variable bit rate (NTR-VBR) traffic class.
5. A method comprising:
receiving a request for a virtual circuit in a node of a switching network;
retrieving an available cell rate to accommodate said virtual circuit for each interface of a plurality of interfaces between said node and a second node of said switching network, said second node being adjacent to said first node, said each interface having a transmission speed rate;
selecting said each interface having said available cell rate higher than a transmission cell rate for said virtual circuit; and
selecting an optimum interface from said each interface selected for inclusion in said virtual circuit, said optimum interface having a highest transmission speed rate of said transmission speed rate of said each interface selected.
6. The method according to claim 5, wherein said switching network is an ATM network accommodating a constant bit rate (CBR) traffic class.
7. The method according to claim 5, wherein said switching network is an ATM network accommodating a real time variable bit rate (RT-VBR) traffic class.
8. The method according to claim 5, wherein said switching network is an ATM network accommodating a non real time variable bit rate (NTR-VBR) traffic class.
9. A method comprising:
receiving a request for a virtual circuit in a node of a switching network;
retrieving an available cell rate to accommodate said virtual circuit for each interface of a plurality of interfaces between said node and a second node of said switching network, said second node being adjacent to said first node;
calculating a ratio for said each interface, as said available cell rate divided by at least one existent virtual circuit in said each interface; and
selecting an optimum interface from said each interface for inclusion in said virtual circuit, said optimum interface having a highest ratio of said ratio of said each interface.
10. The method according to claim 9, wherein said switching network is an ATM network accommodating an available bit rate (ABR) traffic class.
11. The method according to claim 9, wherein said switching network is an ATM network accommodating an unspecified bit rate (UBR) traffic class.
12. A system comprising:
a first node in a switching network to receive a request for a virtual circuit; and
a second node in said switching network, adjacent to said first node and coupled to said first node through a plurality of interfaces;
said first node to retrieve an available cell rate to accommodate said virtual circuit for each interface of said plurality of interfaces, to select said each interface having said available cell rate higher than a transmission cell rate for said virtual circuit, and to select an optimum interface from said each interface selected, said optimum interface having a lowest available cell rate of said available cell rate of said each interface selected.
13. The system according to claim 12, wherein said switching network is an ATM network accommodating a constant bit rate (CBR) traffic class.
14. The system according to claim 12, wherein said switching network is an ATM network accommodating a real time variable bit rate (RT-VBR) traffic class.
15. The system according to claim 12, wherein said switching network is an ATM network accommodating a non real time variable bit rate (NTR-VBR) traffic class.
16. A system comprising:
a first node in a switching network to receive a request for a virtual circuit; and
a second node in said switching network, adjacent to said first node and coupled to said first node through a plurality of interfaces;
said first node to retrieve an available cell rate to accommodate said virtual circuit for each interface of said plurality of interfaces, said each interface having a transmission speed rate, to select said each interface having said available cell rate higher than a transmission cell rate for said virtual circuit, and to select an optimum interface from said each interface selected, said optimum interface having a highest transmission speed rate of said transmission speed rate of said each interface selected.
17. The system according to claim 16, wherein said switching network is an ATM network accommodating a constant bit rate (CBR) traffic class.
18. The system according to claim 16, wherein said switching network is an ATM network accommodating a real time variable bit rate (RT-VBR) traffic class.
19. The system according to claim 16, wherein said switching network is an ATM network accommodating a non real time variable bit rate (NTR-VBR) traffic class.
20. A system comprising:
a first node in a switching network to receive a request for a virtual circuit; and
a second node in said switching network, adjacent to said first node and coupled to said first node through a plurality of interfaces;
said first node to retrieve an available cell rate to accommodate said virtual circuit for each interface of said plurality of interfaces, to calculate a ratio for said each interface, as said available cell rate divided by at least one existent virtual circuit in said each interface, and to select said optimum interface having a highest ratio of said ratio of said each interface.
21. The system according to claim 20, wherein said switching network is an ATM network accommodating an available bit rate (ABR) traffic class.
22. The system according to claim 20, wherein said switching network is an ATM network accommodating an unspecified bit rate (UBR) traffic class.
Patent Citations (199)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4131767(A) | 1978-12-01 | Weinstein | Applicant |
| US4161719(A) | 1979-07-01 | Parikh et al. | Applicant |
| US4316284(A) | 1982-02-01 | Howson | Applicant |
| US4397020(A) | 1983-08-01 | Howson | Applicant |
| US4419728(A) | 1983-12-01 | Larson | Applicant |
| US4424565(A) | 1984-01-01 | Larson | Applicant |
| US4437087(A) | 1984-03-01 | Petr | Applicant |
| US4438511(A) | 1984-03-01 | Baran | Applicant |
| US4439763(A) | 1984-03-01 | Limb | Applicant |
| US4445213(A) | 1984-04-01 | Baugh et al. | Applicant |
| US4446555(A) | 1984-05-01 | Devault et al. | Applicant |
| US4456957(A) | 1984-06-01 | Schieltz | Applicant |
| US4464658(A) | 1984-08-01 | Thelen | Applicant |
| US4499576(A) | 1985-02-01 | Fraser | Applicant |
| US4506358(A) | 1985-03-01 | Montgomery | Applicant |
| US4507760(A) | 1985-03-01 | Fraser | Applicant |
| US4532626(A) | 1985-07-01 | Flores et al. | Applicant |
| US4644532(A) | 1987-02-01 | George et al. | Applicant |
| US4646287(A) | 1987-02-01 | Larson et al. | Applicant |
| US4677423(A) | 1987-06-01 | Benvenuto et al. | Applicant |
| US4679189(A) | 1987-07-01 | Olson et al. | Applicant |
| US4679227(A) | 1987-07-01 | Hughes-Hartogs | Applicant |
| US4723267(A) | 1988-02-01 | Jones et al. | Applicant |
| US4731816(A) | 1988-03-01 | Hughes-Hartogs | Applicant |
| US4750136(A) | 1988-06-01 | Arpin et al. | Applicant |
| US4757495(A) | 1988-07-01 | Decker et al. | Applicant |
| US4763191(A) | 1988-08-01 | Gordon et al. | Applicant |
| US4769810(A) | 1988-09-01 | Eckberg, Jr. et al. | Applicant |
| US4769811(A) | 1988-09-01 | Eckberg, Jr. et al. | Applicant |
| US4771425(A) | 1988-09-01 | Baran et al. | Applicant |
| US4819228(A) | 1989-04-01 | Baran et al. | Applicant |
| US4827411(A) | 1989-05-01 | Arrowood et al. | Applicant |
| US4833706(A) | 1989-05-01 | Hughes-Hartogs | Applicant |
| US4835737(A) | 1989-05-01 | Herrig et al. | Applicant |
| US4879551(A) | 1989-11-01 | Georgiou et al. | Applicant |
| US4893306(A) | 1990-01-01 | Chao et al. | Applicant |
| US4903261(A) | 1990-02-01 | Baran et al. | Applicant |
| US4922486(A) | 1990-05-01 | Lidinsky et al. | Applicant |
| US4933937(A) | 1990-06-01 | Konishi | Applicant |
| US4960310(A) | 1990-10-01 | Cushing | Applicant |
| US4962497(A) | 1990-10-01 | Ferenc et al. | Applicant |
| US4962532(A) | 1990-10-01 | Kasirai et al. | Applicant |
| US4965772(A) | 1990-10-01 | Daniel et al. | Applicant |
| US4970678(A) | 1990-11-01 | Sladowski et al. | Applicant |
| US4979118(A) | 1990-12-01 | Kheradpir | Applicant |
| US4980897(A) | 1990-12-01 | Decker et al. | Applicant |
| US4991169(A) | 1991-02-01 | Davis et al. | Applicant |
| US5003595(A) | 1991-03-01 | Collins et al. | Applicant |
| US5014265(A) | 1991-05-01 | Hahne et al. | Applicant |
| US5020058(A) | 1991-05-01 | Holden et al. | Applicant |
| US5033076(A) | 1991-07-01 | Jones et al. | Applicant |
| US5054034(A) | 1991-10-01 | Hughes-Hartogs | Applicant |
| US5059925(A) | 1991-10-01 | Weisbloom | Applicant |
| US5072449(A) | 1991-12-01 | Enns et al. | Applicant |
| US5088032(A) | 1992-02-01 | Bosack | Applicant |
| US5095480(A) | 1992-03-01 | Fenner | Applicant |
| USRE33900(E) | 1992-04-01 | Howson | Applicant |
| US5115431(A) | 1992-05-01 | Williams et al. | Applicant |
| US5115495(A) | 1992-05-01 | Tsuchiya et al. | Examiner |
| US5119367(A) | 1992-06-01 | Kawakatsu et al. | Examiner |
| US5128926(A) | 1992-07-01 | Perlman et al. | Examiner |
| US5128945(A) | 1992-07-01 | Enns et al. | Applicant |
| US5136580(A) | 1992-08-01 | Videlock et al. | Applicant |
| US5166930(A) | 1992-11-01 | Braff et al. | Applicant |
| US5189662(A) | 1993-02-01 | Kleine-Altekamp | Examiner |
| US5199049(A) | 1993-03-01 | Wilson | Applicant |
| US5206886(A) | 1993-04-01 | Bingham | Applicant |
| US5208811(A) | 1993-05-01 | Kashio et al. | Applicant |
| US5212686(A) | 1993-05-01 | Joy et al. | Applicant |
| US5224099(A) | 1993-06-01 | Corbalis et al. | Applicant |
| US5226120(A) | 1993-07-01 | Brown et al. | Applicant |
| US5228062(A) | 1993-07-01 | Bingham | Applicant |
| US5229994(A) | 1993-07-01 | Balzano et al. | Applicant |
| US5233604(A) | 1993-08-01 | Ahmadi et al. | Examiner |
| US5237564(A) | 1993-08-01 | Lespagnol et al. | Applicant |
| US5241682(A) | 1993-08-01 | Bryant et al. | Applicant |
| US5243342(A) | 1993-09-01 | Kattemalalavadi et al. | Applicant |
| US5243596(A) | 1993-09-01 | Port et al. | Applicant |
| US5247516(A) | 1993-09-01 | Bernstein et al. | Applicant |
| US5249178(A) | 1993-09-01 | Kurano et al. | Applicant |
| US5253251(A) | 1993-10-01 | Aramaki | Applicant |
| US5255291(A) | 1993-10-01 | Holden et al. | Applicant |
| US5260933(A) | 1993-11-01 | Rouse | Applicant |
| US5260978(A) | 1993-11-01 | Fleischer et al.. | Applicant |
| US5268592(A) | 1993-12-01 | Bellamy et al. | Applicant |
| US5268900(A) | 1993-12-01 | Hluchyj et al. | Applicant |
| US5271004(A) | 1993-12-01 | Proctor et al. | Applicant |
| US5274631(A) | 1993-12-01 | Bhardwaj | Applicant |
| US5274635(A) | 1993-12-01 | Rahman et al. | Applicant |
| US5274643(A) | 1993-12-01 | Fisk | Applicant |
| US5280470(A) | 1994-01-01 | Buhrke et al. | Applicant |
| US5280480(A) | 1994-01-01 | Pitt et al. | Applicant |
| US5280500(A) | 1994-01-01 | Mazzola et al. | Applicant |
| US5283783(A) | 1994-02-01 | Nguyen et al. | Applicant |
| US5287103(A) | 1994-02-01 | Kasprzyk et al. | Applicant |
| US5287453(A) | 1994-02-01 | Roberts | Applicant |
| US5291482(A) | 1994-03-01 | McHarg et al. | Applicant |
| US5305311(A) | 1994-04-01 | Lyles | Applicant |
| US5307343(A) | 1994-04-01 | Bostica et al. | Applicant |
| US5309437(A) | 1994-05-01 | Perlman et al. | Applicant |
| US5311509(A) | 1994-05-01 | Heddes et al. | Applicant |
| US5313454(A) | 1994-05-01 | Bustini et al. | Applicant |
| US5313582(A) | 1994-05-01 | Hendel et al. | Applicant |
| US5317562(A) | 1994-05-01 | Nardin et al. | Applicant |
| US5319644(A) | 1994-06-01 | Liang | Applicant |
| US5327421(A) | 1994-07-01 | Hiller et al. | Applicant |
| US5331637(A) | 1994-07-01 | Francis et al. | Applicant |
| US5345445(A) | 1994-09-01 | Hiller et al. | Applicant |
| US5345446(A) | 1994-09-01 | Hiller et al. | Applicant |
| US5359592(A) | 1994-10-01 | Corbalis et al. | Applicant |
| US5361250(A) | 1994-11-01 | Nguyen et al. | Applicant |
| US5361256(A) | 1994-11-01 | Doeringer et al. | Applicant |
| US5361259(A) | 1994-11-01 | Hunt et al. | Applicant |
| US5365524(A) | 1994-11-01 | Hiller et al. | Applicant |
| US5367517(A) | 1994-11-01 | Cidon et al. | Applicant |
| US5371852(A) | 1994-12-01 | Attanasio et al. | Applicant |
| US5386567(A) | 1995-01-01 | Lien et al. | Applicant |
| US5390170(A) | 1995-02-01 | Sawant et al. | Applicant |
| US5390175(A) | 1995-02-01 | Hiller et al. | Applicant |
| US5394394(A) | 1995-02-01 | Crowther et al. | Applicant |
| US5394402(A) | 1995-02-01 | Ross | Applicant |
| US5400325(A) | 1995-03-01 | Chatwani et al. | Applicant |
| US5408469(A) | 1995-04-01 | Opher et al. | Applicant |
| US5416842(A) | 1995-05-01 | Aziz | Applicant |
| US5422880(A) | 1995-06-01 | Heitkamp et al. | Applicant |
| US5422882(A) | 1995-06-01 | Hiller et al. | Applicant |
| US5423002(A) | 1995-06-01 | Hart | Applicant |
| US5426636(A) | 1995-06-01 | Hiller et al. | Applicant |
| US5428607(A) | 1995-06-01 | Hiller et al. | Applicant |
| US5430715(A) | 1995-07-01 | Corbalis et al. | Applicant |
| US5430729(A) | 1995-07-01 | Rahnema | Applicant |
| US5442457(A) | 1995-08-01 | Najafi | Applicant |
| US5442630(A) | 1995-08-01 | Gagliardi et al. | Applicant |
| US5452294(A) | 1995-09-01 | Natarajan | Examiner |
| US5452297(A) | 1995-09-01 | Hiller et al. | Applicant |
| US5473599(A) | 1995-12-01 | Li et al. | Applicant |
| US5473607(A) | 1995-12-01 | Hausman et al. | Applicant |
| US5477541(A) | 1995-12-01 | White et al. | Applicant |
| US5485455(A) | 1996-01-01 | Dobbins et al. | Applicant |
| US5490140(A) | 1996-02-01 | Abensour et al. | Applicant |
| US5490258(A) | 1996-02-01 | Fenner | Applicant |
| US5491687(A) | 1996-02-01 | Christensen et al. | Applicant |
| US5491804(A) | 1996-02-01 | Heath et al. | Applicant |
| US5497368(A) | 1996-03-01 | Reijnierse et al. | Applicant |
| US5504747(A) | 1996-04-01 | Sweasey | Applicant |
| US5509006(A) | 1996-04-01 | Wilford et al. | Applicant |
| US5517494(A) | 1996-05-01 | Green | Applicant |
| US5519704(A) | 1996-05-01 | Farinacci et al. | Applicant |
| US5519858(A) | 1996-05-01 | Walton et al. | Applicant |
| US5526489(A) | 1996-06-01 | Nilakantan et al. | Applicant |
| US5530963(A) | 1996-06-01 | Moore et al. | Applicant |
| US5535195(A) | 1996-07-01 | Lee | Applicant |
| US5539734(A) | 1996-07-01 | Burwell et al. | Applicant |
| US5541911(A) | 1996-07-01 | Nilakantan et al. | Applicant |
| US5546370(A) | 1996-08-01 | Ishikawa | Applicant |
| US5555244(A) | 1996-09-01 | Gupta et al. | Applicant |
| US5561669(A) | 1996-10-01 | Lenney et al. | Applicant |
| US5583862(A) | 1996-12-01 | Callon | Applicant |
| US5592470(A) | 1997-01-01 | Rudrapatna et al. | Applicant |
| US5598581(A) | 1997-01-01 | Daines et al. | Applicant |
| US5600798(A) | 1997-02-01 | Cherukuri et al. | Applicant |
| US5604868(A) | 1997-02-01 | Komine et al. | Applicant |
| US5608726(A) | 1997-03-01 | Virgile | Applicant |
| US5617417(A) | 1997-04-01 | Sathe et al. | Applicant |
| US5617421(A) | 1997-04-01 | Chin et al. | Applicant |
| US5630125(A) | 1997-05-01 | Zellweger | Applicant |
| US5631908(A) | 1997-05-01 | Saxe | Applicant |
| US5632021(A) | 1997-05-01 | Jennings et al. | Applicant |
| US5634010(A) | 1997-05-01 | Ciscon et al. | Applicant |
| US5638359(A) | 1997-06-01 | Peltola et al. | Applicant |
| US5644718(A) | 1997-07-01 | Belove et al. | Applicant |
| US5659684(A) | 1997-08-01 | Giovannoni et al. | Applicant |
| US5666353(A) | 1997-09-01 | Klausmeier et al. | Applicant |
| US5673265(A) | 1997-09-01 | Gupta et al. | Applicant |
| US5678006(A) | 1997-10-01 | Valizadeh et al. | Applicant |
| US5680116(A) | 1997-10-01 | Hashimoto et al. | Applicant |
| US5684797(A) | 1997-11-01 | Aznar et al. | Applicant |
| US5687324(A) | 1997-11-01 | Green et al. | Applicant |
| US5689506(A) | 1997-11-01 | Chiussi et al. | Applicant |
| US5694390(A) | 1997-12-01 | Yamato et al. | Applicant |
| US5724351(A) | 1998-03-01 | Chao et al. | Applicant |
| US5748186(A) | 1998-05-01 | Raman | Applicant |
| US5748617(A) | 1998-05-01 | McLain, Jr. | Applicant |
| US5754547(A) | 1998-05-01 | Nakazawa | Applicant |
| US5802054(A) | 1998-09-01 | Bellenger | Applicant |
| US5835710(A) | 1998-11-01 | Nagami et al. | Applicant |
| US5854903(A) | 1998-12-01 | Morrison et al. | Applicant |
| US5856981(A) | 1999-01-01 | Voelker | Applicant |
| US5892924(A) | 1999-04-01 | Lyon et al. | Applicant |
| US5898686(A) | 1999-04-01 | Virgile | Applicant |
| US5903559(A) | 1999-05-01 | Acharya et al. | Applicant |
| US6167030(A) | 2000-12-01 | Kilkki et al. | Examiner |
| EP384758 | 1990-08-01 | Applicant | |
| EP431751 | 1991-06-01 | Applicant | |
| EP567217 | 1993-10-01 | Applicant | |
| WO93/07569 | 1993-04-01 | Applicant | |
| WO93/07692 | 1993-04-01 | Applicant | |
| WO94/01828 | 1994-01-01 | Applicant | |
| WO95/20850 | 1995-08-01 | Applicant |
Non-Patent Literature (12)
- William Stallings, Data and Computer Communications, pp: 329-333, Prentice Hall, Upper Saddle River, New Jersey 07458.Applicant
- Allen, M., “Novell IPX Over Various WAN Media (IPXW AN), ” Network Working Group, RFC 1551, Dec. 1993, pp. 1-22.Applicant
- Becker, D., “3c589.c: A 3c589 EtherLink3 ethernet driver for linux, ” [email protected], May 3, 1994,pp. 1-13.Applicant
- Chowdhury, et al., “Alternative Bandwitdth Allocation Algorithms for Packet Video in ATM Networks, ” INFOCOM 1992, PP. 1061-1068.Applicant
- Doeringer, W., “Routing on Longest-Matching Prefixes, ” IEEE/ACM Transactions in Networking, vol. 4, No. 1, Feb. 1996, pp. 86-97.Applicant
- Esaki, et al., “Datagram Delivery in an ATM-Internet, ” 2334b IEICE Transactions on Communications, Mar. 1994, No. 3, Tokyo, Japan.Applicant
- IBM Corporation, “Method and Apparatus for the Statistical Multiplexing of Voice, Data and Image Signals, ” IBM Technical Disclosure Bulletin, No. 6, Nov. 1992, pp.409-411.Applicant
- Pei, et al., “Putting Routing Tables in Silicon, ” IEEE Network Magazine, Jan. 1992, pp. 42-50.Applicant
- Perkins, D., “Requirements for an Internet Standard Point-to-Point Protocol, ” Network Working Group, RFC 1547, Dec. 1993, pp. 1-19.Applicant
- Simpson, W., “The Point-toPoint Protocol (PPP), ” Network Working Group, RFC 1548, Dec. 1993, pp. 1-53.Applicant
- Tsuchiya, P. F., “A Search Algorithm for Table Entries with Non-Contigious Wildcarding, ” Abstract, Bellcore.Applicant
- Zhang, et al., “Rate-Controlled Static-Priority Queueing, ” INFOCOM 1993, pp. 227-236.Applicant