Decomposition-based VNF placement algorithm in TDM-WDM-based optical aggregation network

T. Miyamura, A. Misawa, J. Kani
{"title":"Decomposition-based VNF placement algorithm in TDM-WDM-based optical aggregation network","authors":"T. Miyamura, A. Misawa, J. Kani","doi":"10.1109/NOMS.2018.8406160","DOIUrl":null,"url":null,"abstract":"In this paper, we consider the design of an optical aggregation network with network edge functions virtualization in order to reduce network cost. Here, an optical aggregation network connects a server accommodating virtual network functions (VNFs) with optical line terminals (OLTs) via a time-division-multiplexing (TDM)-based point-to- multipoint (P2MP) wavelength path to aggregate traf­fic from access networks. Each VNF must be placed on an adequate server in consideration of the efficiency of wavelength paths to reduce network cost. How­ever, existing VNF placement algorithms determines VNF placement without considering the efficiency of P2MP wavelength paths, which deteriorates network performance and increases network cost. To solve the problem, VNF placement must be carried out so that a P2MP wavelength path can be efficiently shared by multiple OLTs for reducing network cost. For this purpose, we propose a VNF placement algorithm, called decomposition-based VNF placement algorithm (DVA), in a TDM wavelength-division-multiplexing (WDM)-based optical aggregation network. The DVA can find approximate solutions of sufficient quality with practical computation time.","PeriodicalId":19331,"journal":{"name":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"NOMS 2018 - 2018 IEEE/IFIP Network Operations and Management Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NOMS.2018.8406160","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In this paper, we consider the design of an optical aggregation network with network edge functions virtualization in order to reduce network cost. Here, an optical aggregation network connects a server accommodating virtual network functions (VNFs) with optical line terminals (OLTs) via a time-division-multiplexing (TDM)-based point-to- multipoint (P2MP) wavelength path to aggregate traf­fic from access networks. Each VNF must be placed on an adequate server in consideration of the efficiency of wavelength paths to reduce network cost. How­ever, existing VNF placement algorithms determines VNF placement without considering the efficiency of P2MP wavelength paths, which deteriorates network performance and increases network cost. To solve the problem, VNF placement must be carried out so that a P2MP wavelength path can be efficiently shared by multiple OLTs for reducing network cost. For this purpose, we propose a VNF placement algorithm, called decomposition-based VNF placement algorithm (DVA), in a TDM wavelength-division-multiplexing (WDM)-based optical aggregation network. The DVA can find approximate solutions of sufficient quality with practical computation time.
tdm - wdm光汇聚网络中基于分解的VNF放置算法
为了降低网络成本,本文考虑设计一种具有网络边缘功能虚拟化的光聚合网络。在这里,光汇聚网络通过基于时分复用(TDM)的点对多点(P2MP)波长路径将容纳虚拟网络功能(vnf)的服务器与光线路终端(olt)连接起来,聚合来自接入网的流量。考虑到波长路径的效率,必须将每个VNF放置在适当的服务器上,以降低网络成本。然而,现有的VNF放置算法在确定VNF放置时没有考虑P2MP波长路径的效率,从而降低了网络性能,增加了网络成本。为了解决这个问题,必须进行VNF的放置,以便多个olt能够有效地共享P2MP波长路径,从而降低网络成本。为此,我们在TDM波分复用(WDM)光汇聚网络中提出了一种基于分解的VNF放置算法(DVA)。DVA可以在实际的计算时间内找到足够质量的近似解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信