On hierarchical traffic grooming in WDM networks

IEEE/ACM Transactions on Networking

Volumn 16, Issue 5, 2008, Pages 1226-1238

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

^a GOOGLE INC   (United States)

^b North Carolina State University   (United States)

Author keywords

Hierarchical traffic grooming; K center; Optical networks; Wavelength division multiplexing (WDM)

Indexed keywords

CONTROL THEORY; ELECTRIC NETWORK TOPOLOGY; FIBER OPTIC NETWORKS; MULTIPLEXING; MULTIPLEXING EQUIPMENT; NETWORK MANAGEMENT; NETWORK PROTOCOLS; OPTICAL DATA PROCESSING; OPTICAL MATERIALS; PORTS AND HARBORS; SENSOR NETWORKS; TOPOLOGY; WAVELENGTH DIVISION MULTIPLEXING; WIDE AREA NETWORKS;

CONTROL AND MANAGEMENTS; EFFICIENT; GENERAL TOPOLOGIES; GROOMING; HIERARCHICAL; HIERARCHICAL APPROACHES; HIERARCHICAL TRAFFIC GROOMING; K-CENTER; LARGE NETWORKS; LIGHTPATHS; LOGICAL TOPOLOGIES; LOWER BOUNDS; MULTI-GRANULAR NETWORKS; NETWORK RESOURCES; NETWORK TOPOLOGIES; OPTICAL NETWORKS; OPTIMAL ALGORITHMS; PHYSICAL TOPOLOGIES; PRACTICAL IMPORTANCES; ROUTING AND WAVELENGTH ASSIGNMENTS; SCALING; SECOND LEVELS; TRAFFIC GROOMING; WAVELENGTH DIVISION MULTIPLEXING (WDM); WDM NETWORKS;

COMPUTER NETWORKS;

EID: 54549114204     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2007.906655     Document Type: Article

References (31)

1. J. Bar-Ilan, G. Kortsarz, and D. Peleg, "How to allocate network centers," J. Alg., vol. 15, pp. 385-415, 1993.
2. P. Baran, "On distributed communications networks," IEEE Trans. Commun., vol. COM-12, no. 1, pp. 1-9, Mar. 1964.
3. S. Baroni and P. Bayvel, "Wavelength requirements in arbitrary connected wavelength-routed optical networks," J. Lightw. Technol. vol. 15, no. 2, pp. 242-251, Feb. 1997.
4. B. Chen, "Hierarchical traffic grooming in large-scale WDM networks" Ph.D. dissertation, North Carolina State Univ., Raleigh, NC, 2005.
5. I. Chlamtac, A. Ganz, and G. Karmi, "Lightpath communications: An approach to high bandwidth optical WAN's," IEEE Trans. Commun., vol. 40, no. 7, pp. 1171-1182, Jul. 1992.
6. H. Choi and D. B. Szyld, "Application of threshold partitioning of sparse matrices to Markov chains," in Proc. IEEE Int. Comput. Performance and Dependability Symp. (IPDS), 1996.
7. Z. Ding and M. Hamdi, "Clustering techniques for traffic grooming in optical WDM mesh networks," in IEEE GLOBECOM 2002, Nov. 2002, vol. 3,17-21, pp. 2711-2715.
8. R. Dutta, S. Huang, and G. N. Rouskas, "Traffic grooming in path, star, and tree networks: Complexity, bounds, and algorithms," IEEE J. Sel. Areas Commun., vol. 24, no. 4, pp. 66-82, Apr. 2006.
9. R. Dutta and G. N. Rouskas, "On optimal traffic grooming in WDM rings," IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 110-121, Jan. 2002.
10. R. Dutta and G. N. Rouskas, "Traffic grooming in WDM networks: Past and future," IEEE Netw., vol. 16, no. 6, pp. 46-56, Nov./Dec. 2002.
11. M. Esfandiari, S. Gloeckle, A. Zolfagheri, G. Clapp, J. Gannett, H. Kobrinski, V. Poudyal, and R. Skoog, "Improved metro network design by grooming and aggregation of STS-1 demands into OC-192/OC-48 lightpaths," in Proc. NFOEC 2003, Sep. 2003.
12. O. Gerstel, R. Ramaswami, and G. Sasaki, "Cost-effective traffic grooming in WDM rings," IEEE/ACM Trans. Netw., vol. 8, no. 5, pp. 618-630, Oct. 2000.
13. T. Gonzalez, "Clustering to minimize the maximum inter-cluster distance," Theoret. Comput. Sci., vol. 38, pp. 293-306, 1985.
14. A. H. John, Clustering Algorithms. Hoboken, NJ: Wiley, 1975.
15. D. Hochbaum and D. B. Shmoys, "A best possible heuristic for the k-center problem," Math. Oper. Res., vol. 10, pp. 180-184, 1985.
16. D. Hochbaum and D. B. Shmoys, "A unified apporach to approximation algorithms for bottleneck problems," J. ACM, vol. 33, pp. 533-550, 1986.
17. J. Q. Hu and B. Leida, "Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks," in Proc. IEEE INFOCOM, 2004, vol. 23, pp. 495-501.
18. Z. K. G. Patrocínio, Jr. and G. R. Mateus, "A Lagrangian-based heuristic for traffic grooming in WDM optical networks," in IEEE GLOBECOM, 2003, pp. 2767-2771.
19. G. Karypis and V. Kumar, "A fast and highly quality multilevel scheme for partitioning irregular graphs," SIAM J. Sci. Comput., 1998.
20. 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.
21. C. Lee and E. K. Park, "A genetic algorithm for traffic grooming in all-optical mesh networks," in IEEE Int. Conf. Systems, Man, and Cybernetics, Oct. 2002, vol. 7, pp. 6-9.
22. D. Li, Z. Sun, X. Jia, and K. Makki, "Traffic grooming on general topology WDM networks," Proc. Inst. Electr. Eng. - Commun., vol. 150, no. 3, pp. 197-201, Jun. 2003.
23. K. Schloegel, G. Karypis, and V. Kumar, "A new algorithm for multi-objective graph partitioning," Dept. Comput. Sci., Univ. of Minnesota, Duluth, MN, Tech. Rep. 99-003, 1999.
24. D. B. Shmoys, "Approximation algorithms for facility location problems," in Proc. APPROX 2000, Lecture Notes in Computer Science vol. 1913, pp. 27-32.
25. J. Simmons, E. Goldstein, and A. Saleh, "Quantifying the benefit of wavelength add-drop in WDM rings with distance-independent and dependent traffic," J. Lightw. Technol., vol. 17, no. 1, pp. 48-57, Jan. 1999.
26. H. Siregar, H. Takagi, and Y. Zhang, "Efficient routing and wavelength assignment in wavelength-routed optical networks," in Proc. 7th Asia-Pacific Network Operations and Management Symp., Oct. 2003, pp. 116-127.
27. M. Thorup, "Quick k-median, k-center, and facility location for sparse graphs," in Proc. ICALP 2001, Lecture Notes in Computer Science vol. 2076, pp. 249-260.
28. P.-J.Wan, G. Calinescu, L. Liu, and O. Frieder, "Grooming of arbitrary traffic in SONET/WDM BLSRS," IEEE J. Sel. Areas Commun., vol. 18, no. 10, pp. 1995-2003, Oct. 2000.
29. D. West, Introduction to Graph Theory. Upper Saddle River, NJ: Prentice-Hall, 1996.
30. H. Zhu, H. Zang, K. Zhu, and B. Mukherjee, "A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks," IEEE/ACM Trans. Netw., vol. 11, no. 2, pp. 285-299, Apr. 2003.
31. K. Zhu and B. Mukherjee, "Traffic grooming in an optical WDM mesh network," IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 122-133, Jan. 2002.