Next hop selection in ATM networks

Information

  • Patent Grant
  • 6356530
  • Patent Number
    6,356,530
  • Date Filed
    Friday, May 23, 1997
    27 years ago
  • Date Issued
    Tuesday, March 12, 2002
    23 years ago
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.
Description




BACKGROUND OF THE INVENTION




1. Field of the Invention




The invention relates to ATM networks.




2. Related Art




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.




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.




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




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.




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





FIG. 1

shows a block diagram of an ATM network.





FIG. 2

shows a process flow diagram of a first method for selecting an interface for assignment to a call.





FIG. 3

shows a process flow diagram of a second method for selecting an interface for assignment to a call.





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




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 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.




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




ATM Network Including Multiple Interfaces Between Adjacent Nodes





FIG. 1

shows a block diagram of an ATM network.




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


.




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.




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.




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.




First Method for Selecting Interface





FIG. 2

shows a process flow diagram of a first method for selecting an interface for assignment to a call.




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


.




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


.




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.




At a step


213


, the method


200


orders the interfaces


120


selected in the step


212


in increasing order of AvCR.




At a step


214


, the method


200


selects the first interface


120


in an ordered list generated by the step


213


.




The first method thus choses the interface which preserves the maximum remaining cell rate for future calls.




Second Method for Selecting Interface





FIG. 3

shows a process flow diagram of a second method for selecting an interface for assignment to a call.




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


.




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


.




At a step


312


, the method


300


orders the interfaces


120


identified in the step


311


in decreasing order of Maximum Cell Rate.




At a step


313


, the method


300


selects the first interface


120


in an ordered list generated by the step


312


.




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.




Third Method for Selecting Interface





FIG. 4

shows a process flow diagram of a third method for selecting an interface for assignment to a call.




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


.




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


.




At a step


412


, for each interface


120




i


identified 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


.




At a step


413


, for each interface


120




i


identified 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.




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


.




At a step


415


, the method


400


selects the first interface


120


in an ordered list generated by the step


414


.




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.




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 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.
US Referenced Citations (192)
Number Name Date Kind
4131767 Weinstein Dec 1978 A
4161719 Parikh et al. Jul 1979 A
4316284 Howson Feb 1982 A
4397020 Howson Aug 1983 A
4419728 Larson Dec 1983 A
4424565 Larson Jan 1984 A
4437087 Petr Mar 1984 A
4438511 Baran Mar 1984 A
4439763 Limb Mar 1984 A
4445213 Baugh et al. Apr 1984 A
4446555 Devault et al. May 1984 A
4456957 Schieltz Jun 1984 A
4464658 Thelen Aug 1984 A
4499576 Fraser Feb 1985 A
4506358 Montgomery Mar 1985 A
4507760 Fraser Mar 1985 A
4532626 Flores et al. Jul 1985 A
4644532 George et al. Feb 1987 A
4646287 Larson et al. Feb 1987 A
4677423 Benvenuto et al. Jun 1987 A
4679189 Olson et al. Jul 1987 A
4679227 Hughes-Hartogs Jul 1987 A
4723267 Jones et al. Feb 1988 A
4731816 Hughes-Hartogs Mar 1988 A
4750136 Arpin et al. Jun 1988 A
4757495 Decker et al. Jul 1988 A
4763191 Gordon et al. Aug 1988 A
4769810 Eckberg, Jr. et al. Sep 1988 A
4769811 Eckberg, Jr. et al. Sep 1988 A
4771425 Baran et al. Sep 1988 A
4819228 Baran et al. Apr 1989 A
4827411 Arrowood et al. May 1989 A
4833706 Hughes-Hartogs May 1989 A
4835737 Herrig et al. May 1989 A
4879551 Georgiou et al. Nov 1989 A
4893306 Chao et al. Jan 1990 A
4903261 Baran et al. Feb 1990 A
4922486 Lidinsky et al. May 1990 A
4933937 Konishi Jun 1990 A
4960310 Cushing Oct 1990 A
4962497 Ferenc et al. Oct 1990 A
4962532 Kasirai et al. Oct 1990 A
4965772 Daniel et al. Oct 1990 A
4970678 Sladowski et al. Nov 1990 A
4979118 Kheradpir Dec 1990 A
4980897 Decker et al. Dec 1990 A
4991169 Davis et al. Feb 1991 A
5003595 Collins et al. Mar 1991 A
5014265 Hahne et al. May 1991 A
5020058 Holden et al. May 1991 A
5033076 Jones et al. Jul 1991 A
5054034 Hughes-Hartogs Oct 1991 A
5059925 Weisbloom Oct 1991 A
5072449 Enns et al. Dec 1991 A
5088032 Bosack Feb 1992 A
5095480 Fenner Mar 1992 A
RE33900 Howson Apr 1992 E
5115431 Williams et al. May 1992 A
5115495 Tsuchiya et al. May 1992 A
5119367 Kawakatsu et al. Jun 1992 A
5128926 Perlman et al. Jul 1992 A
5128945 Enns et al. Jul 1992 A
5136580 Videlock et al. Aug 1992 A
5166930 Braff et al. Nov 1992 A
5189662 Kleine-Altekamp Feb 1993 A
5199049 Wilson Mar 1993 A
5206886 Bingham Apr 1993 A
5208811 Kashio et al. May 1993 A
5212686 Joy et al. May 1993 A
5224099 Corbalis et al. Jun 1993 A
5226120 Brown et al. Jul 1993 A
5228062 Bingham Jul 1993 A
5229994 Balzano et al. Jul 1993 A
5233604 Ahmadi et al. Aug 1993 A
5237564 Lespagnol et al. Aug 1993 A
5241682 Bryant et al. Aug 1993 A
5243342 Kattemalalavadi et al. Sep 1993 A
5243596 Port et al. Sep 1993 A
5247516 Bernstein et al. Sep 1993 A
5249178 Kurano et al. Sep 1993 A
5253251 Aramaki Oct 1993 A
5255291 Holden et al. Oct 1993 A
5260933 Rouse Nov 1993 A
5260978 Fleischer et al.. Nov 1993 A
5268592 Bellamy et al. Dec 1993 A
5268900 Hluchyj et al. Dec 1993 A
5271004 Proctor et al. Dec 1993 A
5274631 Bhardwaj Dec 1993 A
5274635 Rahman et al. Dec 1993 A
5274643 Fisk Dec 1993 A
5280470 Buhrke et al. Jan 1994 A
5280480 Pitt et al. Jan 1994 A
5280500 Mazzola et al. Jan 1994 A
5283783 Nguyen et al. Feb 1994 A
5287103 Kasprzyk et al. Feb 1994 A
5287453 Roberts Feb 1994 A
5291482 McHarg et al. Mar 1994 A
5305311 Lyles Apr 1994 A
5307343 Bostica et al. Apr 1994 A
5309437 Perlman et al. May 1994 A
5311509 Heddes et al. May 1994 A
5313454 Bustini et al. May 1994 A
5313582 Hendel et al. May 1994 A
5317562 Nardin et al. May 1994 A
5319644 Liang Jun 1994 A
5327421 Hiller et al. Jul 1994 A
5331637 Francis et al. Jul 1994 A
5345445 Hiller et al. Sep 1994 A
5345446 Hiller et al. Sep 1994 A
5359592 Corbalis et al. Oct 1994 A
5361250 Nguyen et al. Nov 1994 A
5361256 Doeringer et al. Nov 1994 A
5361259 Hunt et al. Nov 1994 A
5365524 Hiller et al. Nov 1994 A
5367517 Cidon et al. Nov 1994 A
5371852 Attanasio et al. Dec 1994 A
5386567 Lien et al. Jan 1995 A
5390170 Sawant et al. Feb 1995 A
5390175 Hiller et al. Feb 1995 A
5394394 Crowther et al. Feb 1995 A
5394402 Ross Feb 1995 A
5400325 Chatwani et al. Mar 1995 A
5408469 Opher et al. Apr 1995 A
5416842 Aziz May 1995 A
5422880 Heitkamp et al. Jun 1995 A
5422882 Hiller et al. Jun 1995 A
5423002 Hart Jun 1995 A
5426636 Hiller et al. Jun 1995 A
5428607 Hiller et al. Jun 1995 A
5430715 Corbalis et al. Jul 1995 A
5430729 Rahnema Jul 1995 A
5442457 Najafi Aug 1995 A
5442630 Gagliardi et al. Aug 1995 A
5452294 Natarajan Sep 1995 A
5452297 Hiller et al. Sep 1995 A
5473599 Li et al. Dec 1995 A
5473607 Hausman et al. Dec 1995 A
5477541 White et al. Dec 1995 A
5485455 Dobbins et al. Jan 1996 A
5490140 Abensour et al. Feb 1996 A
5490258 Fenner Feb 1996 A
5491687 Christensen et al. Feb 1996 A
5491804 Heath et al. Feb 1996 A
5497368 Reijnierse et al. Mar 1996 A
5504747 Sweasey Apr 1996 A
5509006 Wilford et al. Apr 1996 A
5517494 Green May 1996 A
5519704 Farinacci et al. May 1996 A
5519858 Walton et al. May 1996 A
5526489 Nilakantan et al. Jun 1996 A
5530963 Moore et al. Jun 1996 A
5535195 Lee Jul 1996 A
5539734 Burwell et al. Jul 1996 A
5541911 Nilakantan et al. Jul 1996 A
5546370 Ishikawa Aug 1996 A
5555244 Gupta et al. Sep 1996 A
5561669 Lenney et al. Oct 1996 A
5583862 Callon Dec 1996 A
5592470 Rudrapatna et al. Jan 1997 A
5598581 Daines et al. Jan 1997 A
5600798 Cherukuri et al. Feb 1997 A
5604868 Komine et al. Feb 1997 A
5608726 Virgile Mar 1997 A
5617417 Sathe et al. Apr 1997 A
5617421 Chin et al. Apr 1997 A
5630125 Zellweger May 1997 A
5631908 Saxe May 1997 A
5632021 Jennings et al. May 1997 A
5634010 Ciscon et al. May 1997 A
5638359 Peltola et al. Jun 1997 A
5644718 Belove et al. Jul 1997 A
5659684 Giovannoni et al. Aug 1997 A
5666353 Klausmeier et al. Sep 1997 A
5673265 Gupta et al. Sep 1997 A
5678006 Valizadeh et al. Oct 1997 A
5680116 Hashimoto et al. Oct 1997 A
5684797 Aznar et al. Nov 1997 A
5687324 Green et al. Nov 1997 A
5689506 Chiussi et al. Nov 1997 A
5694390 Yamato et al. Dec 1997 A
5724351 Chao et al. Mar 1998 A
5748186 Raman May 1998 A
5748617 McLain, Jr. May 1998 A
5754547 Nakazawa May 1998 A
5802054 Bellenger Sep 1998 A
5835710 Nagami et al. Nov 1998 A
5854903 Morrison et al. Dec 1998 A
5856981 Voelker Jan 1999 A
5892924 Lyon et al. Apr 1999 A
5898686 Virgile Apr 1999 A
5903559 Acharya et al. May 1999 A
6167030 Kilkki et al. Dec 2000 A
Foreign Referenced Citations (7)
Number Date Country
0 384 758 Aug 1990 EP
0 431 751 Jun 1991 EP
0 567 217 Oct 1993 EP
WO9307569 Apr 1993 WO
WO9307692 Apr 1993 WO
WO9401828 Jan 1994 WO
WO9520850 Aug 1995 WO
Non-Patent Literature Citations (12)
Entry
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, ” becker@CESDIS.gsfc.nasa.gov, May 3, 1994,pp. 1-13.
Chowdhury, et al., “Alternative Bandwitdth 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-toPoint Protocol (PPP), ” Network Working Group, RFC 1548, Dec. 1993, pp. 1-53.
Tsuchiya, P. F., “A Search Algorithm for Table Entries with Non-Contigious Wildcarding, ” Abstract, Bellcore.
Zhang, et al., “Rate-Controlled Static-Priority Queueing, ” INFOCOM 1993, pp. 227-236.