Placing regenerators in optical networks to satisfy multiple sets of requests

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6199 LNCS, Issue PART 2, 2010, Pages 333-344

  Mertzios, George B ^a   Sau, Ignasi ^b   Shalom, Mordechai ^c   Zaks, Shmuel ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c TEL HAI COLLEGE   (Israel)

Author keywords

approximation algorithms; hardness of approximation; optical networks; overprovisioning; regenerators

Indexed keywords

ACCURATE ESTIMATION; ACTIVE AREA; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; FINITE SET; HARDNESS OF APPROXIMATION; HARDNESS RESULT; IF THERE ARE; LIGHT PATH; MAXIMUM DEGREE; MULTIPLE SET; NETWORK HOSTING; NP-HARD; OPTICAL NETWORKS; OVERPROVISIONING; POLYNOMIAL-TIME; POSITIVE INTEGER D; REAL COSTS; THEORETICAL STUDY; TRAFFIC PATTERN;

COMPUTER SIMULATION; COST FUNCTIONS; FIBER OPTIC NETWORKS; HARDNESS; LINGUISTICS; REGENERATORS; TRANSLATION (LANGUAGES);

APPROXIMATION ALGORITHMS;

EID: 77955333302     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14162-1_28     Document Type: Conference Paper

References (23)

1. Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theoretical Computer Science 237 (1-2), 123-134 (2000)
2. Amini, O., Pérennes, S., Sau, I.: Hardness and Approximation of Traffic Grooming. Theoretical Computer Science 410 (38-40), 3751-3760 (2009)
3. Austrin, P., Khot, S., Safra, M.: Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs. In: Proc. of the 24th IEEE Computational Complexity Conference (CCC), pp. 74-80 (2009)
4. Baker, B. S.: Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM 41 (1), 153-180 (1994)
5. Chen, S., Raghavan, S.: The regenerator location problem. In: Proc. of the International Network Optimization Conference, INOC (2007); Full version to appear in Networks
6. Demaine, E., Hajiaghayi, M., Kawarabayashi, K.-I.: Algorithmic Graph Minor Theory: Decomposition, Approximation and Coloring. In: Proc. of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 637-646 (2005)
7. Diestel, R.: Graph Theory. Springer, Heidelberg (2005)
8. Fedrizzi, R., Galimberti, G. M., Gerstel, O., Martinelli, G., Salvadori, E., Saradhi, C. V., Tanzi, A., Zanardi, A.: A Framework for Regenerator Site Selection Based on Multiple Paths. In: Prooceedings of IEEE/OSA Conference on Optical Fiber Communications, OFC (to appear, 2010)
9. Fedrizzi, R., Galimberti, G. M., Gerstel, O., Martinelli, G., Salvadori, E., Saradhi, C. V., Tanzi, A., Zanardi, A.: Traffic Independent Heuristics for Regenerator Site Selection for Providing Any-to-Any Optical Connectivity. In: Proc. of IEEE/OSA Conference on Optical Fiber Communications, OFC (to appear, 2010)
10. Flammini, M., Marchetti-Spaccamela, A., Monaco, G., Moscardelli, L., Zaks, S.: On the complexity of the regenerator placement problem in optical networks. In: Proc. of the 21st Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 154-162 (2009)
11. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
12. Gerstel, O., Raza, H.: Predeployment of Resources in Agile Photonic Networks. IEEE/OSA Journal of Lightwave Technology 22 (10), 2236-2244 (2004)
13. Kim, S. W., Seo, S. W.: Regenerator placement algorithms for connection establishment in all-optical networks. IEE Proceedings Communications 148 (1), 25-30 (2001)
14. Korotki, S. K.: An Overview of the Global Network Expectation Model. In: Prooceedings of IEEE/OSA Conference on Optical Fiber Communications, OFC (2004)
15. Korotki, S. K., Oikonomou, K. N.: Scaling of Most-Likely Traffic Patterns of Hoseand Cost-Constrained Ring and Mesh Networks. In: Prooceedings of IEEE/OSA Conference on Optical Fiber Communications, OFC (2006)
16. Mertzios, G. B., Sau, I., Shalom, M., Zaks, S.: Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. Technical Report CS-2010-07, Technion, Israel Institute of Technology (2010), www.cs.technion. ac.il/users/www//cgi-bin/tr-info.cgi?2010/CS/CS-2010-07
17. Murthy, C. S. R., Sinha, S.: Information Theoretic Approach to Traffic Adaptive WDM Networks. IEEE/ACM Transactions on Networking 13 (4), 881-894 (2005)
18. Pachnicke, S., Paschenda, T., Krummrich, P. M.: Physical Impairment Based Regenerator Placement and Routing in Translucent Optical Networks. In: Optical Fiber Communication Conference and Exposition and The National Fiber Optic Engineers Conference (Optical Society of America, paper OWA2) (2008)
19. Sriram, K., Griffith, D., Su, R., Golmie, N.: Static vs. dynamic regenerator assignment in optical switches: models and cost trade-offs. In: Workshop on High Performance Switching and Routing (HPSR), pp. 151-155 (2004)
20. Thomassen, C.: Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5. J. Comb. Theory, Ser. B 75 (1), 100-109 (1999)
21. Vazirani, V. V.: Approximation algorithms. Springer, Heidelberg (2001)
22. Yang, X., Ramamurthy, B.: Dynamic routing in translucent WDM optical networks. In: Proc. of the IEEE International Conference on Communications (ICC), pp. 955-971 (2002)
23. Yang, X., Ramamurthy, B.: Sparse Regeneration in Translucent Wavelength- Routed Optical Networks: Architecture, Network Design and Wavelength Routing. Photonic Network Communications 10 (1), 39-53 (2005)