Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/83159
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLin, Rongpingen
dc.contributor.authorLuo, Shanen
dc.contributor.authorZhou, Jingweien
dc.contributor.authorWang, Shengen
dc.contributor.authorChen, Binen
dc.contributor.authorZhang, Xiaoningen
dc.contributor.authorCai, Anliangen
dc.contributor.authorZhong, Wen-Deen
dc.contributor.authorZukerman, Mosheen
dc.date.accessioned2019-01-28T08:15:07Zen
dc.date.accessioned2019-12-06T15:12:59Z-
dc.date.available2019-01-28T08:15:07Zen
dc.date.available2019-12-06T15:12:59Z-
dc.date.issued2018en
dc.identifier.citationLin, 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.010898en
dc.identifier.urihttps://hdl.handle.net/10356/83159-
dc.description.abstractNetwork 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.en
dc.format.extent16 p.en
dc.language.isoenen
dc.relation.ispartofseriesOptics Expressen
dc.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.en
dc.subjectDRNTU::Engineering::Electrical and electronic engineeringen
dc.subjectNetwork Optimizationen
dc.subjectNetworksen
dc.titleColumn generation algorithms for virtual network embedding in flexi-grid optical networksen
dc.typeJournal Articleen
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen
dc.identifier.doi10.1364/OE.26.010898en
dc.description.versionPublished versionen
item.fulltextWith Fulltext-
item.grantfulltextopen-
Appears in Collections:EEE Journal Articles
Files in This Item:
File Description SizeFormat 
Column generation algorithms for virtual.pdf4 MBAdobe PDFThumbnail
View/Open

SCOPUSTM   
Citations 20

10
Updated on Aug 27, 2024

Web of ScienceTM
Citations 20

8
Updated on Oct 31, 2023

Page view(s) 50

490
Updated on Sep 7, 2024

Download(s) 50

95
Updated on Sep 7, 2024

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.