Routing for Load Balance
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.
KeywordsInteger Linear Program Optical Network Network Load Logical Topology Link Load
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- 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
- 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