Resource scheduling method and device

By acquiring and optimizing the main route and backup route paths in the all-optical computing power network, the problems of unclear computing power and unreasonable resource allocation are solved, and efficient service scheduling and high network reliability are achieved.

CN118900249AActive Publication Date: 2024-11-05CHINA MOBILE COMM LTD RES INST +2
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
CN202310486971.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-05-04
Publication Date
2024-11-05
Estimated Expiration
2043-05-04

AI Technical Summary

Technical Problem

In all-optical computing power networks, the existing technology has problems such as incomplete real-time collection of computing power equipment information and inflexible computing resource scheduling, resulting in unclear computing power demand, unreasonable resource allocation, and high network congestion and risks.

Method used

By obtaining the main route path and backup route path of user services, optimizing the target and dual route naturalization constraints, determining the target route path, ensuring the minimum communication delay and the lowest node risk, and achieving efficient service scheduling and reasonable resource allocation.

Benefits of technology

It effectively avoids business failure and network blockage caused by node failure, improves network reliability and resource utilization, and realizes the solution of overall service dual routing planning.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118900249A_ABST
    Figure CN118900249A_ABST
Patent Text Reader

Abstract

The embodiment of the invention provides a resource scheduling method and device. A main routing path and a standby routing path of the user service are obtained, the communication time delay of the main routing path is minimum, the node risk value of the standby routing path is minimum, and the node risk value represents the influence generated by a node fault; and determining a target routing path according to the main routing path and the standby routing path, and scheduling the user service to a node of the target routing path for service processing.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The embodiments of the present application relate to the field of optical communication computing power networks, and specifically to a resource scheduling method and device. Background Art

[0002] At present, in terms of all-optical computing network resource allocation, there are still deficiencies such as incomplete real-time collection of computing equipment information and inflexible computing resource scheduling. At the same time, in order to alleviate network congestion, improve communication network transmission performance, and reduce network risks, the routing algorithms proposed in existing research so far mostly focus on determining accessible paths for services from the network topology structure, and pay insufficient attention to the use of underlying resources; at the same time, there is also a lack of consideration for the load of the underlying computing nodes. Once the node is damaged and loses its ability, the planned business will fail and cause congestion. Summary of the invention

[0003] The embodiments of the present application provide a resource scheduling method and device to solve the problems of unclear service demand computing power and unreasonable computing power resource allocation in the existing computing power optical network.

[0004] In a first aspect, a resource scheduling method is provided, comprising:

[0005] Obtaining a primary routing path and a backup routing path for a user service, wherein the primary routing path has a minimum communication delay, and the backup routing path has a minimum node risk value, wherein the node risk value indicates an impact caused by a node failure;

[0006] A target routing path is determined according to the primary routing path and the backup routing path, and the user service is dispatched to a node of the target routing path for service processing.

[0007] Optionally, obtain the primary routing path and backup routing path of the user service, including:

[0008] According to the optimization target and / or the constraint condition of dual routing naturalization, a main routing path of the user service and a backup routing path are obtained;

[0009] Wherein, the optimization goal includes at least one of the following: minimizing the total communication delay of the service and balancing the network risk as the optimization goal;

[0010] The constraints of the dual-route naturalization include at least one of the following: route uniqueness, path acyclicity, bandwidth resource size allocated to all services should be less than link bandwidth threshold, storage resources available to all user services scheduled to the computing node do not exceed storage resources that the computing node can provide, and computing resources available to all user services scheduled to the computing node do not exceed computing resources that the computing node can provide. Optionally, obtaining the main routing path of the user service includes:

[0011] A main routing path of the user service is determined according to at least one of an access delay of the user service to the accessed node, a transmission delay of the user service between adjacent nodes, and a calculation delay of the user service.

[0012] Optionally, obtaining the main routing path of the user service also includes:

[0013] Determine at least one of the access delay of the user service to the accessed node, the transmission delay of the user service between the adjacent nodes and the computing delay of the user service based on at least one of the size of the user service, the data transmission rate of the user service to the accessed node, the data transmission rate between the user service to the adjacent nodes and the computing power size of the user service to the accessed node.

[0014] Optionally, obtain an alternate routing path for the user service, including:

[0015] Determine a backup routing path for the user service based on at least one of the failure probability, importance, and service load of the user service to the accessed node; wherein the importance indicates the criticality of the node in the optical network.

[0016] Optionally, the method further includes:

[0017] The importance of the node is determined according to the voltage value of the node and the degree-intermediacy correlation index of the node. The degree-intermediacy correlation index of the node is determined based on the node intermediacy and the node degree of the node. The larger the node degree, the stronger the node connectivity, which corresponds to a wider range of fault propagation after the fault occurs. The larger the node intermediacy, the faster the node fault will affect the network performance.

[0018] Optionally, determining a target routing path according to the primary routing path and the backup routing path, and scheduling the user service to a node of the target routing path for service processing includes:

[0019] According to the lowest delay level priority strategy, as well as the main routing path and the backup routing path, a target routing path is determined, and the user service is dispatched to a node of the target routing path for service processing.

[0020] Optionally, the dispatching the user service to a node on a target routing path for service processing includes:

[0021] Scheduling computing power according to the routing information of the target routing path, establishing a network connection and updating corresponding idle resource information;

[0022] If the distance of the scheduled node is greater than the transmission distance threshold, the service priority is lowered and the node is waited for to be released; the planned route is recalculated until all services are completed.

[0023] Optionally, if the distance of the scheduled node is greater than the transmission distance threshold, the service priority is lowered and the node is waited for to be released; the planned route is recalculated until all services are completed, including:

[0024] Calculate the number of frequency slots required for the currently selected target routing path;

[0025] Determine whether the number of frequency slots exceeds the transmission distance threshold;

[0026] If the transmission distance threshold is exceeded, check whether all paths have been traversed. If all paths have been confirmed to have been traversed, output that the current request is blocked, obtain the current request processing status, and update the number of blocked requests for all requests;

[0027] If the transmission distance threshold is not exceeded, the computing power optical network resource node is allocated according to the routing information of the target routing path, and the current request is processed and is not counted in the number of blocked requests;

[0028] Update the number of blocked requests for all requests, wait for the node to be released, and lower the priority of business requests;

[0029] Check whether the blocking service is 0. If there is a blocking service, the blocking service generates request information again and reconfigures the path according to the newly added computing power optical network resources; if the blocking service is 0, the allocation ends.

[0030] In a second aspect, a resource scheduling device is provided, comprising:

[0031] An acquisition module, used to acquire a main routing path and a backup routing path for a user service, wherein the communication delay of the main routing path is minimal, and the node risk value of the backup routing path is minimal, wherein the node risk value indicates the impact caused by a node failure;

[0032] The first determination module is used to determine a target routing path according to the main routing path and the backup routing path, and dispatch the user service to a node of the target routing path for service processing.

[0033] In a third aspect, a communication device is provided, comprising a processor, a memory, and a program or instruction stored in the memory and executable on the processor, wherein the program or instruction, when executed by the processor, implements the steps of the method described in the first aspect.

[0034] In a fourth aspect, a readable storage medium is provided, on which a program or instruction is stored. When the program or instruction is executed by a processor, the steps of the method described in the first aspect are implemented.

[0035] In an embodiment of the present application, a main routing path and a backup routing path of a user service are obtained, the communication delay of the main routing path is minimized, and the node risk value of the backup routing path is minimized, and the node risk value represents the impact caused by a node failure; based on the main routing path and the backup routing path, a target routing path is determined, and the user service is dispatched to the node of the target routing path for service processing, thereby avoiding unclear service demand computing power and unreasonable computing power resource allocation in the existing computing power optical network, and realizing the overall service dual routing planning solution. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] Various other advantages and benefits will become apparent to those of ordinary skill in the art by reading the detailed description of the preferred embodiments below. The accompanying drawings are only for the purpose of illustrating the preferred embodiments and are not to be considered as limiting the present application. Also, the same reference symbols are used throughout the accompanying drawings to represent the same components. In the accompanying drawings:

[0037] Figure 1 is a flow chart of a resource scheduling method provided in an embodiment of the present application;

[0038] Figure 2 It is a schematic diagram of the overall architecture of the computing power optical network service provided by the embodiment of the present application;

[0039] Figure 3 This is a flowchart of computing power optical network resource scheduling provided by an embodiment of the present application;

[0040] Figure 4 It is the NSGA II algorithm execution flow chart provided by this application;

[0041] Figure 5 is a schematic diagram of a resource scheduling device provided in an embodiment of the present application;

[0042] Figure 6 It is a schematic diagram of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0043] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0044] The term "comprise" and any variation thereof in the specification and claims of the present application are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units need not be limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices. In addition, the use of "and / or" in the specification and claims to indicate at least one of the connected objects, such as A and / or B, means that A alone, B alone, and A and B exist in three cases.

[0045] In the embodiments of the present application, words such as "exemplary" or "for example" are used to indicate examples, illustrations or descriptions. Any embodiment or design described as "exemplary" or "for example" in the embodiments of the present application should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present related concepts in a specific way.

[0046] See also Figure 1 , an embodiment of the present application provides a resource scheduling method, and the specific steps include: step 101 and step 102.

[0047] Step 101: obtaining a primary routing path and a backup routing path of a user service, wherein the communication delay of the primary routing path is minimal, and the node risk value of the backup routing path is minimal, wherein the node risk value indicates the impact caused by a node failure;

[0048] Step 102: Determine a target routing path according to the primary routing path and the backup routing path, and dispatch the user service to a node of the target routing path for service processing.

[0049] It can be understood that the target routing path may be a primary routing path or a backup routing path, or may be another routing path other than the primary routing path and the backup routing path.

[0050] In one implementation of the present application, obtaining a primary routing path and a backup routing path for a user service includes:

[0051] According to the optimization target and / or the constraint condition of dual routing naturalization, a main routing path of the user service and a backup routing path are obtained;

[0052] Wherein, the optimization goal includes at least one of the following: minimizing the total communication delay of the service and balancing the network risk as the optimization goal;

[0053] The constraints of the dual routing naturalization include at least one of the following: routing uniqueness, path acyclicity, the size of bandwidth resources allocated to all services should be less than the link bandwidth threshold, the storage resources available to all user services scheduled to the computing node do not exceed the storage resources that the computing node can provide, and the computing resources available to all user services scheduled to the computing node do not exceed the computing resources that the computing node can provide. In one embodiment of the present application, obtaining the main routing path of the user service includes:

[0054] The main routing path of the user service is determined according to at least one of an access delay of the user service to the accessed node, a transmission delay of the user service between adjacent nodes, and a calculation delay of the user service.

[0055] In one implementation of the present application, obtaining the main routing path of the user service also includes:

[0056] Determine at least one of the access delay of the user service to the accessed node, the transmission delay of the user service between the adjacent nodes and the computing delay of the user service based on at least one of the size of the user service, the data transmission rate of the user service to the accessed node, the data transmission rate between the user service to the adjacent nodes and the computing power size of the user service to the accessed node.

[0057] In one implementation of the present application, obtaining a backup routing path for a user service includes:

[0058] Determine a backup routing path for the user service based on at least one of the failure probability, importance, and service load of the user service to the accessed node; wherein the importance indicates the criticality of the node in the optical network.

[0059] In one embodiment of the present application, the method further includes:

[0060] The importance of the node is determined according to the voltage value of the node and the degree-intermediacy correlation index of the node. The degree-intermediacy correlation index of the node is determined based on the node intermediacy and the node degree of the node. The larger the node degree, the stronger the node connectivity, which corresponds to a wider range of fault propagation after the fault occurs. The larger the node intermediacy, the faster the node fault will affect the network performance.

[0061] In one implementation of the present application, determining a target routing path according to the primary routing path and the backup routing path, and scheduling the user service to a node of the target routing path for service processing includes:

[0062] According to the lowest delay level priority strategy, as well as the main routing path and the backup routing path, a target routing path is determined, and the user service is dispatched to a node of the target routing path for service processing.

[0063] In one implementation of the present application, the step of scheduling the user service to a node on a target routing path for service processing includes:

[0064] Scheduling computing power according to the routing information of the target routing path, establishing a network connection and updating corresponding idle resource information;

[0065] If the distance of the scheduled node is greater than the transmission distance threshold, the service priority is lowered and the node is waited for to be released; the planned route is recalculated until all services are completed.

[0066] In one implementation of the present application, if the distance of the scheduled node is greater than the transmission distance threshold, the service priority is lowered and the node is waited for to be released; the planned route is recalculated until all services are completed, including:

[0067] Calculate the number of frequency slots required for the currently selected target routing path;

[0068] Determine whether the number of frequency slots exceeds the transmission distance threshold;

[0069] If the transmission distance threshold is exceeded, check whether all paths have been traversed. If all paths have been confirmed to have been traversed, output that the current request is blocked, obtain the current request processing status, and update the number of blocked requests for all requests;

[0070] If the transmission distance threshold is not exceeded, the computing power optical network resource node is allocated according to the routing information of the target routing path, and the current request is processed and is not counted in the number of blocked requests;

[0071] Update the number of blocked requests for all requests, wait for the node to be released, and lower the priority of business requests;

[0072] Check whether the blocking service is 0. If there is a blocking service, the blocking service generates request information again and reconfigures the path according to the newly added computing power optical network resources; if the blocking service is 0, the allocation ends.

[0073] In this embodiment, with the network topology and business communication indicator requirements clarified, node load modeling is performed based on factors such as network structure, equipment level and business carrying conditions; while taking business performance into consideration, the high-reliability business dual routing planning problem is modeled as a multi-objective optimization problem with the overall network node load value and the business end-to-end communication delay as optimization targets, and with business requirements, bandwidth resources, dual routing independence, etc. as constraints, ultimately achieving the purpose of solving the overall business dual routing planning.

[0074] To support the integrated computing power optical network service, the computing power optical network architecture is divided into the infrastructure layer, computing power orchestration layer and business application layer from the perspective of logical function. Among them, the computing power orchestration layer is the key capability platform for realizing computing power optical network services. The overall architecture of computing power optical network services is as follows: Figure 2 shown.

[0075] The computing power optical network architecture can be logically divided into the infrastructure layer (or optical network infrastructure layer), the computing power orchestration layer and the business application layer. The infrastructure layer is the foundation of the computing power optical network, and its function is to form a multi-level, three-dimensional and ubiquitous distributed optical equipment network system for the cloud, edge and end; the computing power orchestration layer is the scheduling center of the computing power network, and its function is to achieve flexible combination of computing power resources of the computing power optical network, and combine artificial intelligence (AI) and big data technology to achieve unified management, orchestration, scheduling and optimization of computing network resources; the business application layer is the service and capability provision platform of the computing power network, providing customers with one-stop service and intelligent and seamless experience.

[0076] 1. Infrastructure layer: Use network infrastructure to build network connections, which is the foundation for all upper layers, including hardware devices such as servers, storage, and network devices, as well as host operating systems, cloud operating systems, and virtualized network functions deployed on the basis of hardware devices. In terms of physical location, it not only includes the physical facilities of a cabinet and a computer room, but also covers the cross-regional resource integration of a data center and multiple data centers, provides communication through the network to ensure distributed deployment, and provides computing resource information distribution functions, providing overall computing capabilities for the upper layer.

[0077] Optionally, the infrastructure layer includes: at least one of an optical resource device, a data center, a resource discovery module, a resource modeling module, a resource supervision module, and a resource configuration optimization module, which together realize the management of basic resources in the all-optical computing power network, wherein:

[0078] 1) Resource discovery module, used to discover and identify multi-dimensional heterogeneous optical network computing resources in an active / passive manner;

[0079] 2) Resource modeling module, used to model and jointly model the basic optical network resources through formal expressions;

[0080] 3) Resource monitoring module, which is used to track the various states of optical network resources, including resource trusted service status, resource consumption, and utilization rate. It also tracks the status of each stage of the basic resource utilization during the execution of various tasks;

[0081] 4) Resource optimization configuration module, which is used to reconfigure the resource deployment of the computing power optical network according to the task feature information and resource status information collected during the optical network resource supervision process, in order to improve resource utilization and task completion efficiency.

[0082] In the infrastructure system, the network control plane needs to perceive the storage resources and computing resource status of the computing nodes in real time. Assume that there are M terminals in the computing power-aware network system, and the set of terminal devices is represented as M = {1, 2, ..., M}, where m∈M represents a terminal, and each terminal initiates at most one computing task processing request at a time.

[0083] Assume that there are K user services in the computing power optical network system, and the set of user services is represented by k = {1, 2, ..., K}, where k∈K represents a user service. The kth user service can be represented by S k (A k ,X k ,C k ,D kmax ,D ka ,B k ), where A k represents the routing node accessed by user service k, X k represents the quantitative value of the storage resources required by user service k, C k represents the quantized value of the computing resources required by user service k (CPU revolutions / bit data / second, i.e., the CPU revolutions required to process a unit bit of data per unit time), D kmax represents the maximum service processing delay allowed for user service k, D ka represents the delay of user service k accessing the routing node, B k Indicates the size of user service k.

[0084] The user service requested by the terminal is transmitted to the edge wireless access point in the computing power-aware network through a wireless link. According to Shannon's theorem, the user service k is transmitted to the accessed routing node A. k The data transmission rate can be expressed as This application mainly studies how to route and dispatch service requests sent by terminals to the best computing power node for service processing based on the perceived information in the computing power perception network. Therefore, the location distribution of user services is not considered, but the data transmission rate from user services to the connected routing nodes is uniformly quantified. k The access delay is:

[0085]

[0086] In the computing power-aware network, the user service requested by the terminal transmits data between adjacent routing nodes through dynamic communication links. Assuming that the data transmission rate of the dynamic link between routing nodes in the computing power-aware network can be perceived, it can be expressed as:

[0087]

[0088] In the formula, w i,j represents the data transmission rate between routing node i and routing node j, satisfying

[0089]

[0090] Therefore, the transmission delay of user service k between routing node i and routing node j is:

[0091]

[0092] In a computing power-aware network system, the network control plane needs to perceive the storage resources and computing power resource status of computing nodes in real time. Assuming that there are N computing nodes in the network, the set of computing nodes is represented by N = {1, 2, ..., N}, n∈N represents a computing node, then the nth computing node can be represented as Z n (A n ,X n ,C n ,R n ), where A n Indicates the routing node label to which the computing node is connected, X n Indicates the storage resource size of the computing node, C n Indicates the computing power of the computing node (CPU revolutions / bit data / second, i.e., the number of CPU revolutions required to process a unit bit of data per unit time), R n Indicates the data transmission rate from the computing node to the routing node.

[0093] In summary, when the storage resources and computing resources of the computing nodes meet the user's business requirements, the computing latency of the user's business is:

[0094]

[0095] Under the constraints of computing resources and storage resources, the scheduling transmission delay of user services is minimized as the optimization goal, and routing control, computing node selection and storage, and computing power optical resource allocation are jointly optimized. The total delay of a task processing includes at least one of the task access delay, task transmission delay, task arrival at the computing node delay, task processing delay, and task waiting delay. Since the task processing delay and task waiting delay are unified under the condition of a certain computing power requirement, they can be ignored in the optimization model. Therefore, the transmission delay from user service k to the scheduled computing node is:

[0096] T k,t =D ka +D k,i,j +D k,n (6)

[0097] The node risk value refers to the impact caused by the failure of the optical network node. This application mainly considers the failure probability, importance and carrying business of the node. As some equipment in the existing optical network system is old and the failure rate is rising, some equipment models have been discontinued and after-sales service has been terminated, so the reliability has decreased and the risk has increased; in addition, factors such as manufacturing defects and human damage have also increased the probability of node failure. However, the calculation of node failure probability is not complicated. It can be calculated by collecting historical data from the network management system and using statistical methods with the formula Get, P i v represents the probability of failure, Indicates that any node v in the time period T i The number of failures is actually counted on a yearly, monthly, weekly, etc. basis.

[0098] At the same time, the impact of optical communication network failures will further spread in the network through adjacent nodes or links, continuously degrading network performance. Intuitively, nodes with larger node degrees or more critical nodes in the network play a greater role in fault propagation, and the node importance is higher. Node betweenness is a global characteristic quantity that describes the importance and influence of nodes in complex networks. It can be expressed as the ratio of the number of shortest paths passing through a node to the total number of shortest paths between any pair of nodes in the network. Obviously, the larger the betweenness, the more critical the position of a node in the network, and the higher the node importance. Further, the following two conclusions can be drawn: 1) The larger the node degree, the stronger the node connectivity, corresponding to a wider range of fault propagation after a fault occurs; 2) The larger the node betweenness, the faster the fault will affect network performance. Therefore, in order to comprehensively measure the impact of node degree and node betweenness on fault propagation from the perspective of network topology, this application introduces the node degree-betweenness correlation index (Degree-Betweenness Value, DBV), which is defined as follows:

[0099]

[0100] here For node v i DBV; For node v i ; τ is the adjustment coefficient, which is mainly used to eliminate the situation where the difference between node betweenness and degree is too large, and can be adjusted according to actual conditions. is the node betweenness, and the calculation formula is:

[0101]

[0102] in, Represents any node pair v s and v d The number of shortest paths between Indicates passing through node v i The number of shortest paths.

[0103] Different from general communication networks, computing devices of different levels in computing power optical networks play different roles in the network. Node importance indicates the criticality of a node in an optical network. Node importance is related to the device level and device scale. Generally speaking, the higher the device level and the wider the device jurisdiction area, the higher the control level. In particular, the communication equipment in the dispatch center is the most important in the network. Assuming that there are μ different device level values ​​in the network, the node level value set is To facilitate calculation, the voltage values ​​at different sites are standardized:

[0104]

[0105] in, is the normalized site voltage value; ξ i is node v i The level value, ξ min ,ξ max Level Sets The minimum and maximum values ​​in . The final node importance calculation formula is as follows:

[0106]

[0107] here, Node v i importance; α1 and β1 are weight coefficients of site voltage level and DBV index respectively, and α1+β1=1. During calculation, α1 and β1 can be assigned according to actual needs.

[0108] In addition, the business load on the node device also affects the size of the node risk value, so the business load can be represented by the number of services carried on the node. In other words, the more services carried on the node device, the greater the node load, and the greater the loss or impact caused by the node failure. Therefore, the node risk value calculation formula is expressed as follows:

[0109]

[0110] Among them, node v i For business k Nodes on the routing path; For node v i The service set carried on P i v For node v i Probability of failure, Represents node v i The importance of

[0111] During the dual routing planning process, the following constraints must also be met:

[0112] Routing uniqueness: A unique routing path must be assigned to each service in the network. rk is a binary variable, r is the number of candidate paths for the business office, if p(k) is determined as the routing path for the business office, then y rk =1, otherwise y rk =0, the related constraints are described as follows:

[0113]

[0114] Path acyclic: Each service route should satisfy the acyclic constraint, that is:

[0115]

[0116] is the decision variable.

[0117]

[0118] Link bandwidth: In the pre-configured dual-route planning, it is assumed that the service uses dedicated protection on the backup route. To ensure rapid service recovery after a failure and prevent network congestion, the bandwidth resources allocated to all services should be less than the link bandwidth threshold. This constraint is expressed as follows:

[0119]

[0120] in, For business kbandwidth demand; |S| is the total number of services; γ is the bandwidth resource reservation ratio under different protection modes; ζ is the link bandwidth.

[0121] This application takes the business of route planning as the research object, takes minimizing the total communication delay of the business and the balance of network risks as the optimization goal, and uses the communication delay of a single business, link bandwidth, and two-way intersection as constraints to perform route modeling, so as to ensure the real-time performance of the route planning solution and the balanced distribution of network risks at the same time. Based on the vector-based multi-objective joint optimization problem definition method, the objective function is expressed as:

[0122]

[0123] is a vector consisting of two objective functions, and the optimal solution is a one-dimensional column vector consisting of k elements, that is

[0124] The constraints of the objective function are as follows:

[0125]

[0126]

[0127]

[0128]

[0129]

[0130] In the formula, K n represents the set of all user services scheduled to computing node n, constraint (20) indicates that the storage resources available to all user services scheduled to the computing node do not exceed the storage resources that the computing node can provide, and constraint (21) indicates that the computing resources available to all user services scheduled to the computing node do not exceed the computing resources that the computing node can provide.

[0131] 2. Computing power orchestration layer: Centralized and unified management and control of computing power resources and network resources, and ensuring latency determinism and path optimization; computing power control mainly manages distributed computing and storage resources in a centralized and unified manner, including real-time monitoring of resource load conditions to provide elastic resources for function computing processing, with flexible scaling capabilities; connecting to heterogeneous infrastructure resources, shielding the impact of heterogeneity on application deployment, and realizing the abstraction and management of multi-level ubiquitous computing power; at the same time, connecting to distributed infrastructure resources to achieve hierarchical control.

[0132] The computing power orchestration layer includes: at least one of a computing power decomposition module, a computing power management module, a resource storage module, a computing power scheduling module, a computing power monitoring module and a computing power integration module, wherein:

[0133] 1) The computing power deconstruction module decomposes the diverse, large-scale, and complex computing power requirements into small-scale and simplified computing power requirements based on business logic, resource requirements, performance requirements, service continuity, business flow stickiness, and resource node uniformity;

[0134] 2) Computing power management module, which is used to uniformly manage and control computing power resources and network resources, and ensure latency determinism and path optimization;

[0135] 3) Resource storage module: computing nodes store data generated by business calculations;

[0136] 4) The computing power scheduling module is responsible for publishing the current computing power status and network status as routing information to the network, by comprehensively considering the network status and computing resource status;

[0137] 5) Computing power monitoring module, used to monitor the load status of computing power resources and network resources in real time;

[0138] 6) Computing power integration module, used for centralized and unified management of distributed computing and storage resources;

[0139] Optional, computing power light resource scheduling process:

[0140] The user first initiates an application on the computing power trading platform, including the demand for computing power resources and latency requirements. After receiving the user's transaction application, the computing power trading platform will first query the computing power network management and orchestration system for relevant computing power resource information and network resource information. If necessary, the computing power optical network management and orchestration platform can also initiate an end-to-end latency measurement process to obtain more accurate latency information.

[0141] Step 1: The computing power optical network consumer submits a service application, such as site location, computing power optical resource requirements, connection service requirements, etc.

[0142] Step 2: The computing power optical network trading platform generates a computing power optical network resource view based on the business application of the computing power optical network consumer. It takes the computing power optical network consumer as the center and integrates possible computing power resource pools, related network connection resources, etc. into one view.

[0143] Step 3: The computing power optical network trading platform plans the route with the minimum communication delay as the main service route based on the risk perception and dual routing allocation algorithm of the non-dominated sorting genetic algorithm (NSGAII), and the route with the minimum risk as the backup service route.

[0144] Step 4: The computing power trading platform dispatches computing power resources, establishes network connections, etc., and updates the corresponding idle resource information through the computing power network management and orchestration system according to the transaction contract.

[0145] Step 5: The computing power trading platform will continue to track resource usage until the transaction end time set by the transaction contract, at which time the computing power trading platform will terminate the service and release computing power resources and network resources.

[0146] 3. Business application layer: This part mainly includes new businesses and applications deployed in the computing power optical network. These businesses and applications can access and call the function services provided by the platform through the corresponding function application programming interface (Application Programming Interface, API); at the same time, according to the application's own situation, it can put forward requirements for the computing power orchestration layer, control the underlying network and resource orchestration through the computing power orchestration layer, and have elastic and scalable capabilities.

[0147] The business application layer is the layer that users of the computing power optical network directly contact. Its main function is to provide users with an interface to access the computing power optical network, collect user business information and match it to improve user satisfaction.

[0148] Optionally, the business application layer includes: at least one of a business expression module, a service opening module, a business collection module, a computing power request module, a computing power display module and a computing power transaction module, wherein:

[0149] 1) Business expression module, used to formulate and parse business expression templates;

[0150] 2) Service openness module, which is used to display the services that the computing power optical network can provide and the currently available service resources, and match them with the services required by users to determine whether the corresponding services can be provided;

[0151] 3) User service collection module, which is used to record and save relevant information of users’ service requests for the computing power optical network and conduct user satisfaction surveys.

[0152] 4) Computing power request module, used to serve users, who can select specific computing power nodes based on performance and time requirements;

[0153] 5) The computing power display module is used to display the idle computing power resources in the current computing power network and the performance characteristics of each computing power resource;

[0154] 6) Computing power trading module, used by users to complete computing power demand transactions;

[0155] In the embodiment of this application, firstly, after clarifying the network topology and service communication index requirements, the access delay, transmission delay, and calculation delay of the computing power node in the computing power optical network are considered according to the communication delay modeling. While ensuring the user experience and minimizing the communication delay, we plan a main route for subsequent computing power scheduling.

[0156] Secondly, we consider the carrying capacity of the core nodes and the load balancing of the entire network, because the core nodes often carry most of the business tasks. Once a core node has a problem, it will greatly affect the operation of the network. Therefore, we model the node load based on factors such as the equipment scale and business carrying conditions of the optical network nodes, and plan a backup route with the smallest load and the highest risk resistance.

[0157] Finally, the multi-objective optimization problem with constraints such as business requirements, bandwidth resources, and dual routing independence is solved using an intelligent optimization algorithm. The routing information obtained is then uploaded to the computing power orchestration layer. The control node of the computing power orchestration layer schedules computing power according to the routing information, establishes network connections, and updates the corresponding idle resource information. If the scheduled computing power node is too far away and exceeds the threshold, the business priority will be reduced and the computing power node will be released. When there are enough free computing power nodes, the planned route is recalculated until all businesses are completed.

[0158] In order to better understand this application, Figure 3 The embodiments of the present application are further described in detail. This embodiment has no special restrictions on the optical network topology, number of nodes and number of terminal devices used by the system; and has no clear restrictions on its access mechanism and access time.

[0159] The specific implementation process is as follows:

[0160] Step 1: Initialize the computing power optical network device parameter information.

[0161] Step 2: The user initiates a transaction request and randomly obtains computing resources.

[0162] Step 3: Generate all transmission paths to form a multi-source point weighted graph that changes in real time.

[0163] Step 4: Select the shortest delay and its corresponding specific scheduling path.

[0164] Step 5: According to the highest scheduling level strategy, calculate the number of frequency slots required for the currently selected path.

[0165] Step 6: Determine whether the transmission distance exceeds the threshold value. If so, execute step 7; otherwise, execute step 12.

[0166] Step 7: Determine whether all paths have been traversed. If so, go to step 8, otherwise return to step 5.

[0167] Step 8: The current request is blocked.

[0168] Step 9: Get the current request processing status and update the number of blocked requests for all requests.

[0169] Step 10: Wait for the computing power node to be released and lower the priority of the business request.

[0170] Step 11: Determine whether the number of blocked requests is released to 0. If so, end the process, otherwise return to step 2;

[0171] Step 12: Allocation of computing power and optical network resources.

[0172] Step 13: The current request is processed and then step 9 is executed.

[0173] In order to better understand the present invention, the present invention is further described in detail in combination with the embodiments. The specific implementation process is as follows: Step 1: Computing node status Z, computing node number N, link status W, computing power demand S, and user service number K in the computing power-aware optical network.

[0174] Step 2: Initialize the computing power optical network equipment information, integrate the cross-regional resources of the data center and multiple data centers, calculate the number of nodes N, and the link status W in the computing power perception network.

[0175] Step 3: The user initiates an application on the computing power trading platform, including the demand for computing power resources and latency requirements.

[0176] Step 4: To ensure fairness to users, computing tasks randomly obtain computing resources from the network. Based on the accumulation and analysis of task feature data and resource status information, the layout of the computing network is reconfigured, including the redistribution of computing node density and network bandwidth.

[0177] Step 5: Calculate the transmission delay of user services through any link in the network based on the information perceived by the network. All terminal devices, routing nodes, computing nodes and dynamic link delays constitute a real-time changing multi-source point weighted graph.

[0178] Step 6: Initialize the population, set the number of iterations g = 1 and calculate the network risk balance value and the total communication delay value at the initial service distribution.

[0179] Step 7: Perform selection, crossover and mutation operations on P1 and generate a new population N1. g 、N g Get R g . Calculate the new population P gCorresponding objective function values, perform fast non-dominated sort and calculate crowding distance.

[0180] Step 8: Select the best m chromosomes to generate population P g+1 . g+1 Perform selection, crossover, mutation operations and generate population N g+1 .

[0181] Step 9: When the number of iterations reaches the set value, the path with the minimum communication delay is output as the main service routing plan, and the routing plan with the minimum risk balance value is selected as the backup service routing plan.

[0182] Step 10: According to the lowest delay level priority strategy, calculate the number of frequency slots required for the currently selected path.

[0183] Step 11: Count the number of frequency slots at this time to see if it exceeds the transmission distance threshold.

[0184] Step 12: If the transmission distance threshold is exceeded, check whether all paths have been traversed. If all paths have been traversed, output that the current request is blocked. Finally, get the current request processing status and update the number of blocked requests for all requests.

[0185] Step 13: If the transmission distance threshold is not exceeded, the computing power optical network resource node is allocated according to the path information, and the current request is processed and is not counted in the number of blocked requests.

[0186] Step 14: Update the number of blocked requests for all requests, wait for the computing power nodes to be released, and lower the priority of business requests.

[0187] Step 15: Check whether the blocked service is 0. If there is a blocked service, the blocked service generates request information again and reconfigures the path according to the newly added computing power optical network resources. If the blocked service is 0, the allocation is completed.

[0188] In this application, a risk perception and dual routing allocation algorithm based on NSGA II is adopted.

[0189] Fast NSGA II with elite strategy. The elite strategy means that the parent individuals with good performance in the population iteration process will be retained. This strategy can improve the population performance during the algorithm execution process; the crowding distance quantifies the distance between the individual at the same front end and the other two adjacent individuals. By calculating the crowding distance, the population diversity is maintained on the one hand, and the algorithm convergence is accelerated at the same time. However, due to the competition between multiple objective functions, decision makers need to compromise among multiple approximate optimal solutions according to specific requirements when determining the final solution. Figure 4 The execution process of the NSGA II algorithm is given, and the specific steps are as follows:

[0190] Step 1: Randomly generate an initial population P1.

[0191] Step 2: Set the evolution iteration number g=1.

[0192] Step 3: Perform selection, crossover and mutation operations on P1 and generate a new population N1;

[0193] Step 4: Merge population P g 、N g Get R g .

[0194] Step 5: Calculate the new population P g The corresponding objective function value;

[0195] Step 6: Perform fast non-dominated sort;

[0196] Step 7: Calculate crowding distance;

[0197] Step 8: Select the best m chromosomes to generate population P g+1 .

[0198] Step 9: P g+1 Perform selection, crossover, mutation operations and generate population N g+1 .

[0199] Step 10: Determine whether g is less than the threshold value g max , if so, return to step 4; otherwise, output the result.

[0200] In NSGA II, the encoding and decoding methods of chromosomes will directly affect the performance of the algorithm. In order to improve the efficiency of encoding and decoding and realize unified routing planning for all services, this application adopts a fixed-length integer encoding method. Each chromosome represents a routing planning scheme, and each chromosome is composed of multiple independent chromosome segments, each chromosome segment corresponds to a service path, and the length of the chromosome segment depends on the number of network nodes. To this end, it is necessary to number the network nodes first, and then randomly generate gene bits according to the number of network nodes. From the above encoding process, it can be seen that the length of each chromosome is the product of the number of network nodes and the number of services.

[0201] In the decoding process, a decoding method based on position priority is adopted. The service source point is defined as the first node on the path, and then according to the relationship between nodes in the network topology adjacency matrix, a node with a high priority, i.e. a large position index, is selected as the next hop node, and the process is repeated until the service destination node is reached.

[0202] The selection operator is the process of selecting excellent individuals from the old population with a certain probability to form a new population. This application uses the binary tournament method and elite strategy to implement the selection operation. In the mutation operator, the mutant chromosome is selected according to the set mutation probability and the positions of two genes in the same chromosome segment are exchanged to achieve population diversity.

[0203] In this embodiment, first, after clarifying the network topology and business communication indicator requirements, node risk modeling is performed according to factors such as network structure, site level and business load, and the overall risk balance value of the network is calculated; at the same time, taking into account business performance, the high-reliability business dual routing planning problem is modeled as a multi-objective optimization problem with the overall risk balance value of the network and the end-to-end communication delay of the business as the optimization target, and with business requirements, bandwidth resources, dual routing independence, etc. as constraints, and an intelligent optimization algorithm is used to solve it, and finally the purpose of solving the overall business dual routing planning is achieved. Finally, with computing as the center and light as the foundation, the network, cloud, data, intelligence, security, edge, end, chain, etc. are deeply integrated to provide a new type of information infrastructure through integrated services. The computing power optical network aims to connect ubiquitous computing power through an optical transmission network, break through the performance limit of single-point computing power, give full play to the scale efficiency advantages of all-optical computing power, and serve all walks of life in society.

[0204] See also Figure 5 , an embodiment of the present application provides a resource processing device, the device 500 includes:

[0205] An acquisition module 501 is used to acquire a primary routing path and a backup routing path for a user service, wherein the communication delay of the primary routing path is minimal and the node risk value of the backup routing path is minimal, and the node risk value indicates the impact caused by a node failure;

[0206] The first determining module 502 is used to determine a target routing path according to the primary routing path and the backup routing path, and schedule the user service to a node of the target routing path for service processing.

[0207] In one embodiment of the present application, the acquisition module 501 is further used to:

[0208] According to the optimization target and / or the constraint condition of dual routing naturalization, a main routing path of the user service and a backup routing path are obtained;

[0209] Wherein, the optimization goal includes at least one of the following: minimizing the total communication delay of the service and balancing the network risk as the optimization goal;

[0210] The constraints of the dual routing naturalization include at least one of the following: routing uniqueness, path acyclicity, the size of bandwidth resources allocated to all services should be less than the link bandwidth threshold, the storage resources available to all user services scheduled to the computing node do not exceed the storage resources that the computing node can provide, and the computing resources available to all user services scheduled to the computing node do not exceed the computing resources that the computing node can provide. In one embodiment of the present application, obtaining the main routing path of the user service includes:

[0211] A main routing path of the user service is determined according to at least one of an access delay of the user service to the accessed node, a transmission delay of the user service between adjacent nodes, and a calculation delay of the user service.

[0212] In one implementation of the present application, obtaining the main routing path of the user service also includes:

[0213] Determine at least one of the access delay of the user service to the accessed node, the transmission delay of the user service between the adjacent nodes and the computing delay of the user service based on at least one of the size of the user service, the data transmission rate of the user service to the accessed node, the data transmission rate between the user service to the adjacent nodes and the computing power size of the user service to the accessed node.

[0214] In one implementation of the present application, obtaining a backup routing path for a user service includes:

[0215] Determine a backup routing path for the user service based on at least one of the failure probability, importance, and service load of the user service to the accessed node; wherein the importance indicates the criticality of the node in the optical network.

[0216] In one embodiment of the present application, the device further comprises:

[0217] The second determination module is used to determine the importance of the node according to the voltage value of the node and the degree-intermediacy correlation index of the node, wherein the degree-intermediacy correlation index of the node is determined based on the node intermediacy and the node degree of the node, wherein the larger the node degree is, the stronger the node connectivity is, corresponding to a wider range of fault propagation after the fault occurs, and the larger the node intermediacy is, the faster the node fault will affect the network performance.

[0218] In one implementation of the present application, the first determination module is further configured to:

[0219] According to the lowest delay level priority strategy, as well as the main routing path and the backup routing path, a target routing path is determined, and the user service is dispatched to a node of the target routing path for service processing.

[0220] In one implementation of the present application, the step of scheduling the user service to a node on a target routing path for service processing includes:

[0221] Scheduling computing power according to the routing information of the target routing path, establishing a network connection and updating corresponding idle resource information;

[0222] If the distance of the scheduled node is greater than the transmission distance threshold, the service priority is lowered and the node is waited for to be released; the planned route is recalculated until all services are completed.

[0223] In one implementation of the present application, if the distance of the scheduled node is greater than the transmission distance threshold, the service priority is lowered and the node is waited for to be released; the planned route is recalculated until all services are completed, including:

[0224] Calculate the number of frequency slots required for the currently selected target routing path;

[0225] Determine whether the number of frequency slots exceeds the transmission distance threshold;

[0226] If the transmission distance threshold is exceeded, check whether all paths have been traversed. If all paths have been confirmed to have been traversed, output that the current request is blocked, obtain the current request processing status, and update the number of blocked requests for all requests;

[0227] If the transmission distance threshold is not exceeded, the computing power optical network resource node is allocated according to the routing information of the target routing path, and the current request is processed and is not counted in the number of blocked requests;

[0228] Update the number of blocked requests for all requests, wait for the node to be released, and lower the priority of business requests;

[0229] Check whether the blocking service is 0. If there is a blocking service, the blocking service generates request information again and reconfigures the path according to the newly added computing power optical network resources; if the blocking service is 0, the allocation ends.

[0230] The device provided in the embodiment of the present application can achieve Figure 1 The various processes implemented by the method embodiment shown achieve the same technical effect and will not be described again here to avoid repetition.

[0231] like Figure 6As shown, the embodiment of the present application also provides a communication device 600, including a processor 601, a memory 602, a program or instruction stored in the memory 602 and executable on the processor 601, and the program or instruction is executed by the processor 601 to implement the above Figure 1 The various processes of the method embodiment can achieve the same technical effect. To avoid repetition, they will not be described here.

[0232] The embodiment of the present application also provides a readable storage medium on which a program or instruction is stored. When the program or instruction is executed by a processor, the above Figure 1 The various processes of the method embodiment shown can achieve the same technical effect, and will not be described again here to avoid repetition.

[0233] The processor is the processor in the terminal described in the above embodiment. The readable storage medium includes a computer readable storage medium, such as a computer read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0234] The steps of the method or algorithm described in conjunction with the contents disclosed in this application can be implemented in hardware or by executing software instructions in a processor. The software instructions can be composed of corresponding software modules, and the software modules can be stored in RAM, flash memory, ROM, EPROM, EEPROM, registers, hard disks, mobile hard disks, read-only optical disks, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor so that the processor can read information from the storage medium and write information to the storage medium. Of course, the storage medium can also be a component of the processor. The processor and the storage medium can be carried in an ASIC. In addition, the ASIC can be carried in a core network interface device. Of course, the processor and the storage medium can also exist in the core network interface device as discrete components.

[0235] Those skilled in the art should be aware that in one or more of the above examples, the functions described in this application can be implemented using hardware, software, firmware, or any combination thereof. When implemented using software, these functions can be stored in a computer-readable medium or transmitted as one or more instructions or codes on a computer-readable medium. Computer-readable media include computer storage media and communication media, wherein communication media include any media that facilitates the transmission of a computer program from one place to another. The storage medium can be any available medium that a general or special-purpose computer can access.

[0236] The specific implementation methods described above further illustrate the purpose, technical solutions and beneficial effects of the present application in detail. It should be understood that the above description is only the specific implementation methods of the present application and is not intended to limit the scope of protection of the present application. Any modifications, equivalent substitutions, improvements, etc. made on the basis of the technical solutions of the present application should be included in the scope of protection of the present application.

[0237] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the embodiments of the present application may adopt the form of complete hardware embodiments, complete software embodiments, or embodiments in combination with software and hardware. Moreover, the embodiments of the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.

[0238] The embodiments of the present application are described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0239] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0240] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0241] Obviously, those skilled in the art can make various changes and modifications to the embodiments of the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the embodiments of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

Claims

1. A resource scheduling method, characterized in that: include: Obtaining a primary routing path and a backup routing path for a user service, wherein the primary routing path has a minimum communication delay, and the backup routing path has a minimum node risk value, wherein the node risk value indicates an impact caused by a node failure; A target routing path is determined according to the primary routing path and the backup routing path, and the user service is dispatched to a node of the target routing path for service processing.

2. The method according to claim 1, characterized in that: Obtain the primary and backup routing paths for user services, including: According to the optimization target and / or the constraint condition of dual routing naturalization, a main routing path of the user service and a backup routing path are obtained; Wherein, the optimization goal includes at least one of the following: minimizing the total communication delay of the service and balancing the network risk as the optimization goal; The constraints of the dual routing naturalization include at least one of the following: routing uniqueness, path acyclicity, the size of bandwidth resources allocated to all services should be less than the link bandwidth threshold, the storage resources available to all user services scheduled to the computing node do not exceed the storage resources that the computing node can provide, and the computing resources available to all user services scheduled to the computing node do not exceed the computing resources that the computing node can provide.

3. The method according to claim 2, characterized in that Obtain the main routing path of the user's business, including: The main routing path of the user service is determined according to at least one of an access delay of the user service to the accessed node, a transmission delay of the user service between adjacent nodes, and a calculation delay of the user service.

4. The method according to claim 3, characterized in that Obtain the main routing path of the user's business, including: Determine at least one of the access delay of the user service to the accessed node, the transmission delay of the user service between the adjacent nodes and the computing delay of the user service based on at least one of the size of the user service, the data transmission rate of the user service to the accessed node, the data transmission rate between the user service to the adjacent nodes and the computing power size of the user service to the accessed node.

5. The method according to claim 2, characterized in that: Obtain alternate routing paths for user services, including: Determine a backup routing path for the user service based on at least one of the failure probability, importance, and service load of the user service to the accessed node; wherein the importance indicates the criticality of the node in the optical network.

6. The method according to claim 5, characterized in that The method further comprises: The importance of the node is determined according to the voltage value of the node and the degree-intermediacy correlation index of the node. The degree-intermediacy correlation index of the node is determined based on the node intermediacy and the node degree of the node. The larger the node degree, the stronger the node connectivity, which corresponds to a wider range of fault propagation after the fault occurs. The larger the node intermediacy, the faster the node fault will affect the network performance.

7. The method according to claim 1, characterized in that Determining a target routing path according to the primary routing path and the backup routing path, and dispatching the user service to a node of the target routing path for service processing, including: According to the lowest delay level priority strategy, as well as the main routing path and the backup routing path, a target routing path is determined, and the user service is dispatched to a node of the target routing path for service processing.

8. The method according to claim 7, characterized in that The step of dispatching the user service to a node on a target routing path for service processing includes: Scheduling computing power according to the routing information of the target routing path, establishing a network connection and updating corresponding idle resource information; If the distance of the scheduled node is greater than the transmission distance threshold, the service priority is lowered and the node is waited for to be released; the planned route is recalculated until all services are completed.

9. The method according to claim 8, characterized in that If the distance of the scheduled node is greater than the transmission distance threshold, the service priority is lowered and the node is waiting to be released. The planned route is recalculated until all services are completed, including: Calculate the number of frequency slots required for the currently selected target routing path; Determine whether the number of frequency slots exceeds the transmission distance threshold; If the transmission distance threshold is exceeded, check whether all paths have been traversed. If all paths have been confirmed to have been traversed, output that the current request is blocked, obtain the current request processing status, and update the number of blocked requests for all requests; If the transmission distance threshold is not exceeded, the computing power optical network resource node is allocated according to the routing information of the target routing path, and the current request is processed and is not counted in the number of blocked requests; Update the number of blocked requests for all requests, wait for the node to be released, and lower the priority of business requests; Check whether the blocking service is 0. If there is a blocking service, the blocking service generates request information again and reconfigures the path according to the newly added computing power optical network resources; if the blocking service is 0, the allocation ends.

10. A resource scheduling device, characterized in that: include: An acquisition module, used to acquire a main routing path and a backup routing path for a user service, wherein the communication delay of the main routing path is minimal, and the node risk value of the backup routing path is minimal, wherein the node risk value indicates the impact caused by a node failure; The first determination module is used to determine a target routing path according to the main routing path and the backup routing path, and dispatch the user service to a node of the target routing path for service processing.

11. A communication device, characterized in that: The method comprises a processor, a memory, and a program or instruction stored in the memory and executable on the processor, wherein the program or instruction, when executed by the processor, implements the steps of the method according to any one of claims 1 to 9.

12. A readable storage medium, characterized in that: The readable storage medium stores a program or an instruction, and when the program or the instruction is executed by a processor, the steps of the method according to any one of claims 1 to 9 are implemented.

Citation Information

Patent Citations

  • Double-route configuration method and device for power communication network

    CN106506357A

  • Power grid double-route planning method and system based on risk balance

    CN114513451A

  • Terminal service processing method and device

    CN114884862A

  • Calculation network route determination method, device and equipment and storage medium

    CN115086230A

  • Power business double-route planning method and device

    CN116016325A