US6011780A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Transparant non-disruptable ATM network
Assignee: STEVENS INSTITUTE OF TECHNOLO, University of, Trustees of
•
Filing: 1997-05-23
•
Granted: 2000-01-04
•
Expires: 2017-05-23
Abstract
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.
Inventors
- 👤 Dhadesugoor R. Vaman
- 👤 Tai Noh
- 👤 Jay D. Bose
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 19:50
CPC Classifications
H; H04; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5619; H04L2012/562; H04L2012/5625; H04L2012/5627
Claims Analysis
Total Claims: 59
Claim 1
Independent Claim
108 words
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.
Claim 2
Independent Claim
108 words
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.
Claim 3
Dependent Claim
25 words
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.
Claim 4
Dependent Claim
23 words
The method of claim 1 wherein the alarm indication management cell issues from a down-stream node when a primary path has been cut.
Claim 5
Dependent Claim
24 words
The method of claim 1 wherein the step of providing network management further comprises the step of maximizing the bandwidth capacity of the network.
Claim 6
Dependent Claim
30 words
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.
Claim 7
Dependent Claim
24 words
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.
Claim 8
Dependent Claim
22 words
The method of claim 6 wherein the bandwidth of all other virtual paths in the network is reconfigured using virtual bandwidth optimization.
Claim 9
Dependent Claim
19 words
The method of claim 1 further comprising the step of enhancing conventional nodes for use in providing network management.
Claim 10
Dependent Claim
25 words
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.
Claim 11
Dependent Claim
32 words
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.
Claim 12
Dependent Claim
30 words
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.
Claim 13
Dependent Claim
21 words
The method of claim 9 wherein the algorithm is continously executed whenever there is a change in traffic through the network.
Claim 14
Dependent Claim
30 words
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.
Claim 15
Dependent Claim
17 words
The method of claim 10 wherein the step of computing call blocking comprises using recursion for optimization.
Claim 16
Independent Claim
104 words
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.
Claim 17
Independent Claim
104 words
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.
Claim 18
Dependent Claim
25 words
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.
Claim 19
Dependent Claim
20 words
The method of claim 15 wherein the alarm issues from a down-stream node when a primary path has been cut.
Claim 20
Dependent Claim
31 words
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.
Claim 21
Dependent Claim
24 words
The method of claim 18 wherein the step of providing network management further comprises the step of maximizing the bandwidth capacity of the network.
Claim 22
Dependent Claim
24 words
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.
Claim 23
Dependent Claim
22 words
The method of claim 20 wherein the bandwidth of all other virtual paths in the network is reconfigured using virtual bandwidth optimization.
Claim 24
Dependent Claim
25 words
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.
Claim 25
Dependent Claim
32 words
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.
Claim 26
Dependent Claim
30 words
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.
Claim 27
Dependent Claim
21 words
The method of claim 22 wherein the algorithm is continuously executed whenever there is a change in traffic through the network.
Claim 28
Dependent Claim
30 words
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.
Claim 29
Dependent Claim
17 words
The method of claim 23 wherein the step of computing call blocking comprises using recursion for optimization.
Claim 30
Independent Claim
95 words
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.
Claim 31
Independent Claim
95 words
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.
Claim 32
Dependent Claim
25 words
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.
Claim 33
Dependent Claim
23 words
The method of claim 28 wherein the alarm indication management cell issues from a down-stream node when a primary path has been cut.
Claim 34
Dependent Claim
31 words
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.
Claim 35
Dependent Claim
24 words
The method of claim 31 wherein the step of providing network management further comprises the step of maximizing the bandwidth capacity of the network.
Claim 36
Dependent Claim
30 words
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.
Claim 37
Dependent Claim
24 words
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.
Claim 38
Dependent Claim
22 words
The method of claim 34 wherein the bandwidth of all other virtual paths in the network is reconfigured using virtual bandwidth optimization.
Claim 39
Dependent Claim
25 words
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.
Claim 40
Dependent Claim
32 words
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.
Claim 41
Dependent Claim
30 words
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.
Claim 42
Dependent Claim
21 words
The method of claim 36 wherein the algorithm is continuously executed whenever there is a change in traffic through the network.
Claim 43
Dependent Claim
30 words
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.
Claim 44
Dependent Claim
17 words
The method of claim 37 wherein the step of computing call blocking comprises using recursion for optimization.
Claim 45
Independent Claim
106 words
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.
Claim 46
Independent Claim
106 words
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.
Claim 47
Dependent Claim
25 words
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.
Claim 48
Dependent Claim
23 words
The method of claim 42 wherein the alarm indication management cell issues from a down-stream node when a primary path has been cut.
Claim 49
Dependent Claim
24 words
The method of claim 42 wherein the step of providing network management further comprises the step of maximizing the bandwidth capacity of the network.
Claim 50
Dependent Claim
30 words
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.
Claim 51
Dependent Claim
24 words
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.
Claim 52
Dependent Claim
22 words
The method of claim 47 wherein the bandwidth of all other virtual paths in the network is reconfigured using virtual bandwidth optimization.
Claim 53
Dependent Claim
19 words
The method of claim 42 further comprising the step of enhancing conventional nodes for use in providing network management.
Claim 54
Dependent Claim
25 words
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.
Claim 55
Dependent Claim
32 words
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.
Claim 56
Dependent Claim
30 words
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.
Claim 57
Dependent Claim
21 words
The method of claim 50 wherein the algorithm is continuously executed whenever there is a change in traffic through the network.
Claim 58
Dependent Claim
30 words
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.
Claim 59
Dependent Claim
17 words
The method of claim 52 wherein the step of computing call blocking comprises using recursion for optimization.
References Cited (Backward Citations)
US4829554A
Cited
US5113398A
Cited
US5235599A
Cited
US5140695A
Cited
US5170391A
Cited
US5016243A
Cited
US5239667A
Cited
US5241534A
Cited
US5396253A
Cited
US5473598A
Cited
US5239537A
Cited
US5146452A
Cited
US5412376A
Cited
US5317562A
Cited
US5475675A
Cited
US5278977A
Cited
US5301184A
Cited
US5490138A
Cited
US5333130A
Cited
US5398236A
Cited
US5461607A
Cited
US5408465A
Cited
US5600630A
Cited
US5559959A
Cited
US5488606A
Cited
US5495472A
Cited
US5521910A
Cited
US5621722A
Cited
US5461611A
Cited
US5717796A
Cited
US5590118A
Cited
US5715237A
Cited
US5621721A
Cited
US5623481A
Cited
US5590126A
Cited
US5875185A
Cited
US5652751A
Cited
US5768527A
Cited
US5859836A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2003-01-03 | 2003-07-05 | 2004-01-04 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2007-01-03 | 2007-07-05 | 2008-01-04 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2011-01-03 | 2011-07-05 | 2012-01-04 | $7700.00 | Window Closed / Lapsed |