Authors: Chunxia Ji; Yuping Wang; Zhanqi Xu; Xia Li
Addresses: School of Computer Science and Technology, Xidian University, Xi'an, 710071, China ' School of Computer Science and Technology, Xidian University, Xi'an, 710071, China ' School of Telecommunications Engineering, Xidian University, Xi'an, 710071, China ' School of Computer Science and Technology, Xidian University, Xi'an, 710071, China
Abstract: Routing and spectrum allocation (RSA) is an important problem in elastic optical networks (EONs). With the increase of network scale and task requests, the imbalance of the network topology becomes more and more prominent, causing congestion of some links in the network and even paralysation of the entire network. To tackle this issue, in this paper, we first set up an integer linear programming model for RSA problems in EONs, which minimises the number of used slots, optimises the balance of networks and the burden of KeyLinks (i.e., the links which are easy blocked when large requests comes). Then we design a new routing scheme called dynamically adjusted shortest hop count and minimum rank value first (DSHMRF) to select the candidate routes for each request. Moreover, we propose a new genetic algorithm called direction and distance-based genetic algorithm (DDGA) to look for optimal routes for all requests among the candidate routes. To allocate the spectrum reasonably, we adopt first fit (FF) scheme. Finally, the experiments are conducted on several network topologies of different scales with different request sets and the results indicate that the proposed model is effective and the proposed genetic algorithm is efficient.
Keywords: EON; elastic optical network; routing; spectrum allocation; integer linear programming model; genetic algorithm.
International Journal of Sensor Networks, 2019 Vol.31 No.3, pp.145 - 155
Available online: 02 Oct 2019 *Full-text access for editors Access for subscribers Purchase this article Comment on this article