Abstract
In this paper, a survivable routing and wavelength assignment strategy using flow network concepts of network graph theory has been proposed. The proposed approach determines a route and the wavelength simultaneously for incoming lighpath connection traffics. Generally, all algorithms of routing and wavelength assignment problem solve the route selection and channel assignments problem separately. In the proposed approach, flow network represents the wavelength resources in such a way to solve the survivable routing and wavelength assignment problem for WDM networks efficiently. This strategy provides all the possible wavelength continuous flow paths to maximize the lightpaths between pair of source and destination node of the requests. It chooses a suitable lightpath from the available multiple link-disjoint lighpaths to transmit the data for an improved network performance. Simulation results taken over different network topologies confirm that the maximum network flow-based lightpath routing for survivable network has significant improvement of call acceptance ratio when compared against the conventional fixed alternate routing, shortest path and K-shortest path routing approach.
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
Similar content being viewed by others
References
Banerjee, D., Mukherjee, B.: A practical approach for routing and wavelength assignment in large wavelength-routed optical networks. IEEE J. Sel. Areas Commun. 14(5), 903–908 (1996)
Asuman, E., Bertsekas, D.P.: Routing and wavelength assignment in optical networks. EEE/ACM Trans. Netw. 11(2), 259–272 (2003)
Berthold, J., Saleh, A.A.M., Blair, L., Simmons, J.M.: Optical networking: past, present, and future. J. Lightwave Technol. 26(9), 1104–1118 (2008)
Choo, H., Valdimar, V.S., Mukherjee, B.: Routing and wavelength assignment in optical WDM networks with maximum quantity of edge disjoint paths. Photonic Netw. Commun. Springer Sci. 12(2), 145–152 (2006)
Shekhawat, V.S., Saini, A.K., Chaubey, V.K.: Efficient heurstic algorithms for routing and wavelength assignment in optical WDM networks. IUP J. Telecommun. 4(3), 31–43 (2012)
Chatterjee, B.C., Sarma, N., Sahu, P.P.: Review and performance analysis on routing and wavelength assignment approaches for optical networks. IETE Tech. Rev. 30, 12–23 (2013)
Bejerano, Y., Koppol, P.V.: Resource reservation comparison of fault resilient routing schemes. In: 39th Annual IEEE Conference on Local Computer Networks, Edmonton, AB, 2014, pp. 81–89 (2014)
Ramamurthy, S., Sahasrabuddhe, L.: Survivable WDM Mesh networks. J. Lightwave Technol. 21(4) (2003)
Beshir, A., Kuipers, F., Van Mieghem, P., Orda, A.: On-line survivable routing in WDM networks. In: 21st International Teletraffic Congress, Paris (2009)
Ruan, L., Zheng, Y.: Dynamic survivable multipath routing and spectrum allocation in OFDM-based flexible optical networks. IEEE/OSA J. Opt. Commun. Netw. 6(1), 77–85 (2014)
Ho, P.-H., Tapolcai, J., Mouftah, H.T.: On achieving optimal survivable routing for shared protection in survivable next-generation Internet. IEEE Trans. Reliab. 53(2), 216–225 (2004)
Liu, Y., Guo, L., Wei, X.: Optimizing backup optical-network-units selection and backup fibers deployment in survivable hybrid wireless-optical broadband access networks. J. Lightwave Technol. 30(10), 1509–1523 (2012)
Wu, J.,   Liu, Y., Yu, C., Wang, X., Zhao, J.: Multicast protection based on enhanced intelligent p-cycle method in optical mesh networks. Opt. Eng. 52(1), 015008-1–015008-7 (2013)
Guo, L., Cao, J., Hongfang, Yu., Li, L.: Path-based routing provisioning with mixed shared protection in WDM Mesh networks. J. Lightwave Technol. 24(3), 1129–1141 (2006)
Lu, R., Nan, X.: Survivable multipath routing and spectrum allocation in OFDM-based flexible optical networks. J. Opt. Commun. Netw. 5(3), 172–182 (2013)
James Sterbenz, P.G., Hutchison, D., et al.: Resilience and survivability in communication networks: strategies, principles, and survey of disciplines. Comput. Netw. 54(8), 1245–1265 (2010)
Beshir, A., Kuipers, F., Van Mieghem, P., Orda, A.: On-line survivable routing in WDM networks. In: 21st International Teletraffic Congress, Paris, pp. 1–8 (2009)
Cormen, T.H., Leiserson, C.E., et al.: Introduction to Algorithms, 3rd ed. PHI Learning Pvt. Ltd. (2009)
Gurzì, P., Nowé, A., Colitti, W., Steenhaut, K.: Maximum flow based routing and wavelength assignment in all-optical networks. In: 2009 International Conference on Ultra Modern Telecommunications & Workshops, St. Petersburg, pp. 1–6 (2009)
Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM 35(4), 921–940 (1988)
Boykov, Y., Kolmogorov, V.: Experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Trans. Pattern Anal. Mach. Intell. 26(9), 1124–1137 (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Tyagi, D.K., Chaubey, V.K. (2019). Maximum Network Flow Aware Multi-lightpath Survivable Routing in WDM Networks. In: Fong, S., Akashe, S., Mahalle, P. (eds) Information and Communication Technology for Competitive Strategies. Lecture Notes in Networks and Systems, vol 40. Springer, Singapore. https://doi.org/10.1007/978-981-13-0586-3_72
Download citation
DOI: https://doi.org/10.1007/978-981-13-0586-3_72
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-0585-6
Online ISBN: 978-981-13-0586-3
eBook Packages: EngineeringEngineering (R0)