On the application of K-Center algorithms to hierarchical traffic grooming

2nd International Conference on Broadband Networks, BROADNETS 2005

Volumn 2005, Issue , 2005, Pages 295-301

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

^a North Carolina State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

K-CENTER PROBLEM; TRAFFIC GROOMING; TRAFFIC PATTERNS;

BANDWIDTH; PROBLEM SOLVING; TELECOMMUNICATION TRAFFIC; TOPOLOGY; WAVELENGTH DIVISION MULTIPLEXING;

ALGORITHMS;

EID: 33847066347     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICBN.2005.1589748     Document Type: Conference Paper

References (29)

1. O. Gerstel, R. Ramaswami, and G. Sasaki., "Cost-effective traffic grooming in WDM rings," IEEE/ACM Transactions on Networking, vol. 8, no. 5, pp. 618-630, October 2000.
2. P.-J. Wan, G. Calinescu, L. Liu, and O. Frieder., "Grooming of arbitrary traffic in SONET/WDM BLSRs," IEEE Journal on Selected Areas in Communications, vol. 18, no. 10, pp. 1995-2003, 2000.
3. R. Dutta and G. N. Rouskas, "On optimal traffic grooming in WDM rings," IEEE Journal on Selected Areas in Communications, vol. 20, no. 1, pp. 110-121, January 2002.
4. V. R. Konda and T. Y. Chow, "Algorithm for traffic grooming in optical networks to minimize the number of transceivers," in IEEE Workshop on High Performance Switching and Routing, 2001, pp. 218-221.
5. D.Li, Z.Sun, X.Jia, and K.Makki, "Traffic grooming on general topology WDM networks," IEE Proc. Commun., vol. 150, no. 3, pp. 197-201, June 2003.
6. J.Q.Hu and B.Leida, "Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks," Proceedings of the IEEE INFOCOM 2004, vol. 23, no. 1, pp. 495-501, March 2004.
7. Z. K. P. Jr. and G. R. Mateus, "A lagrangian-based heuristic for traffic grooming in WDM optical networks," in IEEE GLOBECOM 2003, vol. 5,1-5, Dec 2003, pp. 2767-2771.
8. C. Lee and E. K. Park, "A genetic algorithm for traffic grooming in all-optical mesh networks," in IEEE SMC 2002, vol. 7, 6-9, Oct 2002.
9. R. Dutta and G. N. Rouskas, "Traffic grooming in WDM networks: Past and future," IEEE Network, vol. 16, no. 6, pp. 46-56, November/December 2002.
10. B. Chen, G. N. Rouskas, and R. Dutta, "A framework for hierarchical traffic grooming in wdm networks of general topology," BroadNets 2005, 2005.
11. J. Simmons, E. Goldstein, and A. Saleh, "Quantifying the benefit of wavelength add-drop in WDM rings with distance-independent and dependent traffic," IEEE/OSA Journal of Lightwave Technology, pp. 48-57, Jan 1999.
12. I. Chlamtac, A. Ganz, and G. Karmi, "Lightpath communications: An approach to high bandwidth optical WANS," IEEE Transactions on Communications, vol. 40, no. 7, pp. 1171-1182, July 1992.
13. B. Chen, G. N. Rouskas, and R. Dutta, "Traffic grooming in wdm ring networks to minimize the maximum electronic port cost," Optical Switching and Networking, 2005.
14. R. Dutta, S. Huang, and G. N. Rouskas, "Traffic grooming in path, star, and tree networks: Complexity, bounds, and algorithms," in Proceeding of ACM SIGMETRICS, June 2003, pp. 298-299.
15. H.Siregar, H.Takagi, and Y.Zhang, "Efficient routing and wavelength assignment in wavelength-routed optical networks," Proceedings of the 7th Asia-Pacific Network Operations and Management Symposium, pp. 116-127, October 2003.
16. S. Baroni and P. Bayvel, "Wavelength requirements in arbitrary connected wavelength-routed optical networks," IEEE/OSA J. Lightwave Technol, vol. 15, no. 2, pp. 242-251, Feb. 1997.
17. J. A. Hartigan, Clustering ALgorithms. Wiley, 1975.
18. H. Choi and D. B. Szyld, "Application of threshold pertitioning of sparse matrices to markov chains," Proceedings of the IEEE International Computer Performance and Dependability Symposium (IPDS), 1996.
19. K. Schloegel, G. Karypis, and V. Kumar, "A new algorithm for multi-objective graph partitioning," Dept. of Computer Science, Univ. of Minnesota, Tech. Rep. 99-003, September 1999.
20. J. Bar-Ilan, G. Kortsarz, and D. Peleg, "How to allocate network centers," J. Algorithms, vol. 15, pp. 385-415, 1993.
21. D. Hochbaum and D. Shmoys, "A unified apporach to approximation algorithms for bottleneck problems," J. ACM, vol. 33, pp. 533-550, 1986.
22. D. B. Shmoys, "Approximation algorithms for facility location problems," Proc. APPROX 2000, LNCS, vol. 1913, pp. 27-32, 2000.
23. M. Thorup, "Quick k-median, k-center, and facility location for sparse graphs," Proc. ICALP 2001, LNCS, vol. 2076, pp. 249-260, 2001.
24. T. Gonzalez, "Clustering to minimize the maximum inter-cluster distance," Theoret. Comput. Sci., vol. 38, pp. 293-306, 1985.
25. D. Hochbaum and D. Shmoys, "A best possible heuristic for the k-center problem," Math. Oper. Res., vol. 10, pp. 180-184, 1985.
26. Z. Xiang, "Color image quantization by minimizing the maximum intercluster distance," ACM Transaction on Graphics, vol. 16, no. 3, pp. 260-276, July 1997.
27. G. Karypis and V. Kumar, "A fast and highly quality multilevel scheme for partitioning irregular graphs," SIAM Journal on Scientific Computing, 1998.
28. P. Baran, "On distributed communications networks," IEEE Transactions on Communications, vol. 12, no. 1, pp. 1-9, March 1964.
29. http://www.caida.org.