Integrating switching and facility networks using ATM

• US 6,081,506 A
• Filed: 11/19/1997
• Issued: 06/27/2000
• Est. Priority Date: 11/19/1997
• Status: Expired due to Term

• Current Assignee: AT&T Corporation (AT&T, Inc.)
• Original Assignee: AT&T Corporation (AT&T, Inc.)
• Inventors: Johri, Pravin Kumar, Buyukkoc, Cagatay, Houck, David J., Milito, Rodolfo Alberto, Meier-Hellstern, Kathleen S.
• Primary Examiner(s): Olms, Douglas W.
• Assistant Examiner(s): Hom, Shick
• Application Number:
  US08/974,172
• Time in Patent Office: 951 Days
• Field of Search: 370/235, 370/351, 370/389, 370/394, 370/395, 370/397, 370/408, 370/409, 370/410, 370/411, 370/414, 370/418, 370/471
• US Class Current: 370/235
• CPC Class Codes: H04L 12/5602 Bandwidth control in ATM Networks, e.g. leaky bucket
• CPC Class Codes: H04L 2012/562 Routing
• CPC Class Codes: H04L 2012/5632 Bandwidth allocation
• CPC Class Codes: H04Q 11/0478 Provisions for broadband connections

Abstract

An efficient approach and corresponding apparatus for selecting virtual paths in a network for routing datagrams achieves effective sharing of capacity without adversely affecting call setup latency. Edge nodes of the network assign calls to virtual paths based on the destination of the call and the current load status of each of a relatively small number of paths. Each call is assigned a VPI (Virtual Path Identifier) corresponding to the path chosen and a VCI (Virtual Circuit Identifier) corresponding to the identity of the call at that edge node. The ATM backbone nodes route calls based solely on the VPI. Capacity management and load balancing is achieved by each edge node keeping track of the load on each access link from its edge node to the rest of the network and of the congestion status of the various links in the network. In one embodiment, the edge node periodically sends information about its usage of the network to a "central fabric network interface" which combines information from all edge nodes, evaluates congestion status for the network links, and forwards that information back to the edge nodes.

Claims

1. A network comprising a plurality of switches interconnected by means of β

links and edge nodes that connect to at least some of said switches via α

links and also connect to apparatus outside said network, and where datagrams are launched onto said network by said edge nodes with a virtual path identifier, VPI, that is specified by said edge node and an edge node destination, the improvement comprising;

said switches route said datagrams according to the dictates of said virtual path identifier, and

a first edge node of said edge nodes that is coupled to a first switch of said switches, when launching a datagram to a second edge node of said edge nodes, employs a first VPI; and

a third edge node of said edge nodes that is coupled to a second switch of said switches that is different from said first switch, when launching datagram to said second edge node of said edge nodes, employs said first VPI.

2. The network of claim 1 where said second edge node sends datagrams to said first edge node uses a second VPI, and said first VPI is different from said second VPI.

3. The network of claim 1 where said datagrams are launched onto said network by said edge nodes with a VPI and a Virtual Circuit Identifier, VCI, and said switches route said datagrams according to dictates that exclude consideration of said VCI.

4. The network of claim 1 where different ones of said edge nodes that are coupled to physically different ones of said switches and which specify the same VPI destine their datagrams to a given one of edge nodes of said network.

5. The network of claim 1 where an edge node of said edge nodes is coupled to a given one of said switches by more than one physical α

link, and cells with different VPIs that emanate from the edge node, in the absence of a congestion condition, are always routed to a preselected one of the α

links coupling the edge node to said given switch.

6. The network of claim 1 where the switches never modify the VPI of incoming datagrams.

7. The network of claim 1 where the switches route datagrams based strictly on VPIs.

8. The network of claim 1 where the switches route datagrams in accordance with a fixed routing table that associated a VPI of an incoming datagram with an outgoing link.

9. The network of claim 1 where the switches are ATM switches.

10. The network of claim 1 where a switch of said network never modifies the VPI of incoming datagrams, except in connection with datagrams belonging to a set of pre-specified VPIs.

11. The network of claim 1 where an edge node of said edge nodes that is called upon to launch datagrams into the network, it being a source edge node, which datagrams are to be routed to a given edge node, selects a VPI for said datagrams from a set of VPIs assigned for said given edge node.

12. The network of claim 11 where the source edge node makes said selection based on information made available to the source edge node regarding congestion levels on links comprising candidate pre-assigned routes for a set of VPIs from among which the source edge node selects a VPI.

13. The network of claim 12 where the information regarding congestion level is derived from information that other source edge nodes have communicated.

14. The network of claim 12 where the information is communicated from other source nodes via a centralized fabric network interface.

15. The network of claim 12 where the source node includes the step of sending information to the CFNI about congestion level that it contributes to some of said β

links.

16. The network of claim 15 where the information is communicated to the edge nodes over a signaling network that is separate from the plurality of switches and the β

links that interconnect them.

17. The network of claim 15 where the information is communicated to the edge nodes over said β

links.

18. The network of claim 1 further comprising a signaling module in each node for sending out its network utilization information and for receiving information about the network utilization by other edge nodes.

19. The network of claim 1 where the datagrams are ATM cells and the switches are ATM switches.

20. The network of claim 1 where the datagrams are data packets and the switches are packet routers.

21. In a network arrangement comprising switches interconnected by links, and edge nodes that are coupled to at least some of said switches, where said switches route datagrams via said links from a source edge node to a destination edge node, a method of setting up a virtual path from said source edge node to said destination edge node comprising:

the source edge node maintaining information about a congestion status of said links,

based on said congestion status information, the source edge node selecting said virtual path for datagrams to be launched by said source edge node from a set of virtual paths that home onto the destination edge node.

22. The method of claim 21 where the edge nodes comprise means to interface between customers and the network.

23. The method of claim 22 where the means to interface between customers and the network comprises a controller.

24. The method of claim 22 where the means to interface between customers and the network comprises a switch.

25. The method of claim 21 where an edge node of said edge nodes is embedded in the switch to which it is coupled.

26. The method of claim 21 where the source edge node reserves capacity in the network.

27. The method of claim 21 where the source edge node reserves capacity in the network by providing information for distribution to other ones of said edge nodes regarding links usage in the selected virtual path, to allow a renewed assessment of the congestion status of said links.

28. The method of claim 27 where the information provided by the source node is provided to a centralized fabric network interface.

29. The method of claim 27 where the reserved capacity is for a variable bit rate communication.

30. The method of claim 27 where the reserved capacity is for a constant bit rate communication.