Abstract
Proper route selection between source and destination \((s-d)\) connection leads to efficient resource utilization which leads to the availability of resources for future call arrivals. Various choices are available for Routing and Wavelength Assignment (RWA) and every network demands a particular set of RWA to face least call blocking. Call blocking is an important issue in WDM network since it decides the provision of efficient service. In this paper, we have proposed the solution for RWA problem, efficient Wavelength Assignment Technique (WAT) and effect of call queuing in the network. We have studied and compared all sets of RWA over 14 nodes NSF network and found out that our proposed WAT works better in every set. Call blocking is a function of time and a slight change in time shows noticeable effects. We have shown the effect of call contention on WDM network and hence proposed the optimum value of it. Our simulation results for dynamic traffic show that optimal selection of RWA and contention window improve blocking of connections.
Similar content being viewed by others
References
Murthy, C. S. R., & Gurusamy, M. (2002). WDM optical networks: Concepts, design and algorithms (1st ed.). Upper Saddle River: Pearson Prentice Hall.
Birman, A. & Kershenbaum, A. (1995). Routing and wavelength assignment methods in single-hop all-optical networks with blocking. In INFOCOM’95 fourteenth annual joint conference of the IEEE computer and communications societies, bringing information to people, proceedings, IEEE (Vol. 2). IEEE.
Thangaraj, J., Mankar, P. D., & Datta, Raja. (2010). Improved shared resource allocation strategy with SLA for survivability in WDM optical networks. Journal of Optics, 39(2), 57–75.
Hu, J. Q. & Leida, B. (2004). Traffic grooming, routing and wavelength assignment in optical WDM mesh networks. In Proc. IEEE INFOCOM (Vol. 4, pp. 495–501).
Xin, C. (2007). Blocking analysis of dynamic traffic grooming in mesh WDM optical networks. IEEE/ACM Transactions on Networking, 15, 721–733.
Betker, A., Gerlach, C., Hlsermann, R., Jger, M., Barry, M., Bodamer, S., Spth, J., Gauger, C., & Khn, M. (2004). Reference transport network scenarios. German Ministry of Education and Research (BMBF), MultiTeraNet project under contract numbers 01 BP 254, 01 BP 256, and 01 BP 289.
Barry, R. A. & Humblet, P. A. (1995). Models of blocking probability in all-optical networks with and without wavelength changers. In Proc. IEEE INFOCOM95 (Vol. 2, pp. 402–412).
Tornatore, M., Baruffaldi, A., Zhu, H., Mukherjee, B., & Pattavina, A. (2007). Dynamic traffic grooming of subwavelength connections with known duration. In Proc. IEEE OFC/NOFC07 (Vol. 1, pp. 1–3).
Yao, W., & Ramamurthy, B. (2005). A link bundled auxiliary graph model for constrained dynamic traffic grooming in WDM mesh networks. IEEE Journal on Selected Areas in Communications, 23, 1542–1555.
Huang, S., & Dutta, R. (2007). Dynamic traffic grooming: The changing role of traffic grooming. IEEE Communications Surveys & Tutorials, 1, 32–50.
Ramaswami, R., & Sivarajan, K. (1998). Optical networks: A practical perspective. Burlington: Morgan Kaufmann Publishers.
Shen, G., et al. (2001). Efficient heuristic algorithms for light-path routing and wavelength assignment in WDM networks under dynamically varying loads. Computer Communications, 24.3, 364–373.
Birman, A. (1996). Computing approximate blocking probabilities for a class of all-optical networks. IEEE Journal on Selected Areas in Communications, 14(5), 852–857.
Vardakas, J. S., Vassilakis, V. G., & Logothetis, M. D. (2007). Calculating blocking probabilities in single-hop WDM traffic groomed optical networks. In ICTON’07 9th international conference on transparent optical networks, 2007 (Vol. 4). IEEE.
Medhi, J. (1991). Stochastic models in queueing theory (2nd ed.). New York: Academic Press.
Maurya, R. K., Thangaraj, J., & Priye, V. (2016). Statistical analysis of blocking probability for dynamic traffic in WDM optical networks based on Erlang B model. In International conference on wireless communications, signal processing and networking (WiSPNET). IEEE.
Charbonneau, N., & Vokkarane, V. M. (2012). A survey of advance reservation routing and wavelength assignment in wavelength-routed WDM networks. IEEE Communications Surveys & Tutorials, 14(4), 1037–1064.
Jukan, A. (2001). QoS-based wavelength routing in multi-service WDM networks. Vienna: Springer-Verlag/Wien.
Rouskas, G. N., Zhu, Y., & Perros, H. G. (1999). Blocking in wavelength routing networks I: The single path case. In Proc. IEEE INFOCOM99 (Vol. 1, pp. 321–328).
Kelly, F. P. (1986). Blocking probabilities in large circuit-switched networks. Advances in Applied Probability, 18, 473–505.
Zang, H., Jue, J. P., & Mukherjee, B. (2000). A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks. SPIE /BALTZERS Optical Networks Magazine, 1, 47–60.
Acknowledgements
We acknowledge the thanks and support provided to us by Department of Electronics Engineering of Indian Institute of Technology (Indian School of Mines), Dhanbad, India.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Petale, S., Maurya, R. & Thangaraj, J. Improved Connection Establishment of Dynamic Traffic with Queue in WDM Optical Networks. Wireless Pers Commun 100, 1707–1725 (2018). https://doi.org/10.1007/s11277-018-5663-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-018-5663-z