Minimizing electronic line terminals for automatic ring protection in general WDM optical networks

被引:30
作者
Calinescu, G [1 ]
Frieder, O [1 ]
Wang, PJ [1 ]
机构
[1] IIT, Dept Comp Sci, Chicago, IL 60616 USA
关键词
approximation algorithm; automatic ring protection; lightpath; traffic grooming;
D O I
10.1109/49.974672
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Automatic ring protection provides simple and rapid fault protection and restoration in telecommunication networks. To implement the automatic ring protection in general wavelength-division multiplexing (WDM) optical networks, the lightpaths are partitioned into groups each of which can be carried in a simple cycle of the underlying network. As the electronic line terminals are the dominant cost factor in the deployment of WDM optical networks, we study how to generate these partitions with minimum electronic line terminals. This optimization problem is NP-hard. We develop two polynomial-time approximation algorithms, with performance guarantees between 1.5 and 1.6 and between 1.5 and 1.5 + epsilon, respectively. The second algorithm can be adapted, with the same performance guarantees, to the problem in which lightpaths are not prespecified and only the endpoints of each connection are given. Both algorithms can be easily adapted, with the same performance guarantees, to the problem in which only link protection is desired, and each group must be carried in a closed trail. The first algorithm matches and the second algorithm improves the approximation ratio obtained independently by Eilam et al. (2000).
引用
收藏
页码:183 / 189
页数:7
相关论文
共 12 条
  • [1] Alanyali M, 1998, IEEE INFOCOM SER, P910, DOI 10.1109/INFCOM.1998.665116
  • [2] Armitage J, 1997, IEEE INFOCOM SER, P244, DOI 10.1109/INFCOM.1997.635136
  • [3] CALINESCU G, IN PRESS J COMBINATO
  • [4] CALINESCU G, 2000, THEORETICAL COMPUTER
  • [5] EILAM T, 2000, 14 INT S DISTR COMP
  • [6] GERSTEL O, P IEEE INFOCOM 98, V1, P94
  • [7] GERSTEL O, P IEEE INFOCOM 99, V2, P734
  • [8] Graham R.L., 1995, Handbook of Combinatorics, VVolume 2
  • [9] HAQUE I, 1996, SONET SDH SOURCEBOOK, P131
  • [10] LIU LW, P INFOCOM 2000, V2, P1020