On the complexity of the regenerator placement problem in optical networks

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2009, Pages 154-162

  Flammini, Michele ^a   Spaccamela, Alberto Marchetti ^b   Monaco, Gianpiero ^a   Moscardelli, Luca ^c   Zaks, Shmuel ^d  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c UNIVERSITY OF CHIETI   (Italy)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Approximation algorithms; Complexity; Optical networks; Regenerators; Wavelength division multiplexing (WDM)

Indexed keywords

ANALYTICAL RESULTS; COMPLEXITY; GRAPH G; INAPPROXIMABILITY; NP COMPLETE; OPTICAL NETWORKS; POLYNOMIAL-TIME ALGORITHMS; REGENERATOR PLACEMENT;

FIBER OPTIC NETWORKS; MULTIPLEXING EQUIPMENT; OPTICAL MATERIALS; POLYNOMIAL APPROXIMATION; REGENERATORS; WAVELENGTH DIVISION MULTIPLEXING;

APPROXIMATION ALGORITHMS;

EID: 70449643050     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1583991.1584035     Document Type: Conference Paper

References (18)

1. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela and M. Protasi. Complexity and Approximation, Combinatorial Optimization Problems and Their Approximability Properties. Springer-verlag, 1999.
2. C. A. Brackett, A. S. Acampora, J. Sweitzer, G. Tangonan, M. T. Smith,W. Lennon, K.-C. Wang, R.H. Hobbs. A scalable multiwavelength multihop optical network: a proposal forresearch on all-optical networks. Journal of Lightwave Technology, 11(5), pp. 736-753, 1993.
3. I. Caragiannis, C. Kaklamanis and P. Kanellopoulos. Energy-Efficient Wireless Network Design. Theory of Comput. Syst., 39(5), pp. 593-617, 2006.
4. S. Chen and S. Raghavan. The Regenerator Location Problem. In Proceedings of the International Network Optimization Conference (INOC 2007).
5. V. Chvatal. A greedy heuristic for the set-covering problem. Math. Oper. Res., 4(3), pp. 233-235, 1979.
6. T. Erlebach and S. Stefanakos. Wavelength Conversion in All-Optical Networks with Shortest-Path Routing. Algorithmica, 43(1-2), pp. 43-61, 2005.
7. U. Feige. A threshold of ln n for approximating set cover. Journal of the ACM, 45(4), pp. 634-652, 1998.
8. M. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, 1979.
9. S. Guha and S. Khuller. Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. Infomation and Computation, 150(1), pp. 57-74, 1999.
10. J. M. Kleinberg and A. Kumar. Wavelength Conversion in Optical Networks. Journal of Algorithms, 38(1), pp. 25-50, 2001.
11. S. W. Kim and S. W. Seo. Regenerator placement algorithms for connection establishment in all-optical networks. IEEE Proceedings Communications, 148(1), pp. 25-30, 2001.
12. S. Pachnicke, T. Paschenda and P. M. Krummrich. Physical Impairment Based Regenerator Placement and Routing in Translucent Optical Networks. Proceedings of the Optical Fiber communication/National Fiber Optic Engineers Conference, (OFC/NFOEC 2008), pp. 1-3, 2008.
13. B. Ramamurthy, H. Feng, D. Datta, J. P. Heritage and B. Mukherjee. Transparent vs. opaque vs. translucent wavelength-routed optical networks. Proceedings of the Optical Fiber Communication Conference and the International Conference on Integrated Optics and Optical Fiber Communication, (OFC/IOOC 99), pp. 59-61, 1999.
14. C. V. Saradhi and S. Zaks. Placement of regenerators in optical networks. In preparation.
15. K. Sriram, D. Griffith, R. Su and N. Golmie. Static vs. dynamic regenerator assignment in optical switches: models and cost trade-offs. Proceedings of the Workshop on High Performance Switching and Routing, (HPSR 2004), pp. 151-155, 2004.
16. G.T. Wilfong and P. Winkler. Ring Routing and Wavelength Translation. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), pp. 333-341, 1998.
17. X. Yang and B. Ramamurthyn. Sparse Regeneration in Translucent Wavelength-Routed Optical Networks: Architecture, Network Design and Wavelength Routing. Photonic Network Communications, 10(1), pp. 39-53, 2005.
18. X. Yang and B. Ramamurthy. Dynamic routing in translucent WDM optical networks. Proceedings of the IEEE International Conference on Communications (ICC 2002), pp. 2796-2802, 2002.