Hierarchical traffic grooming: A tutorial

Computer Networks

Volumn 69, Issue , 2014, Pages 147-156

  Wang, Hui ^a   Rouskas, George N ^b,c,d  

^a Quantcast   (United States)

^b NORTH CAROLINA STATE UNIVERSITY   (United States)

^c North Carolina State University   (United States)

^d KING ABDULAZIZ UNIVERSITY   (Saudi Arabia)

Author keywords

Hierarchical grooming; Network design; Traffic grooming

Indexed keywords

CONTROL AND MANAGEMENT; CONTROL OF NETWORKS; HIERARCHICAL GROOMING; HIERARCHICAL STRUCTURES; MULTI-GRANULAR NETWORKS; NETWORK DESIGN; TRAFFIC GROOMING; WAVELENGTH CAPACITY;

INTERNET;

EID: 84901944664     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2014.04.019     Document Type: Short Survey

References (32)

1. R. Dutta, and G.N. Rouskas Traffic grooming in WDM networks: past and future IEEE Netw. 16 6 2002 46 56
2. O. Gerstel, R. Ramaswami, and G. Sasaki Cost-effective traffic grooming in WDM rings IEEE/ACM Trans. Network. 8 5 2000 618 630 (Pubitemid 32017926)
3. P.-J. Wan, G. Calinescu, L. Liu, and O. Frieder Grooming of arbitrary traffic in SONET/WDM BLSRs IEEE J. Sel. Area. Commun. 18 10 2000 1995 2003 (Pubitemid 32076775)
4. R. Dutta, and G.N. Rouskas On optimal traffic grooming in WDM rings IEEE J. Sel. Area. Commun. 20 1 2002 110 121 (Pubitemid 34133771)
5. V.R. Konda, 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.
6. D. Li, Z. Sun, X. Jia, and K. Makki Traffic grooming on general topology WDM networks IEE Proc. Commun. 150 3 2003 197 201
7. K. Zhu, and B. Mukherjee Traffic grooming in an optical WDM mesh network IEEE J. Sel. Area. Commun. 20 1 2002 122 133 (Pubitemid 34133772)
8. J.Q. Hu, B. Leida, Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks, in: Proceedings of IEEE INFOCOM 2004, March 2004, pp. 495-501.
9. Z.K.G. Patrocínio Jr., G.R. Mateus, A lagrangian-based heuristic for traffic grooming in WDM optical networks, in: IEEE GLOBECOM 2003, vol. 5, 1-5, December 2003, pp. 2767-2771.
10. C. Lee, E.K. Park, A genetic algorithm for traffic grooming in all-optical mesh networks, in: IEEE SMC 2002, vol. 7, 6-9, October 2002.
11. E. Yetginer, G.N. Rouskas, Power efficient traffic grooming in optical WDM networks, in: Proceedings of IEEE GLOBECOM 2009, December 2009.
12. K. Zhu, and B. Mukherjee A review of traffic grooming in WDM optical networks: architectures and challenges Opt. Netw. Mag. 4 2 2003 55 64
13. H. Wang, and G.N. Rouskas Traffic grooming in optical networks: decomposition and partial linear programming (LP) relaxation J. Opt. Commun. Network. 5 8 2013 825 835
14. L.-W. Chen, and E. Modiano Dynamic routing and wavelength assignment with optical bypass using ring embeddings Opt. Switch. Network. 1 1 2005 35 49 (Pubitemid 44360584)
15. 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 J. Lightwave Technol. 17 1999 48 57
16. B. Chen, R. Dutta, G.N. Rouskas, Traffic grooming in star networks, in: Proceedings of the First Traffic Grooming Workshop, October 2004.
17. B. Chen, G.N. Rouskas, and R. Dutta On hierarchical traffic grooming in WDM networks IEEE/ACM Trans. Network. 16 5 2008 1226 1238
18. B. Chen, G.N. Rouskas, R. Dutta, A framework for hierarchical grooming in WDM networks of general topology, in: Proceeding of BROADNETS 2005, October 2005, pp. 167-176.
19. M. Iyer, G.N. Rouskas, R. Dutta, A hierarchical model for multigranular optical networks, in: Proceedings of BROADNETS 2008, September 2008.
20. B. Chen, R. Dutta, G.N. Rouskas, On the application of k-center algorithms to hierarchical traffic grooming, in: Proceedings of the Second Traffic Grooming Workshop, October 2005, pp. 295-301.
21. T. Gonzalez Clustering to minimize the maximum inter-cluster distance Theor. Comput. Sci. 38 1985 293 306 (Pubitemid 15607838)
22. D. Hochbaum, and D.B. Shmoys A best possible heuristic for the k-center problem Math. Oper. Res. 10 1985 180 184 (Pubitemid 15547836)
23. B. Chen, R. Dutta, G.N. Rouskas, Clustering and hierarchical traffic grooming in large scale WDM networks, in: Proceedings of ONDM 2007, LNCS, vol. 4534, May 2007, pp. 249-258.
24. I. Chlamtac, A. Ganz, and G. Karmi Lightpath communications: an approach to high bandwidth optical WANs IEEE Trans. Commun. 40 7 1992 1171 1182
25. H. Siregar, H. Takagi, Y. Zhang, Efficient routing and wavelength assignment in wavelength-routed optical networks, in: Proc. 7th Asia-Pacific Network Oper. and Mgmt Symposium, October 2003, pp. 116-127.
26. S. Baroni, and P. Bayvel Wavelength requirements in arbitrary connected wavelength-routed optical networks IEEE/OSA J. Lightwave Technol. 15 2 1997 242 251 (Pubitemid 127590939)
27. H. Wang, G.N. Rouskas, An efficient algorithm for solving traffic grooming problems in optical networks, in: Proceedings of IEEE ICC 2013, June 2013.
28. H. Wang, G.N. Rouskas, Hierarchical traffic grooming formulations, in: Proceedings of IEEE GLOBECOM 2013, December 2013.
29. H. Wang, Z. Liu, G.N. Rouskas, Scalable traffic grooming in optical networks, in: Proceedings of ACP 2012, November 2013.
30. B. Mukherjee et al. Some principles for designing a wide-area WDM optical network IEEE/ACM Trans. Network. 4 5 1996 684 696 (Pubitemid 126778121)
31. W.D. Grover, D.P. Onguetou, A new approach to node-failure protection with span-protecting p-cycles, in: Proceedings of ICTON 2009, June 2009.
32. P. Baran On distributed communications networks IEEE Trans. Commun. 12 1 1964 1 9