Skip to main content
SpringerLink
Log in

Hierarchical Traffic Grooming

  • Chapter
Traffic Grooming for Optical Networks

Part of the book series: Optical Networks ((OPNW))

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. R. Dutta and G. N. Rouskas. Traffic grooming in WDM networks: Past and future. IEEE Network, 16(6):46–56, November/December 2002.

    Google Scholar 

  2. O. Gerstel, R. Ramaswami, and G. Sasaki. Cost-effective traffic grooming in WDM rings. IEEE/ACM Transactions on Networking, 8(5):618–630, October 2000.

    Google Scholar 

  3. P-J. Wan, G. Calinescu, L. Liu, and O. Frieder. Grooming of arbitrary traffic in SONET/WDM BLSRs. IEEE Journal on Selected Areas in Communications, 18(10):1995–2003, 2000.

    Google Scholar 

  4. R. Dutta and G. N. Rouskas. On optimal traffic grooming in WDM rings. IEEE Journal on Selected Areas in Communications, 20(1):110–121, January 2002.

    Google Scholar 

  5. V. R. Konda and 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, pp. 218–221, 2001.

    Google Scholar 

  6. D. Li, Z. Sun, X. Jia, and K. Makki. Traffic grooming on general topology WDM networks. IEE Proceedings on Communications, 150(3):197–201, June 2003.

    Google Scholar 

  7. K. Zhu and B. Mukherjee. Traffic grooming in an optical WDM mesh network. IEEE Journal on Selected Areas in Communications, 20(1):122–133, Jan 2002.

    Google Scholar 

  8. J.Q. Hu and B. Leida. Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks. Proceedings of the IEEE INFOCOM 2004, 23(1):495–501, March 2004.

    Google Scholar 

  9. Z.K.G. Patrocínio Jr. and G. R. Mateus. A lagrangian-based heuristic for traffic grooming in WDM optical networks. In IEEE GLOBECOM 2003, 5(1–5):2767–2771, Dec 2003.

    Google Scholar 

  10. C. Lee and E. K. Park. A genetic algorithm for traffic grooming in all-optical mesh networks. In IEEE SMC 2002, 7, 6–9, Oct 2002.

    Google Scholar 

  11. L.-W. Chen and E. Modiano. Dynamic routing and wavelength assignment with optical bypass using ring embeddings. Optical Switching and Networking, 1(1):35–49, 2005.

    Google Scholar 

  12. 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 Journal of Lightwave Technology, 17:48–57, Jan 1999.

    Google Scholar 

  13. B. Chen, R. Dutta, and G. N. Rouskas. Traffic grooming in star networks. In Proceedings of the First Traffic Grooming Workshop, October 2004.

    Google Scholar 

  14. B. Chen, G. N. Rouskas, and R. Dutta. A framework for hierarchical grooming in WDM networks of general topology. In Proceeding of BROADNETS 2005, pp. 167–176, October 2005.

    Google Scholar 

  15. B. Chen, G. N. Rouskas, and R. Dutta. On hierarchical traffic grooming in WDM networks. IEEE/ACM Transactions on Networking, 16(6), December 2008.

    Google Scholar 

  16. B. Chen, R. Dutta, and G. N. Rouskas. On the application of k-center algorithms to hierarchical traffic grooming. In Proceedings of the Second Traffic Grooming Workshop, pp. 295–301, October 2005.

    Google Scholar 

  17. T. Gonzalez. Clustering to minimize the maximum inter-cluster distance. Theoretical Computer Science, 38:293–306, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  18. D. Hochbaum and D.B. Shmoys. A best possible heuristic for the k-center problem. Mathematics of Operations Research, 10:180–184, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  19. B. Chen, G. N. Rouskas, and R. Dutta. Clustering and hierarchical traffic grooming in large scale WDM networks. In Proceedings of ONDM 2007, May 2007.

    Google Scholar 

  20. I. Chlamtac, A. Ganz, and G. Karmi. Lightpath communications: An approach to high bandwidth optical WANS. IEEE Transactions on Communications, 40(7):1171–1182, July 1992.

    Google Scholar 

  21. H. Siregar, H. Takagi, and Y. Zhang. Efficient routing and wavelength assignment in wavelength-routed optical networks. Proc. 7th Asia-Pacific Network Oper. and Mgmt Symposium, pp. 116–127, Oct. 2003.

    Google Scholar 

  22. S. Baroni and P. Bayvel. Wavelength requirements in arbitrary connected wavelength-routed optical networks. IEEE/OSA Journal of Lightwave Technology, 15(2):242–251, Feb. 1997.

    Google Scholar 

  23. X-W. Chu, B. Li, and Z. Zhang. A dynamic RWA algorithm in a wavelength-routed all-optical network with wavelength converters. In Proceedings of IEEE INFOCOM, pp. 1795–1802, 2003.

    Google Scholar 

  24. A. Mokhtar and M. Azizoglu. Adaptive wavelength routing in all-optical netowrks. IEEE/ACM Transactions on Networking, 6(2):197–206, April 1998.

    Google Scholar 

  25. X. Cao, V. Anand, and C. Qiao. Waveband switching in optical networks. IEEE Communications Magazine, 41(4):105–112, 2003.

    Article  Google Scholar 

  26. M. Iyer, G. N. Rouskas, and R. Dutta. A hierarchical model for multigranular optical networks. In Proceedings of IEEE BROADNETS 2008, September 2008.

    Google Scholar 

Download references

Authors
  1. George N. Rouskas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rudra Dutta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, North Carolina State University, Raleigh, NC, USA

    Rudra Dutta  & George N. Rouskas  & 

  2. Department of Electrical and Computer Engineering, Iowa State University, Ames, IA, USA

    Ahmed E. Kamal

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Rouskas, G.N., Dutta, R. (2008). Hierarchical Traffic Grooming. In: Dutta, R., Kamal, A.E., Rouskas, G.N. (eds) Traffic Grooming for Optical Networks. Optical Networks. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74518-3_6

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-74518-3_6

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-74517-6

  • Online ISBN: 978-0-387-74518-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation