Fast optical layer mesh protection using pre-cross-connected trails

被引:53
作者
Chow, TY [1 ]
Chudak, F [1 ]
Ffrench, AM [1 ]
机构
[1] Tellabs Res Ctr, Cambridge, MA 02139 USA
关键词
bandwidth sharing; cage graph; Dijkstra algorithm; experimental design; mesh protection; mesh restoration; online algorithm; p-cycle; self-healing networks; SONET; survivable optical networks;
D O I
10.1109/TNET.2004.828951
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Conventional optical networks are based on SONET rings, but since rings are known to use bandwidth inefficiently, there has been much research into shared mesh protection, which promises significant bandwidth savings. Unfortunately, most shared mesh protection schemes cannot guarantee that failed traffic will be restored within the 50-ms timeframe that SONET standards specify. A notable exception is the p-cycle scheme of Grover and Stamatelakis. We argue, however, that p-cycles have certain limitations, e.g., there is no easy way to adapt p-cycles to a path-based protection scheme, and p-cycles seem more suited to static traffic than to dynamic traffic. In this paper we show that the key to fast restoration times is not a ring-like topology per se, but rather the ability to pre-cross-connect protection paths. This leads to the concept of a pre-cross-connected trail or PXT, which is a structure that is more flexible than rings and that adapts readily to both path-based and link-based schemes and to both static and dynamic traffic. The PXT protection scheme achieves fast restoration speeds, and our simulations, which have been carefully chosen using ideas from experimental design theory, show that the bandwidth efficiency of the PXT protection scheme is comparable to that of conventional shared mesh protection schemes.
引用
收藏
页码:539 / 548
页数:10
相关论文
共 12 条
[1]  
Bouillet E, 2002, IEEE INFOCOM SER, P801, DOI 10.1109/INFCOM.2002.1019326
[2]   Optical network design and restoration [J].
Doshi, BT ;
Dravida, S ;
Harshavardhana, P ;
Hauser, O ;
Wang, YF .
BELL LABS TECHNICAL JOURNAL, 1999, 4 (01) :58-84
[3]  
Ellinas G, 1996, IEEE GLOBECOM 1996 - CONFERENCE RECORD, VOLS 1-3, P152, DOI 10.1109/GLOCOM.1996.594351
[4]  
Grover WD, 1998, ICC 98 - 1998 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS VOLS 1-3, P537, DOI 10.1109/ICC.1998.682929
[5]  
Hauser O, 2002, IEEE INFOCOM SER, P817, DOI 10.1109/INFCOM.2002.1019328
[6]   A series of Hamiltonian cycle-based solutions to provide simple and scalable mesh optical network resilience [J].
Huang, H ;
Copeland, JA .
IEEE COMMUNICATIONS MAGAZINE, 2002, 40 (11) :46-51
[7]   Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks [J].
Iraschko, RR ;
MacGregor, MH ;
Grover, WD .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1998, 6 (03) :325-336
[8]   Generalized loop-back recovery in optical mesh networks [J].
Médard, M ;
Barry, RA ;
Finn, SG ;
He, WB ;
Lumetta, SS .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2002, 10 (01) :153-164
[9]   Optimal design and evaluation of survivable WDM transport networks [J].
Miyao, Y ;
Saito, H .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1998, 16 (07) :1190-1198
[10]  
Murakami K, 1997, IEEE INFOCOM SER, P345, DOI 10.1109/INFCOM.1997.635156