Dynamic distribution device and method for network slice resources

Abstract

The invention relates to the technical field of transmission resource allocation, in particular to a dynamic allocation device and method for network slice resources, and the method comprises the steps: collecting the data of the network slice resources, carrying out the preprocessing of the data, and calculating the transmission blocking degree of a virtual logic network through the transmission rate and the transmission queue length of the network slice resources; calculating the congestion increase of the network slice resources by using the transmission queue length of the network slice resources; and according to the transmission obstruction degree of the virtual logic network and the congestion increase performance of all network slice resources in the virtual logic network, the transmission load supplement amount of the virtual logic network is calculated, the reserved resource amount is allocated, and the additional resource allocation amount of each virtual logic network is obtained. The invention aims to improve the accuracy of network slice resource allocation and ensure that the resource allocation better meets service requirements.

Description

Technical Field

[0001] This application relates to the field of transmission resource allocation technology, specifically to a device and method for dynamic allocation of network slice resources. Background Technology

[0002] Network slicing is a technique that divides a physical network into multiple virtual logical networks based on Software Defined Networking (SDN) and Network Function Virtualization (NFV) technologies. Each virtual logical network is called a "slice," and it can independently meet the needs of different users or services. The various virtual logical networks after network slicing are relatively independent, employing different transmission protocols and methods to meet the transmission requirements of different services. For example, for services with high bandwidth requirements, more spectrum resources can be allocated; for low-latency services, network paths can be optimized to reduce data transmission latency. However, the number of transmission nodes in a virtual logical network determines its performance; more nodes result in higher performance. Therefore, it is necessary to allocate network slice resources rationally to ensure that each service can operate efficiently.

[0003] Traditional technologies typically allocate network slice resources based on the proportion of each slice's throughput to the total network throughput. However, the physical structures of nodes within a network slice are not necessarily the same, resulting in varying load capacities for the same information transmission process. Traditional technologies fail to adequately consider the transmission load capacity of transmission nodes, leading to low efficiency in traditional allocation methods and impacting the transmission of various service information. Summary of the Invention

[0004] In view of the above, it is necessary to provide a device and method for dynamic allocation of network slice resources to solve the above problems.

[0005] The first aspect of this application provides a method for dynamic allocation of network slice resources, the method comprising: When allocating network slice resources for the virtual logical network for the first time, reserve the amount of resources; obtain the byte transmission rate, transmission queue length and excess bandwidth of each network slice resource at each time point; Based on the distribution characteristics of byte transmission rate and transmission queue length of each network slice resource at all times within a preset time period, the transmission efficiency and latency of each network slice resource are determined, and their normalized values ​​are used to form a two-dimensional array for each network slice resource. Based on the position characteristics of the two-dimensional array of all network slice resources in each virtual logical network in the coordinate system, the number of congested items in each virtual logical network is determined. The proportion of congested items in each virtual network is analyzed, and combined with the overall distribution of the transmission efficiency, the transmission impedance of each virtual logical network is determined. The numerical characteristics of excess bandwidth of each network slice resource at all times within a preset time period are analyzed, and the transmission queue length at all times is filtered to form a congestion length sequence for each network slice resource. The congestion length sequence of each network slice resource is fitted with a straight line, and the congestion increase of each network slice resource is obtained by combining the changing trend of the element values ​​in the congestion length sequence. Based on the overall distribution of congestion increase of all network slice resources in each virtual logical network, and combined with the transmission impedance, the transmission load replenishment amount of each virtual logical network is obtained. Based on the numerical characteristics of the transmission load supplement of each virtual logical network, the reserved resources are allocated to obtain the additional resource allocation for each virtual logical network.

[0006] The transmission efficiency of each network slice resource is specifically the average byte transmission rate of each network slice resource at all times within a preset time period.

[0007] The delay threshold is specifically the average transmission queue length of each network slice resource at all times within a preset time period.

[0008] The specific process for determining the number of congestions in each virtual logical network is as follows: Map the two-dimensional arrays of all network slice resources in each virtual logical network to a coordinate system, and count the number of two-dimensional arrays above the y=x line in the coordinate system to obtain the number of congestions.

[0009] Specifically, determining the transmission impedance of each virtual logical network involves: The proportion of congestion in each logical virtual network is calculated and positively fused with the negative correlation between the proportion and the mean of the transmission efficiency of all network slice resources in each virtual logical network to obtain the transmission obstruction degree of each virtual logical network.

[0010] Specifically, the congestion length sequence that constitutes each network slice resource is as follows: The moment when the excess bandwidth of each network slice resource is equal to 0 within a preset time period is taken as the congestion moment; the transmission queue length of each network slice resource at each congestion moment within the preset time period is used to form the congestion length sequence of each network slice resource.

[0011] Specifically, obtaining the congestion increase of each network slice resource is as follows: Obtain the minimum element of each network slice resource in the congestion length sequence, calculate the mean difference between all elements in the congestion length sequence and the minimum element, and positively fuse it with the normalized result of the slope of the fitted line of the congestion length sequence to obtain the congestion increase of each network slice resource.

[0012] Specifically, obtaining the transmission load supplement for each virtual logical network is as follows: Calculate the cumulative sum of the congestion increase of all network slice resources in each virtual logical network, and positively fuse it with the transmission impediment of each virtual logical network to obtain the transmission load supplement of each virtual logical network.

[0013] The additional resource allocation for each virtual logical network is specifically the product of the proportion of the transmission load supplement of each virtual logical network to the transmission load supplement of all virtual logical networks and the reserved resource amount.

[0014] Secondly, embodiments of this application also provide a network slice resource dynamic allocation device, including a memory, a processor, and a computer program stored in the memory and running on the processor, wherein the processor executes the computer program to implement the steps of any of the methods described above.

[0015] This application has at least the following beneficial effects: This application accurately assesses the actual load capacity of a virtual logical network by collecting detailed data on network slice resources and combining this with calculations of transmission obstruction and congestion amplification. Compared to traditional technologies, it avoids the problem of uneven allocation caused by neglecting node load capacity, significantly improves the accuracy of resource allocation, and ensures that resource allocation is more aligned with business needs.

[0016] Based on precise resource allocation, this application can dynamically adjust the network slice resource allocation strategy: by calculating transmission obstruction and congestion escalation, network bottlenecks can be identified in a timely manner and resources can be allocated to alleviate congestion. This effectively reduces network congestion and transmission latency, significantly improves the overall network transmission efficiency, and ensures the efficient operation of high-bandwidth and low-latency services.

[0017] This application not only considers the current load but also predicts future load changes through congestion increments. By dynamically allocating reserved resources, it can respond promptly to fluctuations in business demand, ensuring that the network continues to operate efficiently during sudden traffic surges or business growth. This greatly enhances network stability and scalability, providing reliable support for complex network environments and business growth. Attached Figure Description

[0018] Figure 1 A flowchart illustrating the steps of a method for dynamically allocating network slice resources according to an embodiment of this application; Figure 2 A flowchart illustrating the process of obtaining additional resource allocations as provided in one embodiment of this application. Detailed Implementation

[0019] In the description of the embodiments in this application, the words "exemplary," "or," and "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design scheme described as "exemplary" or "for example" in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or design schemes. Specifically, the use of the words "exemplary," "or," and "for example" is intended to present the relevant concepts in a specific manner.

[0020] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used in this application's specification is for the purpose of describing particular embodiments only and is not intended to be limiting of the application.

[0021] It should also be noted that the terms "first" and "second" in this application and its accompanying drawings are used to distinguish similar objects, rather than to describe a specific order or sequence. The methods disclosed in the embodiments of this application or the methods shown in the flowcharts include one or more steps for implementing the method. Without departing from the scope of protection of this application, the execution order of multiple steps can be interchanged, and some steps can also be deleted.

[0022] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application pertains.

[0023] The following description, in conjunction with the accompanying drawings, details the specific scheme of the network slice resource dynamic allocation device and method provided in this application.

[0024] Please see Figure 1 The diagram illustrates a flowchart of a method for dynamically allocating network slice resources according to an embodiment of this application. The method includes the following steps: The first step is to reserve resources when allocating network slice resources for the virtual logical network for the first time; and to obtain the byte transmission rate, transmission queue length, and excess bandwidth of each network slice resource at each time point.

[0025] When allocating network slice resources to the virtual logical network for the first time, a reserved resource amount is set. The proportion of the reserved resource amount to the total resource amount is generally set to 1% to 30% by default, and is set to 20% in this embodiment. The remaining network slice resources are evenly divided and then allocated to various services. In this embodiment, the service type is set to 3, but the value of the service type can be determined by the implementers.

[0026] The protocol analyzer collects transmission information for each network slice resource in each virtual logical network. This transmission information includes the byte transfer rate per second, queue length per second, and excess bandwidth per second. Each collection session in this application lasts 10 minutes, meaning dynamic allocation occurs every 10 minutes. For each type of data collected from each network slice resource, outlier data is removed using the LOF (Local Outlier Factor) algorithm. The removed data is then supplemented using linear interpolation to form the byte transfer rate sequence, transmission queue length sequence, and excess bandwidth sequence for each network slice resource. The calculation of the LOF algorithm and linear interpolation is a known technique, and the specific calculation steps are not detailed here.

[0027] The second step is as follows: Based on the distribution characteristics of byte transmission rate and transmission queue length of each network slice resource at all times within a preset time period, determine the transmission efficiency and latency barrier of each network slice resource, and form a two-dimensional array of each network slice resource by normalizing the two values; determine the number of congestions in each virtual logical network according to the position characteristics of the two-dimensional array of all network slice resources in the coordinate system; analyze the proportion of congestion in each virtual network, and determine the transmission barrier of each virtual logical network in combination with the overall distribution of the transmission efficiency.

[0028] Within the same virtual network, faster node transmission rates and shorter latency indicate better node transmission efficiency. When nodes in a virtual logical network experience a large-scale decrease in transmission rate and an increase in latency, it indicates that the number of network slice resources in the virtual logical network is insufficient to meet the business information transmission needs of the virtual logical network, impacting overall transmission efficiency. Therefore, it is necessary to increase the number of network slice resources in the virtual network to ensure efficient transmission of business information.

[0029] A higher transmission rate of business information indicates that network nodes transmit business information faster. Therefore, the average of the byte transmission rate sequence for each network slice resource is used as the transmission efficiency metric for that network slice resource, characterizing its transmission efficiency during data acquisition. Similarly, the average of the transmission queue length sequence for each network slice resource is calculated as the latency barrier metric, characterizing its latency efficiency during data acquisition. To eliminate the influence of data dimensions, the transmission efficiency and latency barrier metrics for all network slice resources within the same virtual logical network are normalized; in this embodiment, maximum value normalization is used.

[0030] When there are differences in the transmission efficiency and latency of network slice resources in a virtual network, it indicates that the network slice resources are experiencing transmission problems. The more network slice resources with poor transmission, the higher the congestion in the virtual logical network. The transmission efficiency and latency of network slice resources are represented by a two-dimensional array. Since the two-dimensional arrays of network slice resources with good transmission are distributed around (1,0), and those of network slice resources with congestion are distributed around (0,1), y=x is used as a dividing line. The number of two-dimensional arrays on both sides of the line is recorded as the number of congested arrays and the number of smooth arrays below the line.

[0031] Therefore, the transmission obstruction degree of each virtual logical network is calculated to characterize the degree of obstruction in the transmission process. Specifically, the proportion of congestion in each logical virtual network is calculated and positively fused with the negative correlation mapping result of the average transmission efficiency of all network slice resources in each virtual logical network to obtain the transmission obstruction degree of each virtual logical network.

[0032] In this embodiment, the transmission impedance of the i-th virtual logical network is denoted as... Its formula is as follows: In the formula, , Let represent the number of congested nodes and the number of unobstructed nodes in the i-th virtual logical network, respectively. This represents the percentage of congested numbers in the i-th virtual logical network. This represents the average transmission efficiency of all network slice resources in the i-th virtual logical network. This represents a preset division-by-zero adjustment factor to prevent the denominator from being 0; in this embodiment, it is set to 1.

[0033] It should be understood that a larger queue length for network slice resources indicates a greater amount of data to be transmitted, a higher probability of latency in network slice resources, and a potential decrease in data transmission rate due to congestion. This results in a larger ratio of congested network slice resources to the total number of network slice resources, and a smaller average transmission efficiency across all network slice resources in the virtual logical network, thus increasing the transmission obstruction of the virtual logical network. In this situation, the greater the load on network slice resources, the more network slice resources are needed to transmit business information and ensure smooth business operation.

[0034] The third step is to analyze the numerical characteristics of the excess bandwidth of each network slice resource at all times within a preset time period, filter the transmission queue length at all times to form a congestion length sequence for each network slice resource, perform linear fitting on the congestion length sequence for each network slice resource, and combine the changing trend of the element values ​​in the congestion length sequence to obtain the congestion increase of each network slice resource.

[0035] During data transmission within network slice resources, the transmission rate of these resources is inversely proportional to the available bandwidth. When the available bandwidth is zero, it indicates that the transmission rate of the network slice resources has reached its maximum. If the queue length of the network slice resources continues to increase at this point, it suggests that the possibility of congestion is constantly increasing, requiring more resources to be allocated to the virtual logical network for the transmission of business information.

[0036] Taking a virtual logical network as an example, the indices of all elements with a value of 0 in the excess bandwidth sequence of each network slice resource are obtained, and the corresponding times are recorded as congestion times. The elements corresponding to all congestion times in the transmission queue length sequence are then obtained. These elements are arranged chronologically to form the congestion length sequence for each network slice resource. Larger elements in the congestion length sequence indicate a higher probability of congestion in the network slice resource. Furthermore, a growing sequence of elements in the congestion length sequence indicates increasing congestion. Therefore, the congestion length sequence is used as input to the linear least squares method, and the output is the slope of the fitted line of the congestion length sequence. The calculation of the linear least squares method is a well-known technique, and the specific calculation steps will not be elaborated here.

[0037] Therefore, the congestion increase of network slice resources is calculated to characterize the congestion of network slice resources in the next stage. Specifically, the minimum element of the congestion length sequence of each network slice resource is obtained, the mean difference between all elements in the congestion length sequence and the minimum element is calculated, and the mean difference is positively fused with the normalized result of the slope of the fitted line of the congestion length sequence to obtain the congestion increase of each network slice resource.

[0038] In this embodiment, the congestion increase of each network slice resource in the virtual logical network is denoted as... Its formula is as follows: In the formula, This represents the slope of the fitted straight line representing the congestion length sequence corresponding to the j-th network slice resource in the virtual logical network; represents the mean of the differences between each element and the minimum element in the congestion length sequence corresponding to the j-th network slice resource in the virtual logical network; sig() represents the sigmoid function.

[0039] It should be noted that when there is no element in the congestion length sequence corresponding to the network slice resource, it means that the network slice resource is transmitting smoothly, and the congestion increment of the network slice resource is 0.

[0040] It should be understood that as network slice resource congestion increases, the length of pending service information accumulated in the network slice resource queue also increases. This leads to a steeper slope on the straight line fitting the congestion length sequence, and simultaneously increases the difference between each element in the congestion length sequence and the minimum element, further exacerbating the congestion of network slice resources. To alleviate network congestion, it is essential to promptly increase the allocation of network slice resources to improve the transmission efficiency of service information, ensure smooth and stable network operation, and meet the ever-growing service demands.

[0041] The fourth step: Based on the overall distribution of congestion increase of all network slice resources in each virtual logical network, and in conjunction with the transmission impedance, obtain the transmission load replenishment amount for each virtual logical network.

[0042] The load on network slice resources includes both current and future loads, i.e., current transmission impediment capacity and congestion amplification. Therefore, the stronger the impediment capacity and the greater the congestion amplification of network slice resources within the current timeframe, the more it indicates that the service information to be transmitted in the virtual logical network has exceeded the network's load capacity, failing to meet the requirements for service information transmission. Thus, the transmission load replenishment amount for the virtual logical network is calculated. Specifically, the sum of the congestion amplification of all network slice resources in each virtual logical network is calculated and positively fused with the transmission impediment of each virtual logical network to obtain the transmission load replenishment amount for each virtual logical network. In this embodiment, the positive fusion of multiple variables uses a multiplication calculation method.

[0043] It should be understood that as congestion intensifies, the transmission of service information by various network slice resources within the current virtual network faces increased obstacles, meaning the transmission impedance of the virtual logical network increases. Simultaneously, this leads to a continuous rise in the congestion of network slice resources, resulting in a significant increase in the sum of congestion increases across all network slice resources in the virtual logical network. In this situation, more network slice resources will be needed in the next step to transmit service information, alleviating congestion pressure, improving transmission efficiency, ensuring smooth network operation, and meeting increasing business demands.

[0044] The fifth step: Based on the numerical characteristics of the transmission load supplement of each virtual logical network, allocate the reserved resources to obtain the additional resource allocation for each virtual logical network.

[0045] The percentage of the transmission load supplement of each virtual logical network (VLogic Network) to the total transmission load supplement of all VLogic Networks is multiplied by the reserved resource amount to obtain the additional resource allocation for each VLogic Network. A network slice allocator is then used to allocate the reserved resource amount based on the additional resource allocation of the VLogic Network, connecting the reserved resource amount to the VLogic Network and ensuring that the VLogic Network can utilize the reserved resource amount to transmit business logic information.

[0046] The flowchart for obtaining additional resource allocation is as follows: Figure 2 As shown.

[0047] Based on the same inventive concept as the above methods, this application also provides a network slice resource dynamic allocation device, including a memory, a processor, and a computer program stored in the memory and running on the processor, wherein the processor executes the computer program to implement the steps of any of the above methods.

[0048] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to embodiments of this application. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. In some alternative implementations, the functions marked in the blocks may occur in a different order than that shown in the drawings. For example, two consecutive blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. In the descriptions corresponding to the flowcharts and block diagrams in the accompanying drawings, the operations or steps corresponding to different blocks may also occur in a different order than disclosed in the description; sometimes there is no specific order between different operations or steps. For example, two consecutive operations or steps may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. Each block in a block diagram and / or flowchart, and combinations of blocks in a block diagram and / or flowchart, can be implemented using a dedicated hardware-based system that performs the specified function or action, or using a combination of dedicated hardware and computer instructions.

[0049] It will be apparent to those skilled in the art that this application is not limited to the details of the exemplary embodiments described above, and that this application can be implemented in other specific forms without departing from its essential characteristics. Therefore, the embodiments described above should be considered exemplary and non-limiting in all respects; modifications to the technical solutions described in the foregoing embodiments, or equivalent substitutions of some technical features, without causing the essence of the corresponding technical solutions to deviate from the scope of the technical solutions in the embodiments of this application, should all be included within the protection scope of this application.

Claims

1. A method for dynamic allocation of network slice resources, characterized in that, The method includes the following steps: When allocating network slice resources for the virtual logical network for the first time, reserve the amount of resources; obtain the byte transmission rate, transmission queue length and excess bandwidth of each network slice resource at each time point; Based on the distribution characteristics of byte transmission rate and transmission queue length of each network slice resource at all times within a preset time period, the transmission efficiency and latency of each network slice resource are determined, and their normalized values ​​are used to form a two-dimensional array for each network slice resource. Based on the position characteristics of the two-dimensional array of all network slice resources in each virtual logical network in the coordinate system, the number of congested items in each virtual logical network is determined. The proportion of congested items in each virtual network is analyzed, and combined with the overall distribution of the transmission efficiency, the transmission impedance of each virtual logical network is determined. The numerical characteristics of excess bandwidth of each network slice resource at all times within a preset time period are analyzed, and the transmission queue length at all times is filtered to form a congestion length sequence for each network slice resource. The congestion length sequence of each network slice resource is fitted with a straight line, and the congestion increase of each network slice resource is obtained by combining the changing trend of the element values ​​in the congestion length sequence. Based on the overall distribution of congestion increase of all network slice resources in each virtual logical network, and combined with the transmission impedance, the transmission load replenishment amount of each virtual logical network is obtained. Based on the numerical characteristics of the transmission load supplement of each virtual logical network, the reserved resources are allocated to obtain the additional resource allocation for each virtual logical network.

2. The method for dynamic allocation of network slice resources as described in claim 1, characterized in that, The transmission efficiency of each network slice resource is specifically the average byte transmission rate of each network slice resource at all times within a preset time period.

3. The method for dynamic allocation of network slice resources as described in claim 1, characterized in that, The delay threshold is specifically the average transmission queue length of each network slice resource at all times within a preset time period.

4. The method for dynamic allocation of network slice resources as described in claim 1, characterized in that, The specific process for determining the number of congestions in each virtual logical network is as follows: Map the two-dimensional arrays of all network slice resources in each virtual logical network to a coordinate system, and count the number of two-dimensional arrays above the y=x line in the coordinate system to obtain the number of congestions.

5. The method for dynamic allocation of network slice resources as described in claim 1, characterized in that, The determination of the transmission impedance of each virtual logical network is specifically as follows: The proportion of congestion in each logical virtual network is calculated and positively fused with the negative correlation between the proportion and the mean of the transmission efficiency of all network slice resources in each virtual logical network to obtain the transmission obstruction degree of each virtual logical network.

6. The method for dynamic allocation of network slice resources as described in claim 1, characterized in that, The congestion length sequence that makes up each network slice resource is specifically as follows: The moment when the excess bandwidth of each network slice resource is equal to 0 within a preset time period is taken as the congestion moment; the transmission queue length of each network slice resource at each congestion moment within the preset time period is used to form the congestion length sequence of each network slice resource.

7. The method for dynamic allocation of network slice resources as described in claim 1, characterized in that, The congestion increase of each network slice resource is obtained as follows: Obtain the minimum element of each network slice resource in the congestion length sequence, calculate the mean difference between all elements in the congestion length sequence and the minimum element, and positively fuse it with the normalized result of the slope of the fitted line of the congestion length sequence to obtain the congestion increase of each network slice resource.

8. The method for dynamic allocation of network slice resources as described in claim 1, characterized in that, The specific method for obtaining the transmission load supplement for each virtual logical network is as follows: Calculate the cumulative sum of the congestion increase of all network slice resources in each virtual logical network, and positively fuse it with the transmission impediment of each virtual logical network to obtain the transmission load supplement of each virtual logical network.

9. The method for dynamic allocation of network slice resources as described in claim 1, characterized in that, The additional resource allocation for each virtual logical network is specifically the product of the proportion of the transmission load supplement of each virtual logical network to the transmission load supplement of all virtual logical networks and the reserved resource amount.

10. A network slice resource dynamic allocation device, comprising a memory, a processor, and a computer program stored in the memory and running on the processor, characterized in that, When the processor executes the computer program, it implements the steps of the method as described in any one of claims 1-9.

Images