On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks

We present scheduling problems that stem from optical networks, and discuss their complexity. We present lower bounds and inapproximability results for several optimization problems. They include offline and online scenarios, and concern problems that optimize the use of components in the optical networks, specifically Add-Drop Multiplexers ADMs and regenerators.

[1]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[2]  Peng-Jun Wan,et al.  Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs , 2002, J. Comb. Optim..

[3]  Andrea Vitaletti,et al.  Randomized Lower Bounds for Online Path Coloring , 1998, RANDOM.

[4]  Shmuel Zaks,et al.  Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests , 2012, IEEE/ACM Transactions on Networking.

[5]  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..

[6]  秋山 仁,et al.  A Short Proof of the Linear Arboricity for Cubic Graphs , 1982 .

[7]  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.

[8]  Peng-Jun Wan,et al.  Traffic partition in WDM/SONET rings to minimize SONET ADMs , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[9]  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.

[10]  Leah Epstein,et al.  Better Bounds for Minimizing SONET ADMs , 2004, WAOA.

[11]  Peng-Jun Wan,et al.  Minimizing electronic line terminals for automatic ring protection in general WDM optical networks , 2002, IEEE J. Sel. Areas Commun..

[12]  Gianpiero Monaco,et al.  On the complexity of the regenerator placement problem in optical networks , 2011, TNET.

[13]  S. Raghavan,et al.  The regenerator location problem , 2010 .

[14]  Shmuel Zaks,et al.  Lightpath arrangement in survivable rings to minimize the switching cost , 2002, IEEE J. Sel. Areas Commun..

[15]  Ori Gerstel,et al.  Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

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

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

[18]  Byrav Ramamurthy,et al.  Dynamic routing in translucent WDM optical networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[19]  Shmuel Zaks,et al.  On Minimizing the Number of ADMs in a General Topology Optical Network , 2006, DISC.

[20]  Shmuel Zaks,et al.  A 10/7 + /spl epsi/ approximation for minimizing the number of ADMs in SONET rings , 2004, First International Conference on Broadband Networks.

[21]  Prudence W. H. Wong,et al.  Optimal on-line colorings for minimizing the number of ADMs in optical networks , 2010, J. Discrete Algorithms.

[22]  Carsten Thomassen.  Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5 , 1999, J. Comb. Theory, Ser. B.

[23]  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.

[24]  Jean-Claude Bermond,et al.  On linear k-arboricity , 1984, Discret. Math..

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