Minimization of SONET ADMs in ring networks revisited

Minimization of SONET ADMs in ring networks revisited
复制标题

重新审视环形网络中 SONET ADM 的最小化

DOI：
--
复制
发表时间：
2010
期刊：
Computing
影响因子：
3.7
通讯作者：
Betzalel Menahem
Betzalel Menahem
中科院分区：
计算机科学3区
文献类型：
--
作者：
L. Epstein;Asaf Levin;Betzalel Menahem

文献摘要

被引文献

相似文献

我们为 ADM 最小化问题的两个变体设计了改进的近似算法。 SONET 分插复用器 (ADM) 是 SONET/WDM 环中的主要成本因素。环中一组业务流（光路）所需的 SONET ADM 数量由业务流的路由和波长分配决定。我们考虑弧形版本（其中每个交通流的路线作为输入）和弦版本（其中路线由算法决定）。两种情况的目标都是分配波长，以最大限度地减少所用 SONET ADM 的总数。
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. The number of SONET ADMs required by a set of traffic streams (lightpaths) in a ring is determined by the routing and the wavelength assignment of the traffic streams. We consider both the arc version where the route of each traffic stream is given as input, and the chord version, where the routing is to be decided by the algorithm. The goal in both cases is to assign wavelengths so as to minimize the total number of used SONET ADMs.