article

Approximation algorithms for many-to-many traffic grooming in optical WDM networks

Authors:

Mohammad A. Saleh,

Ahmed E. KamalAuthors Info & Claims

IEEE/ACM Transactions on Networking (TON), Volume 20, Issue 5

Pages 1527 - 1540

Published: 01 October 2012 Publication History

Abstract

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.

References

[1]

B. Quinn and K. Almeroth, "IP multicast applications: Challenges and solutions," IETF RFC 3170, Sep. 2001.

[2]

C. Diot, W. Dabbous, and J. Crowcraft, "Multipoint communication: A survey of protocols, functions, and mechanisms," IEEE J. Sel. Areas Commun., vol. 15, no. 3, pp. 277-290, Apr. 1997.

[3]

H. Siregar, H. Takagi, and Y. Zhang, "Efficient routing and wavelength assignment in wavelength-routed optical networks," in Proc. 7th Asia-Pacific Netw. Oper. Manage. Symp., Oct. 2003, pp. 116-127.

[4]

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.

[5]

S. Antonakopoulos and L. Zhang, "Approximation algorithms for grooming in optical network design," in Proc. IEEE INFOCOM, 2009, pp. 1548-1556.

[6]

B. Chen, G. Rouskas, and R. Dutta, "On hierarchical traffic grooming in WDM networks," IEEE/ACM Trans. Netw., vol. 16, no. 5, pp. 1226-1238, Oct. 2008.

[7]

J. Q. Hu and B. Leida, "Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks," in Proc. IEEE INFOCOM, 2004, vol. 1, pp. 495-501.

[8]

X. Zhang and C. Qiao, "An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings," IEEE/ACM Trans. Netw., vol. 8, no. 5, pp. 608-617, Oct. 2000.

[9]

R. Ul-Mustafa and A. E. Kamal, "Grooming of non-uniform traffic on unidirectional and bidirectional rings," Comput. Commun., vol. 29, no. 8, pp. 1065-1078, May 2006.

[10]

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.

[11]

A. L. Chiu and E. H. Modiano, "Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks," J. Lightw. Technol., vol. 18, no. 1, pp. 2-12, Jan. 2000.

[12]

K. Zhu and B. Mukherjee, "Traffic grooming in an optical WD Mmesh network," IEEE J. Sel. Areas Commun., vol. 20, no. 1, pp. 122-133, Jan. 2002.

[13]

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.

[14]

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.

[15]

H. Madhyastha, G. Chowdhary, N. Srinivas, and C. Siva Ram Murthy, "Grooming of multicast sessions in metropolitan WDM ring networks," Comput. Netw., vol. 49, pp. 561-579, 2005.

[16]

A. Rawat, R. La, S. Marcus, and M. Shayman, "Grooming multicast traffic in unidirectional SONET/WDM rings," IEEE J. Sel. Areas Commun., vol. 25, no. 6, pp. 70-83, Aug. 2007.

[17]

A. Billah, B. Wang, and A. Awwal, "Multicast traffic grooming in WDM optical mesh networks," in Proc. IEEE GLOBECOM, 2003, vol. 5, pp. 2755-2760.

[18]

R. Ul-Mustafa and A. E. Kamal, "Design and provisioning of WDM networks with multicast traffic grooming," IEEE J. Sel. Areas Commun., vol. 24, no. 4, pp. 37-53, Apr. 2006.

[19]

G. Chowdhary and C. S. R. Murthy, "Grooming of multicast sessions in wdm mesh networks," in Proc. Workshop Traffic Grooming, 2004 {Online}. Available: http://www.broadnets.org/2004

[20]

R. Ul-Mustafa and A. E. Kamal, "Many-to-one traffic grooming with aggregation in WDM networks," IEEE J. Sel. Areas Commun., vol. 24, no. 8, pp. 68-81, Aug. 2006.

[21]

A. E. Kamal, "Algorithms for multicast traffic grooming in WDM mesh networks," IEEE Commun. Mag., vol. 44, no. 11, pp. 96-105, Nov. 2006.

[22]

R. Dutta, A. E. Kamal, and G. Rouskas, Traffic Grooming for Optical Networks: Foundations, Techniques and Frontiers. New York: Springer, Aug. 2008.

[23]

L. Long and A. E. Kamal, "Reducing network cost of many-to-many communication in unidirectional WDM rings with network coding," J. Lightw. Technol., vol. 27, no. 19, pp. 4209-4220, Oct. 2009.

[24]

M. Saleh and A. E. Kamal, "Many-to-many traffic grooming in WDM networks," J. Opt. Commun. Netw., vol. 1, no. 5, pp. 376-391, Oct. 2009.

[25]

M. Saleh and A. E. Kamal, "Design and provisioning of WDM networks with many-to-many traffic grooming," IEEE/ACM Trans. Netw., vol. 18, no. 6, pp. 1869-1882, Dec. 2010.

[26]

M. Saleh and A. E. Kamal, "Approximation algorithms for many-to-many traffic grooming in WDM mesh networks," in Proc. IEEE INFOCOM, 2010, pp. 1-9.

[27]

B. Chen, G. Rouskas, and R. Dutta, "Traffic grooming in WDM ring networks with the min-max objective," in Proc. IFIP Netw., 2004, pp. 174-185.

[28]

P. Baran, "On distributed communications networks," IEEE Trans. Commun., vol. COM-12, no. 1, pp. 1-9, Mar. 1964.

Cited By

Wu XYe TGuo QLü Z(2019)GRASP for traffic grooming and routing with simple path constraints in WDM mesh networksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2015.04.01386:C(27-39)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.1016/j.comnet.2015.04.013
Divakaran SChinnagounder C(2018)A framework for topology-based traffic grooming with restoration in optical networksInternational Journal of High Performance Computing and Networking10.1504/IJHPCN.2015.0727878:4(358-369)Online publication date: 19-Dec-2018
https://dl.acm.org/doi/10.1504/IJHPCN.2015.072787
Wu XLü ZGuo QYe T(2015)Two-level iterated local search for WDM network design problem with traffic groomingApplied Soft Computing10.1016/j.asoc.2015.08.04437:C(715-724)Online publication date: 1-Dec-2015
https://dl.acm.org/doi/10.1016/j.asoc.2015.08.044

Index Terms

Approximation algorithms for many-to-many traffic grooming in optical WDM networks

Recommendations

Design and provisioning of WDM networks with many-to-many traffic grooming

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 ...
Approximation algorithms for traffic grooming in WDM rings
ICC'09: Proceedings of the 2009 IEEE international conference on Communications

This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "one-to-many" scenario arises in metropolitan access networks in which one node serves as ...
Statistical study of crosstalk accumulation in WDM optical networks with different topology

The robustness of optical networks with respect to the accumulation of in-band crosstalks was statistically studied in this paper, with emphases on the effect of network topology, identified by the network scale and physical connectivity. The in-band ...

Comments

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking

IEEE/ACM Transactions on Networking Volume 20, Issue 5

October 2012

345 pages

ISSN:1063-6692

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 October 2012

Accepted: 14 December 2011

Revised: 10 May 2011

Received: 16 June 2010

Published in TON Volume 20, Issue 5

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
119
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wu XYe TGuo QLü Z(2019)GRASP for traffic grooming and routing with simple path constraints in WDM mesh networksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2015.04.01386:C(27-39)Online publication date: 6-Jan-2019
https://dl.acm.org/doi/10.1016/j.comnet.2015.04.013
Divakaran SChinnagounder C(2018)A framework for topology-based traffic grooming with restoration in optical networksInternational Journal of High Performance Computing and Networking10.1504/IJHPCN.2015.0727878:4(358-369)Online publication date: 19-Dec-2018
https://dl.acm.org/doi/10.1504/IJHPCN.2015.072787
Wu XLü ZGuo QYe T(2015)Two-level iterated local search for WDM network design problem with traffic groomingApplied Soft Computing10.1016/j.asoc.2015.08.04437:C(715-724)Online publication date: 1-Dec-2015
https://dl.acm.org/doi/10.1016/j.asoc.2015.08.044

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents