Method of determining a spectral route in an optical telecommunications network

• US 7,369,767 B2
• Filed: 07/08/2004
• Issued: 05/06/2008
• Est. Priority Date: 07/11/2003
• Status: Expired due to Fees

• Current Assignee: Alcatel SA (Nokia Corporation)
• Original Assignee: Alcatel SA (Nokia Corporation)
• Inventors: Laalaoua, Rachid
• Primary Examiner(s): Li; Shi K.
• Assistant Examiner(s): CURS, NATHAN M
• Application Number:
  US10/885,587
• Publication Number:
  US 20050008367A1
• Time in Patent Office: 1,398 Days
• Field of Search: 398 48- 50, 398/57, 370/400, 370/406
• US Class Current: 398/57
• 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/0278 WDM optical network architectures

Abstract

In order to determine a spectral route between a departure node (N1) and an arrival node (N6) in a WDM optical telecommunications network, the method comprises a step of determining a spatial route connecting the departure node to the arrival node, said spatial route comprising a sequence of route segments (Li), each route segment directly interconnecting two network nodes and being capable of conveying at least one wavelength. The method further comprises the following steps:

• • identifying wavelengths that are usable along each of the route segments; and
  • constructing a graph in which the vertices (i,f_k,λ_l) are the wavelengths usable in the route segments and the arcs joining each of two consecutive vertices are the transitions between the wavelengths represented respectively by said consecutive vertices.
    Each of the arcs is given a distance corresponding to a determined cost of wavelength transition, and finally the shortest path through the graph is determined by an algorithm for determining shortest path.

Claims

1. A method of determining a spectral route in an optical telecommunications network between a departure node and an arrival node belonging to said network, the method comprising a step of using a routing method to determine a spatial route connecting said departure node to said arrival node, said spatial route comprising a sequence of route segments, each route segment directly interconnecting two nodes of said network and being capable of conveying at least one wavelength or wavelength band, the method being characterized in that it further comprises the following subsequent steps:

identifying at least one wavelength or wavelength band that can be used along each of said route segments of said spatial route;

constructing a graph made up of vertices and arcs interconnecting vertices in pairs, in which;

each vertex is associated with one of said route segments and represents a wavelength or wavelength band that can be used along said associated route segment; and

each arc is associated with one of said nodes of said spatial route and joins two consecutive vertices associated respectively with consecutive route segments interconnected via said associated node, and represents a transition from a first wavelength or wavelength band to a second wavelength or wavelength band represented respectively by said consecutive vertices, said transition corresponding to a wavelength conversion that can be performed by said associated node, each of said arcs being given a distance corresponding to a cost that is allocated to said transition; and

determining the shortest path through this graph by an algorithm for determining shortest path.

2. The method according to claim 1, wherein

a route segment is equipped with a plurality of optical fibers,

an initial cost is allocated to a vertex associated with said route segment,

said initial cost corresponds to implementing an additional fiber in said route segment, and

the transition cost allocated to each arc coming from said vertex includes said initial cost.

3. The method according to claim 1, characterized in that said algorithm for determining the shortest path is a Viterbi algorithm.

4. The method according to claim 1, characterized in that said transition cost satisfies one of the following conditions:

said transition cost is treated as being infinite if said transition is not possible because said associated node cannot perform said transition;

said transition cost includes a wavelength conversion cost;

and said transition cost includes a cost of transiting through a transparent node.