A 10/7 + " Approximation for Minimizing the Number of ADMs in SONET Rings
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
On minimizing the number of ADMs – tight bounds for an algorithm without preprocessing
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Better bounds for minimizing SONET ADMs
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Lightpath arrangement in survivable rings to minimize the switching cost
IEEE Journal on Selected Areas in Communications
Minimizing electronic line terminals for automatic ring protection in general WDM optical networks
IEEE Journal on Selected Areas in Communications
On minimizing the number of ADMs---Tight bounds for an algorithm without preprocessing
Journal of Parallel and Distributed Computing
Selfishness, collusion and power of local search for the ADMs minimization problem
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal on-line colorings for minimizing the number of ADMs in optical networks
Journal of Discrete Algorithms
Selfishness, collusion and power of local search for the ADMs minimization problem
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
On minimizing the number of ADMs – tight bounds for an algorithm without preprocessing
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Optimal on-line colorings for minimizing the number of ADMs in optical networks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
Minimizing the number of electronic switches in optical networks is a main research topic in recent studies. In such networks we assign colors to a given set of lightpaths. Thus the lightpaths are partitioned into cycles and paths, and the switching cost is minimized when the number of paths is minimized. The problem of minimizing the switching cost is NP-hard. A basic approximation algorithm for this problem eliminates cycles of size at most l, and has a performance guarantee of $OPT+\frac{1}{2}(1+\epsilon)N$, where OPT is the cost of an optimal solution, N is the number of lightpaths, and $0 \leq \epsilon \leq \frac{1}{l+2}$, for any given odd l. We improve the analysis of this algorithm and prove that $\epsilon \leq \frac{1}{\frac{3}{2}(l+2)}$. This implies an improvement in the running time of the algorithm: for any ε, the exponent of the running time needed for the same approximation ratio is reduced by a factor of 3/2. We also show a lower bound of $\epsilon \geq \frac{1}{2l+3}$. In addition, in our analysis we suggest a novel technique, including a new combinatorial lemma.