End-to-end latency upper bounds and service chain deployment algorithm based on industrial internet network

被引:0
作者
Wang, Min [1 ]
Gao, Ziyi [2 ]
Wang, Haoyuan [3 ]
Qiao, Sibo [4 ]
Wang, Jinhai [1 ]
机构
[1] Tiangong Univ, Sch Life Sci, Tianjin 300387, Peoples R China
[2] Tiangong Univ, Sch Elect & Informat Engn, Tianjin 300387, Peoples R China
[3] Tiangong Univ, Sch Control Sci & Engn, Tianjin 300387, Peoples R China
[4] Tiangong Univ, Sch Software, Tianjin 300387, Peoples R China
基金
中国国家自然科学基金;
关键词
Service chain deployment; Network calculus; Virtual network functions; EDGE; MANAGEMENT;
D O I
10.1016/j.simpat.2024.103031
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The diverse service requests in industrial Internet networks require flexible and efficient service chain deployment to ensure the quality of service (QoS). However, current deployment algorithms for service chains are primarily designed to guarantee only low end-to-end latency; they often overlook the amount of service chains that can be accommodated by the network and could lead to severe network load imbalances, significantly reducing service efficiency and causing serious network congestion issues. To address the above issues, we develop a mathematical model of the network topology and service request chains by integrating Network Function Virtualization (NFV) and Software Defined Networking (SDN). Utilizing network calculus theory, we derive the upper bound of end-to-end delay for service chain routing and analyzed the relationship between the upper bound of service chain routing delay and the resource allocation of Virtual Network Function (VNF) nodes. Based on the aforementioned model, we propose a novel service chain deployment algorithm named the Delay-Aware Load- Balanced Routing Algorithm (DLBRA). DLBRA comprehensively considers network traffic load balancing and end-to-end latency of service chains, rationally allocating VNF node resources to complete the determined service chain routing deployment. Experimental results indicate that, compared to the shortest path and load balancing algorithms, DLBRA not only ensures that the end-to-end delay of the service chain meets its QoS requirements, but also effectively reduces network load imbalance, significantly increasing the number of service chain requests that the network can accommodate. Additionally, DLBRA provides tailored deployment guidance for different types of service chains, such as latency-sensitive and data-intensive service chains, ensuring optimal utilization of network resources. This algorithm enhances the efficiency of service chain deployment in industrial internet scenarios and possesses broad application potential in other network environments where delay optimization and load balancing are critical, such as intelligent transportation, cloud computing, and 5G networks.
引用
收藏
页数:20
相关论文
empty
未找到相关数据