Abstract
We deal with the Regenerator Location Problem in optical networks. We are given a network Gā=ā(V, E), and a set \({\cal Q}\) of communication requests between pairs of terminals in V. We investigate two variations: one in which we are given a routing \({\cal P}\) of the requests in \({\cal Q}\), and one in which we are required to find also the routing. In both cases, each path in \({\cal P}\) must contain a regenerator after every d edges in order to deal with loss of signal quality for some dā>ā0. The goal is to minimize the number of vertices that contain regenerators used by the solution. Both variations of the problem are \(\textsc{NP-hard}\) in the general case. In this work we investigate the parameterized complexity of the problem. We introduce several fixed parameter tractability results and polynomial algorithms for fixed parameter values, as well as several \(\textsc{NP-hardness}\) results. The parameters under consideration are the treewidth of the input graph, the sizes d and \(|{{\cal Q}}|\) and the vertex load, i.e. the maximum number of paths passing through any vertex.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bateni, M., Hajiaghayi, M., Marx, D.: Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. J. ACMĀ 58(5), 21:1ā21:37 (2011)
Chen, S., Raghavan, S.: The regenerator location problem. In: Proceedings of the International Network Optimization Conference (INOC), Spa, Belgium (April 2007)
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: 2010 Conference on Optical Fiber Communication (OFC), Collocated National Fiber Optic Engineers Conference (OFC/NFOEC), pp. 1ā3 (2010)
Flammini, M., Marchetti-Spaccamela, A., Monaco, G., Moscardelli, L., Zaks, S.: On the complexity of the regenerator placement problem in optical networks. IEEE/ACM Transactions on NetworkingĀ 19(2), 498ā511 (2011)
Flammini, M., Monaco, G., Moscardelli, L., Shachnai, H., Shalom, M., Tamir, T., Zaks, S.: Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci.Ā 411(40-42), 3553ā3562 (2010)
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)
Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Optimizing regenerator cost in traffic grooming. Theoretical Computer ScienceĀ 412(52), 7109ā7121 (2011)
Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. AlgorithmicaĀ 20(4), 374ā387 (1998)
Guo, J., Niedermeier, R., SuchĆ½, O.: Parameterized complexity of arc-weighted directed steiner problems. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.Ā 5878, pp. 544ā553. Springer, Heidelberg (2009)
Hartstein, I., Shalom, M., Zaks, S.: On the complexity of the regenerator location problem - treewidth and other parameters. Technical Report CS-2012-08, Department of Computer Science, Technion, Haifa, Israel (October 2012)
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)
Mertzios, G.B., Shalom, M., Wong, P.W.H., Zaks, S.: Online regenerator placement. In: FernĆ ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol.Ā 7109, pp. 4ā17. Springer, Heidelberg (2011)
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 (OFC/NFOEC), OWA2, San Diego, CA, USA (February 2008)
Shalom, M., Voloshin, A., Wong, P.W.H., Yung, F.C.C., Zaks, S.: Online optimization of busy time on parallel machines. In: Agrawal, M., Cooper, S.B., Li, A. (eds.) TAMC 2012. LNCS, vol.Ā 7287, pp. 448ā460. Springer, Heidelberg (2012)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hartstein, I., Shalom, M., Zaks, S. (2013). On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters. In: Erlebach, T., Persiano, G. (eds) Approximation and Online Algorithms. WAOA 2012. Lecture Notes in Computer Science, vol 7846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38016-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-38016-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38015-0
Online ISBN: 978-3-642-38016-7
eBook Packages: Computer ScienceComputer Science (R0)