Modified Dual-Path Allocation Algorithm in Elastic Optical Networks
- PDF / 1,924,505 Bytes
- 19 Pages / 439.37 x 666.142 pts Page_size
- 39 Downloads / 193 Views
Modified Dual‑Path Allocation Algorithm in Elastic Optical Networks Ireneusz Olszewski1 Received: 19 February 2019 / Revised: 20 January 2020 / Accepted: 22 January 2020 © The Author(s) 2020
Abstract Dual-path allocation problem is considered to be a case of multipath routing in Elastic Optical Networks. In this article, the optimization problem is formulated and a dual-path allocation algorithm that solves this problem proposed. In the considered problem all traffic for each request is broken into two equal parts, which are directed along two link-disjoint paths. After any link failure, half of the traffic for each affected request is realized. The proposed algorithm is based on the two weight matrices: the elements of the first one depend on the actual length of the links and their utilization, while the elements of the second one assume unit values if the links exist in the network. The proposed algorithm rejects smaller requests and provides a much lower bandwidth blocking probability than other analyzed algorithms. Keywords Optimization problem · Multipath routing · Mathematical model
1 Introduction The proliferation of services requiring large bandwidth such as High Definition Television (HDTV), Video on Demand (VoD) or cloud computing services have resulted in a dynamic increase of IP traffic in the networks. The appearance of new applications increases the traffic IP from month to month. Therefore, network operators expect transport networks capable of handling huge traffic while maintaining network scalability. It is obvious that the failure of even a single link in such a network can cause disruptions in the transmission of traffic for many users of the network. Resilience to link failure in the Elastic Optical Network (EON) can be achieved, as in Wavelength-Division Multiplexed (WDM) networks, with protection or restoration mechanisms. These mechanisms can be implemented on both link * Ireneusz Olszewski [email protected] 1
Institute of Telecommunications, Faculty of Telecommunications, Computer Science and Electrical Engineering, UTP University of Sciences and Technology, S. Kaliskiego 7, 85‑796 Bydgoszcz, Poland
13
Vol.:(0123456789)
Journal of Network and Systems Management
and path level. Protection uses backup resources and features shorter recovery time of the bandwidth, while the recovery mechanisms are more attractive from an economic point of view. In [1], an offline Routing and Spectrum Allocation (RSA) problem with Dedicated Path Protection (DPP) in EON is proposed. In turn, in [2] two algorithms have been proposed that solve the offline RSA problem with working path protection. The first one is with shared backup path protection and the second one is with dedicated backup path protection. Also in [3] the RSA problem with a shared and dedicated backup path protection was considered with and without tunable transponders. For each case an Integer Linear Programming (ILP) optimization model was proposed and solved to minimize required spare capacity and the maximum numbe
Data Loading...
