Abstract
In wavelength-division multiplexing (WDM) optical networks, the bandwidth request of a traffic stream is generally much lower than the capacity of a lightpath. Therefore, to utilize the network resources (such as bandwidth and transceivers) effectively, several low-speed traffic streams can be efficiently groomed or multiplexed into high-speed lightpaths, thus we can improve the network throughput and reduce the network cost. The traffic grooming problem of a static demand is considered as an optimization problem. In this work, we have proposed a traffic grooming algorithm to maximize the network throughput and reduce the number of transceivers used for wavelength-routed mesh networks and also proposed a dynamic path selection strategy for routing requests which selects the path such that the load on the network gets distributed throughout. The efficiency of our approach has been established through extensive simulation on different sets of traffic demands with different bandwidth granularities for different network topologies and compared the approach with existing algorithm.
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
Bahri, A., Chamberland, S.: A global approach for designing reliable WDM networks and grooming the traffic. Computers & Operations Research 35(12), 3822–3833 (2008)
De, T., Pal, A., Sengupta., I.: A Traffic grooming, routing, and wavelength assignment in an optical WDM mesh networks based on clique partitioning. Photonic Network Communications (February 2010)
Mohan, G., Murthy, C.S.: WDM optical networks: concepts, design and algorithms. Prentice Hall, India (2001)
Yoon, Y., Lee, T., Chung, M., Choo, H.: Traffic grooming based on shortest path in optical WDM mesh networks. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2005. LNCS, vol. 3516, pp. 1120–1124. Springer, Heidelberg (2005)
Zang, H., Jue, J., Mukherjee, B.: A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks. SPIE Opt. Netw. Mag. 1(1), 47–60 (2000)
Zhu, K., Mukherjee, B.: Traffic grooming in an optical WDM mesh network. IEEE J. Sel. Areas Commun. 20(1), 122–133 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhattacharya, S., De, T., Pal, A. (2011). An Algorithm for Traffic Grooming in WDM Mesh Networks Using Dynamic Path Selection Strategy. In: Aguilera, M.K., Yu, H., Vaidya, N.H., Srinivasan, V., Choudhury, R.R. (eds) Distributed Computing and Networking. ICDCN 2011. Lecture Notes in Computer Science, vol 6522. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17679-1_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-17679-1_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17678-4
Online ISBN: 978-3-642-17679-1
eBook Packages: Computer ScienceComputer Science (R0)