OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editors: K. Bergman and V. Chan
  • Vol. 1, Iss. 5 — Oct. 1, 2009
  • pp: 376–391

Many-to-Many Traffic Grooming in WDM Networks

Mohammad A. Saleh and Ahmed E. Kamal  »View Author Affiliations


Journal of Optical Communications and Networking, Vol. 1, Issue 5, pp. 376-391 (2009)
http://dx.doi.org/10.1364/JOCN.1.000376


View Full Text Article

Acrobat PDF (291 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

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 many-to-many traffic grooming in WDM mesh networks. In this problem, a set of many-to-many session requests, each with an arbitrary subwavelength traffic demand, is given and the objective is to provision the sessions on the WDM network with the minimum network cost. The cost of a WDM network is dominated by the cost of higher-layer electronic ports (we refer to them as transceivers). Therefore, our objective is to minimize the total number of transceivers used. We address the problem in both nonsplitting networks, where the nodes do not have optical splitting capabilities, and in splitting networks, where the nodes do have optical splitting capabilities. First, we formulate the problem in each of the two networks as a mixed integer linear program (MILP). Afterwards, based on observations from optimal solutions, we develop a heuristic approach for each network by relaxing and simplifying its corresponding MILP. Through extensive experiments, we verify the accuracy of our proposed heuristics and also show when each of the two networks is a more cost-effective choice for many-to-many traffic grooming.

© 2009 Optical Society of America

OCIS Codes
(000.3860) General : Mathematical methods in physics

ToC Category:
Research Papers

History
Original Manuscript: February 17, 2009
Revised Manuscript: July 9, 2009
Manuscript Accepted: July 22, 2009
Published: September 8, 2009

Citation
Mohammad A. Saleh and Ahmed E. Kamal, "Many-to-Many Traffic Grooming in WDM Networks," J. Opt. Commun. Netw. 1, 376-391 (2009)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jocn-1-5-376


Sort:  Author  |  Year  |  Journal  |  Reset

References

  1. L. H. Sahasrabuddhe and B. Mukherjee, “Light-trees: optical multicasting for improved performance in wavelength routed networks,” IEEE Commun. Mag. , vol. 37, no. 2, pp. 67-73, Feb. 1999. [CrossRef]
  2. A. L. Chiu and E. H. Modiano, “Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks,” J. Lightwave Technol. , vol. 18, no. 1, pp. 2-12, Jan. 2000. [CrossRef]
  3. C. Diot, W. Dabbous, and J. Crowcroft, “Multipoint communication: a survey of protocols, functions, and mechanisms,” IEEE J. Sel. Areas Commun. , vol. 15, pp. 277-290, 1997. [CrossRef]
  4. B. Quinn and K. Almeroth, “IP multicast applications: challenges and solutions,” IETF Request for Comments (RFC) 3170, Sept. 2001.
  5. 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. [CrossRef]
  6. 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. [CrossRef]
  7. 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. [CrossRef]
  8. J. Q. Hu and B. Leida, “Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks,” in Proc. IEEE INFOCOM'04, 2004, pp. 495-501.
  9. S. Antonakopoulos and L. Zhang, “Approximation algorithms for grooming in optical network design,” in Proc. IEEE INFOCOM'09, 2009, pp. 1548-1556.
  10. 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. [CrossRef]
  11. R. Dutta and G. N. Rouskas, “Traffic grooming in WDM networks: past and future,” IEEE Network , vol. 16, no. 6, pp. 46-56, Nov./Dec. 2002. [CrossRef]
  12. 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, pp. 1995-2003, 2000. [CrossRef]
  13. 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, April 2003. [CrossRef]
  14. 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, April 2006.
  15. H. Madhyastha, G. Chowdhary, N. Srinivas, and C. S. R. Murthy, “Grooming of multicast sessions in metropolitan WDM ring networks,” Comput. Netw. , vol. 49, pp. 561-579, 2005. [CrossRef]
  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. [CrossRef]
  17. 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, April 2006.
  18. A. Billah, B. Wang, and A. Awwal, “Multicast traffic grooming in WDM optical mesh networks,” in Proc. GLOBECOM'03, vol. 5, pp. 2755-2760, Dec. 2003.
  19. G. Chowdhary and C. S. R. Murthy, “Grooming of multicast sessions in WDM mesh networks,” in Workshop on Traffic Grooming, 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. M. Saleh and A. Kamal, “Many-to-many traffic grooming in WDM mesh networks,” in Proc. IEEE GLOBECOM'08, 2008, pp. 1-5.
  23. R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung, “Network information flow,” IEEE Trans. Inf. Theory , vol. 46, no. 4, pp. 1204-1216, July 2000. [CrossRef]
  24. http://www.ilog.com/products/cplex/.

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited