Resource allocation method and device for multi-service cross-period IP (Internet Protocol) wireless access network

Abstract

The invention discloses a resource allocation method and device for a multi-service cross-period IP (Internet Protocol) wireless access network. The method comprises the following steps: obtaining respective service information of a plurality of to-be-distributed service flows of the IP wireless access network; obtaining a newest time-space diagram of the IP wireless access network in a preset load period, wherein the newest time-space diagram comprises time layers corresponding to a plurality of time slices obtained by dividing the preset load period and a plurality of directed edges between adjacent time layers; according to the sequence of the service priorities from high to low, sequentially determining at least one target service path which meets the service demand information of each to-be-allocated service flow and has the cross-slice migration cost lower than a preset threshold value from each time layer of the latest time-space diagram, and network resource information satisfying the service demand information is allocated to each target service path. According to the method and the device, the technical problems of insufficient flexibility, inaccuracy in priority distinguishing and poor cross-time continuity when different types of service flows are processed in parallel in related technologies are solved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of wireless communication, in particular to a resource allocation method and device for a multi-service cross-period IP wireless access network. BACKGROUND

[0002] In the multi-service parallel scenario, the existing technology usually relies on centralized management or distributed routing protocol for network resource scheduling and allocation to adapt to the dynamic needs of bandwidth and latency of different service types. However, these technical solutions expose some key problems when dealing with extreme traffic changes and complex service level agreement requirements:

[0003] (1) Insufficient flexibility of resource allocation mechanism: Although the distributed module or centralized management can master the load data of nodes and links and provide a certain degree of dynamic bandwidth adjustment, in multiple dimensions (such as time, service type, priority), the existing method is difficult to form a highly flexible and time-sequential resource allocation mechanism. This means that when dealing with multiple types of business traffic, it is difficult to reallocate resources in a timely manner according to the real-time changes and priorities of the business.

[0004] (2) High priority and ordinary traffic are not finely distinguished: In traffic scheduling, the existing method does not finely distinguish between high-priority traffic and ordinary traffic, making it difficult to achieve priority-sensitive bandwidth and latency allocation during traffic peaks and troughs. This leads to the fact that critical services may not be able to obtain the necessary resource guarantee when the network load is heavy, affecting the quality of service.

[0005] (3) Poor stability and continuity across time periods: In response to sudden congestion or link failures in the network, although some technologies can quickly switch through redundant lines or dynamic rerouting strategies, in cross-period scheduling, such switching and adjustment often lack continuity and stability, which may cause critical services to experience frequent path changes between different time slices, increasing the risk of latency and packet loss.

[0006] In view of the above problems, no effective solution has been proposed so far. SUMMARY

[0007] The embodiments of the present application provide a resource allocation method and device for a multi-service cross-period IP wireless access network, to at least solve the technical problems of insufficient flexibility, poor priority distinction, and poor continuity across time periods when related technologies handle different types of service flows in parallel.

[0008] According to an aspect of the embodiments of the present application, a method for resource allocation of a multi-service cross-period IP wireless access network is provided, comprising: obtaining service information of each of a plurality of to-be-allocated service flows of the IP wireless access network, wherein the service information at least includes service priority and service demand information; obtaining a latest space-time diagram of the IP wireless access network in a preset load period, wherein the latest space-time diagram includes a plurality of time layers corresponding to a plurality of time slices obtained by dividing the preset load period and a plurality of directed edges between adjacent time layers, each time layer includes network node state information of a plurality of network nodes in the IP wireless access network in a corresponding time slice and link state information of links between the network nodes, and the directed edges are used to represent a migration direction of a service path of a service flow between two adjacent time layers; in a descending order of the service priority, at least one target service path that meets the service demand information of each to-be-allocated service flow and has a cross-slice migration cost lower than a preset threshold is determined from each time layer of the latest space-time diagram, and network resource information that meets the service demand information of the corresponding to-be-allocated service flow is allocated to each target service path.

[0009] Optionally, the obtaining of the latest space-time diagram of the IP wireless access network in the preset load period comprises: discretizing the preset load period into a plurality of time slices according to a load peak threshold point and a congestion threshold point of the IP wireless access network in the preset load period, wherein the load peak threshold point is a time point of maximum load traffic carried by each of the plurality of network nodes in the IP wireless access network in the preset load period, and the congestion threshold is a time point at which network resources of the IP wireless access network are in a congested state; in each time slice, a time layer corresponding to the time slice is composed of network node state information of each of the plurality of network nodes in the time slice and link state information of links between the network nodes, wherein the network node state information includes at least one of available bandwidth, traffic load, and proportion of bandwidth occupied by different service priorities, and the link state information includes at least one of link utilization, delay, and packet loss rate; determining service paths of a plurality of allocated service flows in the IP wireless access network in each time slice in the preset load period, and determining a plurality of directed edges between adjacent two time layers according to migration directions of the service paths of each of the plurality of allocated service flows in the adjacent two time slices; and constructing the latest space-time diagram of the IP wireless access network in the preset load period by the time layers corresponding to the plurality of time slices and the plurality of directed edges between the adjacent time layers.

[0010] Optionally, the at least one target service path meeting the service requirement information of each to-be-assigned service flow and having a cross-slice migration cost lower than a preset threshold is determined from each time layer of the latest space-time diagram in turn according to a service priority from high to low, including: sorting the plurality of to-be-assigned service flows according to the service priority from high to low; sequentially traversing each to-be-assigned service flow according to the obtained sorting result, and determining a plurality of candidate service paths meeting the service requirement information of the current to-be-assigned service flow in each time layer in the latest space-time diagram by using a graph search algorithm, the service requirement information at least including: time delay requirement information, bandwidth requirement information, path hop limit; for each time layer, determining the cross-slice migration cost between each candidate service path in the time layer and each candidate service path in the next time layer, and selecting at least one candidate service path having a cross-slice migration cost lower than the preset threshold as the target service path of the to-be-assigned service flow in the time layer.

[0011] Optionally, the cross-slice migration cost between each candidate service path in the time layer and each candidate service path in the next time layer is determined, including: for one candidate service path in the time layer and one candidate service path in the next time layer, determining a first change amount of link state information of each link in the one candidate service path in the time layer and link state information of each link in the one candidate service path in the next time layer, and determining a second change amount of network node state information of each network node in the one candidate service path in the time layer and network node state information of each network node in the one candidate service path in the next time layer; and determining the cross-slice migration cost between the one candidate service path in the time layer and the one candidate service path in the next time layer according to the first change amount and the second change amount.

[0012] Optionally, the service priority includes: high level and low level, wherein the number of target service paths of the to-be-assigned service flow of the high level in each time layer is more than the number of target service paths of the to-be-assigned service flow of the low level in each time layer.

[0013] Optionally, before selecting at least one candidate service path having a cross-slice migration cost lower than a preset threshold as the target service path of the to-be-assigned service flow in the time layer, the method further includes: determining a traffic load value of the to-be-assigned service flow pre-assigned on the at least one candidate service path having a cross-slice migration cost lower than the preset threshold; in the case that the load traffic value of the candidate service path is higher than a preset threshold value, determining that the candidate service path is a high-load path, and eliminating the candidate service path of the high-load path from the target service path of the to-be-assigned service flow of the high level in the time layer.

[0014] Optionally, the network resource information satisfying the service requirement information of the corresponding to-be-allocated service flow is allocated to each target service path, comprising: determining the resource allocation priority of each to-be-allocated service flow corresponding to the multiple target service paths according to the service priority of the to-be-allocated service flow; when the resource allocation priority is high, the network resource information satisfying the service requirement information of the corresponding to-be-allocated service flow is allocated to the target service path; when the resource allocation priority is low, it is judged whether the remaining network resource information in the IP wireless access network satisfies the service requirement information of the corresponding to-be-allocated service flow; if yes, the remaining network resource information is allocated to the target service path; if no, the remaining network resource information is allocated to the edge access node and the core transmission node of the target service path.

[0015] According to another aspect of the embodiments of the present application, a resource allocation device for a multi-service cross-period IP wireless access network is further provided, comprising: a first obtaining module, configured to obtain service information of multiple to-be-allocated service flows in an IP wireless access network, wherein the service information at least comprises service priority and service requirement information; a second obtaining module, configured to obtain a latest space-time diagram of the IP wireless access network in a preset load period, wherein the latest space-time diagram comprises multiple time layers corresponding to multiple time slices obtained by dividing the preset load period and multiple directed edges between adjacent time layers, each time layer comprises network node state information of multiple network nodes in the IP wireless access network in a corresponding time slice and link state information of links between the network nodes, and the directed edges are used to represent the migration direction of a service path of a service flow between two adjacent time layers; and a resource configuration module, configured to determine at least one target service path satisfying the service requirement information of each to-be-allocated service flow and having a cross-slice migration cost lower than a preset threshold from each time layer of the latest space-time diagram in a descending order of the service priority, and allocate network resource information satisfying the service requirement information of the corresponding to-be-allocated service flow to each target service path.

[0016] According to another aspect of the embodiments of the present application, a computer program product is further provided, comprising: a computer program, wherein the computer program is executed by a processor to implement the above-mentioned resource allocation method for a multi-service cross-period IP wireless access network.

[0017] According to another aspect of the embodiments of the present application, an electronic device is further provided, comprising: a memory and a processor, wherein the memory stores a computer program, and the processor is configured to execute the above-mentioned resource allocation method for a multi-service cross-period IP wireless access network through the computer program.

[0018] In the embodiments of the present application, the service information of each of the multiple to-be-assigned service flows of the IP wireless access network is comprehensively collected to provide a data basis for subsequent resource allocation; based on real-time monitoring and historical data analysis, a latest space-time diagram is constructed, and a preset load period is subdivided into multiple time slices, each slice representing a specific time period. The space-time diagram not only reflects the network node state and link state in each time slice, but also shows the migration direction of the service flow between adjacent time slices through the directed edges, providing a visual and structured framework for cross-period scheduling of resources; finally, the system follows the ordering principle of service priority from high to low, filters out target service paths that meet the service demand information of the to-be-assigned service flow from each time layer of the latest space-time diagram, and ensures that the cross-slice migration cost of these paths is lower than a preset threshold. This process ensures the priority satisfaction of high-priority service flows, while reasonably allocating network resource information to meet the transmission needs of low-priority services, maximizing the overall throughput and resource utilization while ensuring the quality of key services, meeting the efficient transmission needs of large-scale service flows across periods. Further, the technical problems of insufficient flexibility, poor priority differentiation, and poor cross-period continuity when related technologies process different types of service flows are solved. BRIEF DESCRIPTION OF DRAWINGS

[0019] The drawings described herein are used to provide further understanding of the present application, and form a part of the present application. The illustrative embodiments of the present application and their descriptions serve to explain the present application, and do not constitute an improper limitation on the present application. In the drawings:

[0020] Figure 1 is a flow diagram of an optional resource allocation method for a multi-service cross-period IP wireless access network according to an embodiment of the present application;

[0021] Figure 2 is a structural diagram of an optional resource allocation device for a multi-service cross-period IP wireless access network according to an embodiment of the present application;

[0022] Figure 3 is a hardware structure block diagram of a computer terminal for implementing a resource allocation method for a multi-service cross-period IP wireless access network according to an embodiment of the present application. DETAILED DESCRIPTION

[0023] To enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present application, and not all embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative effort should fall within the scope of protection of the present application.

[0024] It should be noted that the terms "first," "second," etc., used in the specification, claims, and drawings of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of this application described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0025] Example 1

[0026] According to an embodiment of this application, a resource allocation method for a multi-service, cross-time IP wireless access network is provided. It should be noted that the steps shown in the flowchart in the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions. Furthermore, although a logical order is shown in the flowchart, in some cases, the steps shown or described may be executed in a different order than that shown here.

[0027] Figure 1 This is a flowchart illustrating a resource allocation method for a multi-service, cross-time-period IP wireless access network according to an embodiment of this application. Figure 1 As shown, the method includes the following steps:

[0028] Step S102: Obtain service information for each of the multiple service flows to be allocated in the IP wireless access network. The service information includes at least: service priority and service requirement information.

[0029] In step S104, the latest space-time diagram of the IP wireless access network in the preset load period is acquired. The latest space-time diagram includes a plurality of time layers corresponding to a plurality of time slices obtained by dividing the preset load period and a plurality of directed edges between adjacent time layers, each time layer includes network node state information of a plurality of network nodes in the IP wireless access network in a corresponding time slice and link state information of links between the network nodes, and the directed edges are used to represent the migration direction of the service path of the service flow between two adjacent time layers.

[0030] In step S106, at least one target service path that meets the service demand information of each to-be-assigned service flow and has a cross-slice migration cost lower than a preset threshold is determined from each time layer of the latest space-time diagram in a descending order of service priority, and network resource information that meets the service demand information is assigned to each network node in each target service path.

[0031] Based on the scheme defined in steps S102 to S106, it can be known that, in the embodiments of the present application, the intelligent service information analysis and space-time diagram resource scheduling scheme can effectively solve the problem of lack of flexibility and time sequence continuity in resource allocation in the prior art, especially in the high-load scene of multiple types of services, a more stable and fine dynamic scheduling method can be provided, so that the overall throughput and resource utilization of the network are maximized while the quality of key services is guaranteed, and the efficient transmission demand of large-scale service flows across time periods is met.

[0032] The steps of the resource allocation method of the IP wireless access network for multiple services across time periods will be described in detail below in combination with a specific implementation process.

[0033] In the technical scheme provided in step S102, the system can first acquire a plurality of to-be-assigned service flows transmitted in the IP wireless access network, and the types thereof include but are not limited to URLLC (Ultra-Reliable and Low-Latency Communication), eMBB (Enhanced Mobile Broadband), mIoT (Massive Internet of Things), etc. For each service flow, the system can collect and record the service priority for identifying the importance of different service flows, and can also acquire the service demand information of each service flow, including but not limited to the bandwidth requirement, the upper limit of the delay, the packet loss rate threshold, etc. The service quality requirements are customized according to the service level agreement of the service flow of different service types in different scenarios.

[0034] In the technical solution provided in step S104, the system further acquires a latest space-time graph of the IP wireless access network in the preset load period, the latest space-time graph including time layers corresponding to each of the time slices obtained by dividing the preset load period and a plurality of directed edges between adjacent time layers, wherein each time slice represents a specific network running state period with a definite start time and end time, each time layer includes network node state information of all network nodes (such as routers, switches and other network devices) in the IP wireless access network in the corresponding time slice and link state information of links between the network nodes, and the directed edges between adjacent time layers reflect the migration direction of the service path of the service flow between two adjacent time layers.

[0035] Optionally, the latest space-time graph can be acquired in the following manner:

[0036] First step: discretize the preset load period into a plurality of time slices according to the load peak threshold points and the congestion threshold points of the IP wireless access network in the preset load period.

[0037] The load peak threshold points are time points at which the maximum load traffic carried by each of the network nodes in the IP wireless access network in the preset load period, and the congestion threshold is a time point at which the network resources of the IP wireless access network are in a congested state. These threshold points reflect the maximum carrying capacity of the network resources of the IP wireless access network at a specific time point and the critical point at which congestion begins, and therefore, the preset load period can be discretized into a plurality of time slices based on the time points corresponding to these threshold points, each slice representing a specific network running state, such as a peak period, a stable period or a trough period.

[0038] Second step: in each time slice, the time layer corresponding to the time slice is composed of network node state information of each of the network nodes in the IP wireless access network in the time slice and link state information of links between the network nodes.

[0039] The network node state information includes but is not limited to available bandwidth, traffic load, proportion of bandwidth occupied by different service priorities, etc., and the link state information includes but is not limited to link utilization, delay, packet loss rate, etc.

[0040] Third step: determine the service path of each of the plurality of allocated service flows in each time slice in the preset load period, and determine a plurality of directed edges between adjacent two time layers according to the migration direction of the service path of each of the allocated service flows in the adjacent two time slices.

[0041] Fourth step: constructing the latest space-time graph of the IP wireless access network in the preset load period from the time layers corresponding to the plurality of time slices and the plurality of directed edges between adjacent time layers.

[0042] The space-time graph constructed by the above method not only shows the static topology and link state of the IP wireless access network in different time slices, but also reflects the dynamic service flow path change and cross-period allocation of network resources through the directed edges.

[0043] Further, on the basis of the above latest space-time graph, the system can determine at least one target service path that meets the service demand information of each to-be-allocated service flow and has a cross-slice migration cost lower than a preset threshold from each time layer of the above latest space-time graph in order of service priority from high to low, and the specific implementation manner is as follows:

[0044] First step: sorting a plurality of to-be-allocated service flows in order of service priority from high to low, which ensures that high-priority service flows are given higher priority in resource allocation. The priority directly determines whether the service flow can obtain the required quality of service in the case of limited network resources, so priority sorting of service flows is the basis for differentiated service of service flows.

[0045] Second step: according to the obtained sorting result, traversing each to-be-allocated service flow in turn, and using a graph search algorithm (such as Dijkstra algorithm, A* algorithm, etc.) to determine a plurality of candidate service paths that meet the service demand information of the current to-be-allocated service flow in each time layer of the latest space-time graph. The service demand information at least includes: delay requirement information (i.e. the delay requirement is not lower than a certain threshold), bandwidth requirement information (i.e. the required bandwidth requirement is not lower than a certain value), path hop limit (i.e. the path hop requirement is not lower than a certain limit), etc.

[0046] Third step: for each time layer, determine the cross-slice migration cost between each candidate service path in the time layer and each candidate service path in the next time layer, and select at least one candidate service path with a cross-slice migration cost lower than a preset threshold as the target service path of the to-be-allocated service flow in the time layer.

[0047] The cross-slice migration cost in the technical solution provided in the third step above reflects the adverse effects such as bandwidth loss and delay increase that the service flow may encounter when migrating between different time slices along different paths. Therefore, the system selects those candidate service paths with a cross-slice migration cost lower than a preset threshold as the target service path, ensuring smooth transition of the service flow in cross-period scheduling and maintaining the consistency of its service quality, while also considering the effective use of network resources and avoiding resource waste or additional delay caused by frequent switching of service flow paths.

[0048] Specifically, for one candidate service path in a time layer and one candidate service path in a next time layer, the cross-slice migration cost can be determined by first determining a first variation amount of link state information of each link in the one candidate service path in the time layer and the one candidate service path in the next time layer (such as a variation amount of link utilization, an increase or decrease amount of latency, or a floating amount of packet loss rate), and determining a second variation amount of network node state information of each network node in the one candidate service path in the time layer and the one candidate service path in the next time layer (such as a load condition, a variation of available bandwidth, and stability of inter-node connection state, etc.); and then comprehensively determining the cross-slice migration cost between the one candidate service path in the time layer and the one candidate service path in the next time layer according to the first variation amount and the second variation amount. Therefore, the expression of the cross-slice migration cost can be written as:

[0049] TransCost(k→k+1) = |a (k+1) -a (k) |+η·|l (k+1) -l (k) |

[0050] wherein a (k+1) ,a (k) respectively represent network node state information of each network node in a candidate service path in a kth time layer and network node state information of each network node in a candidate service path in a (k+1)th time layer, l k +1) ,l k) respectively represent link state information of each link in the candidate service path in the kth time layer and link state information of each link in the candidate service path in the (k+1)th time layer, and η represents a cross-slice migration balance coefficient.

[0051] In addition, since the service priority includes high level and low level, and in the environment of limited network resources, the principle of "important priority" should be followed to ensure the stability and priority access capability of critical service flow. Therefore, the number of target service paths of high-level service flow in each time layer is higher than that of low-level service flow, so as to provide more path selection and sufficient network resources for high-level service flow. Even if the main path fails or is congested, it can still be quickly and low-cost switched to the backup path, thereby maintaining the continuity and reliability of its service. At the same time, this also means that the low-level service flow needs to be more flexible in adjusting the path, and even temporarily degrade the service in the case of extreme resource shortage to free up resources to ensure the stable operation of high-level service flow.

[0052] It should be noted that before selecting at least one candidate service path with a cross-slice migration cost lower than a preset threshold as the target service path of the to-be-assigned service flow in the time layer, the system can also evaluate the traffic load value on each candidate service path to ensure that the use of the finally selected path does not exceed its carrying capacity.

[0053] Specifically, the implementation of the above process is as follows: first, determine the traffic load value of the to-be-assigned service flow pre-assigned on at least one candidate service path with a cross-slice migration cost lower than a preset threshold; in the case that the load traffic value of the candidate service path is higher than the preset threshold value, determine that the candidate service path is a high-load path, indicating that it has potential congestion risk, at this time the system can eliminate the candidate service path of the high-load path from the target service path of the to-be-assigned service flow in the time layer with high service priority, to avoid assigning high-level to-be-assigned service flow to such a path that may face performance bottleneck.

[0054] Through the above method, the system can screen out candidate service paths that meet the requirements of traffic carrying capacity and path stability as the target service path of the to-be-assigned service flow in a specific time layer. In this way, not only the communication quality of critical services is guaranteed, but also unreasonable allocation of network resources is avoided, improving the operation efficiency and stability of the entire IP wireless access network.

[0055] After the system obtains the target service paths of the to-be-assigned service flow in each time layer, it can also allocate network resource information meeting the service demand information of the corresponding to-be-assigned service flow to each target service path in turn according to the following method:

[0056] First, according to the service priority of the to-be-assigned service flow, determine the resource allocation priority of each target service path corresponding to the to-be-assigned service flow, wherein high-priority service flow will obtain the highest resource allocation priority, and low-priority service flow will obtain lower priority.

[0057] For target service paths with high resource allocation priority, the system will prioritize allocating network resource information meeting the service demand information of the corresponding to-be-assigned service flow to the target service path. This means that during the allocation process, the path of high-priority service flow will be given more network resources to ensure its service quality and communication efficiency.

[0058] For the target service path with low resource allocation priority, the system adopts different resource allocation strategies, that is, the system first determines whether the remaining network resource information in the IP wireless access network meets the service demand information of the corresponding to-be-allocated service flow; if yes, the system directly allocates the remaining network resource information to the target service path; if not, the system allocates the remaining network resource information to the edge node and the core transmission node of the target service path, that is, the resource allocation priority of the edge node and the core transmission node is promoted, so as to ensure that they can continue to process and forward low-priority service flows without significantly affecting the performance of high-priority service flows, thereby maintaining the key performance of the entire network.

[0059] As to the above edge access node and core transmission node, the embodiment of the application can determine the multi-dimensional connectivity index of each network node in the IP wireless access network: when the multi-dimensional connectivity index of a certain network node is less than a first threshold, the network node is determined to be an edge access node; when the multi-dimensional connectivity index of a certain network node is not less than the first threshold but less than a second threshold, the network node is determined to be a convergence node; when the multi-dimensional connectivity index of a certain network node is not less than the second threshold, the network node is determined to be a core transmission node. The second threshold is greater than the first threshold, and the expression of the multi-dimensional connectivity index can be written as:

[0060]

[0061] In the formula, A i,j represents the connectivity relationship strength of the network node i and the network node j at the backbone layer, Δ cap (i,j) represents the available bandwidth of the network node i through the link (i,j) under different loads, U i,p represents the absorption capacity of the network node i to the service flow of the priority p (that is, the limit of the amount of data that the node i can receive, process and forward when processing the service flow of the priority p), δ p represents the amplification coefficient of the high priority, P represents the total number of priority levels, N represents other network nodes in the IP wireless access network except the network node i, and α1, α2 and α3 represent weighting coefficients respectively.

[0062] Finally, the system can configure an interface to deliver the target service path corresponding to each to-be-allocated service flow and the network resource information of each target service path to each routing device, so as to ensure the seamless connection of the end-to-end execution process.

[0063] In addition, the system can also check the multi-round cross-slice resource scheduling process of each to-be-assigned service flow in the IP wireless access network, monitor the load status of each node and link in the network and the actual constant situation of the to-be-assigned service flow in different time slices. In the periodic checking process, once the system identifies a key link interruption, node failure or unresolvable congestion situation of the network in a certain time period, it is judged as a major failure or congestion situation that cannot be avoided, and a full-network recalculation mechanism (i.e., starting resource redistribution and path recalculation in the full-network range) is used to find the optimal path or suboptimal path again. The full-network recalculation mechanism uses a hybrid routing architecture combining the global perspective of centralized control and the fast response capability of distributed routing protocol, in which the centralized control end is responsible for global scheduling and finds or adjusts the path for high-priority services through optimization algorithm; and the distributed switching is quickly executed on the local node and switches to the backup path according to the strategy issued by the centralized control end to realize fast recovery.

[0064] It should be noted that in the monitoring process, the system can also focus on monitoring the to-be-assigned service flow with high cross-slice service path repetition degree and high service priority, because high cross-slice service path repetition degree means that the to-be-assigned service flow with high service priority excessively occupies the resources of certain nodes or links in the network, which will cause continuous period impact on the to-be-assigned service flow with high service priority when a node or link fails, and further affect the continuity and stability of the service. Therefore, the system monitors and optimizes these service flows to reduce the delay jump in the switching process and improve the consistency and reliability of network transmission.

[0065] Embodiment 2

[0066] According to the embodiments of the present application, a resource allocation apparatus of a multi-service cross-time period IP wireless access network for implementing the resource allocation method of the multi-service cross-time period IP wireless access network in Embodiment 1 is also provided, as shown in Figure 2 The resource allocation apparatus of the multi-service cross-time period IP wireless access network at least includes a first acquisition module 22, a second acquisition module 24 and a resource configuration module 26, wherein:

[0067] The first acquisition module 22 is configured to acquire service information of each to-be-assigned service flow of the IP wireless access network, wherein the service information at least includes service priority and service demand information.

[0068] The second obtaining module 24 is configured to obtain a latest space-time diagram of the IP wireless access network in a preset load period, wherein the latest space-time diagram comprises a plurality of time layers corresponding to a plurality of time slices obtained by dividing the preset load period and a plurality of directed edges between adjacent time layers, each time layer comprises network node state information of a plurality of network nodes in the IP wireless access network at a corresponding time slice and link state information of links between the network nodes, and the directed edges are used to represent a migration direction of a service path of a service flow between two adjacent time layers.

[0069] The resource configuration module 26 is configured to sequentially determine at least one target service path that meets service demand information of each to-be-assigned service flow and has a cross-slice migration cost lower than a preset threshold from each time layer of the latest space-time diagram in a descending order of service priorities, and assign network resource information meeting the service demand information of the corresponding to-be-assigned service flow to each target service path.

[0070] It should be noted that each module in the resource allocation apparatus for the multi-service cross-period IP wireless access network in the embodiments of the present application corresponds to each implementation step of the resource allocation method for the multi-service cross-period IP wireless access network in Embodiment 1. Since Embodiment 1 has been described in detail, the details not embodied in the present embodiment can be referred to Embodiment 1, and will not be described in detail here.

[0071] Embodiment 3

[0072] According to the embodiments of the present application, a computer program product is also provided, which comprises a computer program. When the computer program is executed by a processor, the resource allocation method for the multi-service cross-period IP wireless access network in Embodiment 1 is implemented.

[0073] According to the embodiments of the present application, a non-volatile storage medium is also provided, which comprises a stored computer program. A device in which the non-volatile storage medium is located executes the resource allocation method for the multi-service cross-period IP wireless access network in Embodiment 1 by running the computer program.

[0074] According to the embodiments of the present application, a processor is also provided, which is used to run a computer program. When the computer program is run, the resource allocation method for the multi-service cross-period IP wireless access network in Embodiment 1 is executed.

[0075] According to the embodiments of the present application, an electronic device is also provided, which comprises a memory and a processor. The memory stores a computer program, and the processor is configured to execute the resource allocation method for the multi-service cross-period IP wireless access network in Embodiment 1 by the computer program.

[0076] Specifically, the computer program runs to implement the following steps: obtaining service information of each of a plurality of to-be-assigned service flows of an IP wireless access network, wherein the service information at least includes service priority and service requirement information; obtaining a latest space-time diagram of the IP wireless access network within a preset load period, wherein the latest space-time diagram includes a plurality of time slices obtained by dividing the preset load period, each corresponding time layer and a plurality of directed edges between adjacent time layers, each time layer includes network node state information of each network node in the IP wireless access network within the corresponding time slice and link state information of each link between the network nodes, and the directed edges are used to represent the migration direction of the service path of the service flow between two adjacent time layers; in order of high to low of the service priority, at least one target service path that meets the service requirement information of each to-be-assigned service flow and has a cross-slice migration cost lower than a preset threshold is determined from each time layer of the latest space-time diagram in sequence, and network resource information meeting the service requirement information of the corresponding to-be-assigned service flow is assigned to each target service path.

[0077] As an optional implementation, the electronic device can exist in the form of a mobile terminal, a computer terminal or a similar computing device. Figure 3 A hardware structure block diagram of a computer terminal for implementing a resource allocation method of a multi-service cross-period IP wireless access network is shown. As shown in Figure 3 The computer terminal 30 can include one or more processors 302 (the processor 302 can include but is not limited to a processing device such as a microprocessor MCU or a programmable logic device FPGA), a memory 304 for storing data, and a transmission device 306 for communication functions. In addition, it can also include a display, an input / output interface (I / O interface), a universal serial bus (USB) port (which can be included as one of the ports of the BUS bus), a network interface, a power supply and / or a camera. Those skilled in the art can understand that Figure 3 The structure shown is only schematic, and does not limit the structure of the above-mentioned computer terminal. For example, the computer terminal 30 can also include more or fewer components than Figure 3 shown, or have a different configuration from Figure 3 shown.

[0078] It should be noted that the one or more processors 302 and / or other data processing circuitry described above can be referred to herein generically as "data processing circuitry". The data processing circuitry can be embodied in whole or in part as software, hardware, firmware, or any combination thereof. Furthermore, the data processing circuitry can be a single standalone processing module, or it can be incorporated in whole or in part within any one of the other elements of the computer terminal 30. As referred to in the embodiments herein, the data processing circuitry acts as a processor to control, for example, the selection of the variable resistance terminal path in connection with the interface.

[0079] The memory 304 can be used to store software programs and modules for applications, such as program instructions / data storage means corresponding to the method for resource allocation in a multi-service cross-period IP wireless access network, and the processor 302 can execute various functional applications and data processing by running the software programs and modules stored in the memory 304, i.e. implement the vulnerability detection method of the application program described above. The memory 304 can include a high-speed random access memory, and can also include a non-volatile memory, such as one or more magnetic storage devices, flash memories, or other non-volatile solid-state memories. In some examples, the memory 304 can further include a memory remotely arranged with respect to the processor 302, which can be connected to the computer terminal 30 through a network. Examples of the network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0080] The transmission device 306 is configured to receive or send data via a network. Examples of the network include, but are not limited to, a wireless network provided by a communication service provider of the computer terminal 30. In one example, the transmission device 306 includes a network adapter (NIC) that can be connected to other network devices through a base station so as to communicate with the Internet. In one example, the transmission device 306 can be a radio frequency (RF) module configured to communicate with the Internet in a wireless manner.

[0081] The display can be, for example, a touch screen type liquid crystal display (LCD) that can enable a user to interact with the user interface of the computer terminal 30.

[0082] The above-mentioned embodiment numbers are only for description, and do not represent the advantages and disadvantages of the embodiments.

[0083] In the above-described embodiments of the present application, the description of each embodiment has its own focus, and the parts not described in detail in a certain embodiment can be referred to the relevant description of other embodiments.

[0084] In several embodiments provided in the present application, it should be understood that the disclosed technology can be implemented by other ways. Among them, the above-described device embodiments are only schematic, for example, the division of units can be a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the displayed or discussed units can be indirect coupling or communication connection through some interfaces, units or modules, which can be electrical or other forms.

[0085] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, i.e. they can be located in one place or distributed to multiple units. Some or all of the units can be selected according to actual needs to achieve the purpose of the embodiment.

[0086] In addition, the functional units in each embodiment of the present application can be integrated in one processing unit, or each unit can be physically present separately, or two or more units can be integrated in one unit. The integrated unit can be realized in the form of hardware or in the form of a software functional unit.

[0087] If the integrated unit is realized in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer readable storage medium. Based on this understanding, the technical solutions of the present application essentially or the part of the prior art that contributes to the technical solutions or the whole or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes a plurality of instructions for causing a computer device (which can be a personal computer, a server or a network device, etc.) to execute all or part of the steps of the embodiments of the present application. The aforementioned storage medium includes: a U disk, a read-only memory (ROM, Read-Only Memory), a random access memory (RAM, Random Access Memory), a mobile hard disk, a magnetic disk or an optical disk, and various media that can store program codes.

[0088] The above is only the preferred embodiment of the present application, and it should be pointed out that for ordinary skilled in the art, without departing from the principles of the present application, a number of improvements and refinements can be made, which should be considered as the protection scope of the present application.

Claims

1. A method for resource allocation in a multi-service inter- session IP radio access network, characterized in that, The method comprises the following steps: obtaining service information of a plurality of to-be-assigned service flows of an IP wireless access network, wherein the service information at least comprises service priority and service requirement information; obtaining a latest space-time diagram of the IP wireless access network in a preset load period, wherein the latest space-time diagram comprises a plurality of time layers corresponding to a plurality of time slices obtained by dividing the preset load period, and a plurality of directed edges between adjacent time layers, each of the time layers comprises network node state information of a plurality of network nodes in the IP wireless access network in a corresponding time slice and link state information of links between the network nodes, and the directed edges are used to represent migration direction of a service path of a service flow between two adjacent time layers; determining at least one target service path from each of the time layers of the latest space-time diagram in a descending order of the service priority, wherein the target service path satisfies service requirement information of each of the to-be-assigned service flows and has a cross-slice migration cost lower than a preset threshold, and assigning network resource information satisfying the service requirement information of the corresponding to-be-assigned service flow to each of the target service paths.

2. The method of claim 1, wherein, The method for obtaining a latest space-time diagram of an IP wireless access network in a preset load period comprises the following steps: discretizing the preset load period into a plurality of time slices according to a load peak threshold point and a congestion threshold point of the IP wireless access network in the preset load period, wherein the load peak threshold point is a time point of maximum load traffic carried by each of a plurality of network nodes in the IP wireless access network in the preset load period, and the congestion threshold is a time point at which network resources of the IP wireless access network are in a congested state; composing a time layer corresponding to each of the time slices by network node state information of each of a plurality of network nodes of the IP wireless access network in the time slice and link state information of links between each of the network nodes in each of the time slices, wherein the network node state information comprises at least one of the following: available bandwidth, traffic load, and proportion of bandwidth occupied by different service priorities, and the link state information comprises at least one of the following: link utilization, delay, and packet loss rate; determining service paths of a plurality of assigned service flows in each of the time slices in the preset load period in the IP wireless access network, and determining a plurality of directed edges between adjacent two time layers according to migration direction of the service paths of each of the assigned service flows in adjacent two time slices; constructing the latest space-time diagram of the IP wireless access network in the preset load period by the time layers corresponding to the plurality of time slices and the plurality of directed edges between adjacent time layers.

3. The method of claim 1, wherein, The method for determining at least one target service path from each of the time layers of the latest space-time diagram in a descending order of the service priority comprises the following steps: sorting the plurality of to-be-assigned service flows in a descending order of the service priority; determining a plurality of candidate service paths in each time layer in the latest time-space graph that satisfy service requirement information of the current to-be-assigned service flow by using a graph search algorithm according to the obtained ranking result, the service requirement information at least including: delay requirement information, bandwidth requirement information, path hop limit; For each time layer, a cross-slice migration cost between each candidate service path in the time layer and each candidate service path in the next time layer is determined, and at least one candidate service path with a cross-slice migration cost lower than a preset threshold is selected as a target service path of the to-be-assigned service flow in the time layer.

4. The method of claim 3, wherein, Determining the cross-slice migration cost between each candidate service path in the time layer and each candidate service path in the next time layer includes: For one candidate service path in the time layer and one candidate service path in the next time layer, a first change amount of link state information of each link in the one candidate service path in the time layer and link state information of each link in the one candidate service path in the next time layer is determined, and a second change amount of network node state information of each network node in the one candidate service path in the time layer and network node state information of each network node in the one candidate service path in the next time layer is determined; the cross-slice migration cost between the one candidate service path in the time layer and the one candidate service path in the next time layer is determined according to the first change amount and the second change amount.

5. The method of claim 3, wherein, The service priority includes: high level and low level, wherein the number of target service paths of the to-be-assigned service flow in each time layer at the high level is greater than the number of target service paths of the to-be-assigned service flow in each time layer at the low level.

6. The method of claim 3, wherein, Before selecting at least one candidate service path with a cross-slice migration cost lower than a preset threshold as a target service path of the to-be-assigned service flow in the time layer, the method further includes: determining a traffic load value of a to-be-assigned service flow pre-assigned to the at least one candidate service path with a cross-slice migration cost lower than a preset threshold; in a case where the load traffic value of the candidate service path is higher than a preset threshold value, determining that the candidate service path is a high-load path, and excluding the high-load path from the target service paths of the to-be-assigned service flow at the high level in the time layer.

7. The method of claim 1, wherein, allocating network resource information satisfying the service requirement information of the corresponding to-be-assigned service flow to each target service path includes: determining a resource allocation priority of each target service path corresponding to each to-be-assigned service flow according to the service priority of the to-be-assigned service flow; allocating network resource information satisfying the service requirement information of the corresponding to-be-assigned service flow to the target service path when the resource allocation priority is at a high level; When the resource allocation priority is low, it is judged whether the residual network resource information in the IP wireless access network satisfies the service demand information of the corresponding to-be-allocated service flow; if yes, the residual network resource information is allocated to the target service path; if not, the residual network resource information is allocated to the edge access node and the core transmission node of the target service path.

8. A resource allocation apparatus for a multi-service inter- period IP radio access network, characterized by, The method comprises the steps of: A first obtaining module is configured to obtain service information of a plurality of to-be-allocated service flows in an IP wireless access network, wherein the service information at least comprises service priority and service demand information; A second obtaining module is configured to obtain a latest space-time diagram of the IP wireless access network in a preset load period, wherein the latest space-time diagram comprises a plurality of time slices obtained by dividing the preset load period, each time slice corresponding to a time layer and a plurality of directed edges between adjacent time layers, each time layer comprising network node state information of a plurality of network nodes in the IP wireless access network in the corresponding time slice and link state information of links between the network nodes, and the directed edges are used to represent the migration direction of a service path of a service flow between two adjacent time layers; A resource configuration module is configured to determine at least one target service path that satisfies the service demand information of each to-be-allocated service flow and has a cross-slice migration cost lower than a preset threshold from each time layer of the latest space-time diagram in a descending order of the service priority, and allocate network resource information that satisfies the service demand information of the corresponding to-be-allocated service flow to each target service path.

9. A computer program product, characterised in that, The computer program is executed by a processor to implement the method for allocating resources of a multi-service cross-period IP wireless access network according to any one of claims 1 to 7. The computer program is executed by a processor to implement the method for allocating resources of a multi-service cross-period IP wireless access network according to any one of claims 1 to 7.

10. An electronic device, comprising: The computer program is executed by a processor to implement the method for allocating resources of a multi-service cross-period IP wireless access network according to any one of claims 1 to 7. ​

Images