Please use this identifier to cite or link to this item:
|Title:||Column generation algorithms for virtual network embedding in flexi-grid optical networks||Authors:||Lin, Rongping
|Keywords:||DRNTU::Engineering::Electrical and electronic engineering
|Issue Date:||2018||Source:||Lin, R., Luo, S., Zhou, J., Wang, S., Chen, B., Zhang, X., . . . Zukerman, M. (2018). Column generation algorithms for virtual network embedding in flexi-grid optical networks. Optics Express, 26(8), 10898-. doi:10.1364/OE.26.010898||Series/Report no.:||Optics Express||Abstract:||Network virtualization provides means for efficient management of network resources by embedding multiple virtual networks (VNs) to share efficiently the same substrate network. Such virtual network embedding (VNE) gives rise to a challenging problem of how to optimize resource allocation to VNs and to guarantee their performance requirements. In this paper, we provide VNE algorithms for efficient management of flexi-grid optical networks. We provide an exact algorithm aiming to minimize the total embedding cost in terms of spectrum cost and computation cost for a single VN request. Then, to achieve scalability, we also develop a heuristic algorithm for the same problem. We apply these two algorithms for a dynamic traffic scenario where many VN requests arrive one-by-one. We first demonstrate by simulations for the case of a six-node network that the heuristic algorithm obtains very close blocking probabilities to exact algorithm (about 0.2% higher). Then, for a network of realistic size (namely, USnet) we demonstrate that the blocking probability of our new heuristic algorithm is about one magnitude lower than a simpler heuristic algorithm, which was a component of an earlier published algorithm.||URI:||https://hdl.handle.net/10356/83159
|DOI:||10.1364/OE.26.010898||Rights:||© 2018 Optical Society of America under the terms of the OSA Open Access Publishing Agreement. Users may use, reuse, and build upon the article, or use the article for text or data mining, so long as such uses are for non-commercial purposes and appropriate attribution is maintained. All other rights are reserved.||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||EEE Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.