Approximation Algorithms for Many-to-Many Traffic Grooming in Optical WDM Networks

A large number of network applications today allow several users to interact together using the many-to-many service mode. In many-to-many communication, also referred to as group communication, a session consists of a group of users (we refer to them as members), where each member transmits its traffic to all other members in the same group. In this paper, we address the problem of grooming subwavelength many-to-many traffic (e.g., OC-3) into high-bandwidth wavelength channels (e.g., OC-192) in optical wavelength division multiplexing (WDM) mesh networks. The cost of an optical WDM network is dominated by the cost of higher-layer electronic ports (i.e., transceivers). A transceiver is needed for each initiation and termination of a lightpath. Therefore, our objective is to minimize the total number of lightpaths established. Unfortunately, the grooming problem even with unicast traffic has been shown to be NP-hard. In this paper, we introduce two novel approximation algorithms for the many-to-many traffic grooming problem. We also consider the routing and wavelength assignment problem with the objective of minimizing the number of wavelengths used. Through extensive experiments, we show that the proposed algorithms use a number of lightpaths that is very close to that of a derived lower bound. Also, we compare the two algorithms on other important objectives such as the number of logical hops traversed by a traffic stream, total amount of electronic switching at a node, and Min-Max objectives.

[1]  Spyridon Antonakopoulos,et al.  Approximation Algorithms for Grooming in Optical Network Design , 2009, IEEE INFOCOM 2009.

[2]  George N. Rouskas,et al.  Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms , 2003, IEEE Journal on Selected Areas in Communications.

[3]  Walid Dabbous,et al.  Multipoint Communication: A Survey of Protocols, Functions, and Mechanisms , 1997, IEEE J. Sel. Areas Commun..

[4]  Ahmed E. Kamal,et al.  Design and provisioning of WDM networks with multicast traffic grooming , 2006, IEEE Journal on Selected Areas in Communications.

[5]  Ahmed E. Kamal Algorithms for multicast traffic grooming in WDM mesh networks , 2006, IEEE Communications Magazine.

[6]  Kevin C. Almeroth,et al.  IP Multicast Applications: Challenges and Solutions , 2001, RFC.

[7]  Ahmed E. Kamal,et al.  Traffic Grooming for Optical Networks , 2008 .

[8]  Zhichao. Zhang Traffic grooming in WDM mesh networks , 2003 .

[9]  A.E. Kamal,et al.  Many-to-Many Traffic Grooming in WDM Networks , 2009, IEEE/OSA Journal of Optical Communications and Networking.

[10]  Chunming Qiao,et al.  An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings , 2000, TNET.

[11]  Ahmed E. Kamal,et al.  Design and Provisioning of WDM Networks With Many-to-Many Traffic Grooming , 2010, IEEE/ACM Transactions on Networking.

[12]  Ahmed E. Kamal,et al.  Reducing network cost of many-to-many communication in unidirectional WDM rings with network coding , 2008, 2008 33rd IEEE Conference on Local Computer Networks (LCN).

[13]  Biswanath Mukherjee,et al.  Traffic grooming in an optical WDM mesh network , 2002, IEEE J. Sel. Areas Commun..

[14]  Richard J. La,et al.  Grooming multicast traffic in unidirectional SONET/WDM rings , 2007, IEEE Journal on Selected Areas in Communications.

[15]  Ahmed E. Kamal,et al.  Many-to-one traffic grooming with aggregation in WDM networks , 2006, IEEE Journal on Selected Areas in Communications.

[16]  Biswanath Mukherjee,et al.  A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks , 2003, TNET.

[17]  Ahmed E. Kamal,et al.  Approximation Algorithms for Many-to-Many Traffic Grooming in WDM Mesh Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[18]  D. Rao TRAFFIC GROOMING, ROUTING AND WAVELENGTH ASSIGNMENT IN OPTICAL WDM MESH NETWORKS , 2011 .

[19]  Girish V. Chowdhary,et al.  Grooming of Multicast Sessions in WDM Mesh Networks ∗ , .

[20]  Girish Chowdhary,et al.  Grooming of multicast sessions in metropolitan WDM ring networks , 2005, Comput. Networks.

[21]  A.E. Kamal,et al.  Reducing Network Cost of Many-to-Many Communication in Unidirectional WDM Rings With Network Coding , 2009, Journal of Lightwave Technology.

[22]  A.L. Chiu,et al.  Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks , 2000, Journal of Lightwave Technology.

[23]  Ahmed E. Kamal,et al.  Grooming of non-uniform traffic on unidirectional and bidirectional rings , 2006, Comput. Commun..

[24]  Bin Wang,et al.  Multicast traffic grooming in WDM optical mesh networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[25]  George N. Rouskas,et al.  Traffic Grooming for Optical Networks: Foundations, Techniques and Frontiers , 2008 .

[26]  George N. Rouskas,et al.  Traffic grooming in WDM networks: past and future , 2002, IEEE Netw..

[27]  P. Baran,et al.  On Distributed Communications Networks , 1964 .

[28]  George N. Rouskas,et al.  Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms , 2006, IEEE J. Sel. Areas Commun..

[29]  George N. Rouskas,et al.  Traffic Grooming in WDM Ring Networks with the Min-Max Objective , 2004, NETWORKING.

[30]  Biswanath Mukherjee,et al.  Traffic grooming in an optical WDM mesh network , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[31]  G.N. Rouskas,et al.  On Hierarchical Traffic Grooming in WDM Networks , 2008, IEEE/ACM Transactions on Networking.

[32]  Ori Gerstel,et al.  Cost effective traffic grooming in WDM rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.