Advertisement

Wavelength Assignment in Optical Networks with Fixed Fiber Capacity

  • Matthew Andrews
  • Lisa Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3142)

Abstract

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.

Our main results are negative ones. We show that there is no constant-factor approximation algorithm unless NP⊆ZPP. No such negative result is known if the routes are not fixed. In addition, unless all languages in NP have randomized algorithms with expected running time \(O(n^{{\mbox{\scriptsize{polylog}}}(n)})\), we show that there is no log γ μ approximation for any γ ∈ (0,1) and no log γ m approximation for any γ ∈ (0,0.5). Our analysis is based on hardness results for the problem of approximating the chromatic number in a graph.

On the positive side, we present algorithms with approximation ratios O(log m+logμ), O(logD max  + logμ) and O(D max ) respectively. Here D max is the length of the longest path.

We conclude by presenting two variants of the problem and discussing which of our results still apply.

Keywords

Optical networking wavelength assignment fixed capacity fiber inapproximability 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aggarwal, A., Bar-Noy, A., Coppersmith, D., Ramaswami, R., Schieber, B., Sudan, M.: Efficient routing and scheduling algorithms for optical networks. In: Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, January 1994, pp. 412–423 (1994)Google Scholar
  2. 2.
    Andrews, M., Zhang, L.: Wavelength assignment in optical networks with fixed fiber capacity. Bell Labs Technical Memorandum (2003)Google Scholar
  3. 3.
    Banerjee, D., Mukherjee, B.: A practical approach for routing and wavelength assignment in large wavelength-routed optical networks. IEEE Journal on Selected Areas in Communications 14(5), 903–908 (1996)CrossRefGoogle Scholar
  4. 4.
    Caragiannis, I., Ferreira, A., Kaklamanis, C., Perennes, S., Rivano, H.: Fractional path coloring with applications to WDM networks. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 732–743. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Chekuri, C.: Personal communication (2003)Google Scholar
  6. 6.
    Chekuri, C., Mydlarz, M., Shepherd, F.B.: Multicommodity demand flow in a tree. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, Springer, Heidelberg (2003)Google Scholar
  7. 7.
    Erlebach, T., Jansen, K., Kaklamanis, C., Mihail, M., Persiano, P.: Optimal wavelength routing in directed fiber trees. Theoretical Computer Science 221(1-2), 119–137 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Erlebach, T., Pagourtzis, A., Potika, K., Stefanakos, S.: Resource allocation problems in multifiber WDM tree networks. In: Proceedings of the 29th International Workshop on Graph Theoretic Concepts in Computer Science, pp. 218–229 (2003)Google Scholar
  9. 9.
    Feige, U., Kilian, J.: Zero knowledge and the chromatic number. In: IEEE Conference on Computational Complexity, pp. 278–287 (1996)Google Scholar
  10. 10.
    Fortune, S., Sweldens, W., Zhang, L.: Line system design for DWDM networks. In: Proceedings of the 11th International Telecommunications Network Strategy and Planning Symposium (Networks), Vienna, Austria (2004)Google Scholar
  11. 11.
    Gnauck, A.: Digital transmission. Post-OFC 2004 Reviews (2004)Google Scholar
  12. 12.
    Karp, R.M., Leighton, F.T., Rivest, R.L., Thompson, C.D., Vazirani, U.V., Vazirani, V.V.: Global wire routing in two-dimensional arrays. Algorithmica 2, 113–129 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Klasing, R.: Methods and problems of wavelength-routing in all-optical networks. Technical Report CS-RR-348, Department of Computer Science, University ofWarwick (1998)Google Scholar
  14. 14.
    Kumar, V.: Approximating circular arc coloring and bandwidth allocation in alloptical ring networks. In: Jansen, K., Rolim, J.D.P. (eds.) APPROX 1998. LNCS, vol. 1444, pp. 147–158. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  15. 15.
    Kumar, V., Schwabe, E.: Improved access to optical bandwidth in trees. In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, January 1997, pp. 437–444 (1997)Google Scholar
  16. 16.
    Mihail, M., Kaklamanis, C., Rao, S.: Efficient access to optical bandwidth. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 548–557 (1995)Google Scholar
  17. 17.
    Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge University Press, Cambridge (1995)zbMATHGoogle Scholar
  18. 18.
    Nomikos, C., Pagourtzis, A., Zachos, S.: Routing and path multi-coloring. Information Processing Letters (2001)Google Scholar
  19. 19.
    Polya, G., Tarjan, R., Woods, D.: Notes on Introductory Combinatorics, Progress in Computer Science, No. 4. Birkhauser, Boston, Basel, Stuttgart (1983)Google Scholar
  20. 20.
    Raghavan, P., Thompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 365–374 (1991)CrossRefMathSciNetGoogle Scholar
  21. 21.
    Raghavan, P., Upfal, E.: Efficient routing in all-optical networks. In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing (1994)Google Scholar
  22. 22.
    Scheideler, C.: Probabilistic Methods for Coordination Problems. Habilitation thesis, Paderborn University (2000)Google Scholar
  23. 23.
    Shepherd, B., Vetta, A.: Lighting fibers in a dark network. Bell Labs Technical Memorandum (January 2003)Google Scholar
  24. 24.
    Wilfong, G., Winkler, P.: Ring routing and wavelength translation. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, January 1998, pp. 333–341 (1998)Google Scholar
  25. 25.
    Winkler, P., Zhang, L.: Wavelength assignment and generalized interval graph coloring. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (January 2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Matthew Andrews
    • 1
  • Lisa Zhang
    • 1
  1. 1.Bell LaboratoriesMurray HillUSA

Personalised recommendations