Service function chain deployment method and device for joint user access, equipment and medium

Abstract

The invention provides a service function chain deployment method and device for joint user access, equipment and a medium, and the method comprises the steps: determining a target deployment network based on a pre-constructed air-space-ground integrated network model for joint user access and service function chain deployment; determining a target deployment algorithm based on the importance degree of the virtualized network function called by each service function chain in the service function chain set; with minimization of the end-to-end time delay as a target, deploying the virtualized network function according to a target deployment algorithm so as to determine a target network node deployed by the virtualized network function in a target deployment network; and determining the resource quantity allocated to the virtualized network function by the target network node deployed by the virtualized network function based on the task quantity of the service function chain borne by different virtualized network functions, and completing the deployment of the service function chain set. According to the invention, the end-to-end time delay in the SDN-SAGIN can be further shortened.

Description

Technical Field

[0001] The present invention relates to the technical field of service function chain deployment, and in particular to a service function chain deployment method, device, equipment and medium for joint user access. Background Art

[0002] With the rapid development of mobile internet, people's demands for network coverage are constantly increasing. Traditional terrestrial networks, due to their limited coverage, struggle to meet this growing user demand. To address this challenge, the Space-Air-Ground Integrated Network (SAGIN) has emerged. SAGIN combines drones, satellite networks, and terrestrial networks to provide communication services with wider coverage. However, SAGIN faces the challenges of coexisting multiple protocols, multi-dimensional resources, and multiple network interfaces. How to achieve highly dynamic heterogeneous network integration is a hot research topic in SAGIN.

[0003] Software-defined networking (SDN) combined with virtualized network functions (VNFs) is considered the preferred technology for heterogeneous network convergence. This perfect combination not only achieves the separation of control signaling and data, but also the separation of software and hardware infrastructure. The SDN controller can deploy VNFs at appropriate locations in the network based on different user needs. These ordered VNFs form a service function chain (SFC) to meet user feature requirements. Therefore, SDN-SAGIN not only solves the problem of heterogeneous network convergence but also improves network flexibility and efficiency. However, due to the long distances between space-based and airborne networks and terrestrial users, reducing end-to-end latency in SDN-SAGIN has become a key research goal, especially for latency-sensitive services.

[0004] The primary method for reducing end-to-end latency in existing SDN-SAGIN (Synchronous Functional Networking) is through SFC deployment. Because SFCs consist of ordered chains of VNFs, the placement of different VNFs directly impacts propagation latency. Existing SFC deployment methods include the following: The first is based on terrestrial networks and extends to airborne and space-based networks; the second is based on theoretical implementations of Timeline Expansion Networks (TENs); the third is based on heuristic or meta-heuristic algorithms; the fourth is based on mathematical models; and the fifth is based on machine learning and reinforcement learning. However, there is still room for improvement in these methods for reducing end-to-end latency. Summary of the Invention

[0005] In view of this, the object of the present invention is to provide a service function chain deployment method, apparatus, device and medium for joint user access, which can further shorten the end-to-end delay in SDN-SAGIN.

[0006] In a first aspect, an embodiment of the present invention provides a method for deploying a service function chain for joint user access, including: Determine the target deployment network based on a pre-built integrated air-ground-space network model that combines user access and service function chain deployment. The integrated air-ground-space network model includes an air-based network, a space-based network, and a ground network. Network nodes are configured in the air-based network, the space-based network, and the ground network. The user's associated terminal accesses the target deployment network from the ground network based on the service function chain set. The target deployment network is either an air-based network or a space-based network. Determining a target deployment algorithm based on the importance of the virtualized network function called by each service function chain in the service function chain set; wherein the target deployment algorithm is a front-end deployment algorithm or a back-end deployment algorithm; With the goal of minimizing end-to-end latency, the virtualized network function is deployed according to the target deployment algorithm to determine the target network node where the virtualized network function is deployed in the target deployment network; Based on the task volume of service function chains carried by different virtualized network functions, the target network node where the virtualized network function is deployed is determined to allocate resources to the virtualized network function, and the deployment of the service function chain set is completed.

[0007] In one embodiment, determining a target deployment network based on a pre-built air-ground integrated network model for joint user access and service function chain deployment includes: Based on a pre-built air-ground integrated network model that combines user access and service function chain deployment, determine whether the user's associated terminal is covered by the air-based network, and whether the source network node and destination network node corresponding to the service function chain in the service function chain set are covered by the air-based network; If yes, the space-based network is determined as the target deployment network; If not, the space-based network is determined as the target deployment network.

[0008] In one embodiment, determining a target deployment algorithm based on the importance of a virtualized network function called by each service function chain in a service function chain set includes: Divide the service function chain set according to the virtualized network function called by each service function chain in the service function chain set to obtain a service function chain sub-set corresponding to each virtualized network function; Statistics are collected for each service function chain subset to determine the number of calls to each virtualized network function. The number of calls is used to describe the importance of each virtualized network function. Determine the front-end virtualized network function and the back-end virtualized network function based on the location of each virtualized network function in the pre-built virtualized network function set; A target deployment algorithm is determined based on the importance of the front-end virtualized network functions and the importance of the back-end virtualized network functions.

[0009] In one embodiment, with minimizing end-to-end delay as a goal, deploying a virtualized network function according to a target deployment algorithm to determine a target network node for deploying the virtualized network function in a target deployment network includes: Determine a deployment order for the virtualized network functions based on a target deployment algorithm, so as to deploy the virtualized network functions according to a deployment sequence method; During the deployment of the current virtualized network function, the current virtualized network function is pre-deployed in a network node of the target deployment network, and with the goal of minimizing end-to-end latency, candidate network nodes corresponding to the current virtualized network function are determined from the pre-deployed network nodes based on a set of service function chains corresponding to the current virtualized network function; Determine whether the candidate network nodes meet the preset node and link constraints; If not, the candidate network node will be removed from the target deployment network, and the candidate network node corresponding to the current virtualized network function will be re-determined until the new candidate network node meets the node and link constraints. The candidate network node will be used as the target network node corresponding to the current virtualized network function, and the current virtualized network function will be deployed to the target network node.

[0010] In one embodiment, with the goal of minimizing end-to-end delay, determining a candidate network node corresponding to the current virtualized network function from pre-deployed network nodes based on a subset of service function chains corresponding to the current virtualized network function includes: If the current virtualized network function is the first deployed virtualized network function, determine the link delay between the source network node or destination network node corresponding to each service function chain in the service function chain subset corresponding to the current virtualized network function and the network node pre-deployed with the current virtualized network function, and select the network node corresponding to the shortest link delay as the candidate network node corresponding to the current virtualized network function; If the current virtualized network function is not the first deployed virtualized network function, determine the link delay between the target network node corresponding to the previous virtualized network function or the target network node corresponding to the next virtualized network function and the network node pre-deployed by the current virtualized network function, and use the network node corresponding to the shortest link delay as the candidate network node corresponding to the current virtualized network function.

[0011] In one embodiment, determining whether a candidate network node satisfies preset node and link constraints includes: Determine whether the total resources occupied by all virtualized network functions deployed on the candidate network node are less than the CPU resources corresponding to the candidate network node, and whether the total traffic flowing through the service function chain of the candidate network node is less than the link bandwidth; If so, it is determined that the preset node and link constraints are met.

[0012] In one embodiment, determining the amount of resources allocated to the virtualized network function by the target network node where the virtualized network function is deployed based on the task amount of the service function chains carried by different virtualized network functions includes: The sum of the data transmission volumes corresponding to each service function chain that calls the virtualized network function is used as the task volume of the virtualized network function carrying the service function chain; If the target network node where the virtualized network function is deployed has multiple virtualized network functions deployed on it, the sum of the task amounts of the service function chains carried by each virtualized network function deployed on the target network node is used as the total task amount corresponding to the target network node; Based on the ratio between the task amount and the total task amount, the amount of resources allocated to the virtualized network function by the target network node where the virtualized network function is deployed is determined.

[0013] In a second aspect, an embodiment of the present invention further provides a service function chain deployment device for joint user access, comprising: a network determination module for determining a target deployment network based on a pre-built air-space-ground integrated network model deployed with a joint user access and service function chain; wherein the air-space-ground integrated network model includes an air-based network, a space-based network, and a ground network, each of which is configured with network nodes; and wherein a user's associated terminal accesses the target deployment network from the ground network based on a set of service function chains, and the target deployment network is either an air-based network or a space-based network. an algorithm determination module, configured to determine a target deployment algorithm based on the importance of the virtualized network function called by each service function chain in the service function chain set; wherein the target deployment algorithm is a front-end deployment algorithm or a back-end deployment algorithm; A deployment module is configured to deploy the virtualized network function according to a target deployment algorithm with the goal of minimizing end-to-end delay, so as to determine a target network node for deploying the virtualized network function in a target deployment network; The resource allocation module is used to determine the amount of resources allocated to the target network node where the virtualized network function is deployed based on the task volume of the service function chain carried by different virtualized network functions, and complete the deployment of the service function chain set.

[0014] In a third aspect, an embodiment of the present invention further provides an electronic device, comprising a processor and a memory, wherein the memory stores computer-executable instructions that can be executed by the processor, and the processor executes the computer-executable instructions to implement any one of the methods provided in the first aspect.

[0015] In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium, which stores computer-executable instructions. When the computer-executable instructions are called and executed by a processor, the computer-executable instructions prompt the processor to implement any one of the methods provided in the first aspect.

[0016] An embodiment of the present invention provides a method, apparatus, device and medium for deploying a service function chain for joint user access. First, based on a pre-built air-space-ground integrated network model for joint user access and service function chain deployment, a target deployment network is determined; wherein, the air-space-ground integrated network model includes an air-based network, a space-based network and a ground network, and network nodes are configured in the air-based network, the space-based network and the ground network. The user's associated terminal accesses the target deployment network from the ground network based on the service function chain set, and the target deployment network is an air-based network or a space-based network; then, based on the importance of the virtualized network function called by each service function chain in the service function chain set, a target deployment algorithm is determined; wherein, the target deployment algorithm is a front-end deployment algorithm or a back-end deployment algorithm; then, with the goal of minimizing end-to-end delay, the virtualized network function is deployed according to the target deployment algorithm to determine the target network node where the virtualized network function is deployed in the target deployment network; finally, based on the task amount of the service function chain carried by different virtualized network functions, the target network node where the virtualized network function is deployed is determined as the amount of resources allocated to the virtualized network function, and the deployment of the service function chain set is completed. The above method introduces user access conditions, dynamically adjusts the network to be accessed and the algorithm used for deployment, and deploys virtualized network functions on this basis, and allocates resources to virtualized network functions, thereby achieving optimal utilization of network resources and minimizing end-to-end latency.

[0017] Other features and advantages of the present invention will be described in the following description, and in part will become apparent from the description, or understood by practicing the present invention. The purposes and other advantages of the present invention are realized and obtained by the structures particularly pointed out in the description, claims and drawings.

[0018] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, preferred embodiments are given below and described in detail with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] In order to more clearly illustrate the specific embodiments of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for use in the specific embodiments or the description of the prior art. Obviously, the drawings described below are some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0020] Figure 1 A flowchart of a method for deploying a service function chain for joint user access provided by an embodiment of the present invention; Figure 2 An example diagram of combined user access and VNF deployment provided by an embodiment of the present invention; Figure 3 A diagram of an air-ground integrated network model provided by an embodiment of the present invention; Figure 4 A flow chart of an SFC two-end deployment algorithm for joint user access provided by an embodiment of the present invention; Figure 5 A resource allocation flow chart provided in an embodiment of the present invention; Figure 6 A schematic diagram of the structure of a service function chain deployment device for joint user access provided by an embodiment of the present invention; Figure 7 A schematic structural diagram of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0021] To make the objectives, technical solutions, and advantages of the embodiments of the present invention more clear, the technical solutions of the present invention will be clearly and completely described below in conjunction with the embodiments. Obviously, the embodiments described are only part of the embodiments of the present invention, not all of them. All other embodiments obtained by ordinary technicians in this field based on the embodiments of the present invention without making any creative efforts shall fall within the scope of protection of the present invention.

[0022] Existing SFC deployment methods mainly include the following: The first SFC deployment method extends the commonly used SFC deployment algorithm on terrestrial networks to airborne and space-based networks. While this method can solve the SFC deployment problem in SAGIN networks, its effectiveness is limited because it ignores the characteristics of heterogeneous networks, ignores the user access situation, and does not consider the end-to-end latency differences caused by users accessing different satellites. Furthermore, it considers SFC deployment in a quasi-static topology.

[0023] The second SFC deployment method uses the theory of time-extended networks to address SFC deployment. This method effectively analyzes and represents dynamic network structures by expanding the network's nodes and connections along a timeline to display their states and changes at different points in time. However, the granularity at which time should be broken down remains an unresolved issue, and the SFC deployment requires remodeling for each time node. This consumes significant system resources and is computationally complex.

[0024] The third SFC deployment method uses heuristic or meta-heuristic algorithms for SFC deployment. This method may find high-quality approximate solutions and has strong flexibility, but it usually cannot guarantee the global optimal solution. It is highly dependent on the problem, has complex parameter tuning, and can easily fall into the search space of local optimal solutions.

[0025] The fourth SFC deployment method uses mathematical models to implement SFC deployment. This method typically employs linear programming, integer linear programming, mixed integer linear programming, nonlinear programming, and dynamic programming. This method typically provides high accuracy and can even find the optimal solution. However, it also suffers from high computational complexity, modeling difficulties, and parameter sensitivity.

[0026] The fifth SFC deployment method uses deep learning and reinforcement learning algorithms to implement SFC deployment. This method generally achieves good deployment results, but it requires extensive training and experimentation to achieve the optimal solution. Especially when the network is large, it is necessary to monitor the network and prune branches to prevent overfitting.

[0027] Conclusion: Existing SAGIN service chain deployment methods are mostly based on terrestrial networks, expanding space-based and air-based network nodes and links, with research focusing on SFC deployment and resource allocation. Existing SFC deployment algorithms default to users selecting the nearest satellite access network. By deploying SFC, the inter-satellite link latency and VNF processing latency are shortened, but the user access situation is ignored. Different access network nodes will affect the end-to-end latency of SFC. Therefore, the embodiments of the present invention address the above issues by proposing a service function chain deployment method, apparatus, device, and medium for user access. These methods not only consider the issue of user access to the network, but also focus on the issue of access to different network nodes affecting the end-to-end latency. The proposed method not only reduces the algorithm complexity but also shortens the end-to-end latency.

[0028] Example 1: To facilitate understanding of this embodiment, a service function chain deployment method for joint user access disclosed in an embodiment of the present invention is first described in detail. Figure 1 The flowchart of a method for deploying a service function chain for joint user access is shown, and the method mainly includes the following steps S102 to S108: Step S102 : determining a target deployment network based on a pre-built air-ground-integrated network model for joint user access and service function chain deployment.

[0029] The SAGIN model includes air-based, space-based, and ground-based networks, all of which are equipped with network nodes. A user's associated terminal accesses the ground network to a target deployment network based on a service function chain set (SFC set). The target deployment network is either an air-based or space-based network. In one example, if the user's associated terminal is covered by airspace, and both the source and destination network nodes corresponding to the service function chain are covered by airspace, the air-based network is selected as the target deployment network; otherwise, the space-based network is selected as the target deployment network.

[0030] Step S104: determining a target deployment algorithm based on the importance of the virtualized network function called by each service function chain in the service function chain set.

[0031] The target deployment algorithm is either a front-end deployment algorithm or a back-end deployment algorithm. In one example, an embodiment of the present invention proposes a two-end deployment algorithm for deploying a service function chain in conjunction with user access. Service function chain deployment is performed based on the two-end deployment algorithm to minimize end-to-end latency. Specifically, a virtualized network function set (VNF set) is pre-established. Based on the positions of the VNFs within the set, the front-end VNFs and back-end VNFs are determined. The importance of the two VNFs is then compared to determine the target deployment algorithm from the front-end and back-end deployment algorithms.

[0032] Step S106 , with the goal of minimizing end-to-end delay, the virtualized network function is deployed according to a target deployment algorithm to determine a target network node where the virtualized network function is deployed in the target deployment network.

[0033] In one example, the service function chain deployment problem for joint user access is formulated as a mixed integer programming problem. A representation of end-to-end latency is defined, and virtualized network functions are deployed according to a target deployment algorithm with the goal of minimizing end-to-end latency. Specifically, during the deployment of the current virtualized network function, the current virtualized network function is pre-deployed on a network node in the target deployment network, and a candidate network node corresponding to the current virtualized network function is determined from the pre-deployed network nodes. If the candidate network node does not meet the preset node and link constraints, the candidate network node corresponding to the current virtualized network function is re-determined until the new candidate network node meets the node and link constraints. The candidate network node at this point becomes the target network node to which the current virtualized network function will be deployed.

[0034] Step S108: Based on the task amount of different virtualized network functions carrying service function chains, determine the resource amount allocated to the target network node where the virtualized network function is deployed, and complete the deployment of the service function chain set.

[0035] In one example, the task volume of the service function chain carried by the virtualized network function is first determined, as well as the total task volume corresponding to the target network node where the virtualized network function is deployed. Finally, based on the ratio between the task volume and the total task volume, the amount of resources allocated to the virtualized network function by the target network node where the virtualized network function is deployed can be determined.

[0036] The service function chain deployment method for joint user access provided in an embodiment of the present invention introduces user access conditions, dynamically adjusts the network to be accessed and the algorithm used for deployment, and deploys virtualized network functions on this basis, as well as allocates resources to the virtualized network functions, thereby achieving optimal utilization of network resources and minimization of end-to-end delay.

[0037] Example 2: With the advancement of mobile communications and network function virtualization (VNF) technologies, the Space-Ground Integrated Network (SAGIN) is becoming a key architecture for future communications networks. Within this architecture, efficient deployment of service function chains (SFCs) is crucial for improving network performance and service quality. However, existing SFC deployment research primarily focuses on resource allocation and service chain optimization, often overlooking user access scenarios. This can lead to uneven resource utilization and reduced service quality in practical applications. Therefore, an embodiment of the present invention proposes an SFC deployment solution that integrates user access. By incorporating user access scenarios and analyzing user location characteristics, it dynamically adjusts user access policies and SFC deployment schemes to optimize network resource utilization and minimize end-to-end latency.

[0038] In order to more clearly illustrate the importance of the issues addressed in the embodiments of the present invention, see Figure 2 The diagram below illustrates an example of combined user access and VNF deployment. In this diagram, user UE1 is covered by both satellites S4 and S5. UE1 can choose either satellite S4 or S5 to access the satellite network. Assume that user UE1 has two services, one for UE2 and the other for UE3. If UE1 sends data to UE2, satellite S5 should be used for user access. The end-to-end latency is 27ms, while access via S4 requires 40ms. If UE1 sends data to UE3, satellite S4 should be used for user access. The end-to-end latency is 30ms, while access via S5 requires 39ms. Therefore, different access options should be selected based on the receiving end of each service. Neither the shortest distance access nor the maximum receive power access is optimal. Assume that only user UE1 needs to transmit service data to user UE2 via virtualized network function VNF1. VNF1 can be deployed on any of satellite nodes S1-S6. Assuming user UE1 accesses the satellite network via S4, and VNF1s are deployed at S1-S6, the end-to-end latency is 64ms, 64ms, 64ms, 40ms, 40ms, and 40ms, respectively. Assuming user UE1 accesses the satellite network via S5, and VNF1s are deployed at S1-S6, the end-to-end latency is 73ms, 51ms, 54ms, 49ms, 27ms, and 27ms, respectively. Similarly, if user UE1 needs to transmit service data to user UE3 via virtualized network function VNF1, the optimal access solution and optimal deployment location are: access node S4, with VNF1 deployed at network nodes S1 or S4, achieving a minimum end-to-end latency of 30ms. Therefore, the SFC deployment solution for joint user access is a worthy issue.

[0039] Existing SAGIN service chain deployment methods are mostly based on terrestrial networks, expanding on space-based and airborne network nodes and links. Research focuses on SFC deployment and resource allocation, but neglects user access and fails to consider the impact of access network nodes on end-to-end latency. Therefore, the present invention addresses these issues by constructing a mathematical model for joint optimization of user access, SFC deployment, and network node resource allocation. Furthermore, it proposes a user access method, a VNF deployment method at both ends, and a CPU allocation method to reduce end-to-end latency.

[0040] Specifically, the core points of the service function chain deployment method for joint user access provided by the embodiment of the present invention are: 1) The embodiment of the present invention introduces the SFC deployment problem in SAGIN user access, and proposes an optimization problem for joint user access, SFC deployment, and resource allocation with the goal of minimizing end-to-end delay. 2) The joint optimization problem is described as a mixed integer programming problem, and constraints are given. 3) Based on all SFC request sets, under given constraints and solution objectives, a two-end deployment method for SFC is proposed, which reduces the SFC end-to-end delay. 4) Based on the data size of SFC, a CPU resource allocation strategy is proposed to reduce end-to-end delay.

[0041] Specifically, the main ideas of the service function chain deployment method for joint user access provided by the embodiment of the present invention are: 1) Introducing user access into the SFC deployment problem of SAGIN, and through the analysis of different access points, obtaining the SFC end-to-end delay expression, and proposing the optimization problem of joint user access, SFC deployment and resource allocation. 2) Describing the above problem as a mixed integer programming problem, and giving constraints. 3) Based on all SFC request sets, under given constraints and solution objectives, a two-end deployment method of SFC is proposed to reduce the SFC end-to-end delay. 4) Based on the data volume of SFC, a CPU resource allocation strategy is proposed to reduce the end-to-end delay. 5) Obtaining user access selection, VNF deployment method, and CPU allocation scheme.

[0042] Based on this, an embodiment of the present invention provides a specific implementation of a service function chain deployment method for joint user access.

[0043] Before executing the aforementioned step S102 , it is necessary to pre-build an air-ground integrated network model for joint user access and SFC deployment, and define the expression method, node and link constraints of end-to-end delay.

[0044] (1) Establish a SAGIN model, set the VNF set, build the SFC set, obtain the CPU resource capabilities of different network nodes, and obtain the latency and bandwidth resources between different links. Build an integrated air-ground-space network model that combines user access and SFC deployment. For details, see steps A1 to A3 below: Step A1, see Figure 3 The air-ground-integrated network model diagram shown in FIG. can be expressed as , , ,in Represents a collection of underlying physical nodes (i.e., network nodes), Represents a collection of links between network nodes, e.g. include and , include and , include and SAG stands for space-based network, air-based network and ground-based network. 、 、 Represents the number of nodes in each network, 、 、 The CPU resources of each network node are represented as , The bandwidth resources and link delay between network nodes are expressed as 、 , , That is, network nodes and bandwidth resources between That is, network nodes and Assume that the set of all VNF instances in the system can be expressed as ,in Defined as Each VNF consumes a certain amount of CPU resources during operation. , where VNF is the network function required in the network, such as firewall, encryption, decryption, deep packet compression, etc. The set of service function chains in the network can be expressed as , coexistence service function chains, including Indicates the service function chains. Each service function chain can be expressed as ,in 、 Represents a service function chain The source network node and the destination network node, Represents a service function chain The set of VNFs that need to be traversed, , Represents a service function chain The VNFs, Represents a service function chain The total number of VNFs that need to be traversed, Represents a service function chain To reduce network deployment costs, it is assumed that each VNF can only be deployed on one network node in each network (space-based network, air-based network).

[0045] Step A2, Deployment Model between VNF and Network Nodes: Define Ragdoll Variables , ,in express Deployed on network nodes , otherwise, no deployment. , Indicates that in air-based networks and space-based networks It can only be deployed on one network node. Define the puppet variable Represents a service function chain Occupied . Define variables Represents a service function chain The Is the VNF the first VNF ​​in the VNF set? VNFs, Represents a service function chain The The VNF is the first VNF ​​in the VNF set VNFs.

[0046] Step A3, User Access Model: Define Ragdoll Variables , , Indicates that the user is covered by the airspace and for the service function chain In terms of 、 If both are covered by the airspace, users access the air-based network; otherwise, users access the space-based network.

[0047] (2) Formulate the SFC deployment problem for joint user access as a mixed integer programming problem. Define a representation for end-to-end delay, with the goal of minimizing end-to-end delay. For details, see steps B1 to B2 below: Step B1, end-to-end delay model: The delay of each service function chain includes propagation delay, transmission delay and processing delay.

[0048] Defining propagation delay ,in express The link length between , Represents the speed of light.

[0049] Defining transmission delay ,in is the data transmission volume, For Link Transfer rate.

[0050] Defining processing delays ,in Represented as a node for Allocated computing resources. Expressed as the number of CPU cycles required to process each bit.

[0051] Therefore, the service function chain The total link delay is .

[0052] Step B2, node and link constraints: For network nodes in space-based networks and airborne networks, the resources occupied by deployed VNFs cannot exceed the total capacity of the network node resources (i.e., CPU resources). The expression for this constraint is as follows: ; Define link bandwidth constraint puppet variables , when the service function chain Occupied link , , otherwise it is 0. The expression of this constraint is as follows: ; Indicates that all flows through the node The sum of traffic between service function chains must not exceed the link bandwidth.

[0053] (3) A two-end deployment algorithm for SFC deployment with user access is proposed. Based on this algorithm, SFC deployment is performed to minimize end-to-end latency. The basic idea of ​​this part is to first prioritize the VNFs by importance and then deploy them sequentially based on the two-end deployment method that minimizes latency. This specifically involves steps S102 to S106 mentioned above.

[0054] For the aforementioned step S102, an embodiment of the present invention provides a specific implementation method for determining the target deployment network based on a pre-built air-space-ground integrated network model for joint user access and service function chain deployment: based on the pre-built air-space-ground integrated network model for joint user access and service function chain deployment, it is determined whether the user's associated terminal is covered by the air-based network, and whether the source network node and the destination network node corresponding to the service function chain in the service function chain set are covered by the air-based network; if so, the air-based network is determined as the target deployment network; if not, the space-based network is determined as the target deployment network.

[0055] In the specific implementation, in the collection In the process, first determine whether ,Right now 、 If all are covered by airspace, users access the air-based network, otherwise they access the space-based network. The service function chain set for accessing the air-based network is , the service function chain set for accessing the space-based network is ,in Since the deployment of VNF is and The VNF deployment schemes are consistent, so a unified overview is given below. Indicates that or .

[0056] Regarding the aforementioned step S104, an embodiment of the present invention provides an implementation method for determining a target deployment algorithm based on the importance of the virtualized network function called by each service function chain in the service function chain set, specifically including the following steps C1 to C4: Step C1: Divide the service function chain set according to the VNF called by each service function chain in the service function chain set to obtain a service function chain subset corresponding to each VNF.

[0057] In the specific implementation, according to The service function chain set of VNF in the network is combined and split into A collection of service function chains Each service function chain subset represents the set of all service function chains that call the VNF.

[0058] In step C2, statistics are collected for each service function chain subset to determine the number of calls of each VNF. The number of calls is used to describe the importance of each VNF.

[0059] In the specific implementation, respectively in the collection Calculate the number of calls for each VNF. Indicates the The number of calls to a VNF. The higher the value, the more important the VNF is.

[0060] Step C3, based on the location of each VNF in the pre-built VNF ​​set, determine the front-end VNF and the back-end VNF.

[0061] Step C4: Determine the target deployment algorithm based on the importance of the front-end VNF and the importance of the back-end VNF.

[0062] In one example, if the importance of the front-end VNF is greater than that of the back-end VNF, the front-end deployment algorithm is determined as the target deployment algorithm, otherwise the back-end deployment algorithm is determined as the target deployment algorithm.

[0063] In the specific implementation, comparison and The size of the important ones should be deployed first. , . Define each service function chain , .

[0064] In one example, the target deployment algorithm is 、 For example, assuming is more important than The importance of the front-end deployment algorithm is used to deploy it; when After the deployment is complete, the new front-end VNF (i.e. )and The importance between The importance of If the importance of The importance is still lower than If the importance of the VNF is high, the back-end deployment algorithm will be used, and so on until all VNFs are deployed.

[0065] With respect to the aforementioned step S106, an embodiment of the present invention provides an implementation method for deploying virtualized network functions according to a target deployment algorithm with the goal of minimizing end-to-end latency, so as to determine a target network node for deploying the virtualized network functions in a target deployment network. For details, see the following steps D1 to D4: Step D1, determine the deployment order of VNFs based on the target deployment algorithm, and deploy the VNFs according to the deployment sequence method.

[0066] In one example, if the front-end deployment algorithm is adopted, the deployment starts from the front-end VNF until the back-end VNF deployment is completed; if the back-end deployment algorithm is adopted, the deployment starts from the back-end VNF until the front-end VNF deployment is completed.

[0067] In step D2, during the deployment of the current VNF, the current VNF ​​is pre-deployed in a network node of the target deployment network. With the goal of minimizing end-to-end latency, candidate network nodes corresponding to the current VNF ​​are determined from the pre-deployed network nodes based on the service function chain subset corresponding to the current VNF. For specific implementation, refer to the following cases 1 and 2: Case 1: If the current VNF ​​is the first deployed VNF, determine the link delay between the source network node or destination network node corresponding to each service function chain in the service function chain subset corresponding to the current VNF ​​and the network node pre-deployed by the current VNF, and use the network node corresponding to the shortest link delay as the candidate network node corresponding to the current VNF.

[0068] Specifically, if the front-end deployment algorithm is adopted, it is necessary to determine the link delay between the source network node corresponding to each service function chain in the service function chain subset corresponding to the current VNF ​​and the network node pre-deployed by the current VNF; if the back-end deployment algorithm is adopted, it is necessary to determine the link delay between the destination network node corresponding to each service function chain in the service function chain subset corresponding to the current VNF ​​and the network node pre-deployed by the current VNF.

[0069] The embodiment of the present invention takes the front-end deployment algorithm and the back-end deployment algorithm as examples to explain the first scenario: Front-end deployment algorithm: If , then deploy , need to Calculate all source network nodes to The link delay of the pre-deployed network nodes is calculated, and among all the pre-deployed network nodes, the network node with the shortest delay is selected for The deployment of All source network nodes in the network to any network node in the network The delay can be expressed as: ; The shortest deployment delay among all networks can be expressed as: ,or Once the shortest delay is determined, The deployment location is to be determined middle The deployment location, that is, to determine Corresponding candidate network nodes.

[0070] Backend deployment algorithm: If , then deploy , need to Calculate all destination network nodes to The link delay of all pre-deployed network nodes is selected to The deployment of All destination network nodes in the network to any network node in the network The delay can be expressed as: ; The shortest deployment delay among all networks can be expressed as: ,or Once the shortest delay is determined, The deployment location is to be determined middle The deployment location, that is, to determine Corresponding candidate network nodes.

[0071] Case 2: If the current VNF ​​is not the first deployed VNF, determine the link delay between the target network node corresponding to the previous VNF or the target network node corresponding to the next VNF ​​and the network node pre-deployed by the current VNF, and use the network node corresponding to the shortest link delay as the candidate network node corresponding to the current VNF.

[0072] Specifically, if the front-end deployment algorithm is adopted, it is necessary to determine the link delay between the target network node corresponding to the previous VNF and the network node where the current VNF ​​is pre-deployed; if the back-end deployment algorithm is adopted, it is necessary to determine the link delay between the target network node corresponding to the next VNF ​​and the network node where the current VNF ​​is pre-deployed.

[0073] The embodiment of the present invention takes the front-end deployment algorithm and the back-end deployment algorithm as examples to explain the second scenario: Front-end deployment method: If , then calculate the link delay between VNFs ,in or .at this time All before Deployment is complete. or Once the shortest delay is determined, The deployment location of express middle The deployed network nodes and middle The shortest distance between network nodes where the previous VNF is deployed. express The VNF, that is, the first VNF ​​in the VNF set The network nodes where the VNFs are deployed are , express The The network nodes for VNF deployment are . Use Dijkstra algorithm to calculate network nodes The shortest distance between them, the link propagation delay can be expressed as , to be determined The deployment location, that is, to determine Corresponding candidate network nodes.

[0074] Backend deployment method: If , calculate the link delay between VNFs , using Dijkstra algorithm to calculate network nodes The shortest distance between them, the link propagation delay can be expressed as , to be determined The deployment location, that is, to determine Corresponding candidate network nodes.

[0075] Step D3: Determine whether the candidate network node meets the preset node and link constraints.

[0076] In a specific implementation, it can be determined whether the total resources occupied by all VNFs deployed on the candidate network node are less than the CPU resources corresponding to the candidate network node, and whether the total traffic of the service function chain flowing through the candidate network node is less than the link bandwidth. If so, it is determined that the preset node and link constraints are met. For details, please refer to the explanation of the node and link constraints in the previous embodiment, and this embodiment of the present invention will not be repeated here.

[0077] Step D4, if not, remove the candidate network node from the target deployment network, and re-determine the candidate network node corresponding to the current VNF ​​until the new candidate network node meets the node and link constraints, use the candidate network node as the target network node corresponding to the current VNF, and deploy the current VNF ​​to the target network node.

[0078] Continuing with the front-end deployment algorithm as an example, if If the node resources and link resources of the corresponding candidate network nodes meet the constraints, then The deployment location (that is, determine the corresponding target network node), determine The access scheme of the source network node is selected. Otherwise, the candidate network node is removed from the network. Repeat step D2 until The deployment location and user access solution.

[0079] Continuing with the backend deployment algorithm as an example, if If the node resources and link resources of the corresponding candidate network nodes meet the constraints, then The deployment location (that is, determine the corresponding target network node), determine Otherwise, remove the candidate network node from the network. Repeat step D2 until Deployment location and The access scheme of the destination network node.

[0080] In summary, steps S102 to S106, the embodiment of the present invention provides the following Figure 4 The flowchart of an SFC two-end deployment algorithm for joint user access shown includes the following steps S402 to S444: Step S402: Network initialization, given service function chain combination , VNF collection .

[0081] Step S404: Determine whether to access the empty network or the space-based network service chain, and split it into and . And will and Split into Each service function chain subset represents the set of all service function chains that call the VNF.

[0082] Step S406, calculate / The number of times each VNF is called .

[0083] Step S408: Determine the importance of the VNFs at both ends ; If yes, execute step S410; if no, execute step S426.

[0084] Step S410, determine ; If yes, execute step S412; if no, execute step S418.

[0085] Step S412, calculate , select distance Deploy the network node with the shortest internal network node .

[0086] Step S414: Determine whether the node resources and link resources meet the conditions. If yes, execute step S424; if not, execute step S416.

[0087] Step S416: remove the network node from the network.

[0088] Step S418, calculate , select distance middle Deploy the network node with the shortest distance to the previous VNF deployment node .

[0089] Step S420: Determine whether the node resources and link resources meet the conditions. If yes, execute step S424; if not, execute step S422.

[0090] Step S422: remove the network node from the network.

[0091] Step S424, .

[0092] Step S426, determine If yes, go to step S428; if no, go to step S434.

[0093] Step S428, calculate , select distance Deploy the network node with the shortest distance to the destination network node .

[0094] Step S430: Determine whether the node resources and link resources meet the conditions. If not, proceed to step S432. If yes, proceed to step S440.

[0095] Step S432: remove the network node from the network.

[0096] Step S434, calculate , select distance Inside The next VNF ​​deployment node is deployed on the shortest distance network node .

[0097] Step S436: Determine whether the node resources and link resources meet the conditions. If not, proceed to step S438. If yes, proceed to step S440.

[0098] Step S438: remove the network node from the network.

[0099] Step S440, .

[0100] Step S442, determine If yes, go to step S408; if no, go to step S444.

[0101] Step S444: Obtain all user access solutions and VNF deployment solutions.

[0102] (IV) Based on the workload of different VNFs carrying SFCs, allocate VNF CPU resources at the network nodes where the VNFs are deployed to reduce end-to-end latency. This part corresponds to the aforementioned step S108. For details, see Figure 5 The resource allocation flow chart shown includes the following steps E1 to E4: In step E1, the sum of the data transmission amounts corresponding to each service function chain that calls the virtualized network function is used as the task amount of the virtualized network function carrying the service function chain.

[0103] In the specific implementation, the amount of data flowing through the service function chain of each VNF is summed up. ,in Indicates flow through the amount of tasks.

[0104] In step E2, if multiple virtualized network functions are deployed on the target network node where the virtualized network function is deployed, the sum of the task amounts of the service function chains carried by each virtualized network function deployed on the target network node is used as the total task amount corresponding to the target network node.

[0105] In specific implementation, if multiple VNFs are deployed on the same network node, the data traffic (that is, the total task volume) of the network node can be expressed as .

[0106] Step E3: determining the amount of resources allocated to the virtualized network function by the target network node where the virtualized network function is deployed based on the ratio between the task amount and the total task amount.

[0107] In the specific implementation, the CPU of the network node allocates resources to The flow ratio is distributed, that is, .

[0108] In step E4, the CPU resources of all nodes are allocated.

[0109] In summary, the service function chain deployment method for joint user access provided by the embodiment of the present invention has at least the following features: (1) Existing SAGIN service chain deployment methods are mostly based on terrestrial networks, expanding space-based and airborne network nodes and links. Research focuses on SFC deployment and resource allocation, but ignores user access and fails to consider the impact of access network nodes on end-to-end latency. Therefore, the present invention addresses these issues by constructing a mathematical model for the joint optimization of user access, SFC deployment, and node resource allocation.

[0110] (2) Traditional user access methods and SFC deployment solutions cannot solve this problem. Therefore, the present invention proposes a two-end deployment method that combines user access, SFC deployment, and node resource allocation. Based on different service chain source nodes and destination nodes, the shortest distance from different nodes to the VNF is determined. Based on the shortest end-to-end delay, the user access network node and VNF deployment solution are selected. Based on the service chain's traffic volume, the node's CPU resources are allocated to minimize the end-to-end delay.

[0111] Based on the above embodiment, the embodiment of the present invention provides a service function chain deployment device for joint user access, see Figure 6 The structure diagram of a service function chain deployment device for joint user access is shown, and the device mainly includes the following parts: A network determination module 602 is configured to determine a target deployment network based on a pre-built air-ground-integrated network model that combines user access and service function chain deployment. The air-ground-integrated network model includes an air-based network, a space-based network, and a ground network. The air-based network, the space-based network, and the ground network are all configured with network nodes. The user's associated terminal accesses the target deployment network from the ground network based on the service function chain set. The target deployment network is either an air-based network or a space-based network. An algorithm determination module 604 is configured to determine a target deployment algorithm based on the importance of the virtualized network function called by each service function chain in the service function chain set; wherein the target deployment algorithm is a front-end deployment algorithm or a back-end deployment algorithm; A deployment module 606 is configured to deploy the virtualized network function according to a target deployment algorithm with the goal of minimizing end-to-end delay, so as to determine a target network node for deploying the virtualized network function in a target deployment network; The resource allocation module 608 is used to determine the amount of resources allocated to the target network node where the virtualized network function is deployed based on the task amount of the service function chain carried by different virtualized network functions, and complete the deployment of the service function chain set.

[0112] The service function chain deployment device for joint user access provided in an embodiment of the present invention introduces user access conditions, dynamically adjusts the network to be accessed and the algorithm used for deployment, and deploys virtualized network functions on this basis, as well as allocates resources to the virtualized network functions, thereby achieving optimal utilization of network resources and minimization of end-to-end delay.

[0113] In one embodiment, the network determination module 602 is specifically configured to: Based on a pre-built air-ground integrated network model that combines user access and service function chain deployment, determine whether the user's associated terminal is covered by the air-based network, and whether the source network node and destination network node corresponding to the service function chain in the service function chain set are covered by the air-based network; If yes, the space-based network is determined as the target deployment network; If not, the space-based network is determined as the target deployment network.

[0114] In one embodiment, the algorithm determination module 604 is specifically configured to: Divide the service function chain set according to the virtualized network function called by each service function chain in the service function chain set to obtain a service function chain sub-set corresponding to each virtualized network function; Statistics are collected for each service function chain subset to determine the number of calls to each virtualized network function. The number of calls is used to describe the importance of each virtualized network function. Determine the front-end virtualized network function and the back-end virtualized network function based on the location of each virtualized network function in the pre-built virtualized network function set; A target deployment algorithm is determined based on the importance of the front-end virtualized network functions and the importance of the back-end virtualized network functions.

[0115] In one embodiment, the deployment module 606 is specifically configured to: Determine a deployment order for the virtualized network functions based on a target deployment algorithm, so as to deploy the virtualized network functions according to a deployment sequence method; During the deployment of the current virtualized network function, the current virtualized network function is pre-deployed in a network node of the target deployment network, and with the goal of minimizing end-to-end latency, candidate network nodes corresponding to the current virtualized network function are determined from the pre-deployed network nodes based on a set of service function chains corresponding to the current virtualized network function; Determine whether the candidate network nodes meet the preset node and link constraints; If not, the candidate network node will be removed from the target deployment network, and the candidate network node corresponding to the current virtualized network function will be re-determined until the new candidate network node meets the node and link constraints. The candidate network node will be used as the target network node corresponding to the current virtualized network function, and the current virtualized network function will be deployed to the target network node.

[0116] In one embodiment, the deployment module 606 is specifically configured to: If the current virtualized network function is the first deployed virtualized network function, determine the link delay between the source network node or destination network node corresponding to each service function chain in the service function chain subset corresponding to the current virtualized network function and the network node pre-deployed with the current virtualized network function, and select the network node corresponding to the shortest link delay as the candidate network node corresponding to the current virtualized network function; If the current virtualized network function is not the first deployed virtualized network function, determine the link delay between the target network node corresponding to the previous virtualized network function or the target network node corresponding to the next virtualized network function and the network node pre-deployed by the current virtualized network function, and use the network node corresponding to the shortest link delay as the candidate network node corresponding to the current virtualized network function.

[0117] In one embodiment, the deployment module 606 is specifically configured to: Determine whether the total resources occupied by all virtualized network functions deployed on the candidate network node are less than the CPU resources corresponding to the candidate network node, and whether the total traffic flowing through the service function chain of the candidate network node is less than the link bandwidth; If so, it is determined that the preset node and link constraints are met.

[0118] In one embodiment, the resource allocation module 608 is specifically configured to: The sum of the data transmission volumes corresponding to each service function chain that calls the virtualized network function is used as the task volume of the virtualized network function carrying the service function chain; If the target network node where the virtualized network function is deployed has multiple virtualized network functions deployed on it, the sum of the task amounts of the service function chains carried by each virtualized network function deployed on the target network node is used as the total task amount corresponding to the target network node; Based on the ratio between the task amount and the total task amount, the amount of resources allocated to the virtualized network function by the target network node where the virtualized network function is deployed is determined.

[0119] The device provided in the embodiment of the present invention has the same implementation principle and technical effects as those in the aforementioned method embodiment. For the sake of brief description, for matters not mentioned in the device embodiment, reference can be made to the corresponding content in the aforementioned method embodiment.

[0120] An embodiment of the present invention provides an electronic device. Specifically, the electronic device includes a processor and a storage device. The storage device stores a computer program, and when the computer program is executed by the processor, it executes the method described in any one of the above-mentioned embodiments.

[0121] Figure 7 A structural diagram of an electronic device provided in an embodiment of the present invention, the electronic device 100 includes: a processor 70, a memory 71, a bus 72 and a communication interface 73, wherein the processor 70, the communication interface 73 and the memory 71 are connected via the bus 72; the processor 70 is used to execute an executable module stored in the memory 71, such as a computer program.

[0122] Memory 71 may include high-speed random access memory (RAM) and may also include non-volatile memory, such as at least one disk storage. Communication between the system network element and at least one other network element is achieved through at least one communication interface 73 (which may be wired or wireless), and may utilize the Internet, a wide area network, a local area network, a metropolitan area network, or the like.

[0123] The bus 72 may be an ISA bus, a PCI bus, or an EISA bus. The bus may be divided into an address bus, a data bus, a control bus, and the like. For ease of representation, Figure 7 Only one bidirectional arrow is used in the diagram, but this does not mean that there is only one bus or one type of bus.

[0124] Among them, the memory 71 is used to store programs, and the processor 70 executes the program after receiving the execution instruction. The method executed by the device for flow process definition disclosed in any embodiment of the above-mentioned embodiment of the present invention can be applied to the processor 70 or implemented by the processor 70.

[0125] The processor 70 may be an integrated circuit chip with signal processing capabilities. During implementation, the steps of the above-described method may be performed by hardware integrated logic circuits or software instructions within the processor 70. The processor 70 may be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it may also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. It may implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of the present invention. The general-purpose processor may be a microprocessor or any conventional processor. The steps of the methods disclosed in conjunction with the embodiments of the present invention may be directly implemented and executed by a hardware decoding processor, or by a combination of hardware and software modules within the decoding processor. The software modules may be located in storage media well-known in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or the like. The storage medium is located in the memory 71 , and the processor 70 reads the information in the memory 71 and completes the steps of the above method in combination with its hardware.

[0126] The computer program product of the readable storage medium provided in the embodiment of the present invention includes a computer-readable storage medium storing program code. The instructions included in the program code can be used to execute the method described in the previous method embodiment. The specific implementation can be referred to the previous method embodiment and will not be repeated here.

[0127] If the functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the portion that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions for causing a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in various embodiments of the present invention. The aforementioned storage media include various media capable of storing program code, such as USB flash drives, mobile hard drives, read-only memories (ROMs), random access memories (RAMs), magnetic disks, or optical disks.

[0128] Finally, it should be noted that the above-described embodiments are only specific implementation methods of the present invention, which are used to illustrate the technical solutions of the present invention, rather than to limit them. The scope of protection of the present invention is not limited thereto. Although the present invention has been described in detail with reference to the above-described embodiments, those skilled in the art should understand that any person skilled in the art can modify or easily conceive of changes to the technical solutions described in the above-described embodiments within the technical scope disclosed by the present invention, or replace some of the technical features therein with equivalents. Such modifications, changes, or replacements do not deviate from the spirit and scope of the technical solutions of the embodiments of the present invention, and should be included in the scope of protection of the present invention. Therefore, the scope of protection of the present invention shall be subject to the scope of protection of the claims.

Claims

1. A method for deploying a service function chain for joint user access, characterized in that: include: Determining a target deployment network based on a pre-built air-space-ground integrated network model that combines user access with service function chain deployment; wherein the air-space-ground integrated network model includes an air-based network, a space-based network, and a ground network; the air-based network, the space-based network, and the ground network are all configured with network nodes; a user's associated terminal accesses the target deployment network from the ground network based on a service function chain set; the target deployment network is an air-based network or a space-based network; Determining a target deployment algorithm based on the importance of the virtualized network function called by each service function chain in the service function chain set; wherein the target deployment algorithm is a front-end deployment algorithm or a back-end deployment algorithm; With the goal of minimizing end-to-end delay, deploying the virtualized network function according to the target deployment algorithm to determine a target network node for deploying the virtualized network function in the target deployment network; Based on the task amount of the service function chain carried by different virtualized network functions, the target network node where the virtualized network function is deployed is determined to allocate resources to the virtualized network function, and the deployment of the service function chain set is completed.

2. The method for deploying a service function chain for joint user access according to claim 1, characterized in that: Determine the target deployment network based on a pre-built integrated air-ground network model deployed with joint user access and service function chains, including: Based on a pre-built air-ground integrated network model that combines user access with service function chain deployment, determine whether the user's associated terminal is covered by the air-based network, and whether the source network node and destination network node corresponding to the service function chain in the service function chain set are covered by the air-based network; If yes, the space-based network is determined as the target deployment network; If not, the space-based network is determined as the target deployment network.

3. The method for deploying a service function chain for joint user access according to claim 1, characterized in that: Determining a target deployment algorithm based on the importance of the virtualized network function called by each service function chain in the service function chain set includes: Dividing the service function chain set according to the virtualized network function called by each service function chain in the service function chain set to obtain a service function chain subset corresponding to each virtualized network function; Performing statistics on each of the service function chain subsets to determine a call count of each of the virtualized network functions, where the call count is used to describe an importance of each of the virtualized network functions; Determining a front-end virtualized network function and a back-end virtualized network function based on a location of each virtualized network function in a pre-built virtualized network function set; A target deployment algorithm is determined based on the importance of the front-end virtualized network function and the importance of the back-end virtualized network function.

4. The method for deploying a service function chain for joint user access according to claim 3, characterized in that: With minimizing end-to-end delay as a goal, deploying the virtualized network function according to the target deployment algorithm to determine a target network node for deploying the virtualized network function in the target deployment network includes: Determining a deployment order of the virtualized network functions based on the target deployment algorithm, so as to deploy the virtualized network functions according to the deployment sequence method; In the process of deploying the current virtualized network function, pre-deploy the current virtualized network function in the network node of the target deployment network, and determine, based on the subset of service function chains corresponding to the current virtualized network function, a candidate network node corresponding to the current virtualized network function from the pre-deployed network nodes with the goal of minimizing end-to-end delay; Determining whether the candidate network node meets preset node and link constraints; If not, the candidate network node is removed from the target deployment network, and the candidate network node corresponding to the current virtualized network function is re-determined until the new candidate network node meets the node and link constraints, the candidate network node is used as the target network node corresponding to the current virtualized network function, and the current virtualized network function is deployed to the target network node.

5. The method for deploying a service function chain for joint user access according to claim 4, characterized in that: With the goal of minimizing end-to-end delay, determining, based on the subset of service function chains corresponding to the current virtualized network function, a candidate network node corresponding to the current virtualized network function from the pre-deployed network nodes, comprising: If the current virtualized network function is the first deployed virtualized network function, determining the link delay between the source network node or the destination network node corresponding to each service function chain in the subset of service function chains corresponding to the current virtualized network function and the network node where the current virtualized network function is pre-deployed, and selecting the network node corresponding to the shortest link delay as the candidate network node corresponding to the current virtualized network function; If the current virtualized network function is not the first deployed virtualized network function, determine the link delay between the target network node corresponding to the previous virtualized network function or the target network node corresponding to the next virtualized network function and the network node pre-deployed by the current virtualized network function, and use the network node corresponding to the shortest link delay as the candidate network node corresponding to the current virtualized network function.

6. The method for deploying a service function chain for joint user access according to claim 4, characterized in that: Determining whether the candidate network node meets preset node and link constraints includes: Determine whether the total occupied resources of all the virtualized network functions deployed on the candidate network node are less than the CPU resources corresponding to the candidate network node, and whether the total traffic of the service function chain flowing through the candidate network node is less than the link bandwidth; If so, it is determined that the preset node and link constraints are met.

7. The method for deploying a service function chain for joint user access according to claim 1, characterized in that: Determining, based on the task amounts of different virtualized network functions carrying the service function chains, the amount of resources allocated to the virtualized network functions by the target network node where the virtualized network functions are deployed, includes: The sum of the data transmission amounts corresponding to each service function chain that calls the virtualized network function is used as the task amount of the virtualized network function carrying the service function chain; If the target network node where the virtualized network function is deployed has multiple virtualized network functions deployed on it, the sum of the task amounts of the service function chain carried by each of the virtualized network functions deployed on the target network node is used as the total task amount corresponding to the target network node; Based on the ratio between the task amount and the total task amount, determine the amount of resources allocated to the virtualized network function by the target network node where the virtualized network function is deployed.

8. A service function chain deployment device for joint user access, characterized in that: include: a network determination module, configured to determine a target deployment network based on a pre-built air-space-ground integrated network model deployed with joint user access and service function chains; wherein the air-space-ground integrated network model includes an air-based network, a space-based network, and a ground network; the air-based network, the space-based network, and the ground network are all configured with network nodes; the user's associated terminal accesses the target deployment network from the ground network based on a service function chain set; the target deployment network is an air-based network or a space-based network; an algorithm determination module, configured to determine a target deployment algorithm based on the importance of the virtualized network function called by each service function chain in the service function chain set; wherein the target deployment algorithm is a front-end deployment algorithm or a back-end deployment algorithm; a deployment module, configured to deploy the virtualized network function according to the target deployment algorithm with the goal of minimizing end-to-end delay, so as to determine a target network node for deploying the virtualized network function in the target deployment network; The resource allocation module is used to determine the amount of resources allocated to the virtualized network function by the target network node where the virtualized network function is deployed based on the amount of tasks carried by different virtualized network functions to carry the service function chain, and complete the deployment of the service function chain set.

9. An electronic device, characterized in that: The method comprises a processor and a memory, wherein the memory stores computer-executable instructions that can be executed by the processor, and the processor executes the computer-executable instructions to implement the method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that The computer-readable storage medium stores computer-executable instructions. When the computer-executable instructions are called and executed by a processor, the computer-executable instructions prompt the processor to implement the method according to any one of claims 1 to 7.

Images