Clustering for hierarchical traffic grooming in large scale mesh WDM networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4534 LNCS, Issue , 2007, Pages 249-258

  Chen, Bensong ^a   Dutta, Rudra ^b   Rouskas, George N ^b  

^a GOOGLE INC   (United States)

^b NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; FIBER OPTIC NETWORKS; HIERARCHICAL SYSTEMS; RESOURCE ALLOCATION; TELECOMMUNICATION TRAFFIC; ALGORITHMS; MESH NETWORKING; WAVELENGTH DIVISION MULTIPLEXING;

HIERARCHICAL GROOMING; HIERARCHICAL TRAFFIC; WDM NETWORKS; CONTROL AND MANAGEMENT; HUB NODES; LARGE NETWORKS; MESH WDM NETWORKS; NETWORK RESOURCE; PARAMETERIZED; TRAFFIC GROOMING;

WAVELENGTH DIVISION MULTIPLEXING; CLUSTERING ALGORITHMS;

EID: 38049059379     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72731-6_28     Document Type: Conference Paper

References (18)

1. P. Baran. On distributed communications networks. IEEE Trans. Commun., 12(1): 1-9, Mar. 1964.
2. B. Chen, G. N. Rouskas, and R. Dutta. A framework for hierarchical grooming in WDM networks of general topology. BROADNETS 2005, pp. 167-176, Oct. 2005.
3. H. Choi and D. B. Szyld. Application of threshold partitioning of sparse matrices to markov chains. In IPDS, 1996.
4. Z. Ding and M. Hamdi. Clustering techniques for traffic grooming in optical WDM mesh networks. In GLOBECOM 2002, vol. 3, pp. 2711-2715, Nov. 2002.
5. R. Dutta and G. N. Rouskas. On optimal traffic grooming in WDM rings. IEEE Journal on Selected Areas in Communications, 20(1):110-121, January 2002.
6. R. Dutta and G. N. Rouskas. Traffic grooming in WDM networks: Past and future. IEEE Network, 16(6):46-56, November/December 2002.
7. M. Esfandiari, et al. Improved metro network design by grooming and aggregation of STS-1 demands into OC-192/OC-48 lightpaths. In NFOEC 2003, Sep. 2003.
8. T. Gonzalez. Clustering to minimize the maximum inter-cluster distance. Theoret. Comput. Sci., 38:293-306, 1985.
9. John A. Hartigan. Clustering Algorithms. Wiley, 1975.
10. B. Hendrickson and R. Leland. The Chaco user's guide. Technical Report SAND95-2344, Sandia National Laboratories, Albuquerque, NM 87185-1110, July 1995.
11. D. Hochbaum and D.B. Shmoys. A best possible heuristic for the k-center problem. Math. Oper. Res., 10:180-184, 1985.
12. J.Q. Hu and B. Leida. Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks. INFOCOM 2004, 23(1):495-501, Mar. 2004.
13. S. Huang, R. Dutta, and G. Rouskas. Traffic grooming in path, star, and tree networks: Complexity, bounds, and algorithms. JSAC, 24(4):66-82, Apr. 2006.
14. B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 29:291-307, 1970.
15. V. R. Konda and T. Y. Chow. Algorithm for traffic grooming in optical networks to minimize the number of transceivers. In HPSR Workshop, pp. 218-221, 2001.
16. K. Schloegel, G. Karypis, and V. Kumar. A new algorithm for multi-objective graph partitioning. TR99-003, Dept. of CS, Univ. of Minnesota, Sep. 1999.
17. H. Siregar et al. Efficient routing and wavelength assignment in wavelength-routed optical networks. 7th Asia-Pacific NOMS, pp. 116-127, Oct. 2003.
18. H. Zhu et al. A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks. IEEE/ACM Trans. Netw., 11(2):285-299, Apr. 2003.