A Constrained Maximum Available Frequency Slots on Path Based Online Routing and Spectrum Allocation for Dynamic Traffic in Elastic Optical Networks

• Autorzy: Khan Akhtar Nawaz

Identyfikatory

DOI

10.24425/ijet.2020.134031

• Języki publikacji: EN

Abstrakty

EN

Elastic optical networking is a potential candidate to support dynamic traffic with heterogeneous data rates and variable bandwidth requirements with the support of the optical orthogonal frequency division multiplexing technology (OOFDM). During the dynamic network operation, lightpath arrives and departs frequently and the network status updates accordingly. Fixed routing and alternate routing algorithms do not tune according to the current network status which are computed offline. Therefore, offline algorithms greedily use resources with an objective to compute shortest possible paths and results in high blocking probability during dynamic network operation. In this paper, adaptive routing algorithms are proposed for shortest path routing as well as alternate path routing which make routing decision based on the maximum idle frequency slots (FS) available on different paths. The proposed algorithms select an underutilized path between different choices with maximum idle FS and efficiently avoids utilizing a congested path. The proposed routing algorithms are compared with offline routing algorithms as well as an existing adaptive routing algorithm in different network scenarios. It has been shown that the proposed algorithms efficiently improve network performance in terms of FS utilization and blocking probability during dynamic network operation.

Słowa kluczowe

EN

elastic optical networks; routing and spectrum allocation; blocking probability; continuity constraint

• Wydawca: Polish Academy of Sciences, Committee of Electronics and Telecommunication
• Czasopismo: International Journal of Electronics and Telecommunications
• Rocznik: 2020
• Tom: Vol. 66, No. 4
• Strony: 707--714
• Opis fizyczny: Bibliogr. 30 poz., rys., tab., wykr.

Twórcy

autor

Khan Akhtar Nawaz

• Department of Electrical Engineering, University of Engineering & Technology, Peshawar-Jalozai campus, Pakistan

Bibliografia

• [1] B. C. Chatterjee, N. Sarma and E. Oki, ”Routing and Spectrum Allocation in Elastic Optical Networks: A Tutorial,” in IEEE Communications Surveys & Tutorials, vol. 17, no. 3, pp. 1776-1800, third quarter 2015.
• [2] K. K. Singh, S. Prakash Singh and S. Sengar, ”Fragmentation Suppressed RSA Algorithm for Elastic Optical Network: A Quantitative approach,” 2018 IEEE British and Irish Conference on Optics and Photonics (BICOP), London, United Kingdom, 2018, pp. 1-4.
• [3] L. A. J. Mesquita, K. D. R. Assis, A. F. Santos, M. S. Alencar and R. C. Almeida, ”A Routing and Spectrum Assignment Heuristic for Elastic Optical Networks under Incremental Traffic,” 2018 SBFoton International Optics and Photonics Conference (SBFoton IOPC), Campinas, 2018, pp. 1-5.
• [4] ”The zettabyte era: trends and analysis,” Cisco systems, available at https://www.cisco.com/c/en/us/solutions/collateral/serviceprovider/visual-networkin-index-vni/vni-hyperconnectivity-wp.pdf, june 2017.
• [5] L. Zhang, W. Lu, X. Zhou, and Z. Zhu, ”Dynamic RMSA in spectrum-sliced elastic optical networks for high-throughput service provisioning,” 2013 International Conference on Computing, Networking and Communications, Optical and Grid Networking Symposium, 2013, pp. 380-384.
• [6] A.N. Khan, ”Routing and dimensioning in optical WDM networks for dynamic traffic using post-optimization approach,” Optical Fiber Technology, 40 (2018), pp. 76-81.
• [7] O. Gerstel, M. Jinno, A. Lord, and S.J. Ben Yoo, ”Elastic optical networking: A new dawn for the optical layer?”, IEEE Communications Magazine, Feb 2012, pp. s 12-s20.
• [8] B.C. Chatterjee, S. Ba, and E. Oki, ”Fragmentation problems and management approaches in elastic optical networks: A survey,” IEEE Communications Surveys and Tutorials, vol. 20, no. 1, first quarter 2018, pp. 183-210.
• [9] M. Jinno, H. Takara, B. Kozicki, Y. Tsukishima, Y. Sone and S. Matsuoka, ”Spectrum-efficient and scalable elastic optical path network: architecture, benefits, and enabling technologies,” in IEEE Communications Magazine, vol. 47, no. 11, pp. 66-73, November 2009.
• [10] J. Yuan, Y. Fu, R. Zhu, X. Li, Q. Zhang, and J. Zhang, ”A constrained-lower-indexed-block spectrum assignment policy in elastic optical networks,” Optical Switching and Networking, 33 (2019), pp. 25-33.
• [11] Y. Tan, R. Gu, and Y. Ji, ”Energy-efficient routing, modulation and spectrum allocation in elastic optical networks”, Optical Fiber Technology, vol. 36, 2017, pp. 297-305.
• [12] A. Fallahpour, H. Beyranvand and J. A. Salehi, ”Energy-Efficient Many-cast Routing and Spectrum Assignment in Elastic Optical Networks for Cloud Computing Environment,” in Journal of Lightwave Technology, vol. 33, no. 19, pp. 4008-4018, 1 Oct.1, 2015.
• [13] J. Yuan, D. Zhang, Q. Zhang, X. Li, and Z. Ren, ”A routing and spectrum assignment algorithm in elastic optical network based on minimizing contiguity reduction,” Photonic Network Communications, 2019.
• [14] J.L. Vizcaino, Y. Ye, and I.T. Monroy, ”Energy efficient analysis for flexible-grid OFDM-based optical networks,” Computer Networks, 56 (2012), pp. 2400-2419.
• [15] F.S. Abkenar, A.G. Rahbar, Study and analysis of routing and spectrum allocation (RSA) and routing, modulation and spectrum allocation (RMSA) algorithms in elastic optical networks (EONs), Optical Switching and Networking, 23 (2017), pp. 5-39.
• [16] X. Wan, N. Hua, and X. Zheng, ”Dynamic routing and spectrum assignment in spectrum-flexible transparent optical networks,” J. Opt. Commun. Netw., vol. 4, no. 8, 2012, pp. 603-613.
• [17] L. Zhang, Z. Zhu, Spectrum-efficient anycast in elastic optical interdatacenter networks, Optical Switching and Networking Volume 14, Part 3, August 2014, pp. 250-259.
• [18] K. Walkowiak, M. Klinkowski, B. Rabiega, and R. Goscien, ”Routing and spectrum allocation algorithms for elastic optical networks with dedicated path protection,” Optical Switching and Networking, 13 (2014), pp. 63-75.
• [19] H. Chen, Y. Zhao, J. Zhang, W. Wang and R. Zhu, ”Static Routing and Spectrum Assignment for Deadline-Driven Bulk-Data Transfer in Elastic Optical Networks,” in IEEE Access, vol. 5, pp. 13645-13653, 2017.
• [20] A. Agarwal, V. Bhatia, and S. Prakash, ”Spectrum efficient distance adaptive paths for fixed and fixed-alternate routing in elastic optical networks,” Optical Fiber Technology, 40 (2018), pp. 36-45.
• [21] V.A.C. Vale, R.C. Almeida Jr., ”Power, routing, Modulation Level and Spectrum Assignment in all-optical and elastic networks,” Optical Switching and Networking, vol. 32, 2019, pp. 14-24.
• [22] Z. Zhu, W. Lu, L. Zhang and N. Ansari, ”Dynamic Service Provisioning in Elastic Optical Networks With Hybrid Single-/Multi-Path Routing,” in Journal of Lightwave Technology, vol. 31, no. 1, pp. 15-22, Jan.1, 2013.
• [23] W. Lu and Z. Zhu, ”Dynamic Service Provisioning of Advance Reservation Requests in Elastic Optical Networks,” in Journal of Lightwave Technology, vol. 31, no. 10, pp. 1621-1627, May 15, 2013.
• [24] F. Yousefi, A.G. Rahbar, ”Novel fragmentation-aware algorithms for multipath routing and spectrum assignment in elastic optical networks space division multiplexing (EON-SDM),” Optical Fiber Technology, 46 (2018), pp. 287-296.
• [25] A.N. Khan, ”Online service provisioning in elastic optical networks with hybrid algorithm for congestion aware routing and spectrum allocation,” Optical Fiber Technology, 47 (2019), pp. 27-32.
• [26] B.C. Chatterjee, W. Fadini, E. Oki, ”A spectrum allocation scheme based on first-last-exact fit policy for elastic optical networks”, Journal of Network and Comp. Applications, vol. 68, 2016, pp. 164-172.
• [27] I. Olszewski, ”Spectrum allocation policy in elastic optical networks,” Intl. Journal of Electronics and Telecommunications, vol. 63, no. 4, 2017, pp. 423-429.
• [28] Y. Qiu, ”An efficient spectrum assignment algorithm based on variable grouping mechanism for flex-grid optical networks,” Optical Switching and Networking, 24 (2017), pp. 39-46.
• [29] D. Eppstein, Finding the k shortest paths, SIAM J. Comput. 28 (2), pp. 652–673, 1998.
• [30] Python, www.python.org.