Lightpath arrangement in survivable rings to minimize the switching cost

This paper studies the design of low-cost survivable wavelength-division-multiplexing (WDM) networks. To achieve survivability, lightpaths are arranged as a set of rings. Arrangement in rings is also necessary to support SONET/SDH protection schemes such as 4FBLSR above the optical layer. This is expected to be the most common architecture in regional (metro) networks. We assume that we are given a set of lightpaths in an arbitrary network topology and aim at finding a partition of the lightpaths to rings adding a minimum number of lightpaths to the original set. The cost measure that we consider (number of lightpaths) reflects the switching cost of the entire network. In the case of a SONET/SDH higher layer, the number of lightpaths is equal to the number of add-drop multiplexers (ADMs) (since two subsequent lightpaths in a ring can share an ADM at the common node). We prove some negative results on the tractability and approximability of the problem and provide an approximation algorithm with a worst case approximation ratio of 8/5. We study some special cases in which the performance of the algorithm is improved. A similar problem was introduced, motivated, and studied by Liu, Li, Wan and Frieder (see Proc. INFOCOM 2000, p.1020-1025, 2000) Gerstel, Lin and Sasaki, (see Proc. IEEE INFOCOM '98, p. 94-101, 1998)(where it was termed minimum ADM problem). However, these two works focused on a ring topology while we generalize the problem to an arbitrary network topology.

[1]  Ori Gerstel,et al.  Cost effective traffic grooming in WDM rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[2]  Gary Chartrand,et al.  Randomly Traceable Graphs , 1968 .

[3]  Ori Gerstel,et al.  Fault tolerant multiwavelength optical rings with limited wavelength conversion , 1998, IEEE J. Sel. Areas Commun..

[4]  Eytan Modiano,et al.  Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic , 2000, IEEE Journal on Selected Areas in Communications.

[5]  Shmuel Zaks,et al.  Approximation Algorithms for Survivable Optical Networks , 2000, DISC.

[6]  Xiang-Yang Li,et al.  Wavelength assignment in WDM rings to minimize SONET ADMs , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[7]  Shimon Even,et al.  Graph Algorithms , 1979 .

[8]  Gary L. Miller,et al.  The Complexity of Coloring Circular Arcs and Chords , 1980, SIAM J. Algebraic Discret. Methods.

[9]  Murat Alanyali,et al.  Provisioning algorithms for WDM optical networks , 1999, TNET.

[10]  A.L. Chiu,et al.  Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks , 2000, Journal of Lightwave Technology.

[11]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[12]  Adrian Segall,et al.  Distributed network control for optical networks , 1997, TNET.

[13]  Jean-Yves Le Boudec,et al.  Design of a survivable WDM photonic network , 1997, Proceedings of INFOCOM '97.

[14]  Ken-ichi Sato,et al.  Number of wavelengths required for optical networks with failure restoration , 1994 .

[15]  Ori Gerstel,et al.  Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.