Online regenerator placement

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

Volumn 7109 LNCS, Issue , 2011, Pages 4-17

  Mertzios, George B ^a   Shalom, Mordechai ^b   Wong, Prudence W H ^c   Zaks, Shmuel ^d  

^a DURHAM UNIVERSITY   (United Kingdom)

^b TEL HAI COLLEGE   (Israel)

^c UNIVERSITY OF LIVERPOOL   (United Kingdom)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

online algorithms; optical networks

Indexed keywords

ACTIVE AREA; COMPETITIVE RATIO; EDGE-SETS; FEASIBLE SOLUTION; INTERNAL NODES; LIGHT PATH; LOCATION PROBLEMS; LOWER BOUNDS; NETWORK TOPOLOGY; ON-LINE ALGORITHMS; OPTIMIZATION PROBLEMS; PATH TOPOLOGY; POSITIVE INTEGERS; RANDOMIZED ALGORITHMS; REGENERATOR PLACEMENT; TIGHT BOUND;

ALGORITHMS; ELECTRIC NETWORK TOPOLOGY; ONLINE SYSTEMS; REGENERATORS; TOPOLOGY;

FIBER OPTIC NETWORKS;

EID: 84055218423     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25873-2_2     Document Type: Conference Paper

References (12)

1. Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, S.: The online set cover problem. SIAM J. Computing 39(2), 361-370 (2009)
2. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
3. Chen, S., Ljubic, I., Raghavan, S.: The regenerator location problem. Networks 55(3), 205-220 (2010)
4. 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: Proceedings of IEEE/OSA Conference on Optical Fiber Communications, OFC (2010)
5. Flammini, M., Marchetti-Spaccamela, A., Monaco, G., Moscardelli, L., Zaks, S.: On the complexity of the regenerator placement problem in optical networks. IEEETON 19(2), 498-511 (2011)
6. Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Optimizing Regenerator Cost in Traffic Grooming. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 443-458. Springer, Heidelberg (2010)
7. Kim, S.W., Seo, S.W.: Regenerator placement algorithms for connection establishment in all-optical networks. IEE Proceedings Communications 148(1), 25-30 (2001)
8. Mertzios, G.B., Sau, I., Shalom, M., Zaks, S.: Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 333-344. Springer, Heidelberg (2010)
9. 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, page OWA2. Optical Society of America (2008)
10. Sriram, K., Griffith, D., Su, R., Golmie, N.: Static vs. dynamic regenerator assignment in optical switches: models and cost trade-offs. In: Proceedings of the IEEE Workshop on High Performance Switching and Routing (HPSR), pp. 151-155 (2004)
11. Yang, X., Ramamurthy, B.: Dynamic routing in translucent WDM optical networks. In: Proceedings of the IEEE International Conference on Communications (ICC), pp. 955-971 (2002)
12. 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)