On the complexity of the regenerator location problem treewidth and other parameters

We deal with the Regenerator Location Problem in optical networks. We are given a network G = ( V , E ) , and a set Q of communication requests between pairs of terminals in V . We investigate two variations: one in which we are given a routing P of the requests in Q , and one in which we are required to find also the routing. In both cases, each path in P must contain at least one regenerator in every d consecutive internal vertices 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 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 NP-hardness results. The parameters under consideration are the treewidth of the input graph, the sizes d and | Q | and the load of the vertices, i.e.?the number of paths passing through any vertex.

[1]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[2]  Kumar N. Sivarajan,et al.  Optical Networks: A Practical Perspective, 3rd Edition , 2009 .

[3]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[4]  Rolf Niedermeier,et al.  Parameterized Complexity of Arc-Weighted Directed Steiner Problems , 2011, SIAM J. Discret. Math..

[5]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[6]  Bostjan Bresar,et al.  Minimum k-path vertex cover , 2010, Discret. Appl. Math..

[7]  Elio Salvadori,et al.  Traffic independent heuristics for regenerator site selection for providing any-to-any optical connectivity , 2010, 2010 Conference on Optical Fiber Communication (OFC/NFOEC), collocated National Fiber Optic Engineers Conference.

[8]  Michael R. Fellows,et al.  On the Complexity of Some Colorful Problems Parameterized by Treewidth , 2007, COCOA.

[9]  Stefan Arnborg,et al.  Linear time algorithms for NP-hard problems restricted to partial k-trees , 1989, Discret. Appl. Math..

[10]  Chunming Qiao,et al.  Fiber-Optic Communication Networks , 2008, Wiley Encyclopedia of Computer Science and Engineering.

[11]  Gianpiero Monaco,et al.  Minimizing total busy time in parallel scheduling with application to optical networks , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[12]  Shmuel Zaks,et al.  Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests , 2010, ICALP.

[13]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[14]  Elio Salvadori,et al.  A framework for regenerator site selection based on multiple paths , 2010, 2010 Conference on Optical Fiber Communication (OFC/NFOEC), collocated National Fiber Optic Engineers Conference.

[15]  Victor Vianu,et al.  Invited articles section foreword , 2010, JACM.

[16]  Mohammad Taghi Hajiaghayi,et al.  Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth , 2009, JACM.

[17]  Kumar N. Sivarajan,et al.  Optical Networks: A Practical Perspective , 1998 .

[18]  Charles A. Brackett,et al.  Dense Wavelength Division Multiplexing Networks: Principles and Applications , 1990, IEEE J. Sel. Areas Commun..

[19]  Gianpiero Monaco,et al.  On the Complexity of the Regenerator Cost Problem in General Networks with Traffic Grooming , 2012, Algorithmica.

[20]  Biswanath Mukherjee,et al.  Optical Communication Networks , 1997 .

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  Si Chen,et al.  The regenerator location problem , 2010, Networks.

[23]  Takao Nishizeki,et al.  The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees , 1998, ISAAC.

[24]  S Pachnicke,et al.  Physical Impairment Based Regenerator Placement and Routing in Translucent Optical Networks , 2008, OFC/NFOEC 2008 - 2008 Conference on Optical Fiber Communication/National Fiber Optic Engineers Conference.

[25]  Byrav Ramamurthy,et al.  Sparse Regeneration in Translucent Wavelength-Routed Optical Networks: Architecture, Network Design and Wavelength Routing , 2005, Photonic Network Communications.

[26]  Viggo Kann,et al.  Some APX-completeness results for cubic graphs , 2000, Theor. Comput. Sci..

[27]  Gianpiero Monaco,et al.  On the Complexity of the Regenerator Placement Problem in Optical Networks , 2011, IEEE/ACM Transactions on Networking.

[28]  Prudence W. H. Wong,et al.  Online optimization of busy time on parallel machines , 2014, Theor. Comput. Sci..

[29]  Hans L. Bodlaender,et al.  Dynamic Programming on Graphs with Bounded Treewidth , 1988, ICALP.

[30]  Gianpiero Monaco,et al.  Optimizing regenerator cost in traffic grooming , 2011, Theor. Comput. Sci..

[31]  David Hung-Chang Du,et al.  Distributed computing with high-speed optical networks , 1993, Computer.

[32]  Ralf Klasing,et al.  Methods and Problems of Wavelength-Routing in All-Optical Networks , 1998 .

[33]  Shmuel Zaks,et al.  On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters - (Extended Abstract) , 2012, WAOA.

[34]  N. Golmie,et al.  Static vs. dynamic regenerator assignment in optical switches: models and cost trade-offs , 2004, 2004 Workshop on High Performance Switching and Routing, 2004. HPSR..

[35]  Seung-Woo Seo,et al.  Regenerator placement algorithms for connection establishment in all-optical networks , 2001 .

[36]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .