Advertisement

Wavelength Assignment

  • Xiaohua Jia
  • Xiao-Dong Hu
  • Ding-Zhu Du
Part of the Network Theory and Applications book series (NETA, volume 9)

Abstract

Wavelengths are limited resource in WDM networks. State-of-the-art technology allows close to 300 wavelengths in the laboratory. However, less than 64 wavelengths can be used in real systems. Thus how to make wavelength assignment is crucial for taking full advantage of the potential of WDM networks.

Keywords

Directed Path Tree Network Wavelength Assignment Ring Network Load Balance Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    C. Berge, The Theory of Graphs and its Applications, John Wiley, 1962.MATHGoogle Scholar
  2. [2]
    T. Erlebach and K. Jansen, Scheduling of virtual connections in fast networks, Proceedings of the 4th Workshop on Parallel Systems and Algorithms (PASA), 1996, 13–32.Google Scholar
  3. [3]
    T. Erlebach, K. Jansen, C. Kaklamanis, and P. Persiano, An optimal greedy algorithm in directed tree networks, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 40 (1998), 117–129.MathSciNetGoogle Scholar
  4. [4]
    M. R. Garey, D. S. Johnson, G. L. Miller, and C. H. Papadimitriou, The complexity of coloring circular arcs and chords, SIAM Journal on Algebraic Discrete Methods, 1 (2) (1980), 216–227.MathSciNetMATHCrossRefGoogle Scholar
  5. [5]
    I. Holyer, The NP-completeness of edge-coloring, SIAM Journal on Computing, 10 (4) (1981), 718–720.MathSciNetMATHCrossRefGoogle Scholar
  6. [6]
    V. Kumar, An approximation algorithm for circular arc coloring, Algorithmica, 30 (2001), 406–417.MathSciNetMATHCrossRefGoogle Scholar
  7. [7]
    V. Kumar, Approximating circular arc coloring and bandwidth allocation in all-optical ring networks, Lecture Notes in Computer Science, 1444 (1998), 147–158.CrossRefGoogle Scholar
  8. [8]
    V. Kumar and E. J. Schwabe, Improved access to optical bandwidth in trees, Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1997, 437–444.Google Scholar
  9. [9]
    G.-Z. Li and R. Sinha, On the wavelength assignment problem in multifiber WDM star and ring networks, IEEE/ACM Transactions on Networking, 9 (1) (2001), 60–68.CrossRefGoogle Scholar
  10. [10]
    C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Journal of the ACM, 41 (5) (1994), 960–981.MathSciNetMATHCrossRefGoogle Scholar
  11. [11]
    D. W. Matula, G. Marble, and J. D. Isaacson, Graph coloring algorithms, in Graph Theory and Computing, R. C. Read, Ed., New York and London: Academic, 1972, 109–122.Google Scholar
  12. [12]
    A. Mokhtar and M. Azizoglu, Adaptive wavelength routing in all-optical networks, IEEE/ACM Transactions on Networking, 6 (2) (1998), 197–206.CrossRefGoogle Scholar
  13. [13]
    T. Nishizeki and K. Kashiwagi, On the 1.1 edge-coloring of multigraphs, SIAM Journal on Discrete Mathematics, 3 (3) (1990), 391–410.MathSciNetMATHCrossRefGoogle Scholar
  14. [14]
    P. Raghavan and E. Upfal, Efficient routing in all-optical networks, Proceedings of the 26th Annual ACM Symposium Theory of Computing (STOC), 1994, 134–143.Google Scholar
  15. [15]
    M. Slusarek, A coloring algorithm for interval graphs, Lecture Notes in Computer Science, 379 (1989), 471–480.MathSciNetCrossRefGoogle Scholar
  16. [16]
    G. Wilfong and P. Winkler, Ring routing and wavelength translation, Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1998, 333–341.Google Scholar
  17. [17]
    M. Yannakakis and F. Gavril, Edge dominating sets in graphs, SIAM Journal on Applied Mathematics, 38 (1980), 364–372.MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2002

Authors and Affiliations

  • Xiaohua Jia
    • 1
  • Xiao-Dong Hu
    • 2
  • Ding-Zhu Du
    • 3
  1. 1.Department of Computer ScienceCity University of Hong KongHong Kong, SAR China
  2. 2.Institute of Applied MathematicsAcademy of Mathematics and System Science, Chinese Academy of SciencesBeijingP.R. China
  3. 3.Department of Computer ScienceUniversity of MinnesotaMinneapolisUSA

Personalised recommendations