Abstract
We present a clustering algorithm for hierarchical traffic grooming in large WDM networks. In hierarchical grooming, the network is decomposed into clusters, and one hub node in each cluster is responsible for grooming traffic from and to the cluster. Hierarchical grooming scales to large network sizes and facilitates the control and management of traffic and network resources. Yet determining the size and composition of clusters so as to yield good grooming solutions is a challenging task. We identify the grooming-specific factors affecting the selection of clusters, and we develop a parameterized clustering algorithm that can achieve a desired tradeoff among various goals.
This work was supported by the NSF under grant ANI-0322107.
Chapter PDF
References
Baran, P.: On distributed communications networks. IEEE Trans. Commun. 12(1), 1–9 (1964)
Chen, B., Rouskas, G.N., Dutta, R.: A framework for hierarchical grooming in WDM networks of general topology. In: BROADNETS 2005, pp. 167–176 (October 2005)
Choi, H., Szyld, D.B.: Application of threshold partitioning of sparse matrices to markov chains. In: IPDS (1996)
Ding, Z., Hamdi, M.: Clustering techniques for traffic grooming in optical WDM mesh networks. In: GLOBECOM 2002, vol. 3, pp. 2711-2715 (November 2002)
Dutta, R., Rouskas, G.N.: On optimal traffic grooming in WDM rings. IEEE Journal on Selected Areas in Communications 20(1), 110–121 (2002)
Dutta, R., Rouskas, G.N.: Traffic grooming in WDM networks: Past and future. IEEE Network 16(6), 46–56 (2002)
Esfandiari, M., et al.: Improved metro network design by grooming and aggregation of STS-1 demands into OC-192/OC-48 lightpaths. In: NFOEC 2003 (September 2003)
Gonzalez, T.: Clustering to minimize the maximum inter-cluster distance. Theoret. Comput. Sci. 38, 293–306 (1985)
Hartigan, J.A: Clustering Algorithms. Wiley, Chichester (1975)
Hendrickson, B., Leland, R.: The Chaco user’s guide. Technical Report SAND95-2344, Sandia National Laboratories, Albuquerque, NM 87185-1110 (July 1995)
Hochbaum, D., Shmoys, D.B.: A best possible heuristic for the k-center problem. Math. Oper. Res. 10, 180–184 (1985)
Hu, J.Q., Leida, B.: Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks. INFOCOM 2004 23(1), 495–501 (2004)
Huang, S., Dutta, R., Rouskas, G.: Traffic grooming in path, star, and tree networks: Complexity, bounds, and algorithms. JSAC 24(4), 66–82 (2006)
Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal 29, 291–307 (1970)
Konda, V.R., Chow, T.Y.: Algorithm for traffic grooming in optical networks to minimize the number of transceivers. In: HPSR Workshop, pp. 218-221 (2001)
Schloegel, K., Karypis, G., Kumar, V.: A new algorithm for multi-objective graph partitioning. TR99-003, Dept. of CS, Univ. of Minnesota (September 1999)
Siregar, H., et al.: Efficient routing and wavelength assignment in wavelength-routed optical networks. In: 7th Asia-Pacific NOMS, pp. 116-127 (October 2003)
Zhu, H., et al.: A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks. IEEE/ACM Trans. Netw. 11(2), 285–299 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Chen, B., Dutta, R., Rouskas, G.N. (2007). Clustering for Hierarchical Traffic Grooming in Large Scale Mesh WDM Networks . In: Tomkos, I., Neri, F., Solé Pareta, J., Masip Bruin, X., Sánchez Lopez, S. (eds) Optical Network Design and Modeling. ONDM 2007. Lecture Notes in Computer Science, vol 4534. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72731-6_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-72731-6_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72729-3
Online ISBN: 978-3-540-72731-6
eBook Packages: Computer ScienceComputer Science (R0)