动态虚拟光网络组成的性能建模与分析

S. Peng, R. Nejabati, E. Escalona, D. Simeonidou, M. Anastasopoulos, K. Georgakilas, A. Tzanakaki, A. Vernitski
{"title":"动态虚拟光网络组成的性能建模与分析","authors":"S. Peng, R. Nejabati, E. Escalona, D. Simeonidou, M. Anastasopoulos, K. Georgakilas, A. Tzanakaki, A. Vernitski","doi":"10.1109/ONDM.2012.6210208","DOIUrl":null,"url":null,"abstract":"High-capacity networks based on optical technologies enable global delivery of high-performance network-based applications driven by Future Internet services. Due to the accelerated evolution of these applications, dynamic adaptability of the underlying optical infrastructure becomes crucial to support efficient data transport through the operators' networks. Optical network virtualization can be considered as a key technology for addressing this challenge. This paper presents a novel architecture enabled by optical network virtualization that adopts the concept of Infrastructure as a Service (IaaS). For the IaaS framework, three intelligent and dynamic composition mechanisms, employing Mixed Integer Linear Programming (MILP), K-Shortest Path (K-SP) and Random path routing algorithms are proposed. The performance of these algorithms in terms of the virtual optical network (VON) composition performance and the algorithm computational complexity is evaluated and compared in this study. The results show that MILP can provide optimal solutions for VON composition but it takes the longest time to execute, while the proposed Random algorithm can achieve the shortest running time.","PeriodicalId":151401,"journal":{"name":"2012 16th International Conference on Optical Network Design and Modelling (ONDM)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Performance modelling and analysis of dynamic virtual optical network composition\",\"authors\":\"S. Peng, R. Nejabati, E. Escalona, D. Simeonidou, M. Anastasopoulos, K. Georgakilas, A. Tzanakaki, A. Vernitski\",\"doi\":\"10.1109/ONDM.2012.6210208\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"High-capacity networks based on optical technologies enable global delivery of high-performance network-based applications driven by Future Internet services. Due to the accelerated evolution of these applications, dynamic adaptability of the underlying optical infrastructure becomes crucial to support efficient data transport through the operators' networks. Optical network virtualization can be considered as a key technology for addressing this challenge. This paper presents a novel architecture enabled by optical network virtualization that adopts the concept of Infrastructure as a Service (IaaS). For the IaaS framework, three intelligent and dynamic composition mechanisms, employing Mixed Integer Linear Programming (MILP), K-Shortest Path (K-SP) and Random path routing algorithms are proposed. The performance of these algorithms in terms of the virtual optical network (VON) composition performance and the algorithm computational complexity is evaluated and compared in this study. The results show that MILP can provide optimal solutions for VON composition but it takes the longest time to execute, while the proposed Random algorithm can achieve the shortest running time.\",\"PeriodicalId\":151401,\"journal\":{\"name\":\"2012 16th International Conference on Optical Network Design and Modelling (ONDM)\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-04-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 16th International Conference on Optical Network Design and Modelling (ONDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ONDM.2012.6210208\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 16th International Conference on Optical Network Design and Modelling (ONDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ONDM.2012.6210208","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

基于光技术的大容量网络能够实现由未来互联网服务驱动的高性能网络应用的全球交付。由于这些应用的加速发展,底层光基础设施的动态适应性对于支持通过运营商网络的高效数据传输变得至关重要。光网络虚拟化可以被认为是解决这一挑战的关键技术。本文提出了一种采用基础设施即服务(IaaS)概念的光网络虚拟化新架构。针对IaaS框架,提出了采用混合整数线性规划(MILP)、k -最短路径(K-SP)和随机路径路由算法的三种智能动态组合机制。本文从虚拟光网络(VON)组成性能和算法计算复杂度两方面对这些算法的性能进行了评价和比较。结果表明,MILP算法可以为VON组合提供最优解,但执行时间较长,而随机算法可以实现最短的运行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Performance modelling and analysis of dynamic virtual optical network composition
High-capacity networks based on optical technologies enable global delivery of high-performance network-based applications driven by Future Internet services. Due to the accelerated evolution of these applications, dynamic adaptability of the underlying optical infrastructure becomes crucial to support efficient data transport through the operators' networks. Optical network virtualization can be considered as a key technology for addressing this challenge. This paper presents a novel architecture enabled by optical network virtualization that adopts the concept of Infrastructure as a Service (IaaS). For the IaaS framework, three intelligent and dynamic composition mechanisms, employing Mixed Integer Linear Programming (MILP), K-Shortest Path (K-SP) and Random path routing algorithms are proposed. The performance of these algorithms in terms of the virtual optical network (VON) composition performance and the algorithm computational complexity is evaluated and compared in this study. The results show that MILP can provide optimal solutions for VON composition but it takes the longest time to execute, while the proposed Random algorithm can achieve the shortest running time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信