Skip to main content

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

  • 424 Accesses

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 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. S. Thiagarajan and A. K. Somani, “Capacity fairness of WDM networks with grooming capability,” Opt. Networks Mag., vol. 2, no. 3, pp. 24–31, May/June 2001.

    Google Scholar 

  2. E. Modiano and P. J. Lin, “Traffic grooming in WDM networks,” IEEE Commun. Mag., pp. 124–1299, July 2001.

    Google Scholar 

  3. R. Ranganathan, J. Berthold, L. Blair, and J. Berthold, “Architectural implications of core grooming in a 46-node USA optical network,” in Proc. IEEE/OSA OFC ’02, Mar. 2002, pp. 498–499.

    Google Scholar 

  4. R. Dutta and G. N. Rouskas, “Traffic grooming in WDM networks: past and future,” IEEE Network, pp. 46–56, November/December 2002.

    Google Scholar 

  5. K. Zhu and B. Mukherjee, “A review of traffic grooming in WDM optical networks: architectures and challenges,” Opt. Networks Mag., vol. 4, no. 2, pp. 55–64, March/April 2003.

    Google Scholar 

  6. L. B. Sofman, A. Agrawal, and T. S. El-Bawab, “Traffic grooming and bandwidth efficiency in packet and burst switched networks,” in Proc. of the Applied Telecommunications Symposium (ATS 2003), part of the Advanced Simulation Technologies Conference (ASTC 2003), pp. 3–8, Orlando, Florida, March 30-April 3, 2003.

    Google Scholar 

  7. 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. on Networking, vol. 11, no. 2, pp. 285–99, April 2003.

    Google Scholar 

  8. K. Zhu, H. Zang, and B. Mukherjee, “A comprehensive study on next- generation optical grooming switches,” IEEE J. Select. Areas Commun., vol. 21, no. 7, pp. 1173–86, September 2003

    Google Scholar 

  9. L. B. Sofman, T. S. El-Bawab, and A. Agrawal, “Effect of traffic variability on statistical multiplexing gain in a continuous bufferless traffic model,” in Proc. SPIE, vol. 5244, pp. 122–30, Performance and Control of Next-Generation Communications Networks, part of SPIE International Symposium ITCom 2003 (Information Technologies and Communications), September 7–11, 2003, Orlando, Florida, USA.

    Google Scholar 

  10. A. Agrawal, L. B. Sofman, and T. S. El-Bawab, “On the enhancement of bandwidth efficiency by traffic grooming in optical cross-connect based networks,” in Proc. SPIE, vol. 5247, pp. 196–202, Optical Transmission Systems and Equipment for WDM Networking II, part of SPIE International Symposium ITCom 2003 (Information Technologies and Communications), September 7–11, 2003, Orlando, Florida, USA.

    Google Scholar 

  11. S. Huang, R. Dutta, and G. N. Rouskas, “Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms,” IEEE J. Select. Areas in Commun., vol. 24, no. 4, April 2006.

    Google Scholar 

  12. C. Xin, B. Wang, X. Cao, and J. Li, “Logical topology design for dynamic traffic grooming in WDM optical networks,” IEEE J. Lightwave Technol., vol. 24, no. 6, pp. 2267–75, June 2006.

    Google Scholar 

  13. A. E. Kamal, “Algorithms for multicast traffic grooming in WDM mesh networks,” IEEE Commun. Mag., pp. 96–105, November 2006.

    Google Scholar 

  14. S. Huang and R. Dutta, “Dynamic traffic grooming: The changing role of traffic grooming,” IEEE Commun. Surveys & Tutorials, vol. 8, no. 4, 4th Quarter 2006.

    Google Scholar 

  15. T. S. El-Bawab, “Optical Switching,” Springer, July 2006, ISBN: 0-387-26141-9.

    Google Scholar 

  16. R. Ramaswami and K. N. Sivarajan, “Optical Networks: A Practical Perspective,” 2nd Ed., Morgan Kaufmann, Academic Press, 2002.

    Google Scholar 

  17. W. Goralski, “SONET/SDH,” 3rd Ed., McGraw-Hill, Osborne, 2002.

    Google Scholar 

  18. P. Bonenfant and A. Rodriguez-Moral, “Generic framing procedure (GFP): the catalyst for efficient data over transport,” IEEE Commun. Mag., vol. 40, no. 5, pp. 72–9, May 2002.

    Google Scholar 

  19. L. L. Peterson and B. S. Davie, “Computer Networks: A System Approach,” 4th Ed., Morgan Kaufmann Publishers, 2007.

    Google Scholar 

  20. J. Bergen, “Selection of proper switch fabric tied to ultimate application,” Lightwave, pp. 130–131, July 2000

    Google Scholar 

  21. G. Parulkar, “Harnessing the power of the optical internet,” Lightwave, pp. 132–133, July 2000.

    Google Scholar 

  22. L. H. Sahasrabuddhe and B. Mukherjee, “Light-trees: optical multicasting for improved performance in wavelength-routed networks,” IEEE Commun. Mag., vol. 37, pp. 67–73, February 1999.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

El-Bawab, T.S. (2008). Grooming Switches. 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_2

Download citation

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

  • 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