Transparant non-disruptable ATM network

• US 6,011,780 A
• Filed: 05/23/1997
• Issued: 01/04/2000
• Est. Priority Date: 05/23/1997
• Status: Expired due to Term

• Current Assignee: Hanger Solutions, LLC (IP Investments Group LLC)
• Original Assignee: Stevens Institute Of Technology
• Inventors: Noh, Tai, Bose, Jay D., Vaman, Dhadesugoor R.
• Primary Examiner(s): Olms, Douglas W.
• Assistant Examiner(s): VANDERPUYE, KENNETH N
• Application Number:
  US08/862,631
• Time in Patent Office: 956 Days
• Field of Search: 370/227, 370/228, 370/237, 370/231, 370/223, 370/224, 370/242, 370/244, 370/249, 370/222, 370/225, 455/440, 455/441, 340/825.01, 340/827
• US Class Current: 370/237
• CPC Class Codes: H04L 2012/562 Routing
• CPC Class Codes: H04L 2012/5625 Operations, administration and maintenance [OAM]
• CPC Class Codes: H04L 2012/5627 Fault tolerance and recovery
• CPC Class Codes: H04Q 11/0478 Provisions for broadband connections

Abstract

A method and apparatus for the transparent, non-disruptable transfer of data, particularly multimedia data, through any packet-based network, such as an ATM network is provided. The method of the present invention includes the step of setting a primary path and a secondary path between nodes of a network, or of a network domain. Accordingly, when a switch or node establishes a Virtual Path (VP) to another switch with specified effective bandwidth, it also has an alternate VP that is available, although no bandwidth is actually used. The method of the present invention further includes the step of optimizing the available capacity of the system through management actions. For handling congestion and resource failures, the total effective bandwidth on each physical link is categorized in terms of idle capacity (unused or available), used capacity (for existing VPs), and spare capacity. When a resource failure occurs, the idle capacity is used for real-time switching of the VP and service is not disrupted. This is accomplished by an alarm indication management cell which is delivered when a resource problem is encountered. This management cell sets forth the secondary path and the bandwidth associated therewith. On the other hand, if idle capacity does not exist, the spare capacity is used, while the bandwidth of all other VPs is reconfigured using virtual bandwidth optimization. Therefore, service disruption does not occur. In a wireless, mobile network, the present invention monitors node movement and takes management actions on the basis of such node movement to prevent service disruption.

Claims

1. A method for providing non-disruptable service through a packet-based network comprising the steps of:

establishing a primary path and a secondary path between nodes in the network;

providing network management means for communicating between the nodes of the network and for detecting network resource failures, the network management means monitoring the available, used and spare bandwidth capacity of the network through management actions;

delivering an alarm indication management cell to specify the secondary path as a result of a network resource failure;

calculating the available bandwidth along the secondary path; and

re-routing a transmission from a primary path to a secondary path without the need for re-establishing communication.

2. The method of claim 1 wherein the alarm indication management cell is delivered from an upstream node when congestion is detected by the upstream node.

3. The method of claim 1 wherein the alarm indication management cell issues from a down-stream node when a primary path has been cut.

4. The method of claim 1 wherein the step of providing network management further comprises the step of maximizing the bandwidth capacity of the network.

5. The method of claim 1 wherein further comprising the step of dividing the network into local domains and performing network managing and re-routing in the local domains of the network.

6. The method of claim 1 wherein spare capacity is used to re-route a transmission along a secondary path if available capacity does not exist.

7. The method of claim 6 wherein the bandwidth of all other virtual paths in the network is reconfigured using virtual bandwidth optimization.

8. The method of claim 1 further comprising the step of enhancing conventional nodes for use in providing network management.

9. The method of claim 8 further comprising the step of programming the nodes with a reconfiguration algorithm for optimizing network topology and reconfiguring virutal paths.

10. The method of claim 6 wherein the step of providing network management further comprises the step of calculating call blocking probablity for each switch pair and class of service in the network.

11. The method of claim 1 further comprising the step of re-routing a transmission from a secondary path back to a primary path upon resolution of the source of resource failure.

12. The method of claim 9 wherein the algorithm is continously executed whenever there is a change in traffic through the network.

13. The method of claim 12 wherein the algorithm is continously executed in each node for all virtual paths between that node and the node with which it is in contact.

14. The method of claim 10 wherein the step of computing call blocking comprises using recursion for optimization.

15. A method for providing non-disruptable service through a packet-based network comprising the steps of:

dividing the network into local domains;

establishing a primary path and a secondary path between nodes in the network;

providing network management means for communicating between the nodes of the network in the local domains, and for detecting network resource failures;

delivering an alarm indication management cell to specify the secondary path as a result of a network resource failure;

calculating the available bandwidth along the secondary path; and

re-routing a transmission from a primary path to a secondary path in the local domains without the need for re-establishing communication.

16. The method of claim 15 wherein the alarm indication management cell is delivered from an up-stream node when congestion is detected by the upstream node.

17. The method of claim 15 wherein the alarm issues from a down-stream node when a primary path has been cut.

18. The method of claim 15 wherein the step of providing network management further comprises the step of monitoring the available, used and spare bandwidth capacity of the network through management actions.

19. The method of claim 18 wherein the step of providing network management further comprises the step of maximizing the bandwidth capacity of the network.

20. The method of claim 18 wherein spare capacity is used to re-route a transmission along a secondary path if available capacity does not exist.

21. The method of claim 20 wherein the bandwidth of all other virtual paths in the network is reconfigured using virtual bandwidth optimization.

22. The method of claim 21 further comprising the step of programming the nodes with a reconfiguration algorithm for optimizing network topology and reconfiguring virtual paths.

23. The method of claim 19 wherein the step of providing network management further comprises the step of calculating call blocking probability for each switch pair and class of service in the network.

24. The method of claim 15 further comprising the step of rerouting a transmission from a secondary path back to a primary path upon resolution of the source of resource failure.

25. The method of claim 22 wherein the algorithm is continuously executed whenever there is a change in traffic through the network.

26. The method of claim 25 wherein the algorithm is continuously executed in each node for all virtual paths between that node and the node with which it is in contact.

27. The method of claim 23 wherein the step of computing call blocking comprises using recursion for optimization.

28. A method for providing non-disruptable service through a packet-based network comprising the steps of:

establishing a primary path and a secondary path between nodes in the network;

enhancing conventional nodes for use in providing network management for communicating between the nodes of the network and for detecting network resource failures;

delivering an alarm indication management cell to specify the secondary path as a result of a network resource failure;

calculating the available bandwidth along the secondary path; and

re-routing a transmission from a primary path to a secondary path without the need for re-establishing communication.

29. The method of claim 28 wherein the alarm indication management cell is delivered from an up-stream node when congestion is detected by the upstream node.

30. The method of claim 28 wherein the alarm indication management cell issues from a down-stream node when a primary path has been cut.

31. The method of claim 28 wherein the step of providing network management further comprises the step of monitoring the available, used and spare bandwidth capacity of the network through management actions.

32. The method of claim 31 wherein the step of providing network management further comprises the step of maximizing the bandwidth capacity of the network.

33. The method of claim 28 wherein further comprising the step of dividing the network into local domains and performing network managing and re-routing in the local domains of the network.

34. The method of claim 31 wherein spare capacity is used to re-route a transmission along a secondary path if available capacity does not exist.

35. The method of claim 34 wherein the bandwidth of all other virtual paths in the network is reconfigured using virtual bandwidth optimization.

36. The method of claim 28 further comprising the step of programming the nodes with a reconfiguration algorithm for optimizing network topology and reconfiguring virtual paths.

37. The method of claim 32 wherein the step of providing network management further comprises the step of calculating call blocking probability for each switch pair and class of service in the network.

38. The method of claim 28 further comprising the step of re-routing a transmission from a secondary path back to a primary path upon resolution of the source of resource failure.

39. The method of claim 36 wherein the algorithm is continuously executed whenever there is a change in traffic through the network.

40. The method of claim 39 wherein the algorithm is continuously executed in each node for all virtual paths between that node and the node with which it is in contact.

41. The method of claim 37 wherein the step of computing call blocking comprises using recursion for optimization.

42. A method for providing non-disruptable service through a packet-based network comprising the steps of:

establishing a primary path and a secondary path between nodes in the network;

providing network management means for communicating between the nodes of the network and for detecting congestion, the network management means monitoring the available, used and spare bandwidth capacity of the network through management actions;

delivering an alarm indication management cell to specify the secondary path as a result of a network resource failure;

calculating the available bandwidth along the secondary path; and

re-routing a transmission from a primary path to a secondary path without the need for re-establishing communication.

43. The method of claim 42 wherein the alarm indication management cell is delivered from an up-stream node when congestion is detected by the upstream node.

44. The method of claim 42 wherein the alarm indication management cell issues from a down-stream node when a primary path has been cut.

45. The method of claim 42 wherein the step of providing network management further comprises the step of maximizing the bandwidth capacity of the network.

46. The method of claim 42 wherein further comprising the step of dividing the network into local domains and performing network managing and re-routing in the local domains of the network.

47. The method of claim 42 wherein spare capacity is used to re-route a transmission along a secondary path if available capacity does not exist.

48. The method of claim 47 wherein the bandwidth of all other virtual paths in the network is reconfigured using virtual bandwidth optimization.

49. The method of claim 42 further comprising the step of enhancing conventional nodes for use in providing network management.

50. The method of claim 49 further comprising the step of programming the nodes with a reconfiguration algorithm for optimizing network topology and reconfiguring virtual paths.

51. The method of claim 45 wherein the step of providing network management further comprises the step of calculating call blocking probability for each switch pair and class of service in the network.

52. The method of claim 42 further comprising the step of re-routing a transmission from a secondary path back to a primary path upon resolution of the source of resource failure.

53. The method of claim 50 wherein the algorithm is continuously executed whenever there is a change in traffic through the network.

54. The method of claim 53 wherein the algorithm is continuously executed in each node for all virtual paths between that node and the node with which it is in contact.

55. The method of claim 52 wherein the step of computing call blocking comprises using recursion for optimization.