Patent US2240037A successfully refreshed from Google Patents.
US7451340B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Connection set-up extension for restoration path establishment in mesh networks
Assignee: Nokia of America Corp
•
Filing: 2003-09-26
•
Granted: 2008-11-11
•
Expires: 2023-09-26
Abstract
Abstract An extension to a connection setup protocol for establishment of a restoration path for a service in a mesh network involves, at a transit node along the restoration path, the steps of (1) receiving a service data structure having an identification of each link and transit node in a primary path for the service, and (2) determining whether to reserve additional protection bandwidth on an outgoing link incident to the transit node using the service data structure, wherein the outgoing link is part of the restoration path. In one or more embodiments, the service data structure includes identification of the service, identification of the outgoing link, and bandwidth of the service. In some cases, the extension involves reserving the additional protection bandwidth on the outgoing link, if the transit node determines that the protection bandwidth is required, based upon knowledge of the protection bandwidth already reserved on the outgoing link.
Inventors
- 👤 Bharat T. Doshi
- 👤 Zbigniew M. Dziong
- 👤 Ramesh Nagarajan
- 👤 Muhammad A. Qureshi
- 👤 Yung-Terng Wang
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 13:35
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/12; H04L45/123; H04L41/00; H04L41/06; H04L41/0654; H04L41/0663; H04L45/22; H04L45/28; H04L45/50; H04L45/24; H04L45/247
Claims Analysis
Total Claims: 40
Claim 1
Independent Claim
181 words
A method for establishing a restoration path for a service in a mesh network having a plurality of nodes interconnected by a plurality of links, the method comprising, at a regional manager for one or more transit nodes of the restoration path: receiving a service data structure comprising an identification of each link and transit node in a primary path for the service, wherein: the service data structure is a primary path vector having a plurality of entries corresponding to the nodes and links in the network; and each entry of the primary path vector identifies whether the corresponding node or link is part of the primary path for the service, wherein at least one entry of the primary path vector identifies that the corresponding node or link is not part of the primary path for the service; and determining whether to reserve additional protection bandwidth, on an outgoing link incident to at least one of the one or more transit nodes of the restoration path, using the service data structure, wherein the outgoing link is part of the restoration path.
Claim 2
Independent Claim
181 words
A method for establishing a restoration path for a service in a mesh network having a plurality of nodes interconnected by a plurality of links, the method comprising, at a regional manager for one or more transit nodes of the restoration path: receiving a service data structure comprising an identification of each link and transit node in a primary path for the service, wherein: the service data structure is a primary path vector having a plurality of entries corresponding to the nodes and links in the network; and each entry of the primary path vector identifies whether the corresponding node or link is part of the primary path for the service, wherein at least one entry of the primary path vector identifies that the corresponding node or link is not part of the primary path for the service; and determining whether to reserve additional protection bandwidth, on an outgoing link incident to at least one of the one or more transit nodes of the restoration path, using the service data structure, wherein the outgoing link is part of the restoration path.
Claim 3
Dependent Claim
27 words
The invention of claim 1 , further comprising receiving, at the regional manager, identification of the service, identification of the outgoing link, and bandwidth of the service.
Claim 4
Dependent Claim
19 words
The invention of claim 1 ,wherein the primary path vector is a primary path node-link vector V pnl .
Claim 5
Dependent Claim
50 words
The method of claim 3 , further comprising: reserving the additional protection bandwidth on the outgoing link, if the regional manager determines that any additional protection bandwidth is required; and transmitting from the regional manager information about the additional protection bandwidth for communication to each other node in the network.
Claim 6
Dependent Claim
18 words
The invention of claim 1 , wherein the network is a mesh data network that transmits packetized data.
Claim 7
Dependent Claim
119 words
The invention of claim 1 , wherein: the regional manager has a network data structure comprising, for each link in the network and each node or other link in the network, a representation of a minimum amount of protection bandwidth required to be reserved on said each link to restore service upon failure of said node or other link; the regional manager determines, using the network and service data structures, whether the service requires the additional protection bandwidth to be reserved on the outgoing link of he transit node of the restoration path; and the regional manager updates the network data structure if any additional protection bandwidth is determined to be required for the service on the outgoing link.
Claim 8
Dependent Claim
143 words
The invention of claim 6 , wherein: the network data structure is an array of vectors, wherein: each vector in the array corresponds to a different link in the network; each vector in the away has a plurality of entries corresponding to the nodes and links in the network; for a vector corresponding to the outgoing link, each entry in the vector corresponding to a node or other link identifies the minimum amount of protection bandwidth required to be reserved on the outgoing link to restore service upon failure of the node or other link; and the service data structure is a primary path vector having a plurality of entries corresponding to the nodes and links in the network, wherein: each entry of the primary path vector identifies whether the corresponding node or link is part of the primary path for the service.
Claim 9
Dependent Claim
52 words
The invention of claim 7 , wherein the regional manager determines whether the service requires any additional protection bandwidth to be reserved on the outgoing link by applying a vector addition operation between the primary path vector corresponding to the service and the vector of the away corresponding to the outgoing link.
Claim 10
Dependent Claim
36 words
The invention of claim 8 , wherein the vector addition operation comprises addition of corresponding vector entries, wherein the additional protection bandwidth is required if any vector entry sum exceeds a reserved bandwidth on the link.
Claim 11
Dependent Claim
20 words
The invention of claim 1 , wherein the receiving of a service data structure comprises supporting a signaling protocol interface.
Claim 12
Dependent Claim
18 words
The invention of claim 10 , wherein the signaling protocol is reservation protocol with traffic engineering extensions (RSVP-TE).
Claim 13
Dependent Claim
29 words
The method of claim 1 , further comprising reserving the additional protection bandwidth on the outgoing link, if the regional manager determines that any additional protection bandwidth is required.
Claim 14
Dependent Claim
28 words
The method of claim 12 , further comprising transmitting from the regional manager information about the additional protection bandwidth for communication to each other node in the network.
Claim 15
Dependent Claim
30 words
The method of claim 1 , wherein at least one entry of the primary path vector identifies that the corresponding link is part of the primary path for the service.
Claim 16
Dependent Claim
181 words
A regional manager in a mesh network having a plurality of nodes interconnected by a plurality of links, wherein: the regional manager manages one or more transit nodes of a restoration path for a service in the mesh network; and the regional manager is adapted to: receive a service data structure comprising an identification of each link and transit node in a primary path for the service, wherein: the service data structure is a primary path vector having a plurality of entries corresponding to the nodes and links in the network; and each entry of the primary path vector identifies whether the corresponding node or link is part of the primary path for the service, wherein at least one entry of the primary path vector identifies that the corresponding node or link is not part of the primary path for the service; and determine whether to reserve additional protection bandwidth, on an outgoing link incident to at least one of the one or more transit nodes, using the service data structure, wherein he outgoing link is part of the restoration path.
Claim 17
Dependent Claim
181 words
A regional manager in a mesh network having a plurality of nodes interconnected by a plurality of links, wherein: the regional manager manages one or more transit nodes of a restoration path for a service in the mesh network; and the regional manager is adapted to: receive a service data structure comprising an identification of each link and transit node in a primary path for the service, wherein: the service data structure is a primary path vector having a plurality of entries corresponding to the nodes and links in the network; and each entry of the primary path vector identifies whether the corresponding node or link is part of the primary path for the service, wherein at least one entry of the primary path vector identifies that the corresponding node or link is not part of the primary path for the service; and determine whether to reserve additional protection bandwidth, on an outgoing link incident to at least one of the one or more transit nodes, using the service data structure, wherein he outgoing link is part of the restoration path.
Claim 18
Dependent Claim
29 words
The invention of claim 15 , wherein the regional manager is further adapted to receive identification of the service, identification of the outgoing link, and bandwidth of the service.
Claim 19
Dependent Claim
20 words
The invention of claim 15 , wherein the primary path vector is a primary path node-link vector V pnl .
Claim 20
Dependent Claim
19 words
The invention of claim 15 , wherein the network is a mesh virtual-circuit data network that transmits packetized data.
Claim 21
Dependent Claim
35 words
The invention of claim 15 , wherein the regional manager is further adapted to reserve the additional protection bandwidth on the outgoing link, if the regional manager determines that any additional protection bandwidth is required.
Claim 22
Dependent Claim
30 words
The invention of claim 19 , wherein the regional manager is further adapted to transmit information about the additional protection bandwidth for communication to each other node in the network.
Claim 23
Dependent Claim
30 words
The invention of claim 15 , wherein at least one entry of the primary path vector identifies that the corresponding link is part of the primary path for the service.
Claim 24
Independent Claim
135 words
A method for establishing a restoration path for a primary service path in a mesh network having a plurality of nodes interconnected by a plurality of links, the method comprising: receiving a service data structure comprising an identification of each link and node in the primary service path, wherein: the service data structure is a primary path vector having a plurality of entries corresponding to the nodes and links in the network; and each entry of the primary path vector identifies whether the corresponding node or link is part of the primary path for the service; and determining, for each link of the restoration path, wherein the restoration path has previously been calculated, based on the information in the service data structure, whether to reserve additional protection bandwidth on the link of the restoration path.
Claim 25
Independent Claim
135 words
A method for establishing a restoration path for a primary service path in a mesh network having a plurality of nodes interconnected by a plurality of links, the method comprising: receiving a service data structure comprising an identification of each link and node in the primary service path, wherein: the service data structure is a primary path vector having a plurality of entries corresponding to the nodes and links in the network; and each entry of the primary path vector identifies whether the corresponding node or link is part of the primary path for the service; and determining, for each link of the restoration path, wherein the restoration path has previously been calculated, based on the information in the service data structure, whether to reserve additional protection bandwidth on the link of the restoration path.
Claim 26
Dependent Claim
52 words
The method of claim 22 , wherein the step of determining is further based on a network data record for the link comprising a representation of a minimum amount of protection bandwidth required to be reserved on the link to service upon failure of each link and node in the mesh network.
Claim 27
Dependent Claim
22 words
The method of claim 22 , wherein the steps of receiving and determining are performed at each node of the restoration path.
Claim 28
Dependent Claim
24 words
The method of claim 22 , wherein the method is performed at one or more regional managers for each node of the restoration path.
Claim 29
Dependent Claim
30 words
The method of claim 22 , wherein at least one entry of the primary path vector identifies that the corresponding link is part of the primary path for the service.
Claim 30
Independent Claim
396 words
A method for establishing a restoration path for a service in a mesh network having a plurality of nodes interconnected by a plurality of links, the method comprising, at a regional manager for one or more transit nodes of the restoration path: receiving a service data structure comprising an identification of each link and transit node in a primary path for the service; determining whether to reserve additional protection bandwidth, on an outgoing link incident to at least one of the one or more transit nodes of the restoration path, using the service data structure, wherein the outgoing link is part of the restoration path; reserving the additional protection bandwidth on the outgoing link, if the regional manager determines that any additional protection bandwidth is required; and transmitting from the regional manager information about the additional protection bandwidth for communication to each other node in the network, wherein: the regional manager has a network data structure comprising, for each link in the network and each node or other link in the network, a representation of a minimum amount of protection bandwidth required to be reserved on said each link to restore service upon failure of said node or other link; the network data structure is an array of vectors, wherein: each vector in the array corresponds to a different link in the network; each vector in the away has a plurality of entries corresponding to the nodes and links in the network; and for a vector corresponding to the outgoing link, each entry in the vector corresponding to a node or other link identifies the minimum amount of protection bandwidth required to be reserved on the outgoing link to restore service upon failure of the node or other link; the service data structure is a primary path vector having a plurality of entries corresponding to the nodes and links in the network, wherein each entry of the primary path vector identifies whether the corresponding node or link is part of the primary path for the service; the regional manager determines, using the network and service data structures, whether the service requires the additional protection bandwidth to be reserved on the outgoing link of the transit node of the restoration path; and the regional manager updates the network data structure if any additional protection bandwidth is determined to be required for the service on the outgoing link.
Claim 31
Independent Claim
396 words
A method for establishing a restoration path for a service in a mesh network having a plurality of nodes interconnected by a plurality of links, the method comprising, at a regional manager for one or more transit nodes of the restoration path: receiving a service data structure comprising an identification of each link and transit node in a primary path for the service; determining whether to reserve additional protection bandwidth, on an outgoing link incident to at least one of the one or more transit nodes of the restoration path, using the service data structure, wherein the outgoing link is part of the restoration path; reserving the additional protection bandwidth on the outgoing link, if the regional manager determines that any additional protection bandwidth is required; and transmitting from the regional manager information about the additional protection bandwidth for communication to each other node in the network, wherein: the regional manager has a network data structure comprising, for each link in the network and each node or other link in the network, a representation of a minimum amount of protection bandwidth required to be reserved on said each link to restore service upon failure of said node or other link; the network data structure is an array of vectors, wherein: each vector in the array corresponds to a different link in the network; each vector in the away has a plurality of entries corresponding to the nodes and links in the network; and for a vector corresponding to the outgoing link, each entry in the vector corresponding to a node or other link identifies the minimum amount of protection bandwidth required to be reserved on the outgoing link to restore service upon failure of the node or other link; the service data structure is a primary path vector having a plurality of entries corresponding to the nodes and links in the network, wherein each entry of the primary path vector identifies whether the corresponding node or link is part of the primary path for the service; the regional manager determines, using the network and service data structures, whether the service requires the additional protection bandwidth to be reserved on the outgoing link of the transit node of the restoration path; and the regional manager updates the network data structure if any additional protection bandwidth is determined to be required for the service on the outgoing link.
Claim 32
Independent Claim
158 words
A method for establishing a restoration path for a service in a mesh network having a plurality of nodes interconnected by a plurality of links, the method comprising, at a regional manager for one or more transit nodes of the restoration path: receiving a service data structure comprising an identification of each link and transit node in a primary path for the service, wherein: the service data structure is a primary path vector having a plurality of entries corresponding to all the nodes and links in the network; and each entry of the primary path vector identifies whether the corresponding node or link is or is not part of the primary path for the service; and determining whether to reserve additional protection bandwidth, on an outgoing link incident to at least one of the one or more transit nodes of the restoration path, using the service data structure, wherein the outgoing link is part of the restoration path.
Claim 33
Independent Claim
158 words
A method for establishing a restoration path for a service in a mesh network having a plurality of nodes interconnected by a plurality of links, the method comprising, at a regional manager for one or more transit nodes of the restoration path: receiving a service data structure comprising an identification of each link and transit node in a primary path for the service, wherein: the service data structure is a primary path vector having a plurality of entries corresponding to all the nodes and links in the network; and each entry of the primary path vector identifies whether the corresponding node or link is or is not part of the primary path for the service; and determining whether to reserve additional protection bandwidth, on an outgoing link incident to at least one of the one or more transit nodes of the restoration path, using the service data structure, wherein the outgoing link is part of the restoration path.
Claim 34
Dependent Claim
119 words
The invention of claim 28 , wherein: the regional manager has a network data structure comprising, for each link in the network and each node or other link in the network, a representation of a minimum amount of protection bandwidth required to be reserved on said each link to restore service upon failure of said node or other link; the regional manager determines, using the network and service data structures, whether the service requires the additional protection bandwidth to be reserved on the outgoing link of the transit node of the restoration path; and the regional manager updates the network data structure if any additional protection bandwidth is determined to be required for the service on the outgoing link.
Claim 35
Dependent Claim
143 words
The invention of claim 29 , wherein: the network data structure is an array of vectors, wherein: each vector in the array corresponds to a different link in the network; each vector in the away has a plurality of entries corresponding to the nodes and links in the network; for a vector corresponding to the outgoing link, each entry in the vector corresponding to a node or other link identifies the minimum amount of protection bandwidth required to be reserved on the outgoing link to restore service upon failure of the node or other link; and the service data structure is a primary path vector having a plurality of entries corresponding to the nodes and links in the network, wherein each entry of the primary path vector identifies whether the corresponding node or link is part of the primary path for the service.
Claim 36
Dependent Claim
52 words
The invention of claim 30 , wherein the regional manager determines whether the service requires any additional protection bandwidth to be reserved on the outgoing link by applying a vector addition operation between the primary path vector corresponding to the service and the vector of the array corresponding to the outgoing link.
Claim 37
Dependent Claim
36 words
The invention of claim 31 , wherein the vector addition operation comprises addition of corresponding vector entries, wherein the additional protection bandwidth is required if any vector entry sum exceeds a reserved bandwidth on the link.
Claim 38
Dependent Claim
30 words
The method of claim 28 , wherein at least one entry of the primary path vector identifies that the corresponding link is part of the primary path for the service.
Claim 39
Independent Claim
403 words
A method for establishing a restoration path for a service in a mesh network having a plurality of nodes interconnected by a plurality of links, the method comprising, at a regional manager for one or more transit nodes of the restoration path: receiving a service data structure comprising an identification of each link and transit node in a primary path for the service, wherein: the service data structure is a primary path vector having a plurality of entries corresponding to the nodes and links in the network; and each entry of the primary path vector identifies whether the corresponding node or link is part of the primary path for the service; and determining whether to reserve additional protection bandwidth, on an outgoing link incident to at least one of the one or more transit nodes of the restoration path, using the service data structure, wherein the outgoing link is part of the restoration path, wherein: the regional manager has a network data structure comprising, for each link in the network and each node or other link in the network, a representation of a minimum amount of protection bandwidth required to be reserved on said each link to restore service upon failure of said node or other link; the regional manager determines, using the network and service data structures, whether the service requires the additional protection bandwidth to be reserved on the outgoing link of the transit node of the restoration path; the regional manager updates the network data structure if any additional protection bandwidth is determined to be required for the service on the outgoing link; the network data structure is an array of vectors, wherein: each vector in the array corresponds to a different link in the network; each vector in the away has a plurality of entries corresponding to the nodes and links in the network; and for a vector corresponding to the outgoing link, each entry in the vector corresponding to a node or other link identifies the minimum amount of protection bandwidth required to be reserved on the outgoing link to restore service upon failure of the node or other link; and the service data structure is a primary path vector having a plurality of entries corresponding to the nodes and links in the network, wherein each entry of the primary path vector identifies whether the corresponding node or link is part of the primary path for the service.
Claim 40
Independent Claim
403 words
A method for establishing a restoration path for a service in a mesh network having a plurality of nodes interconnected by a plurality of links, the method comprising, at a regional manager for one or more transit nodes of the restoration path: receiving a service data structure comprising an identification of each link and transit node in a primary path for the service, wherein: the service data structure is a primary path vector having a plurality of entries corresponding to the nodes and links in the network; and each entry of the primary path vector identifies whether the corresponding node or link is part of the primary path for the service; and determining whether to reserve additional protection bandwidth, on an outgoing link incident to at least one of the one or more transit nodes of the restoration path, using the service data structure, wherein the outgoing link is part of the restoration path, wherein: the regional manager has a network data structure comprising, for each link in the network and each node or other link in the network, a representation of a minimum amount of protection bandwidth required to be reserved on said each link to restore service upon failure of said node or other link; the regional manager determines, using the network and service data structures, whether the service requires the additional protection bandwidth to be reserved on the outgoing link of the transit node of the restoration path; the regional manager updates the network data structure if any additional protection bandwidth is determined to be required for the service on the outgoing link; the network data structure is an array of vectors, wherein: each vector in the array corresponds to a different link in the network; each vector in the away has a plurality of entries corresponding to the nodes and links in the network; and for a vector corresponding to the outgoing link, each entry in the vector corresponding to a node or other link identifies the minimum amount of protection bandwidth required to be reserved on the outgoing link to restore service upon failure of the node or other link; and the service data structure is a primary path vector having a plurality of entries corresponding to the nodes and links in the network, wherein each entry of the primary path vector identifies whether the corresponding node or link is part of the primary path for the service.
References Cited (Backward Citations)
US5706276A
Cited
US5506956A
Cited
US5854903A
Cited
US5933425A
Cited
US6141319A
Cited
US5754543A
Cited
US5933422A
Cited
US5956339A
Cited
US5881048A
Cited
US6075766A
Cited
US5995485A
Cited
US6104701A
Cited
US6760302B1
Cited
US20040042402A1
Cited
US5856981A
Cited
US20030048749A1
Cited
US6130875A
Cited
US6205117B1
Cited
US20040057375A1
Cited
US6606303B1
Cited
US6477582B1
Cited
US20030179700A1
Cited
US6538987B1
Cited
US6711125B1
Cited
US6549513B1
Cited
US20040190461A1
Cited
US20080095045A1
Cited
US20060178918A1
Cited
US20050185652A1
Cited
US6697334B1
Cited
US7039009B2
Cited
US20010038471A1
Cited
US6795394B1
Cited
US7272116B1
Cited
US20020067693A1
Cited
US20020071392A1
Cited
US6725401B1
Cited
US20020118636A1
Cited
US6982951B2
Cited
US20020097671A1
Cited
US20050232144A1
Cited
US7180852B1
Cited
US20020174207A1
Cited
US6856592B2
Cited
US7188280B2
Cited
US20040233843A1
Cited
US20030065811A1
Cited
US20020194339A1
Cited
US7308198B1
Cited
US20030037276A1
Cited
US20030169692A1
Cited
US20050201276A1
Cited
US6904462B1
Cited
US20030018812A1
Cited
US20030021222A1
Cited
US20040174882A1
Cited
US20040165526A1
Cited
US20030095500A1
Cited
US7362709B1
Cited
US7110356B2
Cited
US6807653B2
Cited
US7164652B2
Cited
US20030112760A1
Cited
US20040052207A1
Cited
US20030147352A1
Cited
US7248561B2
Cited
US20070011284A1
Cited
US7209975B1
Cited
US20060013149A1
Cited
US7099286B1
Cited
US6863363B2
Cited
US20040004938A1
Cited
US7197008B1
Cited
US20040008619A1
Cited
US6850487B2
Cited
US20040190445A1
Cited
US20040205239A1
Cited
US7280755B2
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2011-11-11 | 2012-05-12 | 2012-11-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2015-11-11 | 2016-05-12 | 2016-11-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2019-11-11 | 2020-05-12 | 2020-11-11 | $7700.00 | Window Closed / Lapsed |