版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Kyoto Univ Grad Sch Informat Kyoto 6068501 Japan
出 版 物:《COMPUTER NETWORKS》 (计算机网络)
年 卷 期:2024年第241卷
核心收录:
学科分类:0810[工学-信息与通信工程] 0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:JSPS KAKENHI Japan [19K14980 21H03426 23H03382]
主 题:Network function virtualization Service chaining Multicast Reliability Optimization problem
摘 要:Service chaining provides network services to users by processing packets with a series of virtualized network functions (VNFs). Multicast communication can suppress the network load compared to unicast communication when the same service is provided to multiple users simultaneously. Network providers need to ensure that services are provided to users under reliability requirements. Existing service chaining models can cause failure -intolerant or cost -inefficient resource allocation for multicast services. This paper proposes a multisource multicast service chaining model that guarantees the reliability of network services with flexible routing and VNF placement. The proposed model determines the routing and VNF placement for each service chain request with redundancy so as to minimize the total resource utilization cost while satisfying the reliability requirement. In order to obtain cost-efficient feasible solutions, we introduce two heuristic algorithms. One is an algorithm that iteratively solves an integer linear programming problem until the reliability requirements are satisfied for all requests. The other is an algorithm that determines the VNF placement by using a metric based on the betweenness centrality and server failure rate. Numerical results show that the proposed model allocates the network and computation resources for services with lower total cost compared to the existing model. We also show illustrative examples of the resource allocation to compare the characteristics of two heuristic algorithms.