Enhanced Backwards Recursive Path Computation for Multi-area Wavelength Switched Optical Networks Under Wavelength Continuity Constraint

2009 ◽  
Vol 1 (2) ◽  
pp. A180 ◽  
Author(s):  
Ramon Casellas ◽  
Ricardo Martínez ◽  
Raül Muñoz ◽  
Sebastian Gunreben
Keyword(s):  
Optical Networks ◽  
Path Computation ◽  
Continuity Constraint ◽  
Recursive Path ◽  
Wavelength Continuity Constraint

Reduced load approximation for WDM rings with wavelength continuity constraint

2006 ◽  
Vol 5 (12) ◽  
pp. 937 ◽  
Author(s):  
Divanilson R. Campelo ◽  
Raul C. Almeida, Jr. ◽  
Helio Waldman
Keyword(s):  
Continuity Constraint ◽  
Wavelength Continuity Constraint ◽  
Wdm Rings ◽  
Reduced Load Approximation

Design of contention resolution over backup path in path computation element based wavelength-switched optical networks

2010 ◽  
Vol 8 (4) ◽  
pp. 372-376
Author(s):  
侯连兴 Lianxing Hou ◽  
陆月明 Yueming Lu ◽  
王俊华 Junhua Wang ◽  
纪越峰 Yuefeng Ji
Keyword(s):  
Optical Networks ◽  
Contention Resolution ◽  
Backup Path ◽  
Path Computation ◽  
Path Computation Element

A Scalable Constraint-based Path Computation Approach in Multi-domain Optical Networks

2010 ◽  
Author(s):  
Siwei Chen ◽  
Wei Guo ◽  
Yaohui Jin ◽  
Weiqiang Sun ◽  
Weisheng Hu
Keyword(s):  
Optical Networks ◽  
Path Computation

A ROUTING AND WAVELENGTH ASSIGNMENT STRATEGY FOR SUCCESSFUL TRANSMISSION IN OPTICAL NETWORKS

2009 ◽  
Vol 10 (01n02) ◽  
pp. 1-26
Author(s):  
ANNA AGUSTÍ-TORRA ◽  
CRISTINA CERVELLÓ-PASTOR ◽  
MIQUEL A. FIOL
Keyword(s):  
Optical Networks ◽  
Packet Switching ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Statistical Multiplexing ◽  
Successful Transmission ◽  
Line Digraph ◽  
Simple Tool ◽  
Assignment Strategy ◽  
Continuity Constraint

Optical Burst and Packet Switching (OBS/OPS) are techniques designed to serve higher-layer packet-based communication protocols by allowing statistical multiplexing. Since OBS and OPS networks provide connectionless transport, they both suffer from contention, which occurs when multiple communications want to use simultaneously the same wavelength in a link. This paper proposes a Routing and Wavelength Assignment (RWA) strategy based on the concept of (rooted) collision-free digraph, which represents all paths assigned by the routing to those communications sharing a wavelength. Using the proposed RWA strategy, the contention problem can be successfully solved by using simple mechanisms based on adding a suitable additional delay to burst/packet transmissions. Here we define and characterize the routing-antipodal networks, in which we can define [n/2] pairs of arc-disjoint collision-free digraphs (with n being the number of nodes) that altogether include all arcs of the network. This implies that, using [n/2] wavelengths, we can achieve connectivity between any pair of nodes under the wavelength-continuity constraint. Solutions with fewer wavelengths are also feasible. In particular, if the routing-antipodal network has a trail that passes through all vertices at least once, one wavelength is enough to ensure connectivity between each pair of nodes. We also show that the line digraph technique provides us with a simple tool for obtaining proper collision-free digraphs. The proposed method works in either a synchronous or an asynchronous transmission environment. Also, the arriving and length burst/packet distributions can be of any type, provided that the maximum theoretical offered load is not exceeded.

Sign in / Sign up

Export Citation Format

Share Document