End-to-End Delay Minimization based Joint Route Selection and Network Function Placement in SDN

Leilei Huang, Rong Chai, Qianbin Chen, Chun Jin
{"title":"End-to-End Delay Minimization based Joint Route Selection and Network Function Placement in SDN","authors":"Leilei Huang, Rong Chai, Qianbin Chen, Chun Jin","doi":"10.1109/WCSP.2018.8555615","DOIUrl":null,"url":null,"abstract":"The integration of software-defined networking (S-DN) and network function virtualization (NFV) is expected to achieve the convenient management and flexible deployment of various sophisticated network functions, and support user applications with guaranteed quality of service (QoS). In this paper, we jointly study route selection and network function placement problem. To stress the service sensitivity on delay, we formulate an optimization problem which minimizes the total end-to-end delay subject to data transmission, service requirement and various available resource constraints. As the formulated problem is an NP-hard problem, which cannot be solved easily, we transform it into three subproblems, i.e., route selection subproblem, network function placement subproblem and resource sharing subproblem of user flows, and solve the three subproblems by applying the K-shortest paths algorithm, Kuhn-Munkres (K-M) algorithm and Lagrangian dual method, respectively. Numerical results demonstrate the effectiveness of the proposed algorithm.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2018.8555615","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The integration of software-defined networking (S-DN) and network function virtualization (NFV) is expected to achieve the convenient management and flexible deployment of various sophisticated network functions, and support user applications with guaranteed quality of service (QoS). In this paper, we jointly study route selection and network function placement problem. To stress the service sensitivity on delay, we formulate an optimization problem which minimizes the total end-to-end delay subject to data transmission, service requirement and various available resource constraints. As the formulated problem is an NP-hard problem, which cannot be solved easily, we transform it into three subproblems, i.e., route selection subproblem, network function placement subproblem and resource sharing subproblem of user flows, and solve the three subproblems by applying the K-shortest paths algorithm, Kuhn-Munkres (K-M) algorithm and Lagrangian dual method, respectively. Numerical results demonstrate the effectiveness of the proposed algorithm.
基于SDN联合路由选择和网络功能布局的端到端时延最小化
软件定义网络(S-DN)与网络功能虚拟化(NFV)的融合,可以实现各种复杂网络功能的便捷管理和灵活部署,在保证服务质量(QoS)的前提下支持用户应用。本文共同研究了路由选择和网络功能布局问题。为了强调业务对延迟的敏感性,我们在数据传输、业务需求和各种可用资源约束的情况下,制定了一个最小化端到端总延迟的优化问题。由于公示问题是np困难问题,不易求解,我们将其转化为三个子问题,即用户流的路由选择子问题、网络功能放置子问题和资源共享子问题,并分别应用k -最短路径算法、khn - munkres (K-M)算法和拉格朗日对偶方法对这三个子问题进行求解。数值结果表明了该算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信