Distributed precomputation of network signal paths with table-based link capacity control

• US 6,205,117 B1
• Filed: 11/24/1999
• Issued: 03/20/2001
• Est. Priority Date: 10/29/1997
• Status: Expired due to Term

• Current Assignee: WSOU Investments, LLC (WSOU Holdings, LLC)
• Original Assignee: Lucent Technologies, Inc. (Nokia Corporation)
• Inventors: Harshavardhana, Paramasiviah, Dravida, Subrahmanyam, Doshi, Bharat Tarachand, Wang, Yufei
• Primary Examiner(s): Olms, Douglas W.
• Assistant Examiner(s): Pizarro, Ricardo M.
• Application Number:
  US09/448,266
• Time in Patent Office: 482 Days
• Field of Search: 370/216, 370/217, 370/221, 370/226, 370/228, 370/225, 370/218, 370/227
• US Class Current: 370/228
• CPC Class Codes: H04J 14/0227 Operation, administration, maintenance or provisioning [OAMP] of WDM networks, e.g. media access, routing or wavelength allocation
• CPC Class Codes: H04J 14/0241 Wavelength allocation for communications one-to-one, e.g. unicasting wavelengths
• CPC Class Codes: H04J 14/0284 WDM mesh architectures
• CPC Class Codes: H04Q 11/0005 Switch and router aspects
• CPC Class Codes: H04Q 2011/005 Arbitration and scheduling
• CPC Class Codes: H04Q 2011/0081 Fault tolerance; Redundancy; Recovery; Reconfigurability

Abstract

Distributed precomputation techniques for determining primary and/or restoration paths in an optical or electrical network. The invention provides a number of partially and fully asynchronous distributed precomputation algorithms which may be implemented, for example, by the nodes of an all-optical network, in which network links are constrained in terms of optical signal wavelength and failure isolation. A given distributed precomputation algorithm may include a first phase in which paths are allocated for capacity demands to the extent possible without resolving contentions, and a second phase in which contentions between demands for the same capacity are resolved. The first phase may implement a contention locking mechanism which locks a primary path of a given demand to prevent other demands from contending for the same capacity, and a link capacity control mechanism which involves storing a link status table at one or more nodes, the link status table listing a number of specific failures and demands which are affected by the failures. The second phase of the distributed precomputation algorithm reroutes paths previously allocated to one or more demands in order to free up capacity required for another demand, so as to optimize overall network capacity utilization.

Claims

1. A method of determining signal paths for capacity demands in a network which includes a plurality of nodes and a plurality of links, each of the links interconnecting a pair of nodes, the method comprising the steps of:

determining at least one signal path in the network using a distributed precomputation process implemented by at least a subset of the plurality of nodes, wherein the distributed precomputation process includes a first phase in which paths are allocated for capacity demands to the extent possible without violating capacity constraints, and a second phase in which contentions between demands for the same capacity are resolved; and

providing link-based capacity control as part of the distributed precomputation process to identify demands contending for capacity on a specific link and to resolve contention on the specific link, wherein the link-based capacity control involves storing a link status table at one or more nodes controlling a given one of the links, the link status table listing a number of specific failures and demands which are affected by the failures.

2. The method of claim 1 wherein the link status table includes, for one or more of the specific failures, an indication of spare capacity on a corresponding link.

3. The method of claim 1 wherein the link status table further includes a link status indicator.

4. The method of claim 3 wherein a value of the link status indicator indicates that spare capacity is available for a specific failure and that the given link is ready to allocate and reserve capacity for a requesting demand.

5. The method of claim 3 wherein a value of the link status indicator indicates that the link has no spare capacity and also that it will not entertain any requests from demands to enter a link-based contention resolution state.

6. An apparatus for use in determining signal paths for capacity demands in a network which includes a plurality of nodes and a plurality of links, each of the links interconnecting a pair of nodes, the apparatus comprising:

a nodal processor associated with a corresponding one of the plurality of nodes in the network, the nodal processor implementing at least a portion of a distributed precomputation process for determining at least one signal path in the network, wherein the distributed precomputation process includes a first phase in which paths are allocated for capacity demands to the extent possible without violating capacity constraints, and a second phase in which contentions between demands for the same capacity are resolved, wherein the nodal processor further provides link-based capacity control as part of the distributed precomputation process to identify demands contending for capacity on a specific link and to resolve contention on the specific link, wherein the link-based capacity control involves storing a link status table at one or more nodes controlling a given one of the links, the link status table listing a number of specific failures and demands which are affected by the failures.

7. The apparatus of claim 6 wherein the link status table includes, for one or more of the specific failures, an indication of spare capacity on a corrcsponding link.

8. The apparatus of claim 6 wherein the link status table further includes a link status indicator.

9. The apparatus of claim 8 wherein a value of the link status indicator indicates that spare capacity is available for a specific failure and that the given link is ready to allocate and reserve capacity for a requesting demand.

10. The apparatus of claim 8 wherein a value of the link status indicator indicates that the link has no spare capacity and also that it will not entertain any requests from demands to enter a link-based contention resolution state.