Wavelength Assignment in Optical Networks with Fixed Fiber Capacity

We consider the problem of assigning wavelengths to demands in an optical network of m links. We assume that the route of each demand is fixed and the number of wavelengths available on a fiber is some parameter μ. Our aim is to minimize the maximum ratio between the number of fibers deployed on a link e and the number of fibers required on the same link e when wavelength assignment is allowed to be fractional.

[1]  Richard M. Karp,et al.  Global Wire Routing in Two-Dimensional Arrays (Extended Abstract) , 1983, FOCS.

[2]  Uriel Feige,et al.  Zero knowledge and the chromatic number , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[3]  Satish Rao,et al.  Efficient access to optical bandwidth wavelength routing on directed fiber trees, rings, and trees of rings , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[4]  Klaus Jansen,et al.  Optimal Wavelength Routing on Directed Fiber Trees , 1999, Theor. Comput. Sci..

[5]  Biswanath Mukherjee,et al.  A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks , 1996, IEEE J. Sel. Areas Commun..

[6]  Peter Winkler,et al.  Ring routing and wavelength translation , 1998, SODA '98.

[7]  L. Zhang,et al.  Line system design for DWDM networks , 2004, 11th International Telecommunications Network Strategy and Planning Symposium. NETWORKS 2004,.

[8]  Peter Winkler,et al.  Wavelength assignment and generalized interval graph coloring , 2003, SODA '03.

[9]  Alok Aggarwal,et al.  Efficient routing and scheduling algorithms for optical networks , 1994, SODA '94.

[10]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[11]  Adrian Vetta,et al.  Lighting fibers in a dark network , 2004, IEEE Journal on Selected Areas in Communications.

[12]  Eli Upfal,et al.  Efficient routing in all-optical networks , 1994, STOC '94.

[13]  Donald R. Woods,et al.  Notes on Introductory Combinatorics. , 1986 .

[14]  Aris Pagourtzis,et al.  Routing and Path Multi-Coloring , 2001, Inf. Process. Lett..

[15]  Hervé Rivano,et al.  Fractional Path Coloring with Applications to WDM Networks , 2001, ICALP.

[16]  Chandra Chekuri,et al.  Multicommodity Demand Flow in a Tree , 2003, ICALP.

[17]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[18]  Klaus Jansen,et al.  Approximation Algorithms for Combinatorial Optimization , 2000 .

[19]  C. Scheideler.  Probabilistic Methods for Coordination Problems , 2000 .

[20]  Satish Rao,et al.  Efficient access to optical bandwidth , 1995, FOCS 1995.

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

[22]  Vijay Kumar,et al.  Improved access to optical bandwidth in trees , 1997, SODA '97.

[23]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[24]  Vijay Kumar,et al.  Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks , 1998, APPROX.

[25]  Katerina Potika,et al.  Resource Allocation Problems in Multifiber WDM Tree Networks , 2003, WG.