Title :
Fast optical Layer mesh protection using pre-cross-connected trails
Author :
Chow, Timothy Y. ; Chudak, Fabian ; Ffrench, Anthony M.
Author_Institution :
Tellabs Res. Center, Cambridge, MA, USA
fDate :
6/1/2004 12:00:00 AM
Abstract :
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.
Keywords :
network topology; optical fibre networks; telecommunication network reliability; telecommunication traffic; experimental design theory; fast restoration time; network traffic; optical layer mesh protection; optical networks; precross-connected trails; shared mesh protection; Bandwidth; Design for experiments; Network topology; Operations research; Optical fiber networks; Protection; SONET; Switches; Telecommunication traffic; Traffic control; Bandwidth sharing; Dijkstra algorithm; SONET; cage graph; experimental design; mesh protection; mesh restoration; online algorithm; p-cycle; self-healing networks; survivable optical networks;
Journal_Title :
Networking, IEEE/ACM Transactions on
DOI :
10.1109/TNET.2004.828951