面向网络功能虚拟化的动态服务链迁移

Liquan Xie, Qiao Zhou, Jianyang Huang
{"title":"面向网络功能虚拟化的动态服务链迁移","authors":"Liquan Xie, Qiao Zhou, Jianyang Huang","doi":"10.1109/ICNISC.2017.00027","DOIUrl":null,"url":null,"abstract":"Virtual network function supports the scalable control to the software-based network functions while leading to the challenge of flexible service chains migration for the load balance, processing performance or QoS. In this paper, we formulated the service chains migration (SCM) problem as an integer linear program that maximizes the utility of the network and subjects to the resource and performance constraints. We approximated the objective function of SCM with the Log-Sum-Exp function, and proposed a Markov chain-based distributed migration algorithm. Simulation results prove that the proposed algorithm can realize effective and cost-efficient service chain migration.","PeriodicalId":429511,"journal":{"name":"2017 International Conference on Network and Information Systems for Computers (ICNISC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Dynamic Service Chain Migration for Network Functions Virtualization\",\"authors\":\"Liquan Xie, Qiao Zhou, Jianyang Huang\",\"doi\":\"10.1109/ICNISC.2017.00027\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Virtual network function supports the scalable control to the software-based network functions while leading to the challenge of flexible service chains migration for the load balance, processing performance or QoS. In this paper, we formulated the service chains migration (SCM) problem as an integer linear program that maximizes the utility of the network and subjects to the resource and performance constraints. We approximated the objective function of SCM with the Log-Sum-Exp function, and proposed a Markov chain-based distributed migration algorithm. Simulation results prove that the proposed algorithm can realize effective and cost-efficient service chain migration.\",\"PeriodicalId\":429511,\"journal\":{\"name\":\"2017 International Conference on Network and Information Systems for Computers (ICNISC)\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Network and Information Systems for Computers (ICNISC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNISC.2017.00027\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Network and Information Systems for Computers (ICNISC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNISC.2017.00027","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

虚拟网络功能支持对基于软件的网络功能的可扩展控制,同时也带来了灵活的业务链迁移对负载平衡、处理性能或QoS的挑战。在本文中,我们将服务链迁移(SCM)问题表述为一个整数线性规划,使网络的效用最大化,并受资源和性能约束。用Log-Sum-Exp函数逼近SCM的目标函数,提出了一种基于马尔可夫链的分布式迁移算法。仿真结果表明,该算法能够实现高效、低成本的服务链迁移。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dynamic Service Chain Migration for Network Functions Virtualization
Virtual network function supports the scalable control to the software-based network functions while leading to the challenge of flexible service chains migration for the load balance, processing performance or QoS. In this paper, we formulated the service chains migration (SCM) problem as an integer linear program that maximizes the utility of the network and subjects to the resource and performance constraints. We approximated the objective function of SCM with the Log-Sum-Exp function, and proposed a Markov chain-based distributed migration algorithm. Simulation results prove that the proposed algorithm can realize effective and cost-efficient service chain migration.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信