Abstract
In this chapter, we present a new scheme for traffic grooming in WDM mesh networks. We propose a new node architecture which brings together all the three qualities desired: practical feasibility, cost-effectiveness and efficient grooming capability. None of the models considered so far in the literature have managed to satisfy all three criteria. We achieve these three ideals by considering a combination of groomers at multiple traffic granularities. We also present an algorithm for efficient traffic grooming with this new architecture. We justify the need for this new algorithm by imposing our node architecture on existing algorithms and comparing with them through a wide range of simulations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gerstel, O., Lin, P., and Sasaki, G. (1999). Combined WDM and SONET network design. In Proc. IEEE INFOCOM’99, pages 734–743.
Gerstel, O. and Ramaswami, R. (2000). Cost effective traffic grooming in WDM rings. IEEE/ACM Transactions on Networking, 8(5):618–630.
Hiuban, G., P’erennes, S., and Syska, M. (2002). Traffic grooming in WDM networks with multi-layer-switches. In Proc. IEEE ICC’02.
Konda, V. R. and Chow, T. (2001). Algorithm for traffic grooming in optical networks. In Proc. IEEE HPSR’01, pages 218–221.
Modiano, E. and Berry, R. (1999). Minimizing electronic multiplexing costs for dynamic traffic in unidirectional SONET ring networks. In Proc. IEEE ICC’99, pages 1724–1730.
Modiano, E. and Berry, R. (2000). Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic. IEEE Journal on Selected Areas in Communications, 18(10): 1961–1971.
Modiano, E. and Chiu, A. (2000). Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. IEEE Journal on Lightwave Technology, 18(1):2–12.
Thiagarajan, S. and Somani, A. K. (2001). Traffic grooming for survivable WDM mesh networks. In Proc. SPIE OptiComm’01, pages 54–65.
Wan, P. J., Calinescu, G., Liu, L., and Frieder, O. (2000). Grooming of arbitrary traffic in SONET/WDM rings. IEEE Journal on Selected Areas in Communications, 18(10): 1995–2003.
Zhang, X. and Qiao, C. (1999). On scheduling all-to-all personalized connections and cost-effective designs in WDM rings. IEEE/ACM Transactions on Networking, 7(3):435–445.
Zhang, X. and Qiao, C. (2000). An effective and comprehensive approach to traffic grooming and wavelength assignment in SONET/WDM rings. IEEE/ACM Transactions on Networking, 8(5):608–617.
Zhu, H., Zang, H., Zhu, K., and Mukherjee, B. (2002). Dynamic traffic grooming in WDM mesh networks using a novel graph model. In Proc. IEEE Globecom’02.
Zhu, K. and Mukherjee, B. (2002). Traffic grooming in an optical WDM mesh network. IEEE Journal on Selected Areas in Communications, 20(1):122–133.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science + Business Media, Inc.
About this chapter
Cite this chapter
Madhyastha, H.V., Siva Ram Murthy, C. (2005). A Practical and Cost-Effective Approach to Efficient Traffic Grooming in WDM Mesh Networks. In: Sivalingam, K.M., Subramaniam, S. (eds) Emerging Optical Network Technologies. Springer, Boston, MA. https://doi.org/10.1007/0-387-22584-6_12
Download citation
DOI: https://doi.org/10.1007/0-387-22584-6_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-22582-1
Online ISBN: 978-0-387-22584-5
eBook Packages: Computer ScienceComputer Science (R0)