Advertisement

Routing for Load Balance

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

Abstract

The load balancing problem, as one of the most significant and extensively studied problems in computer communication networks, is addressed not only in wavelength routed optical networks but also in general circuiot/packet-switched networks. However, this problem is particularly important for the optimization of the usage of some WDM network resources, such as wavelengths and bandwidths.

Keywords

Integer Linear Program Optical Network Network Load Logical Topology Link Load 
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]
    D. Banerjee and B. Mukherjee, A practical approach for routing and wavelength assignment in large wavelength-routed optical networks, IEEE Journal on Selected Areas in Communications, 14 (5) (1996), 903–908.CrossRefGoogle 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]
    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
  4. [4]
    P. Lkein, S. Plotkin, C. Stein, and É. Tardos, Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts, SIAM Journal on Computing, 23 (3) (1994), 466–487.MathSciNetCrossRefGoogle Scholar
  5. [5]
    M. Mihail, C. Kaklamanis, and S. Rao, Efficient access to optical bandwidth, Proceedings of the 36th Annual IEEE Symposium Foundations of Computer Science (FOCS), 1995, 548–557.Google Scholar
  6. [6]
    P. Raghavan and C. D. Thompson, Randomized rounding: A technique for probably good algorithms and algorithmic proofs, Combinatorica, 7 (4) (1987), 365–374.MathSciNetMATHCrossRefGoogle Scholar
  7. [7]
    P. Raghavan and E. Upfal, Efficient routing in all-optical networks, Proceedings ofthe 26th Annual ACM Symposium Theory of Computing (STOC), 1994, 134–143.Google Scholar
  8. [8]
    A. Schrijver, P. Seymour, and P. Winkler, The ring loading problem, SIAM Journal on Discrete Mathematics, 11 (1) (1998), 1–14.MathSciNetMATHCrossRefGoogle Scholar
  9. [9]
    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

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