Highly utilizable protection mechanism for WDM mesh network

• US 7,280,755 B2
• Filed: 09/26/2003
• Issued: 10/09/2007
• Est. Priority Date: 09/26/2003
• Status: Expired due to Fees

• Current Assignee: Korea Advanced Institute of Science and Technology
• Original Assignee: ICU Research and Industrial Cooperation Group
• Inventors: Kang, Minho, Jeong, Hong Kyu
• Primary Examiner(s): Vanderpuye; Kenneth
• Assistant Examiner(s): Le; Thi Q.
• Application Number:
  US10/672,453
• Publication Number:
  US 20050071484A1
• Time in Patent Office: 1,474 Days
• Field of Search: 398/7, 398/58, 398/57
• US Class Current: 398/7
• 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: H04J 14/0287 Protection in WDM systems

Abstract

In this application, the invention is a novel heuristic mechanism of working path and backup path reservation for highly utilizable WDM mesh networks, which we call dynamic-network adapted cost selection (DAC-selection) mechanism. One of its characteristics is simple traffic distribution mechanism, and the performance of DAC-selection mechanism is superior to that of Random selection (R-selection) and Advanced Combined Min-cost selection (ACM-selection) mechanism. DAC-selection mechanism provides simple cost function by assigning proper weights to each component of the cost function and the total cost is obtained by just summing up the individual cost. Therefore, it is possible to select a best pair of working path and backup path which consumes least wavelength for reservation.

Claims

1. A highly utilizable protection mechanism for WDM mesh network comprising of;

a step of waiting randomly generated channel request which is a request to generate channel between source node and target node,

a step of finding shortest path set within limit of hop length,

a step of finding disjointed path set for each path of the shortest path set,

a step of making pairs using shortest path set and disjoint path set for WP and BP,

a step of calculating cost by using cost function considering current network state,

a step of sorting the cost lists from minimum cost to maximum cost,

a step of selecting best pair having minimum cost, and

a step of checking whether each link has enough capacity to allocate channel resources for the channel request with best working and backup path pair having minimum cost,

wherein said step of calculating cost is as follow;

Cost*=(W₁×

AC+W₂×

(WC+BC)+W₃×

CC)

where W₁<

<

W₂<

<

W₃, W_j is much bigger than W_i, i<

j, i={1, 2,} and j={2,3}

where

2. A highly utilizable protection mechanism for WDM mesh network according to claim 1,

wherein after said step of checking whether each link has enough capacity, if a result of checking is enough wavelength for both WP and BP, then a step of accepting said channel request, and if not, then a step of rejecting said channel request.

3. A highly utilizable protection mechanism for WDM mesh network comprising of;

a step of producing a shortest path set when channel request is generated, wherein channel request is a request to generate channel between source node and target node,

a step of selecting disjoint path set to select working path and backup path in said path set,

a step of calculating cost by using cost function considering current network state,

a step of selecting best pair having minimum cost, and

a step of allocating resources by checking whether each link has enough capacity to allocate channel resources for the channel request with best working and backup path pair having minimum cost,

wherein said step of calculating cost is as follow;

Cost*=(W₁×

AC+W₂×

(WC+BC)+W₃×

CC)

where W₁<

<

W₂<

<

W₃, W_j is much bigger than W_i, i<

j, i={1, 2,} and j={2, 3}

where