Constrained shortest path first algorithm for lambda-switched mesh optical networks with logical overlay OCh/SP rings

Author

Poppe, Fabrice ; De Neve, Hans ; Petit, Guido H.

Author_Institution

Network Strategy Group, Alcatel Bell Telephone, Antwerp, Belgium

fYear

2001

fDate

2001

Firstpage

150

Lastpage

154

Abstract

We describe a constrained shortest path first (CSPF) routing algorithm for lambda-switched optical networks with logical overlay OCh/SP rings. Speed is definitely a requirement if the algorithm is to be used for lambda-switching, but several features of the network architecture complicate the routing problem. The algorithm we present in this paper meets the requirement of being fast. Moreover, the routing of a lightpath is based on a limited amount of link state information, which can be disseminated by a lightweight routing protocol. Our numerical results show that the performance of the algorithm does not improve significantly if the routing decisions are based on more detailed information about the configuration of the network

Keywords

network topology; optical fibre networks; optical switches; protocols; telecommunication network routing; algorithm performance; constrained shortest path first algorithm; lambda-switched mesh optical networks; lightpath routing; lightweight routing protocol; link state information; logical overlay OCh/SP rings; long-haul core optical network; network architecture; network configuration; optical cross-connects; routing algorithm; Capacity planning; Integer linear programming; Mesh networks; Optical fiber networks; Partitioning algorithms; Probability; Protection; Routing protocols;

fLanguage

English

Publisher

ieee

Conference_Titel

High Performance Switching and Routing, 2001 IEEE Workshop on

Conference_Location

Dallas, TX

Print_ISBN

0-7803-6711-1

Type

conf

DOI

10.1109/HPSR.2001.923622

Filename

923622