Abstract
We consider the problem of traffic grooming in WDM ring networks. Previous studies have focused on minimizing aggregate representations of the network cost. In this work, we consider a Min-Max objective, in which it is desirable to minimize the cost at the node where this cost is maximum. Such an objective is of practical value when dimensioning a network for unknown future traffic demands and/or for dynamic traffic scenarios. We prove that traffic grooming with the Min-Max objective is NP-Complete even when wavelength assignment is not an issue. We also present a new polynomial-time algorithm for Min-Max traffic grooming. Experiments with a wide range of problem instances demonstrate that our algorithm produces solutions which are always close to the optimal and/or the lower bound, and which scale well to large network sizes, large number of wavelengths, and high loads.
This work was supported in part by the NSF under grant ANI-0322107.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Dutta, R., Rouskas, G.N.: A survey of virtual topology design algorithms for wavelength routed optical networks. Optical Networks 1 (2000) 73–89
Dutta, R., Rouskas, G.N.: Traffic grooming in WDM networks: Past and future. IEEE Network 16 (2002) 46–56
Dutta, R., Rouskas, G.N.: On optimal traffic grooming in WDM rings. IEEE Journal on Selected Areas in Communications 20 (2002) 110–121
Chen, L.W., Modiano, E.: Efficient routing and wavelength assignment for reconfigurable WDM networks with wavelength converters. In: IEEE INFOCOM. (2003)
Chen, B., Rouskas, G.N., Dutta, R.: Traffic grooming in WDM rings with the Min-Max objective. Technical report, North Carolina State Univ., Raleigh, NC (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, B., Rouskas, G.N., Dutta, R. (2004). Traffic Grooming in WDM Ring Networks with the Min-Max Objective. In: Mitrou, N., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds) Networking 2004. NETWORKING 2004. Lecture Notes in Computer Science, vol 3042. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24693-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-24693-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21959-0
Online ISBN: 978-3-540-24693-0
eBook Packages: Springer Book Archive