Min Wang , Ziyi Gao , Haoyuan Wang , Sibo Qiao , Jinhai Wang
{"title":"End-to-end latency upper bounds and service chain deployment algorithm based on industrial internet network","authors":"Min Wang , Ziyi Gao , Haoyuan Wang , Sibo Qiao , Jinhai Wang","doi":"10.1016/j.simpat.2024.103031","DOIUrl":null,"url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":49518,"journal":{"name":"Simulation Modelling Practice and Theory","volume":"138 ","pages":"Article 103031"},"PeriodicalIF":3.5000,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Simulation Modelling Practice and Theory","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1569190X2400145X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
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.
期刊介绍:
The journal Simulation Modelling Practice and Theory provides a forum for original, high-quality papers dealing with any aspect of systems simulation and modelling.
The journal aims at being a reference and a powerful tool to all those professionally active and/or interested in the methods and applications of simulation. Submitted papers will be peer reviewed and must significantly contribute to modelling and simulation in general or use modelling and simulation in application areas.
Paper submission is solicited on:
• theoretical aspects of modelling and simulation including formal modelling, model-checking, random number generators, sensitivity analysis, variance reduction techniques, experimental design, meta-modelling, methods and algorithms for validation and verification, selection and comparison procedures etc.;
• methodology and application of modelling and simulation in any area, including computer systems, networks, real-time and embedded systems, mobile and intelligent agents, manufacturing and transportation systems, management, engineering, biomedical engineering, economics, ecology and environment, education, transaction handling, etc.;
• simulation languages and environments including those, specific to distributed computing, grid computing, high performance computers or computer networks, etc.;
• distributed and real-time simulation, simulation interoperability;
• tools for high performance computing simulation, including dedicated architectures and parallel computing.