Call size feedback on PNNI operation

Information

  • Patent Grant
  • 6122272
  • Patent Number
    6,122,272
  • Date Filed
    Friday, May 23, 1997
    28 years ago
  • Date Issued
    Tuesday, September 19, 2000
    25 years ago
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.
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
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 (such as call size). 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.
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
  • 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.
US Referenced Citations (184)
Number Name Date Kind
RE33900 Howson Apr 1992
4131767 Weinstein Dec 1978
4161719 Parikh et al. Jul 1979
4316284 Howson Feb 1982
4397020 Howson Aug 1983
4419728 Larson Dec 1983
4424565 Larson Jan 1984
4437087 Petr Mar 1984
4438511 Baran Mar 1984
4439763 Limb Mar 1984
4445213 Baugh et al. Apr 1984
4446555 Devault et al. May 1984
4456957 Schieltz Jun 1984
4464658 Thelen Aug 1984
4499576 Fraser Feb 1985
4506358 Montgomery Mar 1985
4507760 Fraser Mar 1985
4532626 Flores et al. Jul 1985
4644532 George et al. Feb 1987
4646287 Larson et al. Feb 1987
4677423 Benvenuto et al. Jun 1987
4679189 Olson et al. Jul 1987
4679227 Hughes-Hartogs Jul 1987
4723267 Jones et al. Feb 1988
4731816 Hughes-Hartogs Mar 1988
4750136 Arpin et al. Jun 1988
4757495 Decker et al. Jul 1988
4763191 Gordon et al. Aug 1988
4769810 Eckberg, Jr. et al. Sep 1988
4769811 Eckberg, Jr. et al. Sep 1988
4771425 Baran et al. Sep 1988
4819228 Baran et al. Apr 1989
4827411 Arrowood et al. May 1989
4833706 Hughes-Hartogs May 1989
4835737 Herrig et al. May 1989
4879551 Georgiou et al. Nov 1989
4893306 Chao et al. Jan 1990
4903261 Baran et al. Feb 1990
4922486 Lidinsky et al. May 1990
4933937 Konishi Jun 1990
4960310 Cushing Oct 1990
4962497 Ferenc et al. Oct 1990
4962532 Kasiraj et al. Oct 1990
4965772 Daniel et al. Oct 1990
4970678 Sladowski et al. Nov 1990
4979118 Kheradqir Dec 1990
4980897 Decker et al. Dec 1990
4991169 Davis et al. Feb 1991
5003595 Collins et al. Mar 1991
5014265 Hahne et al. May 1991
5020058 Holden et al. May 1991
5033076 Jones et al. Jul 1991
5054034 Hughes-Hartogs Oct 1991
5059925 Weisbloom Oct 1991
5072449 Enns et al. Dec 1991
5088032 Bosack Feb 1992
5095480 Fenner Mar 1992
5115431 Williams et al. May 1992
5128945 Enns et al. Jul 1992
5136580 Videlock et al. Aug 1992
5166930 Braff et al. Nov 1992
5199049 Wilson Mar 1993
5206886 Bingham Apr 1993
5208811 Kashio et al. May 1993
5212686 Joy et al. May 1993
5224099 Corbalis et al. Jun 1993
5226120 Brown et al. Jul 1993
5228062 Bingham Jul 1993
5229994 Balzano et al. Jul 1993
5233604 Ahmadi et al. Aug 1993
5237564 Lespagnol et al. Aug 1993
5241682 Bryant et al. Aug 1993
5243342 Kattemalalavadi et al. Sep 1993
5243596 Port et al. Sep 1993
5247516 Bernstein et al. Sep 1993
5249178 Kurano et al. Sep 1993
5253251 Aramaki Oct 1993
5255291 Holden et al. Oct 1993
5260933 Rouse Nov 1993
5260978 Fleischer et al. Nov 1993
5268592 Bellamy et al. Dec 1993
5268900 Hluchyj et al. Dec 1993
5271004 Proctor et al. Dec 1993
5274631 Bhardwaj Dec 1993
5274635 Rahman et al. Dec 1993
5274643 Fisk Dec 1993
5280470 Buhrke et al. Jan 1994
5280480 Pitt et al. Jan 1994
5280500 Mazzola et al. Jan 1994
5283783 Nguyen et al. Feb 1994
5287103 Kasprzyk et al. Feb 1994
5287453 Roberts Feb 1994
5289462 Ahmadi et al. Feb 1994
5291482 McHarg et al. Mar 1994
5305311 Lyles Apr 1994
5307343 Bostica et al. Apr 1994
5309437 Perlman et al. May 1994
5311509 Heddes et al. May 1994
5313454 Bustini et al. May 1994
5313582 Hendel et al. May 1994
5317562 Nardin et al. May 1994
5319644 Liang Jun 1994
5327421 Hiller et al. Jul 1994
5331637 Francis et al. Jul 1994
5345445 Hiller et al. Sep 1994
5345446 Hiller et al. Sep 1994
5357507 Hughes et al. Oct 1994
5359592 Corbalis et al. Oct 1994
5361250 Nguyen et al. Nov 1994
5361256 Doeringer et al. Nov 1994
5361259 Hunt et al. Nov 1994
5365524 Hiller et al. Nov 1994
5367517 Cidon et al. Nov 1994
5371852 Attanasio et al. Dec 1994
5386567 Lien et al. Jan 1995
5390170 Sawant et al. Feb 1995
5390175 Hiller et al. Feb 1995
5394394 Crowther et al. Feb 1995
5394402 Ross Feb 1995
5400325 Chatwani et al. Mar 1995
5408469 Opher et al. Apr 1995
5416842 Aziz May 1995
5422880 Heitkamp et al. Jun 1995
5422882 Hiller et al. Jun 1995
5423002 Hart Jun 1995
5426636 Hiller et al. Jun 1995
5428607 Hiller et al. Jun 1995
5430715 Corbalis et al. Jul 1995
5430729 Rahnema Jul 1995
5442457 Najafi Aug 1995
5442630 Gagliardi et al. Aug 1995
5452297 Hiller et al. Sep 1995
5473599 Li et al. Dec 1995
5473607 Hausman et al. Dec 1995
5485455 Dobbins et al. Jan 1996
5490140 Abensour et al. Feb 1996
5490258 Fenner Feb 1996
5491687 Christensen et al. Feb 1996
5491804 Heath et al. Feb 1996
5497368 Reijnierse et al. Mar 1996
5504747 Sweazey Apr 1996
5509006 Wilford et al. Apr 1996
5517494 Green May 1996
5519704 Farinacci et al. May 1996
5519858 Walton et al. May 1996
5526489 Nilakantan et al. Jun 1996
5530963 Moore et al. Jun 1996
5535195 Lee Jul 1996
5539734 Burwell et al. Jul 1996
5541911 Nilakantan et al. Jul 1996
5546370 Ishikawa Aug 1996
5555244 Gupta et al. Sep 1996
5561669 Lenney et al. Oct 1996
5583862 Callon Dec 1996
5592470 Rudrapatna et al. Jan 1997
5598581 Daines et al. Jan 1997
5600798 Cherukuri et al. Feb 1997
5604868 Komine et al. Feb 1997
5608726 Virgile Mar 1997
5617417 Sathe et al. Apr 1997
5617421 Chin et al. Apr 1997
5630125 Zellweger May 1997
5631908 Saxe May 1997
5632021 Jennings et al. May 1997
5634010 Ciscon et al. May 1997
5644718 Belove et al. Jul 1997
5666353 Klausmeier et al. Sep 1997
5673265 Gupta et al. Sep 1997
5678006 Valizadeh et al. Oct 1997
5680116 Hashimoto et al. Oct 1997
5684797 Aznar et al. Nov 1997
5687324 Green et al. Nov 1997
5689499 Hullett et al. Nov 1997
5689506 Chiussi et al. Nov 1997
5719864 Badger et al. Feb 1998
5724351 Chao et al. Mar 1998
5748186 Raman May 1998
5754547 Nakazawa May 1998
5802054 Bellenger Sep 1998
5854903 Morrison et al. Dec 1998
5856981 Voelker Jan 1999
5892924 Lyon et al. Apr 1999
5898686 Virgile Apr 1999
5903559 Acharya et al. May 1999
Foreign Referenced Citations (1)
Number Date Country
0 384 758 A2 Feb 1990 EPX