Skip to main content

Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings

  • Conference paper
Combinatorial Optimization and Applications (COCOA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5573))

  • 1187 Accesses

Abstract

As an important technique, traffic grooming aggregates the traffic of multiple connections into a single wavelength channel, and significantly increases the utilization of bandwidth of wavelength channels. In this paper, for the problem of grooming multicast traffics in unidirectional SONET/WDM rings, an efficient approximation algorithms with approximation factor of 2lng + lnM + o(ln(M ·g)) for any given number of multicast requests M and grooming factor g is proposed.

The work is supported by NNSF (60373012, 10871119) of China, the French-Chinese foundation for sciences and their applications and the China scholarship Council, Promotional Foundation (2005BS01016) for Middle-aged or Young Scientists of Shandong Province, SRI of SPED(J07WH05), DRF and UF(XJ0609)of QFNU.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Billah, A.R.B., Wang, B., Awwal, A.A.S.: Effective Traffic Grooming in WDM Rings. In: Proceedings of IEEE Globecom, vol. 3, pp. 2726–2730 (2002)

    Google Scholar 

  2. Călinescu, G., Frieder, O., Wan, P.: Minimizing Electronic Line Terminals for Automatic Ring Protection in General WDM Optical Networks. IEEE Journal of Selected Area on Communications 20(1), 183–189 (2002)

    Article  Google Scholar 

  3. Chen, B., Rouskas, G.N., Dutta, R.: Traffic Grooming in WDM Ring Networks with the Min-Max Objective. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol. 3042, pp. 174–185. Springer, Heidelberg (2004)

    Google Scholar 

  4. Chen, B., Rouskas, G.N., Dutta, R.: Traffic Grooming in Star Networks. In: Broadnets 2004: Workshop on Traffic Grooming in WDM Networks (2004)

    Google Scholar 

  5. Chiu, A.L., Modiano, E.H.: Traffic Grooming Algorithms for Reducing Electronic Multiplexing Costs in WDM Ring Networks. IEEE/OSA Journal of Lightwave Technology 18(1), 2–12 (2000)

    Article  Google Scholar 

  6. Chowdhary, G.V., Murthy, C.S.R.: Grooming of Multicast Sessions in WDM Mesh Networks. In: The 1st Workshop on Traffic Grooming in WDM Networks, San Jose, USA (2004)

    Google Scholar 

  7. Chowdhary, G.V., Murthy, C.S.R.: Dynamic Multicast Traffic Engineering in WDM Groomed Mesh Networks. In: The 1st Workshop on Traffic Grooming in WDM Networks, San Jose, USA (2004)

    Google Scholar 

  8. Eilam, T., Moran, S., Zaks, S.: Lightpath Arrangement in Survivable Rings to Minimize the Switching Cost. IEEE Journal of Selected Area on Communications 20(1), 172–182 (2002)

    Article  Google Scholar 

  9. Epstein, L., Levin, A.: Better Bounds for Minimizing SONET ADMs. In: The 2nd Workshop on Approximation and Online Algorithms, Bergen, Norway (2004)

    Google Scholar 

  10. Farahmandz, F., Huang, X., Jue, J.P.: Efficient Online Traffic Grooming Algorithms in WDM Mesh Networks with Drop-and-Continue Node Architecture. In: Proc. of IEEE Broadnets, pp. 180–189 (2004)

    Google Scholar 

  11. Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the Traffic Grooming Problem in Tree and Star Networks. Journal of Parallel and Distributed Computing 68(7), 939–948 (2008)

    Article  MATH  Google Scholar 

  12. Flammini, M., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the Traffic Grooming Problem. Journal of Discrete Algorithms 6(3), 472–479 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gargano, L., Vaccaro, U.: Routing in All-Optical Networks: Algorithmic and GraphCTheoretic Problemsin. In: Cai, N., Dueck, G., Althöfer, I. (eds.) Numbers, Information and Complexity. Kluwer Academic Publishers, Dordrecht (2000)

    Google Scholar 

  14. Gerstel, O., Lin, P., Sasaki, G.: Wavelength Assignment in a WDM Ring to Minimize Cost of Embedded SONET Rings. In: Proc. of the 17th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 1998), pp. 94–101 (1998)

    Google Scholar 

  15. Gerstel, O., Ramaswami, R.: Cost-Effective Traffic Grooming in WDM Rings. IEEE/ACM Transactions of Networking 8(5), 618–630 (2000)

    Article  Google Scholar 

  16. Huang, X., Farahmandz, F., Jue, J.P.: Multicast Traffic Grooming in Wavelength-Routed WDM Mesh Networks using Dynamically Changing Light-Trees. IEEE/OSA Journal of Lightwave Technology 23(10), 3178–3187 (2005)

    Article  Google Scholar 

  17. Johnson, D.S.: Approximation Algorithms for Combinatorial Problems. J. Comput. System Sci. 9, 256–278 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  18. Madhyastha, H.V., Srinivas, N., Chowdhary, G.V., Murthy, C.S.R.: Grooming of Multicast Sessions in WDM Ring Networks. In: Torra, V., Narukawa, Y. (eds.) MDAI 2008. LNCS, vol. 5285, pp. 1–12. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  19. Rawat, A., La, R., Marcus, S., Shayman, M.: Grooming Multicast Traffic in Unidirectional SONET/WDM Rings. IEEE Journal on Selected Areas in Communications - Optical Communications and Networking Series 25(6), 70–83 (2007)

    Article  Google Scholar 

  20. Shalom, M., Zaks, S.: A \(\frac{10}{7}+\varepsilon\) Approximation Scheme for Minimizing the Number of ADMs in Sonet Rings. In: The 1st Annual International Conference on Broadband Networks. San-Jos’e, California, USA (2004)

    Google Scholar 

  21. Zhang, X., Qiao, C.: An Effective and Comprehensive Approach for Traffic Grooming and Wavelength Assignment in SONET/WDM Rings. IEEE/ACM Transactions On Networking 8(5), 608–617 (2000)

    Article  Google Scholar 

  22. Zhang, X., Qiao, C.: Scheduling in Unidirectional WDM Rings and its Extensions. In: Vicedo, J.L., Martínez-Barco, P., Muńoz, R., Saiz Noeda, M. (eds.) EsTAL 2004. LNCS, vol. 3230, pp. 208–219. Springer, Heidelberg (2004)

    Google Scholar 

  23. Zhu, K., Mukherjee, B.: Traffic Grooming in an Optical WDM Mesh Network. IEEE Journal on Selected Areas in Communications 20(1), 122–133 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yu, J., Cui, S., Wang, G. (2009). Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings. In: Du, DZ., Hu, X., Pardalos, P.M. (eds) Combinatorial Optimization and Applications. COCOA 2009. Lecture Notes in Computer Science, vol 5573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02026-1_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02026-1_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02025-4

  • Online ISBN: 978-3-642-02026-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics