US 6,122,272 AGrant

Call Size Feedback on PNNI Operation

Issue Date:2000-09-19

•28 Claims

•1 Drawing Sheets

Abstract

The invention provides a method and system for selecting routes in a switching network with resource reservation, such as an ATM network. A set of routes are periodically precomputed, so that routes are known between any sending node and any receiving node, subject to resource reservation requirements. Each incoming call has its resource requirements, such as call size, compared with a selected threshold, and if the requirements exceed the threshold, a route is dynamically recomputed for the call. Other aspects of routing may be responsive to the calls' resource requirements. For example, a ratio of required resources with quality-of-service restrictions to required resources without such restrictions may be used to determine whether to reject the call, responsive to the call's resource requirements. The call size may be compared against another selected threshold, and the decision to determine whether to use that ratio to reject the call may be made responsive to comparisons against one or both thresholds.

Metadata

Assignee

Cisco Technology, Inc.

Inventors

Marek Tomaszewski
Ashok Chippa
Ethan Spiegel

Application Information

Application Number:US 8630313

Filing Date:1997-05-23

Priority Date:1997-05-23

Art Unit:272

Classifications

IPC:

H04L 1228H04J 116

Field of Search:

370230;235;236;254;392;395;397;389;351;400

Patent Drawings (1 sheets)

Description

Background of the Invention

1. Field of the Invention

The invention relates to ATM networks.

2. Related Art

In known ATM systems, different calls can have different requirements for transmission bandwidth. The transmission bandwidth requirement for a call is termed its "size." For example, a videoconference call is considered "larger" than a simple voice call. When selecting a virtual circuit for routing each call in an ATM network, the size of the call is considered in determining which switching nodes to select for routing each call or which through, or if the call should be rejected due to a lack of transmission capacity.

Known ATM systems determine the route for the virtual circuit for each incoming call as the call enters the ATM network. However, one problem which has arisen in the art is that this operation requires substantial computation. Accordingly, while this method achieves the goal of determining the virtual circuit for each incoming call, it has the drawback of requiring substantial resources for computation, can delay processing of incoming calls, and can therefore result in lesser throughput of incoming calls by the ATM system.

One technique to reduce the computation intensity associated with route computation is to use precomputed routes. However, precomputed routes can produce paths that are less efficient from the point of view of bandwidth utilization than routes computed dynamically. It would be advantageous to dynamically route those calls which might have a significant impact on overall bandwidth utilization in the network.

Accordingly, it would be desirable to provide a method and system for selecting routes in an ATM network, which does not require excessive dynamic route computation. This advantage is achieved in an embodiment of the invention in which most routes are precomputed, but some routes are dynamically computed in response to call size, thus call size is used to determine or help determine whether a dynamically computed route should be used instead of a precomputed route.

Summary of Invention

In alternative embodiments, other aspects of routing may also be responsive to the calls' resource requirements (such as call size). For example, a ratio of required resources with quality-of-service restrictions to required resources without such restrictions may be used to determine whether to reject the call, responsive to the call's resource requirements. In such alternative embodiments, the call size may be compared against another selected threshold, and the decision to determine whether to use that ratio to reject the call may be made responsive to comparisons against one or both thresholds.

Brief Description of the Drawings

FIG. 1 shows a process flow diagram of a method for selecting routes in a switching network.

Detailed Description of the Preferred Embodiment

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.

Inventions described herein can be used in conjunction with inventions described in the following application:

Application Ser. No. 08/862,915, filed May 23, 1997, Express Mailing No. EM302071674, in the name of the same inventors, titled "Next Hop Selection in ATM Networks", having attorney docket number CIS-025.

This application is hereby incorporated by reference as if fully set forth herein.

Precomputed Routes or Dynamic Recomputation

FIG. 1 shows a process flow diagram of a method for selecting routes in a switching network.

A method 100 for selecting routes in a switching network includes the flow points 110 through 170, and steps therebetween. The method 100 is preferably performed in a switching network with resource reservation, such as an ATM network.

At a flow point 110, the switching network includes a set of nodes, including at least one sending node, at least one receiving node, and a plurality of routes between the sending nodes and the receiving nodes.

At a step 121, the method 100 precomputes a set of routes between each of the sending nodes and each of the receiving nodes, subject to resource reservation requirements.

The step 121 is periodically performed, so that precomputed routes are known between any of the sending nodes and any of the receiving nodes, and the routes which are known are subject to resource reservation requirements.

As used herein, the concept of "precomputed" routes includes schemes in which a set of routes, or a set of preferred routes, are determined independent of parameters of the call. This includes cases where some precomputed routes are in fact computed or partially computed at or near the time the call arrives, but are determined independent of parameters of the call such as call size. A fixed technique for determining a preferred route is a precomputed route, while a technique or selection among techniques which is responsive to the call size and determines different routes for calls having different sizes (as opposed to merely rejecting calls which are too large) is not a precomputed route.

At a flow point 130, an incoming call arrives at one of the sending nodes. The incoming call includes a designated receiving node and a set of resource requirements. For example, one such resource requirement is a call size for the incoming call.

The incoming call is preferably an incoming call in a telephone network to be routed using the ATM network.

At a step 141, the call size for the incoming call is compared with a first selected threshold. In a preferred embodiment, the first selected threshold is a static value set by an operator using a network management system for a peer group in the ATM network. For example, the static value may comprise a value such as about 1 megabit per second, or a value such as about 384 kilobits per second, so as to distinguish between ordinary voice telephone calls and videotelephone calls. In alternative embodiments, the first selected threshold may be dynamically determined in response to traffic in the ATM network or other factors. For example, the first selected threshold may be determined in response to the number and type of call requests received, so as to approximately limit the number of calls for which routes are dynamically computed to a selected limit.

At a step 142, if the call size for the incoming call exceeds the first selected threshold, the method 100 dynamically recomputes a route for the call (thus disregarding the precomputed routes). Otherwise, the method 100 does not perform the step 142.

Call Rejection For Excessive Resource Usage

At a step 143, the call size for the incoming call is compared with a second selected threshold. In a preferred embodiment, the second selected threshold is a static value; however, in alternative embodiments, the second selected threshold may be determined responsive to traffic in the ATM network or other factors, in similar manner as the first selected threshold is determined in the step 141.

At a step 144, if the call size for the incoming call does not exceed the second selected threshold, the method 100 continues with the flow point 150. Otherwise, the method 100 proceeds to determine an excess-usage ratio of required resources with quality-of-service restrictions to required resources without such restrictions.

To determine the ratio in the step 144, the method 100 performs the following sub-steps:

At a sub-step 144(a), the method 100 determines a first route for the incoming call without using quality of service restrictions.

At a sub-step 144(b), the method 100 determines a first weighted hop count n0 for the first route.

In a preferred embodiment, the first weighted hop count is computed by assigning a relatively lower administrative cost to relatively higher-speed interfaces. For example, the administrative cost for a hop can be inversely proportional to the total Maximum Cell Rate of interfaces available for that hop.

At a sub-step 144(c), the method 100 determines a second route for the incoming call, this time using quality of service restrictions.

The second route can require different switching nodes and can require more switching nodes than the first route, because quality of service restrictions restrict the nature of the interfaces through which the call can pass.

At a sub-step 144(d), the method 100 determines a second weighted hop count n1 for the second route.

In a preferred embodiment, the second weighted hop count is determined in like manner as the first weighted hop count. Thus, the second weighted hop count is computed by assigning a relatively lower administrative cost to relatively higher-speed interfaces.

At a sub-step 144(e), the method 100 determines the excess-usage ratio n1/n0.

At a step 145, if the excess-usage ratio n1/n0 determined in the step 144 exceeds a third selected threshold, the method 100 rejects the call.

In a preferred embodiment, the third selected threshold is a static value; however, in alternative embodiments, the third selected threshold may be determined responsive to traffic in the ATM network or other factors, in similar manner as the first selected threshold is determined in the step 141. In a preferred embodiment, the third selected threshold is an excess-usage ratio of about 1.5 to 1 for a relatively dense network, or about 2 or 3 to 1 for a relatively sparse network.

At a flow point 150, a route is known for the incoming call.

At a step 161, the incoming call is routed according to the known route.

At a flow point 170, the method 100 is complete.

Further Applicability of Resource Requirement Feedback

The resource requirements of the incoming call has broader applicability than determining (a) whether to dynamically recompute routes, or (b) whether to dynamically determine an excess-usage ratio and reject incoming calls responsive thereto.

For example, the method 100 can determine, responsive to the resources required by the incoming call (such as call size), whether to apply techniques relating to one or more of the following:

In a dynamic path recomputation protocol, such as in virtual path and virtual circuit recomputation, the call size can be used to determine for which calls to determine whether to reroute paths. For example, paths can be dynamically rerouted only for those calls which are large enough to make a significant difference.

In a system which transmits multicast information, the call size can be used to determine for which point to multipoint calls to attempt to optimize (or partially reoptimize) the multicast routing tree. Similarly, in a system which transmits multicast information and also receives point to point calls, the call size can be used to determine for which newly arrived calls to trigger an attempt to optimize (or partially reoptimize) multicast routing trees.

In other routing protocols which concern or involve dynamic path computation or resource reservation, the call size can be used to determine for which calls to attempt to perform dynamic path computation or resource reservation.

Alternative Embodiments

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, including the steps of precomputing a set of routes in a switching network, said routes being between a plurality of sending nodes and a plurality of receiving nodes; receiving a request for a virtual circuit at one of said sending nodes, said request including a designated receiving node; examining a set of resource requirements for said request; and choosing whether to dynamically compute a new route between said one sending node and said designated receiving node, responsive to whether any of said set of resource requirements exceeds a set of selected thresholds, said thresholds determined in response to a network parameter.

2. A method as in claim 1, wherein said switching network is an ATM network.

3. A method as in claim 1, wherein said request comprises an incoming call in a telephone network.

4. A method as in claim 1, wherein said resource requirements include a call size.

5. A method as in claim 1, wherein: said resource requirements include a call size; and said step of choosing includes the step of comparing said call size with a selected threshold.

6. A method, including the steps of receiving a request for a virtual circuit in a switching network, said network having a plurality of sending nodes and a plurality of receiving nodes, said request being received at a sending node; examining a set of resource requirements for said request; and choosing whether to dynamically compute a ratio of required resources with quality-of-service restrictions to required resources without such restrictions, responsive to whether any of said resource requirements exceeds a set of selected thresholds, said thresholds determined in response to a network parameter.

7. A method as in claim 6, wherein said switching network is an ATM network.

8. A method as in claim 6, wherein said request comprises an incoming call in a telephone network.

9. A method as in claim 6, wherein said resource requirements include a call size.

10. A method as in claim 6, wherein: said resource requirements include a call size; and said step of choosing includes the step of comparing said call size with a selected threshold.

11. A method as in claim 6, comprising the step of determining whether to reject said request, responsive to said dynamically computed ratio.

12. A node in a switching network, said node including: a periodic route determination mechanism configured to periodically precompute a set of routes in said switching network, said set of routes including a plurality of sending nodes and a plurality of receiving nodes; a receiver mechanism configured to receive a request for a virtual circuit including a designated receiving node; a determination mechanism configured to examine a set of resource requirements for said request received by the receiver mechanism; and a decision mechanism configured to choose whether to dynamically compute a new route between said node and said designated receiving node, responsive to whether any of said set of resource requirements exceeds a set of selected thresholds, said thresholds determined in response to a network parameter.

13. The node of claim 12, wherein said switching network is an ATM network.

14. The node of claim 12, wherein said request comprises an incoming call in a telephone network.

15. The node of claim 12, wherein said resource requirements include a call size.

16. The node of claim 12, wherein: said resource requirements include a call size; and the decision mechanism includes a comparison mechanism configured to compare said call size with a selected threshold.

17. A system including: a switching network having a plurality of sending nodes and a plurality of receiving nodes, one of said plurality of sending nodes being a designated sending node and one of said plurality of receiving nodes being a designated receiving node; a receiver mechanism configured to receive a request for a virtual circuit on said network, said receiver mechanism in communication with at least one of said designated sending node and said designated receiving node; a determination mechanism configured to examine a set of resource requirements for said request, said determination mechanism in communication with the receiver mechanism; and a decision mechanism configured to choose whether to dynamically compute a ratio of required resources with quality-of-service restrictions to required resources without such restrictions, responsive to whether any of said resource requirements exceeds a set of selected thresholds, said thresholds determined in response to a network parameter, said decision mechanism in communication with said determination mechanism.

18. The system of claim 17, wherein said switching network is an ATM network.

19. The system of claim 17, wherein said request comprises an incoming call in a telephone network.

20. The system of claim 17, wherein said resource requirements include a call size.

21. The system of claim 17, wherein said resource requirements include a call size; and the decision mechanism includes a comparison mechanism configured to compare said call size with a selected threshold.

22. The system of claim 17, further including a rejection mechanism configured to determine whether to reject said request, responsive to said dynamically computed ratio computed by the decision mechanism.

23. An object-oriented software system for selecting routes in a switching network with resource reservation said software system comprising: an object for receiving a request for a virtual circuit in a switching network, said network having a plurality of sending nodes and a plurality of receiving nodes, said request being received at a sending node; an object for examining a set of resource requirements for said request; and an object for choosing whether to dynamically compute a ratio of required resources with quality-of-service restrictions to required resources without such restrictions, responsive to whether any of said resource requirements exceeds a set of selected thresholds, said thresholds determined in response to a network parameter; wherein a set of actions carried out in operation of said software system are as depicted in the flow diagram of FIG. 1.

24. A software system as in claim 23, wherein said switching network is an ATM network.

25. A software system as in claim 23, wherein said request comprises an incoming call in a telephone network.

26. A software system as in claim 23, wherein said resource requirements include a call size.

27. A software system as in claim 23, wherein said resource requirements include a call size; and said step of choosing includes the step of comparing said call size with a selected threshold.

28. A software system as in claim 23, comprising the step of determining whether to reject said request, responsive to said dynamically computed ratio.

Patent Citations (191)

Patent	Date	Inventor
USRe33900	1992-04-01	Howson
US4131767	1978-12-01	Weinstein
US4161719	1979-07-01	Parikh et al.
US4316284	1982-02-01	Howson
US4397020	1983-08-01	Howson
US4419728	1983-12-01	Larson
US4424565	1984-01-01	Larson
US4437087	1984-03-01	Petr
US4438511	1984-03-01	Baran
US4439763	1984-03-01	Limb
US4445213	1984-04-01	Baugh et al.
US4446555	1984-05-01	Devault et al.
US4456957	1984-06-01	Schieltz
US4464658	1984-08-01	Thelen
US4499576	1985-02-01	Fraser
US4506358	1985-03-01	Montgomery
US4507760	1985-03-01	Fraser
US4532626	1985-07-01	Flores et al.
US4644532	1987-02-01	George et al.
US4646287	1987-02-01	Larson et al.
US4677423	1987-06-01	Benvenuto et al.
US4679189	1987-07-01	Olson et al.
US4679227	1987-07-01	Hughes-Hartogs
US4723267	1988-02-01	Jones et al.
US4731816	1988-03-01	Hughes-Hartogs
US4750136	1988-06-01	Arpin et al.
US4757495	1988-07-01	Decker et al.
US4763191	1988-08-01	Gordon et al.
US4769810	1988-09-01	Eckberg, Jr. et al.
US4769811	1988-09-01	Eckberg, Jr. et al.
US4771425	1988-09-01	Baran et al.
US4819228	1989-04-01	Baran et al.
US4827411	1989-05-01	Arrowood et al.
US4833706	1989-05-01	Hughes-Hartogs
US4835737	1989-05-01	Herrig et al.
US4879551	1989-11-01	Georgiou et al.
US4893306	1990-01-01	Chao et al.
US4903261	1990-02-01	Baran et al.
US4922486	1990-05-01	Lidinsky et al.
US4933937	1990-06-01	Konishi
US4960310	1990-10-01	Cushing
US4962497	1990-10-01	Ferenc et al.
US4962532	1990-10-01	Kasiraj et al.
US4965772	1990-10-01	Daniel et al.
US4970678	1990-11-01	Sladowski et al.
US4979118	1990-12-01	Kheradqir
US4980897	1990-12-01	Decker et al.
US4991169	1991-02-01	Davis et al.
US5003595	1991-03-01	Collins et al.
US5014265	1991-05-01	Hahne et al.
US5020058	1991-05-01	Holden et al.
US5033076	1991-07-01	Jones et al.
US5054034	1991-10-01	Hughes-Hartogs
US5059925	1991-10-01	Weisbloom
US5072449	1991-12-01	Enns et al.
US5088032	1992-02-01	Bosack
US5095480	1992-03-01	Fenner
US5115431	1992-05-01	Williams et al.
US5128945	1992-07-01	Enns et al.
US5136580	1992-08-01	Videlock et al.
US5166930	1992-11-01	Braff et al.
US5199049	1993-03-01	Wilson
US5206886	1993-04-01	Bingham
US5208811	1993-05-01	Kashio et al.
US5212686	1993-05-01	Joy et al.
US5224099	1993-06-01	Corbalis et al.
US5226120	1993-07-01	Brown et al.
US5228062	1993-07-01	Bingham
US5229994	1993-07-01	Balzano et al.
US5233604	1993-08-01	Ahmadi et al.
US5237564	1993-08-01	Lespagnol et al.
US5241682	1993-08-01	Bryant et al.
US5243342	1993-09-01	Kattemalalavadi et al.
US5243596	1993-09-01	Port et al.
US5247516	1993-09-01	Bernstein et al.
US5249178	1993-09-01	Kurano et al.
US5253251	1993-10-01	Aramaki
US5255291	1993-10-01	Holden et al.
US5260933	1993-11-01	Rouse
US5260978	1993-11-01	Fleischer et al.
US5268592	1993-12-01	Bellamy et al.
US5268900	1993-12-01	Hluchyj et al.
US5271004	1993-12-01	Proctor et al.
US5274631	1993-12-01	Bhardwaj
US5274635	1993-12-01	Rahman et al.
US5274643	1993-12-01	Fisk
US5280470	1994-01-01	Buhrke et al.
US5280480	1994-01-01	Pitt et al.
US5280500	1994-01-01	Mazzola et al.
US5283783	1994-02-01	Nguyen et al.
US5287103	1994-02-01	Kasprzyk et al.
US5287453	1994-02-01	Roberts
US5289462	1994-02-01	Ahmadi et al.
US5291482	1994-03-01	McHarg et al.
US5305311	1994-04-01	Lyles
US5307343	1994-04-01	Bostica et al.
US5309437	1994-05-01	Perlman et al.
US5311509	1994-05-01	Heddes et al.
US5313454	1994-05-01	Bustini et al.
US5313582	1994-05-01	Hendel et al.
US5317562	1994-05-01	Nardin et al.
US5319644	1994-06-01	Liang
US5327421	1994-07-01	Hiller et al.
US5331637	1994-07-01	Francis et al.
US5345445	1994-09-01	Hiller et al.
US5345446	1994-09-01	Hiller et al.
US5357507	1994-10-01	Hughes et al.
US5359592	1994-10-01	Corbalis et al.
US5361250	1994-11-01	Nguyen et al.
US5361256	1994-11-01	Doeringer et al.
US5361259	1994-11-01	Hunt et al.
US5365524	1994-11-01	Hiller et al.
US5367517	1994-11-01	Cidon et al.
US5371852	1994-12-01	Attanasio et al.
US5386567	1995-01-01	Lien et al.
US5390170	1995-02-01	Sawant et al.
US5390175	1995-02-01	Hiller et al.
US5394394	1995-02-01	Crowther et al.
US5394402	1995-02-01	Ross
US5400325	1995-03-01	Chatwani et al.
US5408469	1995-04-01	Opher et al.
US5416842	1995-05-01	Aziz
US5422880	1995-06-01	Heitkamp et al.
US5422882	1995-06-01	Hiller et al.
US5423002	1995-06-01	Hart
US5426636	1995-06-01	Hiller et al.
US5428607	1995-06-01	Hiller et al.
US5430715	1995-07-01	Corbalis et al.
US5430729	1995-07-01	Rahnema
US5442457	1995-08-01	Najafi
US5442630	1995-08-01	Gagliardi et al.
US5452297	1995-09-01	Hiller et al.
US5473599	1995-12-01	Li et al.
US5473607	1995-12-01	Hausman et al.
US5485455	1996-01-01	Dobbins et al.
US5490140	1996-02-01	Abensour et al.
US5490258	1996-02-01	Fenner
US5491687	1996-02-01	Christensen et al.
US5491804	1996-02-01	Heath et al.
US5497368	1996-03-01	Reijnierse et al.
US5504747	1996-04-01	Sweazey
US5509006	1996-04-01	Wilford et al.
US5517494	1996-05-01	Green
US5519704	1996-05-01	Farinacci et al.
US5519858	1996-05-01	Walton et al.
US5526489	1996-06-01	Nilakantan et al.
US5530963	1996-06-01	Moore et al.
US5535195	1996-07-01	Lee
US5539734	1996-07-01	Burwell et al.
US5541911	1996-07-01	Nilakantan et al.
US5546370	1996-08-01	Ishikawa
US5555244	1996-09-01	Gupta et al.
US5561669	1996-10-01	Lenney et al.
US5583862	1996-12-01	Callon
US5592470	1997-01-01	Rudrapatna et al.
US5598581	1997-01-01	Daines et al.
US5600798	1997-02-01	Cherukuri et al.
US5604868	1997-02-01	Komine et al.
US5608726	1997-03-01	Virgile
US5617417	1997-04-01	Sathe et al.
US5617421	1997-04-01	Chin et al.
US5630125	1997-05-01	Zellweger
US5631908	1997-05-01	Saxe
US5632021	1997-05-01	Jennings et al.
US5634010	1997-05-01	Ciscon et al.
US5644718	1997-07-01	Belove et al.
US5666353	1997-09-01	Klausmeier et al.
US5673265	1997-09-01	Gupta et al.
US5678006	1997-10-01	Valizadeh et al.
US5680116	1997-10-01	Hashimoto et al.
US5684797	1997-11-01	Aznar et al.
US5687324	1997-11-01	Green et al.
US5689499	1997-11-01	Hullett et al.
US5689506	1997-11-01	Chiussi et al.
US5719864	1998-02-01	Badger et al.
US5724351	1998-03-01	Chao et al.
US5748186	1998-05-01	Raman
US5754547	1998-05-01	Nakazawa
US5802054	1998-09-01	Bellenger
US5854903	1998-12-01	Morrison et al.
US5856981	1999-01-01	Voelker
US5892924	1999-04-01	Lyon et al.
US5898686	1999-04-01	Virgile
US5903559	1999-05-01	Acharya et al.
EPX384758A2	1990-02-01
EPX431751A1	1990-11-01
EPX567217A2	1993-10-01
WOXWO93/07692	1993-04-01
WOXWO93/07569	1993-04-01
WOXWO94/01828	1994-01-01
WOXWO95/20850	1995-08-01

Non-Patent Literature (13)

Stallings, Data and Computer Communications, PP:329-333, 1996.
William Stallings, Data and Computer Communications, PP: 329-333, Prentice Hall, Upper Saddle River, New Jersey 07458.
Allen, M., "Novell IPX Over Various WAN Media (IPXW AN)," Network Working Group, RFC 1551, Dec. 1993, pp. 1-22.
Becker, D., "3c589.c: A 3c589 EtherLink3 ethernet driver for linux." [email protected], May 3, 1994, pp. 1-13.
Chowdhury, et al., "Alternative Bandwidth Allocation Algorithms for Packet Video in ATM Networks," INFOCOM 1992, pp. 1061-1068.
Doeringer, W., "Routing on Longest-Matching Prefixes," IEEE/ACM Transactions in Networking, vol. 4, No. 1, Feb. 1996, pp. 86-97.
Esaki, et al., "Datagram Delivery in an ATM-Internet," 2334b IEICE Transactions on Communications, Mar. 1994, No. 3, Tokyo, Japan.
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.
Pei, et al., "Putting Routing Tables in Silicon," IEEE Network Magazine, Jan. 1992, pp. 42-50.
Perkins, D., "Requirements for an Internet Standard Point-to-Point Protocol," Network Working Group, RFC 1547, Dec. 1993, pp. 1-19.
Simpson, W., "The Point-to-Point Protocol (PPP)," Network Working Group, RFC 1548, Dec. 1993, pp. 1-53.
Tsuchiya, P.F., "A Search Algorithm for Table Entries with Non-contiguous Wildcarding," Abstract, Bellcore.
Zhang, et al., "Rate-Controlled Static-Priority Queueing," INFOCOM 1993, pp. 227-236.

Abstract

Description