Research on Service Function Chain Orchestration for Intractable Scenarios

Xiangyu Yin, X. Chen, Tao Wu, Liang Li, Qing Li, Mingfeng Zhao, Bin Xiang, Lingyun Liu
{"title":"Research on Service Function Chain Orchestration for Intractable Scenarios","authors":"Xiangyu Yin, X. Chen, Tao Wu, Liang Li, Qing Li, Mingfeng Zhao, Bin Xiang, Lingyun Liu","doi":"10.1109/ISCTIS58954.2023.10213001","DOIUrl":null,"url":null,"abstract":"Service Function Chaining (SFC) has become a typical network service delivery approach in software-defined networking/ network function virtualization (SDN/NFV) network architectures. The complex network topology and dynamic nature of network resources in NFV networks have made the orchestration of service function chains a research hotspot and challenge. Existing studies consider mapping various types of virtual network function (VNF) nodes in the virtual service function chain to the underlying physical network, assuming that physical nodes can accommodate all types of VNF services, which imposes high demands on the performance of the physical network. In response to the aforementioned issues, this paper proposes a novel network architecture for scenarios where the physical network is intractable. To validate the effectiveness of the proposed network architecture, mathematical programming algorithms and genetic algorithms are employed to conduct experiments on the orchestration of SFC.","PeriodicalId":334790,"journal":{"name":"2023 3rd International Symposium on Computer Technology and Information Science (ISCTIS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 3rd International Symposium on Computer Technology and Information Science (ISCTIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCTIS58954.2023.10213001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Service Function Chaining (SFC) has become a typical network service delivery approach in software-defined networking/ network function virtualization (SDN/NFV) network architectures. The complex network topology and dynamic nature of network resources in NFV networks have made the orchestration of service function chains a research hotspot and challenge. Existing studies consider mapping various types of virtual network function (VNF) nodes in the virtual service function chain to the underlying physical network, assuming that physical nodes can accommodate all types of VNF services, which imposes high demands on the performance of the physical network. In response to the aforementioned issues, this paper proposes a novel network architecture for scenarios where the physical network is intractable. To validate the effectiveness of the proposed network architecture, mathematical programming algorithms and genetic algorithms are employed to conduct experiments on the orchestration of SFC.
棘手场景下的业务功能链编排研究
业务功能链(SFC)已成为软件定义网络/网络功能虚拟化(SDN/NFV)网络架构中典型的网络服务交付方式。NFV网络中复杂的网络拓扑结构和网络资源的动态性使业务功能链的编排成为研究的热点和挑战。现有研究考虑将虚拟业务功能链中各种类型的VNF节点映射到底层物理网络,假设物理节点可以容纳所有类型的VNF业务,这对物理网络的性能提出了很高的要求。针对上述问题,本文针对物理网络难以处理的场景,提出了一种新的网络架构。为了验证所提出的网络架构的有效性,采用数学规划算法和遗传算法对SFC的编排进行了实验。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信