A multi-dimensional resource cooperative scheduling method, system, terminal and medium for an all-optical switching network

Abstract

The application discloses a kind of multidimensional resource coordination scheduling methods, systems, terminals and media for all-optical switching network, method includes: when receiving service request set, determine to be handled request from service request set based on service priority;Generate candidate transmission path set, and filter out target transmission path from candidate transmission path set based on minimum bottleneck load criterion;On target transmission path, adopt hierarchical resource search strategy, according to the priority order of wavelength channel, polarization state, space mode traverses resource tuple;When searching idle resource tuple that meets the condition, allocate idle resource tuple for to-be-processed request, update resource state tensor, and encapsulate the resource tuple that has been allocated as logical resource unit.The application does not need to change the optical switching matrix hardware structure of switching node, is only realized in the software logic of scheduling control plane, easy to deploy in engineering, applicable to the all-optical switching network scene of wavelength resource shortage.

Description

Technical Field

[0001] This invention relates to the field of network communication technology, and in particular to a multi-dimensional resource collaborative scheduling method, system, terminal, and medium for all-optical switching networks. Background Technology

[0002] All-optical switching technology, by routing and switching signals directly in the optical domain, avoids the rate bottlenecks and power consumption associated with traditional optical-electrical-optical conversion, making it one of the key technologies for next-generation high-speed optical communication networks. In all-optical switching networks, the scheduling and allocation of link resources is a core issue, and its performance directly determines the network's switching capacity and service carrying capacity.

[0003] Currently, resource management in all-optical switching networks primarily revolves around the wavelength dimension. This involves transmitting multiple wavelength channels over a single optical fiber using Wavelength Division Multiplexing (WDM) technology, and allocating wavelength resources to service requests using Routing and Wavelength Assignment (RWA) algorithms. Under a standard 100GHz channel spacing in the C-band, the number of available wavelength channels per link is approximately 40, and resource space is limited by the number of available wavelengths.

[0004] With the development of optical fiber transmission technology, polarization division multiplexing (PDM) and space division multiplexing (SDM) technologies have been extensively studied at the transmission layer. However, most of the research on these technologies focuses on physical layer transmission performance. In the field of resource scheduling algorithms at the switching layer, there is currently a lack of systematic technical solutions on how to incorporate polarization state and spatial mode as independent switching dimensions into the resource scheduling framework.

[0005] Therefore, existing technologies still need improvement. Summary of the Invention

[0006] To address the aforementioned shortcomings of existing technologies, this invention provides a multi-dimensional resource collaborative scheduling method, system, terminal, and medium for all-optical switching networks. It aims to solve the problems of existing switching resource scheduling relying solely on a single wavelength dimension, resulting in high service blocking rates due to insufficient resource space under high load. The technical solution adopted by this invention is as follows: In a first aspect, the present invention provides a multi-dimensional resource collaborative scheduling method for all-optical switching networks. The method is applied to switching nodes and the scheduling control plane in the all-optical switching network, and the method includes: When a set of business requests is received, requests to be processed are determined from the set of business requests based on business priority; For the request to be processed, a set of candidate transmission paths is generated, and a target transmission path is selected from the set of candidate transmission paths based on the minimum bottleneck load criterion. On the target transmission path, a hierarchical resource search strategy is adopted to traverse resource tuples in priority order of wavelength channel, polarization state, and spatial mode. When a free resource tuple that meets the conditions is found, the free resource tuple is allocated to the request to be processed, the resource state tensor of all links on the target transmission path is updated, and the allocated resource tuple is encapsulated into a logical resource unit.

[0007] In one implementation, the method further includes: The physical resources of each link in the all-optical switching network are characterized by three orthogonal scheduling dimensions: wavelength channel, polarization state, and spatial mode. Any combination of a wavelength channel, a polarization state, and a spatial mode is used as an independently allocable resource tuple. A corresponding three-dimensional resource state tensor is generated for each link. The element values ​​of the resource state tensor are used to represent whether the corresponding resource tuple is in an idle or occupied state.

[0008] In one implementation, determining the requests to be processed from the set of business requests based on business priority includes: All business requests in the business request set are sorted by business priority according to business priority, and the resource status tensor set of the entire network at the current moment is obtained. Select the highest priority business request as the pending request.

[0009] In one implementation, business priority sorting aims to minimize the weighted connection establishment latency, and the objective function is: ,in, For the first The priority coefficient of each business request. For the first The chain establishment delay for each business request.

[0010] In one implementation, selecting a target transmission path from the set of candidate transmission paths based on the minimum bottleneck load criterion includes: Calculate the bottleneck node resource load rate for each candidate path in the candidate transmission path set. The bottleneck node resource load rate is the ratio of the number of resource tuples occupied by the node to the total resource tuple capacity of the node. The candidate path with the lowest resource load rate of the bottleneck node is selected as the target transmission path.

[0011] In one implementation, a hierarchical resource search strategy is employed along the target transmission path, traversing resource tuples according to priority order of wavelength, polarization state, and spatial mode, including: Under the current polarization state and current spatial mode, traverse all wavelength channels in sequence and check whether the corresponding resource tuples of all links on the target transmission path are in an idle state. If a resource tuple that satisfies the condition of being free along the entire path exists, the search terminates and the search is considered successful. If all wavelength channels are occupied in the current polarization state, switch to another orthogonal polarization state, reset the wavelength traversal index, and re-execute the full wavelength channel traversal verification. If all wavelength channels under two orthogonal polarization states are occupied, switch to the next spatial mode, reset the polarization state traversal index and wavelength traversal index, and repeat the traversal verification process of polarization state and wavelength channels until all spatial modes have been traversed.

[0012] In one implementation, a hierarchical resource search strategy is employed along the target transmission path, traversing resource tuples according to priority order of wavelength, polarization state, and spatial mode. This also includes: When no available resource tuple is found after traversing all wavelength channels, polarization states, and spatial modes, the pending service request is stored in a waiting queue and will re-participate in scheduling after the resources in the network are released.

[0013] Secondly, embodiments of the present invention also provide a multi-dimensional resource collaborative scheduling system for all-optical switching networks, wherein the system is used to implement the steps of the multi-dimensional resource collaborative scheduling method for all-optical switching networks described in any of the above solutions, and the system includes: The business request filtering module is used to determine the requests to be processed from the business request set based on business priority when a business request set is received. The transmission path filtering module is used to generate a set of candidate transmission paths for the request to be processed, and to filter out the target transmission path from the set of candidate transmission paths based on the minimum bottleneck load criterion. The resource tuple traversal module is used to traverse resource tuples along the target transmission path using a hierarchical resource search strategy, according to the priority order of wavelength channel, polarization state, and spatial mode. The resource tuple allocation and encapsulation module is used to allocate the idle resource tuple to the pending request when an idle resource tuple that meets the conditions is found, update the resource state tensor of all links on the target transmission path, and encapsulate the allocated resource tuple into a logical resource unit.

[0014] Thirdly, embodiments of the present invention also provide a terminal, wherein the terminal includes a memory, a processor, and a multi-dimensional resource collaborative scheduling program for all-optical switching networks stored in the memory and executable on the processor. When the processor executes the multi-dimensional resource collaborative scheduling program for all-optical switching networks, it implements the steps of the multi-dimensional resource collaborative scheduling method for all-optical switching networks described in any of the above schemes.

[0015] Fourthly, embodiments of the present invention also provide a computer-readable storage medium, wherein a multi-dimensional resource collaborative scheduling program for all-optical switching networks is stored on the computer-readable storage medium, and the multi-dimensional resource collaborative scheduling program for all-optical switching networks implements the steps of the multi-dimensional resource collaborative scheduling method for all-optical switching networks described in any of the above schemes on the computer-readable storage medium.

[0016] Beneficial Effects: Compared with existing technologies, this invention provides a multi-dimensional resource collaborative scheduling method for all-optical switching networks. The method is applied to switching nodes and the scheduling control plane in the all-optical switching network. When a set of service requests is received, requests to be processed are determined from the set based on service priority. Next, for the requests to be processed, a set of candidate transmission paths is generated, and a target transmission path is selected from the set based on the minimum bottleneck load criterion. Then, on the target transmission path, a hierarchical resource search strategy is adopted, traversing resource tuples according to the priority order of wavelength channel, polarization state, and spatial mode. Finally, when a free resource tuple that meets the conditions is found, it is allocated to the request to be processed, the resource state tensor of all links on the target transmission path is updated, and the allocated resource tuple is encapsulated into a logical resource unit.

[0017] By employing the method of this invention, the schedulable resource space of a single link is expanded from W wavelength channels to W×2×M resource units (W is the number of wavelengths, and M is the number of spatial modes), multiplying the switching capacity without changing the number of wavelength channels. Since the search priority is arranged in wavelength→polarization→spatial order, the algorithm only uses the wavelength dimension under low load, behaving consistent with traditional WDM scheduling; polarization and spatial dimensions are automatically enabled only under high load, ensuring compatibility with existing equipment deployments. The pooled encapsulation of Logical Resource Units (LRUs) ensures that the management complexity of multi-dimensional resources does not significantly increase with the number of dimensions.

[0018] The method of this invention does not require changes to the optical switching matrix hardware structure of the switching node (polarization diversity switching can be achieved by adding polarization beam splitters and beam combiners before and after the existing switching matrix), and is implemented only in the software logic of the scheduling control plane. It is easy to deploy in engineering and is suitable for all-optical switching network scenarios with limited wavelength resources. Attached Figure Description

[0019] Figure 1 This is a schematic diagram of the architecture of the all-optical switching network used in the multi-dimensional resource collaborative scheduling method for all-optical switching networks, as described in this embodiment of the invention.

[0020] Figure 2 This is a flowchart of a preferred embodiment of the multi-dimensional resource collaborative scheduling method for all-optical switching networks according to an embodiment of the present invention.

[0021] Figure 3 This is a schematic diagram of the multi-dimensional resource space model established in the multi-dimensional resource collaborative scheduling method for all-optical switching networks according to an embodiment of the present invention.

[0022] Figure 4 This is a schematic diagram of the state transition process of LRU in the multi-dimensional resource collaborative scheduling method for all-optical switching networks according to an embodiment of the present invention.

[0023] Figure 5 This is a schematic diagram illustrating the specific application process of the multi-dimensional resource collaborative scheduling method for all-optical switching networks according to an embodiment of the present invention.

[0024] Figure 6 This is a technical framework diagram of a multi-dimensional resource collaborative scheduling system for all-optical switching networks according to an embodiment of the present invention.

[0025] Figure 7 A schematic diagram of the terminal provided in an embodiment of the present invention. Detailed Implementation

[0026] To make the objectives, technical solutions, and effects of this invention clearer and more explicit, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.

[0027] The flowchart shown in the attached diagram is for illustrative purposes only and does not necessarily include all content, operations, or steps, nor does it require execution in the described order. For example, some operations or steps can be broken down, combined, or partially merged, so the actual execution order may change depending on the actual situation.

[0028] It should be understood that the terminology used in this specification is for the purpose of describing particular embodiments only and is not intended to limit the invention. As used in this specification and the appended claims, the singular forms “a,” “an,” and “the” are intended to include the plural forms unless the context clearly indicates otherwise.

[0029] It should be understood that, in order to clearly describe the technical solutions of the embodiments of the present invention, the terms "first" and "second" are used in the embodiments of the present invention to distinguish identical or similar items with essentially the same function and effect. For example, "first control information" and "second control information" are only used to distinguish different control information and do not limit their order.

[0030] Those skilled in the art will understand that the words "first" and "second" do not limit the quantity or the order of execution, and that the words "first" and "second" do not necessarily imply that they are different.

[0031] It should also be understood that the term “and / or” as used in this specification and the appended claims refers to any combination of one or more of the associated listed items and all possible combinations, and includes such combinations.

[0032] The working environment of the multi-dimensional resource collaborative scheduling method for all-optical switching networks in this embodiment is the switching nodes and electroplating control plane in the all-optical switching network. Its system architecture is shown in the attached figure. Figure 1 As shown. Specifically, the switching nodes are located in the network data plane. Each switching node includes an Optical Performance Monitoring (OPM) unit, a Polarization Beam Splitter (PBS), and two independent optical switching matrices (handling X-polarization and Y-polarization respectively). The OPM unit collects three types of parameters of the link in real time: wavelength power spectrum, Stokes polarization parameter, and mode coupling coefficient. The PBS splits the input optical signal into X and Y paths according to the polarization direction, sends them to the corresponding switching matrices for independent routing, and then combines them through the polarization beam combiner for output. This polarization diversity architecture is the hardware foundation for polarization state as an independent scheduling dimension. The scheduling control plane is located in the network control plane and includes three software modules: a resource status awareness module, a scheduling decision module, and a resource pool management module. The resource status awareness module receives monitoring data reported by the OPM units of each node and updates the resource status tensor according to a preset period. The scheduling decision module is the core control unit, responsible for receiving service requests, performing routing calculations, and multi-dimensional resource allocation, implementing the hierarchical resource search algorithm described in this invention. The resource pool management module is responsible for the creation, allocation, status management and reclamation of logical resource units (LRU), and provides a unified resource operation interface for the scheduling decision module.

[0033] The method in this embodiment can be applied to a terminal, which can be an intelligent electronic device such as a computer. Figure 2 As shown in the figure, the multi-dimensional resource collaborative scheduling method for all-optical switching networks in this embodiment specifically includes the following steps: Step S100: When a set of service requests is received, the requests to be processed are determined from the set of service requests based on the service priority.

[0034] In practical applications, this embodiment first characterizes the physical resources of each link in the all-optical switching network as three orthogonal scheduling dimensions: wavelength channel, polarization state, and spatial mode. Figure 3 The multidimensional resource space model in the image is shown below: Wavelength dimension This corresponds to W wavelength division multiplexing channels within the C-band. ; polarization dimension This corresponds to the two orthogonal polarization states P in X and Y; Spatial dimension This corresponds to the M linear polarization modes S supported by the few-mode fiber.

[0035] In this embodiment, a combination of any wavelength channel, a polarization state, and a spatial mode is used as an independently allocable resource tuple. A corresponding three-dimensional resource state tensor is generated for each link, and the values ​​of the elements of the resource state tensor are used to represent whether the corresponding resource tuple is in an idle or occupied state. Specifically, a resource tuple... A unique physical transmission channel is determined. The resource state tensor of link e at time t is defined. W represents the number of wavelengths, M represents the number of spatial modes, and the element value is 1 to indicate occupied and 0 to indicate idle. From Figure 3 As can be seen, the resource state tensor can be expanded into two two-dimensional matrices (corresponding to the X / Y polarization states respectively), with each matrix having a spatial pattern as its behavior and wavelength channels as its columns.

[0036] When the scheduling control plane receives the set of service requests, this embodiment sorts all service requests in the set according to their service priorities (sorted from highest to lowest priority π, where π=1 is the highest). Simultaneously, it obtains the resource status tensor set of the entire network at the current moment, and then selects the service request with the highest priority as the request to be processed. In one implementation, the service priority sorting aims to minimize the weighted connection establishment latency, and the optimization objective function is: ,in, For the first The priority coefficient of each business request. For the first The latency of establishing a connection for each business request. Weighting allows high-priority business requests to have a larger share in the objective function.

[0037] Step S200: For the request to be processed, generate a set of candidate transmission paths, and select the target transmission path from the set of candidate transmission paths based on the minimum bottleneck load criterion.

[0038] After identifying the requests to be processed, this embodiment can use the K-shortest path algorithm to generate a set of candidate transmission paths. When multiple equivalent candidate transmission paths exist, this embodiment can select the target transmission path from the set of candidate transmission paths based on the minimum bottleneck load criterion. Specifically, this embodiment can calculate the bottleneck node resource load rate of each candidate path in the set of candidate transmission paths. The bottleneck node resource load rate is the ratio of the number of resource tuples occupied by the node to the total resource tuple capacity of the node. Then, the candidate path with the lowest bottleneck node resource load rate is selected as the target transmission path.

[0039] Step S300: On the target transmission path, a hierarchical resource search strategy is adopted to traverse the resource tuples in the priority order of wavelength channel, polarization state, and spatial mode.

[0040] In this embodiment, the hierarchical resource search strategy is as follows: Publicly available resource tuples are searched along the selected path, prioritizing searches in the order of "wavelength channel → polarization state → spatial mode". First, all wavelength channels are traversed; if wavelengths are exhausted, the polarization state is switched to continue the search; if polarization states are exhausted, the spatial mode is switched to repeat the above process. Constraints include: conflict-free constraints (different services on the same link must not occupy the same resource tuple) and resource continuity constraints (the same service uses the same resource tuple across different segments of the link).

[0041] Specifically, this embodiment first traverses all wavelength channels sequentially under the current polarization state and spatial mode, verifying whether the corresponding resource tuples of all links on the target transmission path are in an idle state. If there is a resource tuple that satisfies the condition of the entire path being idle, the search terminates and is determined to be successful. If all wavelength channels under the current polarization state are occupied, the process switches to another orthogonal polarization state, resets the wavelength traversal index, and re-executes the full wavelength channel traversal verification. If all wavelength channels under both orthogonal polarization states are occupied, the process switches to the next spatial mode, resets the polarization state traversal index and the wavelength traversal index, and repeats the polarization state and wavelength channel traversal verification process until all spatial modes have been traversed. When no available resource tuple is found after traversing all wavelength channels, polarization states, and spatial modes, the pending service request is stored in a waiting queue and will re-participate in scheduling after resources in the network are released.

[0042] Step S400: When a free resource tuple that meets the conditions is found, the free resource tuple is allocated to the request to be processed, the resource state tensor of all links on the target transmission path is updated, and the allocated resource tuple is encapsulated into a logical resource unit.

[0043] In this embodiment, when a free resource tuple that meets the conditions is found, the free resource tuple is allocated to the request to be processed, the resource state tensor of all links on the target transmission path is updated, and the allocated physical resource tuple is encapsulated into a logical resource unit (LRU). The data structure is as follows: ,in, A unique identifier for LRU. These are the wavelength channel parameters corresponding to the LRU. These are the polarization state parameters corresponding to the LRU. These are the spatial mode parameters corresponding to LRU. To assign timestamps, The release timestamp is used. The state value can be IDLE, ALLOCATED, or RESERVED. The LRU state transition process is shown in the appendix. Figure 4 As shown: IDLE → (Scheduling and Allocation) → ALLOCATED → (Service End) → IDLE is the normal lifecycle; IDLE → (Reservation Request) → RESERVED → (Confirm Allocation) → ALLOCATED is the reservation process; ALLOCATED → (Link Disconnection) → Migration Status → (Migration Complete) → IDLE (Release Original LRU) is the migration process in a dynamic topology scenario.

[0044] The effects of the technical solution of this invention are as follows: (1) Resource space expansion effect: By incorporating polarization state and spatial mode into the schedulable dimension, the theoretical resource space of a single link is expanded from W (pure wavelengths) to Resource units. Taking C-band 40-wavelength, 6-mode few-mode fiber as an example, the resource space is expanded from 40 to 480.

[0045] (2) Low load compatibility effect: The hierarchical search strategy is executed in the order of priority of “wavelength channel → polarization state → spatial mode”. Under low load, the algorithm only uses the wavelength dimension, and its behavior is completely consistent with the traditional WDM scheduling. The polarization and spatial dimensions are only automatically enabled when the wavelength resources are exhausted.

[0046] (3) Scheduling efficiency: The computational complexity of hierarchical search is Taking W=40 and M=6 as an example, only 480 searches are required, which is far lower than the exponential complexity of finding the global optimal solution and meets the requirements of real-time scheduling.

[0047] (4) Management decoupling effect: LRU pooling encapsulation shields the underlying physical differences of three-dimensional resources. The upper-level scheduler operates LRU only through a unified interface, and the management complexity does not increase significantly with the increase of the number of dimensions.

[0048] (5) Business continuity effect: LRU reservation state and migration mechanism support resource pre-allocation and business migration in dynamic topology scenarios, reducing business interruption time during link switching.

[0049] Furthermore, this invention also provides examples of specific application processes of the multi-dimensional resource collaborative scheduling method for all-optical switching networks, such as... Figure 5 The steps shown are as follows: Step S01: The service request arrives at the scheduling decision module. The scheduling decision module receives the set of service requests. Each request includes the source node, destination node, and priority level. Sort resources by priority from highest to lowest, and simultaneously query the resource status awareness module for the current resource status tensor set of the entire network. .

[0050] Step S02: Retrieve the highest priority unprocessed request. The K-shortest path algorithm is called to generate a set of candidate paths; the target transmission path with the lowest bottleneck load is selected according to the MBL criterion. .

[0051] Step S03: Wavelength dimension search. In the current polarization state and spatial patterns Next, iterate through wavelengths w=1,2,…,W to query the target transmission path. Check if all tensor elements corresponding to all links are 0. If a resource tuple with common free resources exists along the entire path, the search is successful, and the resource allocation operation is performed (allocating the tuple to the business). Update the tensor corresponding element of all links on the path to 1, notify the resource pool management module to create an LRU and set its status to ALLOCATED), and proceed to step S07; if there is a conflict in all wavelengths, proceed to step S04.

[0052] Step S04: Polarization dimension switching search. Switch the polarization state to another orthogonal polarization (p=p+1), reset the wavelength index w=1, and re-traverse all wavelength channels. If there is a free tuple in the entire path, the search is successful, perform resource allocation operation, and go to step S07; if there are no available resources for any wavelength under both polarization states, go to step S05.

[0053] Step S05: Spatial Dimension Switching Search. Switch the spatial mode to the next mode (s=s+1), reset the polarization index p=1 and wavelength index w=1, and re-traverse all combinations of polarization states and wavelength channels under this spatial mode. If there is a fully free tuple in the entire path, the search is successful, and resource allocation operation is performed, proceeding to step S07; if all spatial modes have been searched and no usable resources are found, proceed to step S06.

[0054] Step S06: Search failed. No usable resource tuples were found after exhausting the entire 3D resource space. Request... Enter the waiting queue. When an LRU is subsequently released (its state becomes IDLE), the requests in the waiting queue are re-scheduled according to priority. Proceed to step S07.

[0055] Step S07: Determine if there are any unprocessed requests. If so, return to step S02 to process the next request; if all requests have been processed, this round of scheduling ends.

[0056] In the above process, steps S03 to S06 are completed in one loop. When S04 is hit, the process can be exited in advance without executing subsequent steps.

[0057] Based on the above embodiments, the present invention also provides a multi-dimensional resource collaborative scheduling system for all-optical switching networks, the system being used to implement the steps of the above method embodiments. Specifically, as Figure 6 As shown, the system includes: a service request filtering module 10, a transmission path filtering module 20, a resource tuple traversal module 30, and a resource tuple allocation and encapsulation module 40. The service request filtering module 10, upon receiving a set of service requests, determines the requests to be processed from the set based on service priority. The transmission path filtering module 20, for the requests to be processed, generates a set of candidate transmission paths and filters out the target transmission path from the set of candidate transmission paths based on the minimum bottleneck load criterion. The resource tuple traversal module 30, on the target transmission path, uses a hierarchical resource search strategy to traverse resource tuples according to the priority order of wavelength channel, polarization state, and spatial mode. The resource tuple allocation and encapsulation module 40, when a free resource tuple that meets the search conditions is found, allocates the free resource tuple to the request to be processed, updates the resource state tensor of all links on the target transmission path, and encapsulates the allocated resource tuple into logical resource units.

[0058] The principles of each module in this embodiment of the multi-dimensional resource collaborative scheduling system for all-optical switching networks are the same as the implementation process of each step in the above method embodiment, and will not be elaborated further here.

[0059] Based on the above embodiments, the present invention also provides a terminal, the principle block diagram of which can be as follows: Figure 7 As shown. The terminal may include one or more processors 100 ( Figure 7(Only one is shown in the image), memory 101, and computer program 102 stored in memory 101 and executable on one or more processors 100. For example, a multi-dimensional resource collaborative scheduling program for all-optical switching networks. When one or more processors 100 execute computer program 102, they can implement the various steps in the multi-dimensional resource collaborative scheduling method embodiment for all-optical switching networks. Alternatively, when one or more processors 100 execute computer program 102, they can implement the functions of each module / unit in the multi-dimensional resource collaborative scheduling device embodiment for all-optical switching networks, which is not limited here.

[0060] In one embodiment, the processor 100 may be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor.

[0061] In one embodiment, memory 101 can be an internal storage unit of the terminal, such as a hard disk or RAM. Memory 101 can also be an external storage terminal of the terminal, such as a plug-in hard disk, smart media card (SM), secure digital card (SD), flash card, etc., all equipped on the terminal. Furthermore, memory 101 can include both internal and external storage units. Memory 101 is used to store computer programs and other programs and data required by the terminal. Memory 101 can also be used to temporarily store data that has been output or will be output.

[0062] Those skilled in the art will understand that Figure 7 The block diagram shown is merely a partial structural diagram related to the present invention and does not constitute a limitation on the terminal to which the present invention is applied. A specific terminal may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0063] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium. When executed, the computer program can include the processes of the embodiments of the above methods. Any references to memory, storage, databases, or other media used in the embodiments provided by this invention can include non-volatile and / or volatile memory. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in various forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), dual data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link DRAM (SLDRAM), direct memory bus RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

[0064] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features; and these modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A multi-dimensional resource collaborative scheduling method for all-optical switching networks, characterized in that, The method is applied to switching nodes and scheduling control planes in an all-optical switching network. The method includes: When a set of business requests is received, requests to be processed are determined from the set of business requests based on business priority; For the request to be processed, a set of candidate transmission paths is generated, and a target transmission path is selected from the set of candidate transmission paths based on the minimum bottleneck load criterion. On the target transmission path, a hierarchical resource search strategy is adopted to traverse resource tuples in priority order of wavelength channel, polarization state, and spatial mode. When a free resource tuple that meets the conditions is found, the free resource tuple is allocated to the request to be processed, the resource state tensor of all links on the target transmission path is updated, and the allocated resource tuple is encapsulated into a logical resource unit.

2. The multi-dimensional resource collaborative scheduling method for all-optical switching networks according to claim 1, characterized in that, The method further includes: The physical resources of each link in the all-optical switching network are characterized by three orthogonal scheduling dimensions: wavelength channel, polarization state, and spatial mode. Any combination of a wavelength channel, a polarization state, and a spatial mode is used as an independently allocable resource tuple. A corresponding three-dimensional resource state tensor is generated for each link. The element values ​​of the resource state tensor are used to represent whether the corresponding resource tuple is in an idle or occupied state.

3. The multi-dimensional resource collaborative scheduling method for all-optical switching networks according to claim 1, characterized in that, Based on business priority, requests to be processed are determined from the set of business requests, including: All business requests in the business request set are sorted by business priority according to business priority, and the resource status tensor set of the entire network at the current moment is obtained. Select the highest priority business request as the pending request.

4. The multi-dimensional resource collaborative scheduling method for all-optical switching networks according to claim 3, characterized in that, Business priority ranking aims to minimize weighted connection establishment latency, and the optimization objective function is: ,in, For the first The priority coefficient of each business request. For the first The chain establishment delay for each business request.

5. The multi-dimensional resource collaborative scheduling method for all-optical switching networks according to claim 1, characterized in that, Target transmission paths are selected from the candidate transmission path set based on the minimum bottleneck load criterion, including: Calculate the bottleneck node resource load rate for each candidate path in the candidate transmission path set. The bottleneck node resource load rate is the ratio of the number of resource tuples occupied by the node to the total resource tuple capacity of the node. The candidate path with the lowest resource load rate of the bottleneck node is selected as the target transmission path.

6. The multi-dimensional resource collaborative scheduling method for all-optical switching networks according to claim 1, characterized in that, On the target transmission path, a hierarchical resource search strategy is adopted, traversing resource tuples according to the priority order of wavelength, polarization state, and spatial mode, including: Under the current polarization state and current spatial mode, traverse all wavelength channels in sequence and check whether the corresponding resource tuples of all links on the target transmission path are in an idle state. If a resource tuple that satisfies the condition of being free along the entire path exists, the search terminates and the search is considered successful. If all wavelength channels are occupied in the current polarization state, switch to another orthogonal polarization state, reset the wavelength traversal index, and re-execute the full wavelength channel traversal verification. If all wavelength channels under two orthogonal polarization states are occupied, switch to the next spatial mode, reset the polarization state traversal index and wavelength traversal index, and repeat the traversal verification process of polarization state and wavelength channels until all spatial modes have been traversed.

7. The multi-dimensional resource collaborative scheduling method for all-optical switching networks as described in claim 6, characterized in that, On the target transmission path, a hierarchical resource search strategy is adopted, traversing resource tuples according to the priority order of wavelength, polarization state, and spatial mode, and also includes: When no available resource tuple is found after traversing all wavelength channels, polarization states, and spatial modes, the pending service request is stored in a waiting queue and will re-participate in scheduling after the resources in the network are released.

8. A multi-dimensional resource collaborative scheduling system for all-optical switching networks, characterized in that, The system is used to implement the steps of the multi-dimensional resource collaborative scheduling method for all-optical switching networks as described in any one of claims 1-7, the system comprising: The business request filtering module is used to determine the requests to be processed from the business request set based on business priority when a business request set is received. The transmission path filtering module is used to generate a set of candidate transmission paths for the request to be processed, and to filter out the target transmission path from the set of candidate transmission paths based on the minimum bottleneck load criterion. The resource tuple traversal module is used to traverse resource tuples along the target transmission path using a hierarchical resource search strategy, according to the priority order of wavelength channel, polarization state, and spatial mode. The resource tuple allocation and encapsulation module is used to allocate the idle resource tuple to the pending request when an idle resource tuple that meets the conditions is found, update the resource state tensor of all links on the target transmission path, and encapsulate the allocated resource tuple into a logical resource unit.

9. A terminal, characterized in that, The terminal includes a memory, a processor, and a multi-dimensional resource collaborative scheduling program for all-optical switching networks stored in the memory and executable on the processor. When the processor executes the multi-dimensional resource collaborative scheduling program for all-optical switching networks, it implements the steps of the multi-dimensional resource collaborative scheduling method for all-optical switching networks as described in any one of claims 1-7.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a multi-dimensional resource collaborative scheduling program for all-optical switching networks, and the multi-dimensional resource collaborative scheduling program for all-optical switching networks implements the steps of the multi-dimensional resource collaborative scheduling method for all-optical switching networks as described in any one of claims 1-7 on the computer-readable storage medium.

Images