Column generation algorithms for virtual network embedding in flexi-grid optical networks
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...
Saved in:
Main Authors: | , , , , , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/83159 http://hdl.handle.net/10220/47570 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-83159 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-831592020-03-07T13:57:26Z Column generation algorithms for virtual network embedding in flexi-grid optical networks Lin, Rongping Luo, Shan Zhou, Jingwei Wang, Sheng Chen, Bin Zhang, Xiaoning Cai, Anliang Zhong, Wen-De Zukerman, Moshe School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering Network Optimization Networks 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. Published version 2019-01-28T08:15:07Z 2019-12-06T15:12:59Z 2019-01-28T08:15:07Z 2019-12-06T15:12:59Z 2018 Journal Article 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 https://hdl.handle.net/10356/83159 http://hdl.handle.net/10220/47570 10.1364/OE.26.010898 en Optics Express © 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. 16 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
country |
Singapore |
collection |
DR-NTU |
language |
English |
topic |
DRNTU::Engineering::Electrical and electronic engineering Network Optimization Networks |
spellingShingle |
DRNTU::Engineering::Electrical and electronic engineering Network Optimization Networks Lin, Rongping Luo, Shan Zhou, Jingwei Wang, Sheng Chen, Bin Zhang, Xiaoning Cai, Anliang Zhong, Wen-De Zukerman, Moshe Column generation algorithms for virtual network embedding in flexi-grid optical networks |
description |
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. |
author2 |
School of Electrical and Electronic Engineering |
author_facet |
School of Electrical and Electronic Engineering Lin, Rongping Luo, Shan Zhou, Jingwei Wang, Sheng Chen, Bin Zhang, Xiaoning Cai, Anliang Zhong, Wen-De Zukerman, Moshe |
format |
Article |
author |
Lin, Rongping Luo, Shan Zhou, Jingwei Wang, Sheng Chen, Bin Zhang, Xiaoning Cai, Anliang Zhong, Wen-De Zukerman, Moshe |
author_sort |
Lin, Rongping |
title |
Column generation algorithms for virtual network embedding in flexi-grid optical networks |
title_short |
Column generation algorithms for virtual network embedding in flexi-grid optical networks |
title_full |
Column generation algorithms for virtual network embedding in flexi-grid optical networks |
title_fullStr |
Column generation algorithms for virtual network embedding in flexi-grid optical networks |
title_full_unstemmed |
Column generation algorithms for virtual network embedding in flexi-grid optical networks |
title_sort |
column generation algorithms for virtual network embedding in flexi-grid optical networks |
publishDate |
2019 |
url |
https://hdl.handle.net/10356/83159 http://hdl.handle.net/10220/47570 |
_version_ |
1681043586841313280 |