Minimizing electronic line terminals for automatic ring protection in general WDM optical networks
Minimizing electronic line terminals for automatic ring protection in general WDM optical networks
复制标题
最小化电子线路终端以实现一般 WDM 光网络中的自动环保护
DOI：
--
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
P. Wan
中科院分区：
文献类型：
--
作者：
G. Călinescu;O. Frieder;P. Wan
自动环保护在电信网络中提供简单、快速的故障保护和恢复。为了在普通波分复用(WDM)光网络中实现自动环保护，将光路划分为组，每组光路径可以在底层网络的一个简单循环中承载。由于电子线路终端是WDM光网络部署中的主要成本因素，我们研究了如何用最少的电子线路终端来产生这些划分。这个优化问题是NP难的。我们开发了两种多项式时间近似算法，性能保证分别在1.5到1.6和1.5到1.5+/SPL EPSi/之间。第二种算法可以在具有相同性能保证的情况下适用于没有预先指定光路并且只给出每个连接的端点的问题。在相同的性能保证下，这两种算法都可以很容易地适应其中只需要链路保护并且每个组必须在封闭的路径中携带的问题。第一种算法匹配，第二种算法改进了Eilam等人独立获得的逼近比。(请参见第14条交响乐。分布式计算，2000)。
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 + /spl epsi/, 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. (see 14th Int. Symp. Distributed Computing, 2000).