Resource allocation method of space division multiplexing elastic optical network, terminal and storage medium

Abstract

The invention provides a resource allocation method of a space division multiplexing elastic optical network, a terminal and a storage medium. The method comprises the following steps: planning K paths for a service according to resource availability, and arranging the paths in a descending order according to path cost values; calculating a frequency spectrum block required by the service based on the path length; dividing the fiber cores of the kth path into a non-adjacent group and an adjacent group, and calculating the frequency spectrum regularity of each fiber core; judging whether business exists in adjacent groups or not, if not, performing spectrum allocation in non-adjacent groups, and determining a selected spectrum position through a minimum index change difference value according to a flexible fiber core spectrum fragment index and a spectrum block required by the business; and when the non-adjacent groups are blocked for the first time, bringing the adjacent groups into a frequency spectrum allocation process, and allocating a frequency spectrum position which is least influenced by crosstalk and fragmentation degree to the service according to the crosstalk-fragmentation effect value, the frequency spectrum regularity and a frequency spectrum block required by the service. According to the invention, ICXT and spectrum fragmentation problems can be considered as a whole, and efficient utilization of network spectrum resources can be realized.

Description

Technical Field

[0001] The present invention relates to the technical field of resource allocation, and in particular to a resource allocation method, terminal and storage medium for a space-division multiplexing elastic optical network. Background Art

[0002] Space Division Multiplexing (SDM) technology based on multi-core fibers has attracted widespread attention as an effective means to improve the transmission capacity of elastic optical networks (EONs). By introducing the spatial domain into EONs, SDM elastic optical networks not only expand the network transmission capacity, but also bring about complex network resource states, making it more challenging to adopt reasonable routing, fiber core and spectrum allocation methods for service requests.

[0003] The traditional EONs resource allocation method needs to meet the three major constraints of spectrum continuity, adjacency and conflict when allocating services. As a result, after a period of establishment and dismantling, a large number of discontinuous spectrum fragments will appear in the network, seriously affecting the network transmission performance. At the same time, the spatial dimension is introduced into EONs to form a multi-dimensional optical network. Considering that inter-core crosstalk (ICXT) is an important constraint of multi-core fiber (MCF), it is necessary to effectively avoid ICXT through a reasonable resource allocation method to maximize the carrying of services by multi-dimensional optical networks, thereby reducing service congestion and improving spectrum resource utilization.

[0004] The influence of crosstalk XT reduces the utilization of spectrum resources, and in order to meet the XT constraint, when establishing a service connection, many scattered spectrum resources that cannot be used may be generated in order to find a suitable spectrum location. This is called spectrum fragmentation. Therefore, there is a mutual constraint relationship between ICXT and spectrum fragmentation. If the generation of fragmentation can be reduced while taking into account the XT constraint, the utilization of resources in the network will be improved and the probability of service blocking will be reduced. At present, the research literature has failed to comprehensively consider the ICXT and spectrum fragmentation issues, which is not conducive to achieving the goal of efficient utilization of spectrum resources in the network. Summary of the invention

[0005] The embodiments of the present invention provide a resource allocation method, terminal and storage medium for a space-division multiplexing elastic optical network to solve the problem that the existing methods fail to comprehensively consider the ICXT and spectrum fragmentation problems, which is not conducive to achieving efficient utilization of spectrum resources in the network.

[0006] In a first aspect, an embodiment of the present invention provides a resource allocation method for a space-division multiplexing elastic optical network, comprising:

[0007] Obtain the source node and sink node of the service, plan K paths for the service according to the source node, sink node and resource availability, and sort the K paths in descending order according to the path cost value; K is a positive integer;

[0008] Calculate the spectrum block required for the service based on the path length of the k-th path;

[0009] The fiber cores of the k-th path are divided into non-adjacent groups and adjacent groups, and the spectrum regularity of each fiber core of the k-th path is calculated;

[0010] Determine whether there is any service in the adjacent group of the kth path. If not, enter the first stage of spectrum allocation and allocate spectrum in non-adjacent groups. According to the flexible core spectrum fragmentation index and the spectrum blocks required by the service, determine the selected spectrum position through the minimum index change difference and establish a connection;

[0011] When the first service congestion occurs in the non-adjacent group, the second stage of spectrum allocation begins. The adjacent group is included in the spectrum allocation process. Based on the crosstalk-fragmentation effect value, spectrum regularity, and spectrum blocks required by the service, the spectrum position with the least impact of crosstalk and fragmentation is allocated to the service to establish a connection.

[0012] Among them, k starts from 1 and goes up to K.

[0013] In one possible implementation, resource availability is expressed as:

[0014]

[0015] Among them, RAE k Indicates the ratio of available frequency slots in the kth path to the total frequency slot resources; F i Indicates the total number of frequency slots on the i-th link; hop k Indicates the number of node hops of the kth path; represents the spectrum status of the spectrum position with index j of the i-th link;

[0016] The path cost is expressed as:

[0017]

[0018] Among them, L k represents the path length of the kth path; S k Represents the path cost of the kth path.

[0019] In a possible implementation, the spectrum regularity is expressed as:

[0020]

[0021] Among them, CSC l,crepresents the spectrum regularity of the cth fiber core of the lth link; in CSC l,c In the spectrum regularity of Indicates the maximum frequency slot index number on the cth fiber core of the lth link, Indicates the minimum frequency slot index number on the cth fiber core of the lth link, represents the spectrum state of the jth frequency slot of the cth fiber core of the lth link, v represents the number of the frequency slot, ∑P c Indicates the number of services that exist on the cth fiber core, B l,c represents the number of idle spectrum segments on the cth fiber core of the lth link, It represents the number of idle frequency slots in the qth idle spectrum segment on the cth fiber core of the lth link.

[0022] In a possible implementation, the selected spectrum position is determined by a minimum indicator change difference according to a flexible core spectrum fragmentation indicator and a spectrum block required by a service, including:

[0023] Arrange the fiber cores of non-adjacent groups in descending order according to spectral regularity;

[0024] Traversing each fiber core in the non-adjacent group to determine whether there is a spectrum block required by the service in the non-adjacent group;

[0025] If the non-adjacent group does not have the spectrum block required by the service, it is determined that the non-adjacent group has the first service blocking;

[0026] If there are spectrum blocks required by the service in non-adjacent groups, the spectrum position with the smallest change value of the core spectrum fragmentation index before and after the task allocation is selected as the target spectrum position;

[0027] Determine whether the crosstalk value after the target spectrum position is assigned to the service exceeds the crosstalk threshold. If the crosstalk value after the target spectrum position is assigned to the service does not exceed the crosstalk threshold, the target spectrum position is assigned to the service and the service is transmitted successfully. If the crosstalk value after the target spectrum position is assigned to the service exceeds the crosstalk threshold, it is determined that the first service congestion occurs in the non-adjacent group.

[0028] In a possible implementation, the core spectrum fragmentation index SMF is expressed as:

[0029]

[0030] Wherein, FFS represents the number of free spectrum blocks, Cbb represents the number of blank continuous spectrum blocks, MaxnubCbb represents the maximum number of blank continuous spectrum blocks, Maxsize represents the maximum size of blank continuous spectrum blocks, MinnubCbb represents the minimum number of blank continuous spectrum blocks, Minsize represents the minimum size of blank continuous spectrum blocks, Smax represents the maximum frequency gap index number of this fiber core, and Smin represents the minimum frequency gap index number of this fiber core;

[0031] The minimum indicator change difference is expressed as:

[0032] min[ΔSMF=SMF before -SMF after ]

[0033] Among them, SMF before Indicates the core spectrum fragmentation index before allocating the service to a certain spectrum position, SMF after It represents the core spectrum fragmentation index after the service is allocated to the spectrum position, and ΔSMF represents the change value of the core spectrum fragmentation index before and after the service is allocated to the spectrum position.

[0034] In a possible implementation, according to the crosstalk-fragmentation effect value, spectrum regularity, and spectrum blocks required by the service, a spectrum position least affected by crosstalk and fragmentation is allocated to the service, including:

[0035] Traverse each fiber core in descending order of spectrum regularity to find candidate spectrum positions of all spectrum blocks that meet the service requirements;

[0036] Traversing each candidate spectrum position, and calculating the crosstalk-fragmentation effect value of each candidate spectrum position;

[0037] Determine whether the candidate spectrum position with the smallest crosstalk-fragmentation effect value is on the fiber core with the largest spectrum regularity;

[0038] If the candidate spectrum position with the smallest crosstalk-fragmentation effect value is on the fiber core with the largest spectrum regularity, it is determined whether the crosstalk value after allocating the candidate spectrum position to the service exceeds the crosstalk threshold. If the crosstalk value after allocating the candidate spectrum position to the service does not exceed the crosstalk threshold, the candidate spectrum position is allocated to the service, and the service transmission is successful.

[0039] If the candidate spectrum position with the smallest crosstalk-fragmentation effect value is not on the fiber core with the largest spectrum regularity, the allocation effect value of each candidate spectrum position is calculated, and a determination is made as to whether the crosstalk value after the candidate spectrum position with the smallest allocation effect value is allocated to the service exceeds the crosstalk threshold; if the crosstalk value after the candidate spectrum position with the smallest allocation effect value is allocated to the service does not exceed the crosstalk threshold, the candidate spectrum position with the smallest allocation effect value is allocated to the service, and the service transmission is successful.

[0040] In one possible implementation, the crosstalk-debris effect value is expressed as:

[0041]

[0042] Among them, G l,c represents the crosstalk-debris effect value of the candidate spectrum position on the cth fiber core of the lth link, represents the number of frequency slots that the cth fiber core of the lth link overlaps with the jth adjacent fiber core, n represents the number of fiber cores adjacent to the cth fiber core, and F r represents the number of frequency slots required for the service on the cth fiber core, represents the total number of available spectrum blocks on the cth core of the lth link after the candidate spectrum positions on the cth core of the lth link are allocated to the service, where represents the number of idle frequency slots in the ith idle and continuous spectrum block in the cth fiber core of the lth link, and S represents the number of idle and continuous spectrum blocks in the cth fiber core of the lth link;

[0043] The distribution effect value V of the candidate spectrum position on the cth fiber core of the lth link l,c It is expressed as:

[0044]

[0045] Among them, CSC l,c Represents the spectrum regularity of the cth fiber core of the lth link.

[0046] In a possible implementation, after calculating the spectrum regularity of each fiber core of the kth path, the resource allocation method of the space division multiplexing elastic optical network further includes:

[0047] Determine whether there is a spectrum block required by the service on the kth path;

[0048] If the spectrum block required by the service does not exist on the k-th path, k is incremented by 1 to obtain a new k, and the process jumps to the step of calculating the spectrum block required by the service based on the path length of the k-th path and is executed in a loop;

[0049] Accordingly, judging whether there is any service in the adjacent group of the k-th path includes:

[0050] If there is a spectrum block required by the service on the k-th path, it is determined whether there is any service in the adjacent group of the k-th path.

[0051] In a second aspect, an embodiment of the present invention provides a resource allocation device for a space-division multiplexing elastic optical network, including:

[0052] The path acquisition module is used to obtain the source node and sink node of the service, plan K paths for the service according to the source node, sink node and resource availability, and arrange the K paths in descending order according to the path cost value; K is a positive integer;

[0053] A demand calculation module, used for calculating the spectrum block required for the service based on the path length of the kth path;

[0054] A fiber core parameter calculation module, used to divide the fiber cores of the k-th path into non-adjacent groups and adjacent groups, and calculate the frequency spectrum regularity of each fiber core of the k-th path;

[0055] The first resource allocation module is used to determine whether there is a service in the adjacent group of the kth path. If not, it enters the first stage of spectrum allocation, allocates spectrum in non-adjacent groups, determines the selected spectrum position through the minimum indicator change difference according to the flexible fiber core spectrum fragmentation index and the spectrum block required by the service, and establishes a connection;

[0056] The second resource allocation module is used to enter the second stage of spectrum allocation when the non-adjacent group has the first service congestion, include the adjacent group in the spectrum allocation process, allocate the spectrum position with the least impact by crosstalk and fragmentation to the service according to the crosstalk-fragmentation effect value, spectrum regularity and spectrum blocks required by the service, and establish a connection;

[0057] Among them, k starts from 1 and goes up to K.

[0058] In a third aspect, an embodiment of the present invention provides a terminal, comprising a memory and a processor, the memory being used to store a computer program, the processor being used to call and run the computer program stored in the memory, and executing the resource allocation method for a space-division multiplexing elastic optical network as described in the first aspect or any possible implementation of the first aspect.

[0059] In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, which stores a computer program. When the computer program is executed by a processor, it implements the steps of the resource allocation method for a space-division multiplexing elastic optical network as described in the first aspect or any possible implementation method of the first aspect.

[0060] The embodiment of the present invention provides a resource allocation method, terminal and storage medium for a space-division multiplexing elastic optical network. The method plans K paths for a service based on resource availability. From the beginning of resource allocation, a transmission path with relatively concentrated resources, path length that meets the acceptable service transmission and relatively few physical nodes is selected, which to a certain extent also reduces the energy consumption of optical-electrical-optical node conversion in the network. After the service arrives, it is divided into two resource allocation stages. In the first stage, tight spectrum block resource allocation is pursued. Based on the flexible core spectrum fragmentation index, the selected spectrum position is determined by minimizing the difference in the change of the core spectrum fragmentation index before and after the service pre-selected spectrum position as a reference to reduce the generation of fragments; in the second stage of service allocation, all cores are included in the resource allocation stage. According to the crosstalk-fragmentation effect value, spectrum regularity and spectrum blocks required by the service, the spectrum position with the least impact of crosstalk and fragmentation is allocated to the service, so that ICXT and spectrum fragmentation problems can be comprehensively considered, which is conducive to realizing efficient use of spectrum resources in the network. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0062] Figure 1 It is a flow chart of a resource allocation method for a space-division multiplexing elastic optical network provided by an embodiment of the present invention;

[0063] Figure 2 is a schematic diagram of an example of calculating a flexible core spectrum fragmentation index provided by an embodiment of the present invention;

[0064] Figure 3 is a schematic diagram of an example of calculating the frequency spectrum regularity of a fiber core provided by an embodiment of the present invention;

[0065] Figure 4 is a schematic diagram of resource allocation provided by an embodiment of the present invention;

[0066] Figure 5 is a schematic diagram of an example of a spectrum allocation information coordinate diagram provided by an embodiment of the present invention;

[0067] Figure 6 It is a flowchart of a resource allocation method for a space-division multiplexing elastic optical network provided by another embodiment of the present invention;

[0068] Figure 7 It is a structural schematic diagram of a resource allocation device for a space-division multiplexing elastic optical network provided by an embodiment of the present invention;

[0069] Figure 8 is a schematic diagram of a terminal provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0070] In the following description, specific details such as specific system structures, technologies, etc. are provided for the purpose of illustration rather than limitation, so as to provide a thorough understanding of the embodiments of the present invention. However, it should be clear to those skilled in the art that the present invention may be implemented in other embodiments without these specific details. In other cases, detailed descriptions of well-known systems, devices, circuits, and methods are omitted to prevent unnecessary details from obstructing the description of the present invention.

[0071] In order to make the purpose, technical solutions and advantages of the present invention more clear, specific embodiments will be described below in conjunction with the accompanying drawings.

[0072] As mentioned above, the current research literature fails to comprehensively consider the ICXT and spectrum fragmentation issues, which is not conducive to achieving the goal of efficient use of spectrum resources in the network. The main manifestations are: 1) Crosstalk (XT) is one of the main obstacles to resource allocation in space-division multiplexing elastic optical networks (SDM-EONs). In SDM-EONs, the XT avoidance method avoids the overlap of the same spectrum slots (FSs) in adjacent cores. In the XT worst-case method, it is assumed that all FSs in adjacent cores are occupied in order to consider XT in the worst case. This method overestimates the impact of IC-XT in the network and will lead to a large amount of idle spectrum resources being wasted. 2) When a service arrives, the shortest path algorithm is usually used, which will cause the service to be blocked on a frequently used link, resulting in unbalanced resource use in the network. In this case, the network resources cannot be fully utilized. 3) The resource allocation method that jointly considers crosstalk and spectrum fragmentation is adopted to reduce the generation of fragments while meeting the service allocation conditions. By reasonably setting the priority of the core and the priority of the candidate spectrum position, the spectrum resource position for service allocation is jointly and accurately determined.

[0073] In response to the above problems, the prior art provides a resource allocation method based on energy efficiency and crosstalk-fragmentation awareness in a space-division multiplexing elastic optical network, which can better and more reasonably allocate resources in the network and reduce the probability of service blocking. However, the above method focuses on reducing crosstalk under the premise of reducing power consumption during transmission, and reduces fragmentation through spectrum partitioning. When the service is blocked, the service is divided into blocks and a public channel is selected for transmission. In this regard, this method does not accurately measure the crosstalk-fragmentation impact of the available position when allocating spectrum resources to the service, and fails to accurately measure the impact of the degree of fragmentation after the service is allocated resources, which has certain limitations.

[0074] In order to solve the above problems, an embodiment of the present application provides a resource allocation method for a space-division multiplexing elastic optical network.

[0075] See also Figure 1 , which shows a flow chart of implementing a resource allocation method for a space-division multiplexing elastic optical network provided by an embodiment of the present invention. The execution subject of the resource allocation method for a space-division multiplexing elastic optical network may be a terminal.

[0076] The resource allocation method of the above-mentioned space-division multiplexing elastic optical network may include:

[0077] In S101, the source node and the sink node of the service are obtained, K paths are planned for the service according to the source node, the sink node and resource availability, and the K paths are arranged in descending order according to the path cost value; K is a positive integer.

[0078] In this embodiment, when a new service request is received, the source node and the sink node of the new service may be acquired according to the service request, and some other information of the service may also be acquired, which is not specifically limited here.

[0079] The KSP-Dijkstra shortest path method (K algorithm for short) can be used to plan K shortest paths for new services based on the source node, the sink node, and the resource availability, and obtain the path lengths of the K paths. Then, the path cost value can be calculated based on the resource availability, the number of physical nodes of the path, and the path length. The K paths are sorted in descending order according to the path cost value to obtain K paths in descending order. When traversing the K paths subsequently, the K paths in descending order are traversed.

[0080] In some embodiments, resource availability is expressed as:

[0081]

[0082] Among them, RAE k Indicates the ratio of available frequency slots in the kth path to the total frequency slot resources; F i Indicates the total number of frequency slots on the i-th link; hop k Indicates the number of node hops of the kth path; Indicates the spectrum state of the spectrum position with index j of the i-th link, where a value of 0 indicates an idle state, and a value of 1 indicates an occupied state, or a value of 1 indicates an idle state, and a value of 0 indicates an occupied state.

[0083] In this embodiment, RAE kIt represents the ratio of available frequency slots on the k-th path to the total frequency slot resources, that is, the resource availability of the k-th path. It should be noted that, since the above formula calculates the resource availability of the k-th path, the link in the above formula represents the link of the k-th path, that is, in the above formula, the value of i is from 1 to the last link of the k-th path. Among them, a "link" is a section on a "path", that is: there are several routing nodes on a network path, and the transmission path between two routing nodes is called a "link". In other words, a path can include multiple links, and the number of links on a path is equal to the number of node hops on the path minus 1, that is, hop k -1.

[0084] The path cost is expressed as:

[0085]

[0086] Among them, l k represents the path length of the kth path; S k Represents the path cost of the kth path.

[0087] This embodiment uses the resource availability of the path divided by the logarithm of the path length and the number of node hops of the path to obtain the path cost. 10 L k The smaller the path, the smaller the number of node hops and the RAE k The larger the S k The greater the value, the greater the resource availability and the greater the path cost. The greater the resource availability, the greater the path cost, and the more likely it is to choose this path for transmission, thereby avoiding the emergence of a "bottleneck path" caused by repeated selection of the shortest path, causing service congestion and weakening the utilization efficiency of spectrum resources.

[0088] In S102, based on the path length of the kth path, the spectrum block required by the service is calculated.

[0089] In this embodiment, the modulation format level of the service corresponding to the kth path can be determined according to the path length of the kth path, and the spectrum blocks required by the service, which can also be called the number of frequency slots required by the service, can be calculated according to the modulation format level.

[0090] Specifically, the modulation format level may be determined according to the path weight value ranking of the paths. Different modulation format levels correspond to different crosstalk limit values. The higher the modulation format level, the smaller the crosstalk limit value.

[0091] Spectrum block f required for the service r It is expressed as:

[0092]

[0093] In the above formula, b r is the data rate of the service, C is the unit capacity of a frequency slot, M is the modulation format level of the service, G f To protect bandwidth frequency slots.

[0094] The value of k starts from 1 and goes up to K. That is, k first takes the value of 1, and S102 to S105 are executed. If resources are allocated to the task, the resource allocation ends. Otherwise, k is automatically increased by 1, and S102 to S105 are executed again until resources are allocated to the task or k is greater than K. When k is greater than K, the service is marked as unavailable on K paths, and the path needs to be searched again. If a path that meets the resources required by the service is still not found after the search again, the service is blocked and the service transmission fails.

[0095] In S103, the fiber cores of the k-th path are divided into non-adjacent groups and adjacent groups, and the frequency spectrum regularity of each fiber core of the k-th path is calculated.

[0096] In this embodiment, the vertex coloring method can be used to divide the cores of the k-th path into non-adjacent groups V1 and adjacent groups V2. The spectrum regularity of each core of the k-th path is calculated to indicate the resource distribution of each core. The cores of the k-th path are arranged in descending order of spectrum regularity, or the cores of the non-adjacent group V1 of the k-th path are arranged. The cores with high spectrum regularity are preferentially selected.

[0097] In some embodiments, the spectral regularity is expressed as:

[0098]

[0099] Among them, CSC l,c represents the spectrum regularity of the cth fiber core of the lth link; in CSC l,c In the spectrum regularity of Indicates the maximum frequency slot index number on the cth fiber core of the lth link, Indicates the minimum frequency slot index number on the cth fiber core of the lth link; represents the spectrum state of the jth frequency slot of the cth fiber core of the lth link. Its value is 0, indicating the occupied state, and its value is 1, indicating the idle state, or its value is 1, indicating the occupied state, and its value is 0, indicating the idle state; v represents the number of the frequency slot, ∑P c Indicates the number of services that exist on the cth fiber core, B l,c represents the number of idle spectrum segments on the cth fiber core of the lth link, It represents the number of idle frequency slots in the qth idle spectrum segment on the cth fiber core of the lth link.

[0100] In S104, it is determined whether there is any service in the adjacent group of the kth path. If not, the first stage of spectrum allocation is entered, and spectrum allocation is performed in non-adjacent groups. According to the flexible fiber core spectrum fragmentation index and the spectrum blocks required by the service, the selected spectrum position is determined by the minimum index change difference to establish a connection.

[0101] In this embodiment, when a new service arrives, it is first determined whether there is any service in the core of the adjacent group V2. If so, it is determined that the non-adjacent group has experienced the first service congestion and the second stage of spectrum allocation is entered; if not, the first stage of spectrum allocation is entered and spectrum allocation is performed only in non-adjacent groups. The spectrum position with the smallest difference in the change of the core spectrum fragmentation index is selected and allocated to the service, thereby establishing a connection and completing resource allocation.

[0102] In S105, when the non-adjacent group of the k-th path experiences the first service congestion, the second stage of spectrum allocation is entered, the adjacent group is included in the spectrum allocation process, and the spectrum position least affected by the crosstalk and fragmentation degree is allocated to the service according to the crosstalk-fragmentation effect value, spectrum regularity and spectrum blocks required by the service, and the connection is established;

[0103] Among them, k starts from 1 and goes up to K.

[0104] In this embodiment, when the first service congestion occurs in non-adjacent groups, the second stage of spectrum allocation is entered, and the adjacent groups are included in the spectrum allocation process. By calculating the crosstalk-fragmentation effect value, the spectrum position least affected by crosstalk and fragmentation is allocated to the service according to the crosstalk-fragmentation effect value, spectrum regularity and spectrum blocks required for the service, thereby establishing a connection and completing resource allocation.

[0105] When the first service congestion occurs in the non-adjacent group, spectrum allocation for all subsequent new services directly enters the second stage without going through the first stage.

[0106] The embodiment of the present application plans K paths for the service based on resource availability. From the very beginning of resource allocation, a transmission path with relatively concentrated resources, acceptable path length for service transmission, and relatively few physical nodes is selected, which also reduces the energy consumption of optical-electrical-optical node conversion in the network to a certain extent. After the service arrives, it is divided into two resource allocation stages. In the first stage, tight spectrum block resource allocation is pursued. Based on the flexible core spectrum fragmentation index, the selected spectrum position is determined by minimizing the difference in the change of the core spectrum fragmentation index before and after the service pre-selected spectrum position as a reference to reduce the generation of fragments; in the second stage of service allocation, all cores are included in the resource allocation stage. According to the crosstalk-fragmentation effect value, spectrum regularity, and spectrum blocks required by the service, the spectrum position with the least impact of crosstalk and fragmentation is allocated to the service, so that ICXT and spectrum fragmentation problems can be considered in a comprehensive manner, which is conducive to the efficient use of spectrum resources in the network.

[0107] In some embodiments, in the above S104, the above determining the selected spectrum position by the minimum indicator change difference according to the flexible core spectrum fragmentation indicator and the spectrum block required by the service includes:

[0108] Arrange the fiber cores of non-adjacent groups in descending order according to spectral regularity;

[0109] Traversing each fiber core in the non-adjacent group to determine whether there is a spectrum block required by the service in the non-adjacent group;

[0110] If the non-adjacent group does not have the spectrum block required by the service, it is determined that the non-adjacent group has the first service blocking;

[0111] If there are spectrum blocks required by the service in non-adjacent groups, the spectrum position with the smallest change value of the core spectrum fragmentation index before and after the task allocation is selected as the target spectrum position;

[0112] Determine whether the crosstalk value after the target spectrum position is assigned to the service exceeds the crosstalk threshold. If the crosstalk value after the target spectrum position is assigned to the service does not exceed the crosstalk threshold, the target spectrum position is assigned to the service and the service is transmitted successfully. If the crosstalk value after the target spectrum position is assigned to the service exceeds the crosstalk threshold, it is determined that the first service congestion occurs in the non-adjacent group.

[0113] In this embodiment, if the non-adjacent group does not have the spectrum block required by the service, it is determined that the non-adjacent group has experienced the first service congestion, and the second stage of resource allocation is entered.

[0114] The crosstalk value after the target spectrum position is assigned to the service is the average crosstalk value XT between the fiber core where the target spectrum position is located and the adjacent fiber core. a express.

[0115]

[0116] Where n is the number of adjacent fiber cores of the fiber core where the target spectrum is located; L is the fiber transmission length; h is the crosstalk increment per unit length, β, q, r, and w are optical fiber parameters, representing the optical fiber propagation constant, coupling coefficient, bending radius, and core-to-core distance, respectively.

[0117] If the crosstalk value after the target spectrum position is allocated to the service exceeds the crosstalk threshold, it is determined that the non-adjacent group has experienced the first service congestion, and the second stage of resource allocation is entered. The crosstalk threshold can be set according to actual needs and is not specifically limited here.

[0118] In some embodiments, the core spectrum fragmentation index SMF is expressed as:

[0119]

[0120] Wherein, FFS represents the number of free spectrum blocks, Cbb represents the number of blank continuous spectrum blocks, MaxnubCbb represents the maximum number of blank continuous spectrum blocks, Maxsize represents the maximum size of blank continuous spectrum blocks, MinnubCbb represents the minimum number of blank continuous spectrum blocks, Minsize represents the minimum size of blank continuous spectrum blocks, Smax represents the maximum frequency gap index number of this fiber core, and Smin represents the minimum frequency gap index number of this fiber core;

[0121] The minimum indicator change difference is expressed as:

[0122] min[ΔSMF=SMF before -SMF after ]

[0123] Among them, SMF before Indicates the core spectrum fragmentation index before allocating the service to a certain spectrum position, SMF after It represents the core spectrum fragmentation index after the service is allocated to the spectrum position, and ΔSMF represents the change value of the core spectrum fragmentation index before and after the service is allocated to the spectrum position.

[0124] If the SMF is small, it means that there is less fragmentation in the path; if the SMF is large, it means that there is a serious fragmentation problem in the path.

[0125] By selecting the spectrum location of the service through the minimum indicator change difference, it is possible to strictly limit the fragmentation generated by resource allocation in the first stage to a minimum.

[0126] This embodiment pursues tight spectrum block resource allocation in the first stage, based on the flexible spectrum fragmentation measurement formula, and determines the selected spectrum position with reference to minimizing the change in the fragmentation measurement value before and after the service pre-selected spectrum position, with the main purpose of reducing fragmentation generation.

[0127] In some embodiments, in the above S105, allocating a spectrum position least affected by crosstalk and fragmentation to the service according to the crosstalk-fragmentation effect value, spectrum regularity and spectrum blocks required by the service includes:

[0128] Traverse each fiber core in descending order of spectrum regularity to find candidate spectrum positions of all spectrum blocks that meet the service requirements;

[0129] Traversing each candidate spectrum position, and calculating the crosstalk-fragmentation effect value of each candidate spectrum position;

[0130] Determine whether the candidate spectrum position with the smallest crosstalk-fragmentation effect value is on the fiber core with the largest spectrum regularity;

[0131] If the candidate spectrum position with the smallest crosstalk-fragmentation effect value is on the fiber core with the largest spectrum regularity, it is determined whether the crosstalk value after allocating the candidate spectrum position to the service exceeds the crosstalk threshold. If the crosstalk value after allocating the candidate spectrum position to the service does not exceed the crosstalk threshold, the candidate spectrum position is allocated to the service, and the service transmission is successful.

[0132] If the candidate spectrum position with the smallest crosstalk-fragmentation effect value is not on the fiber core with the largest spectrum regularity, the allocation effect value of each candidate spectrum position is calculated, and a determination is made as to whether the crosstalk value after the candidate spectrum position with the smallest allocation effect value is allocated to the service exceeds the crosstalk threshold; if the crosstalk value after the candidate spectrum position with the smallest allocation effect value is allocated to the service does not exceed the crosstalk threshold, the candidate spectrum position with the smallest allocation effect value is allocated to the service, and the service transmission is successful.

[0133] This embodiment traverses each fiber core of the k-th path in descending order of spectrum regularity to find candidate spectrum positions of all spectrum blocks that meet the needs of the service.

[0134] The crosstalk value after allocating the candidate spectrum position to the service and the crosstalk value after allocating the candidate spectrum position with the smallest allocation effect value to the service can refer to the aforementioned XT a The calculation formula is used for calculation.

[0135] If the crosstalk value after allocating the candidate spectrum position to the service exceeds the crosstalk threshold, k is added by 1 to obtain a new k, and it is determined whether the new k is greater than K. If not, the process jumps to step S102 and executes in a loop. If so, the service transmission fails and resource allocation ends.

[0136] Similarly, if the crosstalk value after allocating the candidate spectrum position with the smallest allocation effect value to the service exceeds the crosstalk threshold, k is added by 1 to obtain a new k, and it is determined whether the new k is greater than K. If not, jump to step S102 and execute in a loop. If so, the service transmission fails and the resource allocation ends.

[0137] In some embodiments, the crosstalk-debris effect value is expressed as:

[0138]

[0139] Among them, G l,c represents the crosstalk-debris effect value of the candidate spectrum position on the cth fiber core of the lth link, represents the number of frequency slots that the cth fiber core of the lth link overlaps with the jth adjacent fiber core, n represents the number of fiber cores adjacent to the cth fiber core, and F r represents the number of frequency slots required for the service on the cth fiber core, represents the total number of available spectrum blocks on the cth core of the lth link after the candidate spectrum positions on the cth core of the lth link are allocated to the service, where represents the number of free frequency slots in the ith free and continuous spectrum block in the cth fiber core of the lth link, and S represents the number of free and continuous spectrum blocks in the cth fiber core of the lth link (the smaller S is, the better);

[0140] The distribution effect value V of the candidate spectrum position on the cth fiber core of the lth link l,c It is expressed as:

[0141]

[0142] Among them, CSC l,c Represents the spectrum regularity of the cth fiber core of the lth link.

[0143] In the calculation formula of the crosstalk-fragmentation effect value, It indicates the average amount of available spectrum for each resource block. The larger the ratio, the more concentrated the idle continuous spectrum blocks are. The smaller the value, the smaller the crosstalk-fragmentation effect generated after the connection is established and the better the performance.

[0144] In the calculation formula of the distribution effect value, G l,c The smaller the G value is, the smaller the crosstalk-fragmentation effect is, and the smaller the impact is. l,c Indicates the resource concentration of the fiber core. The larger the part, the better, thus affecting the entire V l,c For the spectrum position, the V value (i.e. V l,c ) is smaller, the more worthy the location is to establish a connection.

[0145] In the second stage, the ordinate of the spectrum allocation information coordinate diagram can be set to represent the CSC of the fiber core. l,c The horizontal axis represents the crosstalk-fragmentation effect value generated after the spectrum block is occupied. The appropriate spectrum resources are allocated to the service according to the information coordinate diagram. Finally, when the service arrives, the CSC of the cth fiber core of the lth link l,c value and the G value of the pre-allocated position for the service.

[0146] In the second stage of this embodiment, all the cores are arranged in descending order according to the real-time core spectrum regularity, and are included in the resource allocation stage. Due to the presence of adjacent cores in this stage, the influence of inter-core crosstalk needs to be considered. To this end, by calculating the crosstalk-fragmentation effect value measurement of the candidate spectrum position on the link, the smaller the value, the smaller the crosstalk impact and the generated fragmentation impact. Combined with the core spectrum regularity, when the allocation effect value is smaller, the candidate spectrum position is less affected by crosstalk and the generated fragmentation, which means that the effect of the position after allocation is better, so that the spectrum position with the least crosstalk and fragmentation impact can be selected to allocate to the service, thereby improving resource utilization.

[0147] In the embodiment of the present application, the cores are divided into two groups during the core selection stage. The core spectrum regularity is used as the core selection order basis throughout the entire process, so that the cores with relatively concentrated resources, that is, the cores with a lower degree of fragmentation, are first used as core resources for service transmission, so as to achieve the purpose of reducing the generation of new fragments and the increase in the probability of blocking.

[0148] In some embodiments, after calculating the spectrum regularity of each fiber core of the kth path, the resource allocation method of the space division multiplexing elastic optical network further includes:

[0149] Determine whether there is a spectrum block required by the service on the kth path;

[0150] If the spectrum block required by the service does not exist on the k-th path, k is incremented by 1 to obtain a new k, and the process jumps to the step of calculating the spectrum block required by the service based on the path length of the k-th path and is executed in a loop;

[0151] Accordingly, judging whether there is any service in the adjacent group of the k-th path includes:

[0152] If there is a spectrum block required by the service on the k-th path, it is determined whether there is any service in the adjacent group of the k-th path.

[0153] The above judgment basis for determining whether there is a spectrum block required by the service on the kth path is whether f r ≤F l , where F l It only refers to a certain idle continuous spectrum in the set of continuous idle resources on the kth path.

[0154] If the spectrum block required by the service does not exist on the kth path, k is increased by 1 to obtain a new k, and it is determined whether the new k is greater than K. If not, the process jumps to step S102 and is executed in a loop. If so, the service transmission fails and resource allocation ends.

[0155] Figure 2The calculation example of flexible core spectrum fragmentation index is given. There are 20 spectrum blocks in this section, FFS = 10 represents the number of idle spectrum blocks, Cbb = 6; MaxnubCbb represents the maximum number of blank continuous spectrum blocks, which is 1 here, and there are three idle spectrum blocks; MinnubCbb represents the minimum number of blank continuous spectrum blocks, which is 3 here, and each of them has an idle spectrum block. According to the core spectrum fragmentation index formula:

[0156] Figure 3 The calculation example of the spectrum regularity of the fiber core and the sorting result are given. First, the resource blocks occupied by the services in the fiber core are retrieved, the sequence number and quantity of the spectrum resource blocks are retrieved, and the spectrum regularity of each fiber core is calculated in real time according to the set fiber core spectrum regularity formula.

[0157] Figure 4 A resource allocation diagram is given. Figure 5 The vertical axis of the spectrum allocation information coordinate diagram represents the CSC of the fiber core. l,c The value and the horizontal axis represent the crosstalk-fragmentation effect value generated after the spectrum block is occupied. According to the information coordinate diagram, appropriate spectrum resources are allocated to the service. Finally, when the service arrives, the fiber core CSC on the optical path will l,c value and the G value of the pre-allocated position for the service.

[0158] Figure 6 A flow chart for implementing a resource allocation method for a space-division multiplexing elastic optical network is provided. For details, please refer to the aforementioned embodiment and no further details will be given.

[0159] The method provided by the embodiment of the present application first presents the link resource availability according to the resource usage on all links, comprehensively considers the resource availability and combines the path length and the number of hops to improve the transmission path selection of the incoming service; then the cores are divided into non-adjacent and adjacent groups, and the resource distribution of each core is calculated in real time using the core resource regularity; then a hierarchical allocation model for spectrum resources is established, and the spectrum is first allocated in the non-adjacent core group in combination with a flexible fragmentation measurement method until the first service congestion occurs in the resources in the group, and then the second allocation stage of crosstalk perception and fragmentation perception is entered. In the second stage, the influence of the candidate spectrum position on the crosstalk and fragmentation after the connection is established is calculated by setting the core crosstalk-fragmentation effect value, and the final connection establishment position is determined by the core spectrum regularity. This strategy can effectively balance the mutual constraints between crosstalk and fragmentation. This method can effectively balance the mutual constraints between crosstalk and fragmentation through a reasonable path, core and spectrum selection mechanism, effectively reduce the generation of spectrum fragmentation in the network, improve the efficiency of resource utilization, and reduce the impact of crosstalk between cores and reduce congestion. This method takes into account link load, path hop count, and path length in the process of allocating service resources, and combines the real-time usage status of the fiber core spectrum. The purpose is to ensure balanced resource usage within the network under crosstalk constraints, minimize the generation of spectrum fragmentation, and improve network spectrum resource utilization.

[0160] It should be understood that the order of execution of the steps in the above embodiment does not necessarily mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiment of the present invention.

[0161] The following is an embodiment of the device of the present invention. For details not described in detail therein, reference may be made to the corresponding method embodiment described above.

[0162] Figure 7 The structure diagram of the resource allocation device of the space division multiplexing elastic optical network provided by the embodiment of the present invention is shown. For the convenience of explanation, only the part related to the embodiment of the present invention is shown, which is described in detail as follows:

[0163] like Figure 7 As shown, the resource allocation device 20 of the space-division multiplexing elastic optical network may include: a path acquisition module 21, a demand calculation module 22, a core parameter calculation module 23, a first resource allocation module 24 and a second resource allocation module 25.

[0164] The path acquisition module 21 is used to acquire the source node and the sink node of the service, plan K paths for the service according to the source node, the sink node and the resource availability, and arrange the K paths in descending order according to the path cost value; K is a positive integer;

[0165] A demand calculation module 22, configured to calculate the spectrum blocks required for the service based on the path length of the kth path;

[0166] A fiber core parameter calculation module 23, used to divide the fiber cores of the k-th path into non-adjacent groups and adjacent groups, and calculate the frequency spectrum regularity of each fiber core of the k-th path;

[0167] The first resource allocation module 24 is used to determine whether there is a service in the adjacent group of the kth path. If not, the first stage of spectrum allocation is entered, and spectrum allocation is performed in non-adjacent groups. According to the flexible core spectrum fragmentation index and the spectrum block required by the service, the selected spectrum position is determined by the minimum index change difference, and the connection is established;

[0168] The second resource allocation module 25 is used to enter the second stage of spectrum allocation when the first service congestion occurs in non-adjacent groups, incorporate adjacent groups into the spectrum allocation process, and allocate spectrum positions least affected by crosstalk and fragmentation to the services according to the crosstalk-fragmentation effect value, spectrum regularity and spectrum blocks required by the services, and establish connections; wherein k starts from 1 to K.

[0169] In one possible implementation, resource availability is expressed as:

[0170]

[0171] Among them, RAE k Indicates the ratio of available frequency slots in the kth path to the total frequency slot resources; F i Indicates the total number of frequency slots on the i-th link; hop k Indicates the number of node hops of the kth path; represents the spectrum status of the spectrum position with index j of the i-th link;

[0172] The path cost is expressed as:

[0173]

[0174] Among them, L k represents the path length of the kth path; S k Represents the path cost of the kth path.

[0175] In a possible implementation, the spectrum regularity is expressed as:

[0176]

[0177] Among them, CSC l,c represents the spectrum regularity of the cth fiber core of the lth link; in CSC l,c In the spectrum regularity of Indicates the maximum frequency slot index number on the cth fiber core of the lth link, Indicates the minimum frequency slot index number on the cth fiber core of the lth link, represents the spectrum state of the jth frequency slot of the cth fiber core of the lth link, v represents the number of the frequency slot, ∑P c Indicates the number of services that exist on the cth fiber core, B l,c represents the number of idle spectrum segments on the cth fiber core of the lth link, It represents the number of idle frequency slots in the qth idle spectrum segment on the cth fiber core of the lth link.

[0178] In a possible implementation, in the first resource allocation module 24, the selected spectrum position is determined by a minimum indicator change difference according to the flexible core spectrum fragmentation indicator and the spectrum block required by the service, including:

[0179] Arrange the fiber cores of non-adjacent groups in descending order according to spectral regularity;

[0180] Traversing each fiber core in the non-adjacent group to determine whether there is a spectrum block required by the service in the non-adjacent group;

[0181] If the non-adjacent group does not have the spectrum block required by the service, it is determined that the non-adjacent group has the first service blocking;

[0182] If there are spectrum blocks required by the service in non-adjacent groups, the spectrum position with the smallest change value of the core spectrum fragmentation index before and after the task allocation is selected as the target spectrum position;

[0183] Determine whether the crosstalk value after the target spectrum position is assigned to the service exceeds the crosstalk threshold. If the crosstalk value after the target spectrum position is assigned to the service does not exceed the crosstalk threshold, the target spectrum position is assigned to the service and the service is transmitted successfully. If the crosstalk value after the target spectrum position is assigned to the service exceeds the crosstalk threshold, it is determined that the first service congestion occurs in the non-adjacent group.

[0184] In a possible implementation, the core spectrum fragmentation index SMF is expressed as:

[0185]

[0186] Wherein, FFS represents the number of free spectrum blocks, Cbb represents the number of blank continuous spectrum blocks, MaxnubCbb represents the maximum number of blank continuous spectrum blocks, Maxsize represents the maximum size of blank continuous spectrum blocks, MinnubCbb represents the minimum number of blank continuous spectrum blocks, Minsize represents the minimum size of blank continuous spectrum blocks, Smax represents the maximum frequency gap index number of this fiber core, and Smin represents the minimum frequency gap index number of this fiber core;

[0187] The minimum indicator change difference is expressed as:

[0188] min[ΔSMF=SMF before -SMF after ]

[0189] Among them, SMF before Indicates the core spectrum fragmentation index before allocating the service to a certain spectrum position, SMF after It represents the core spectrum fragmentation index after the service is allocated to the spectrum position, and ΔSMF represents the change value of the core spectrum fragmentation index before and after the service is allocated to the spectrum position.

[0190] In a possible implementation, in the second resource allocation module 25, according to the crosstalk-fragmentation effect value, the spectrum regularity and the spectrum block required by the service, the spectrum position least affected by the crosstalk and fragmentation degree is allocated to the service, including:

[0191] Traverse each fiber core in descending order of spectrum regularity to find candidate spectrum positions of all spectrum blocks that meet the service requirements;

[0192] Traversing each candidate spectrum position, and calculating the crosstalk-fragmentation effect value of each candidate spectrum position;

[0193] Determine whether the candidate spectrum position with the smallest crosstalk-fragmentation effect value is on the fiber core with the largest spectrum regularity;

[0194] If the candidate spectrum position with the smallest crosstalk-fragmentation effect value is on the fiber core with the largest spectrum regularity, it is determined whether the crosstalk value after allocating the candidate spectrum position to the service exceeds the crosstalk threshold. If the crosstalk value after allocating the candidate spectrum position to the service does not exceed the crosstalk threshold, the candidate spectrum position is allocated to the service, and the service transmission is successful.

[0195] If the candidate spectrum position with the smallest crosstalk-fragmentation effect value is not on the fiber core with the largest spectrum regularity, the allocation effect value of each candidate spectrum position is calculated, and a determination is made as to whether the crosstalk value after the candidate spectrum position with the smallest allocation effect value is allocated to the service exceeds the crosstalk threshold; if the crosstalk value after the candidate spectrum position with the smallest allocation effect value is allocated to the service does not exceed the crosstalk threshold, the candidate spectrum position with the smallest allocation effect value is allocated to the service, and the service transmission is successful.

[0196] In one possible implementation, the crosstalk-debris effect value is expressed as:

[0197]

[0198] Among them, G l,crepresents the crosstalk-debris effect value of the candidate spectrum position on the cth fiber core of the lth link, represents the number of frequency slots that the cth fiber core of the lth link overlaps with the jth adjacent fiber core, n represents the number of fiber cores adjacent to the cth fiber core, and F r represents the number of frequency slots required for the service on the cth fiber core, represents the total number of available spectrum blocks on the cth core of the lth link after the candidate spectrum positions on the cth core of the lth link are allocated to the service, where represents the number of idle frequency slots in the ith idle and continuous spectrum block in the cth fiber core of the lth link, and S represents the number of idle and continuous spectrum blocks in the cth fiber core of the lth link;

[0199] The distribution effect value V of the candidate spectrum position on the cth fiber core of the lth link l,c It is expressed as:

[0200]

[0201] Among them, CSC l,c Represents the spectrum regularity of the cth fiber core of the lth link.

[0202] In a possible implementation, the resource allocation device for a space-division multiplexing elastic optical network further includes: a judgment module.

[0203] The judgment module is used to: after calculating the spectrum regularity of each fiber core of the k-th path, judge whether there is a spectrum block required by the service on the k-th path; if there is no spectrum block required by the service on the k-th path, add 1 to k to obtain a new k, and jump to the step of calculating the spectrum block required by the service based on the path length of the k-th path and execute it cyclically;

[0204] Accordingly, in the first resource allocation module 24, judging whether there is any service in the adjacent group of the kth path includes:

[0205] If there is a spectrum block required by the service on the k-th path, it is determined whether there is any service in the adjacent group of the k-th path.

[0206] Figure 8 is a schematic diagram of a terminal provided by an embodiment of the present invention. Figure 8 As shown, the terminal 4 of this embodiment includes: a processor 40 and a memory 41. The memory 41 is used to store a computer program 42, and the processor 40 is used to call and run the computer program 42 stored in the memory 41 to perform the steps in the above-mentioned resource allocation method embodiments of the space-division multiplexing elastic optical network, such as Figure 1Alternatively, the processor 40 is used to call and run the computer program 42 stored in the memory 41 to implement the functions of each module / unit in the above-mentioned device embodiments, for example Figure 7 Functions of modules / units 21 to 25 are shown.

[0207] Exemplarily, the computer program 42 may be divided into one or more modules / units, which are stored in the memory 41 and executed by the processor 40 to implement the present invention. The one or more modules / units may be a series of computer program instruction segments capable of implementing specific functions, which are used to describe the execution process of the computer program 42 in the terminal 4. For example, the computer program 42 may be divided into Figure 7 Modules / units 21 to 25 are shown.

[0208] The terminal 4 may include, but is not limited to, a processor 40 and a memory 41. Those skilled in the art will appreciate that Figure 8 It is only an example of terminal 4 and does not constitute a limitation on terminal 4. It may include more or fewer components than shown in the figure, or a combination of certain components, or different components. For example, the terminal may also include input and output devices, network access devices, buses, etc.

[0209] The processor 40 may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc.

[0210] The memory 41 may be an internal storage unit of the terminal 4, such as a hard disk or memory of the terminal 4. The memory 41 may also be an external storage device of the terminal 4, such as a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card, etc. equipped on the terminal 4. Further, the memory 41 may also include both an internal storage unit and an external storage device of the terminal 4. The memory 41 is used to store the computer program and other programs and data required by the terminal. The memory 41 may also be used to temporarily store data that has been output or is to be output.

[0211] The technicians in the relevant field can clearly understand that for the convenience and simplicity of description, only the division of the above-mentioned functional units and modules is used as an example for illustration. In practical applications, the above-mentioned function allocation can be completed by different functional units and modules as needed, that is, the internal structure of the device can be divided into different functional units or modules to complete all or part of the functions described above. The functional units and modules in the embodiment can be integrated in a processing unit, or each unit can exist physically separately, or two or more units can be integrated in one unit. The above-mentioned integrated unit can be implemented in the form of hardware or in the form of software functional units. In addition, the specific names of the functional units and modules are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of this application. The specific working process of the units and modules in the above-mentioned system can refer to the corresponding process in the aforementioned method embodiment, which will not be repeated here.

[0212] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described or recorded in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0213] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.

[0214] In the embodiments provided by the present invention, it should be understood that the disclosed devices / terminals and methods can be implemented in other ways. For example, the device / terminal embodiments described above are only schematic. For example, the division of the modules or units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0215] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0216] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0217] If the integrated module / unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the present invention implements all or part of the processes in the above-mentioned embodiment method, and can also be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium. When the computer program is executed by the processor, it can implement the steps of the above-mentioned resource allocation method embodiments of each space-division multiplexing elastic optical network. Among them, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium may include: any entity or device that can carry the computer program code, recording medium, U disk, mobile hard disk, disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signal, telecommunication signal and software distribution medium.

[0218] The embodiments described above are only used to illustrate the technical solutions of the present invention, rather than to limit the same. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. Such modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present invention, and should all be included in the protection scope of the present invention.

Claims

1. A resource allocation method for a space-division multiplexing elastic optical network, characterized in that: include: Acquire a source node and a sink node of a service, plan K paths for the service according to the source node, the sink node and resource availability, and arrange the K paths in descending order according to the path cost value; K is a positive integer; Calculating a spectrum block required for the service based on the path length of the kth path; The fiber cores of the k-th path are divided into non-adjacent groups and adjacent groups, and the spectrum regularity of each fiber core of the k-th path is calculated; Determine whether there is any service in the adjacent group of the kth path. If not, enter the first stage of spectrum allocation, allocate spectrum in the non-adjacent group, determine the selected spectrum position by the minimum index change difference according to the flexible core spectrum fragmentation index and the spectrum block required by the service, and establish a connection; When the non-adjacent group of the k-th path experiences the first service congestion, the second stage of spectrum allocation is entered, the adjacent group is included in the spectrum allocation process, and the spectrum position least affected by the crosstalk and fragmentation is allocated to the service according to the crosstalk-fragmentation effect value, spectrum regularity and spectrum blocks required by the service, and a connection is established; Among them, k starts from 1 and goes up to K.

2. The resource allocation method for space-division multiplexing elastic optical network according to claim 1, characterized in that: The resource availability is expressed as: Among them, RAE k Indicates the ratio of available frequency slots in the kth path to the total frequency slot resources; F i Indicates the total number of frequency slots on the i-th link; hop k Indicates the number of node hops of the kth path; represents the spectrum status of the spectrum position with index j of the i-th link; The path cost is expressed as: Among them, L k represents the path length of the kth path; S k Represents the path cost of the kth path.

3. The resource allocation method for space-division multiplexing elastic optical network according to claim 1, characterized in that: The spectrum regularity is expressed as: Among them, CSC l,c represents the spectrum regularity of the cth fiber core of the lth link; in CSC l,c In the spectrum regularity of Indicates the maximum frequency slot index number on the cth fiber core of the lth link, Indicates the minimum frequency slot index number on the cth fiber core of the lth link, represents the spectrum state of the jth frequency slot of the cth fiber core of the lth link, v represents the number of the frequency slot, ∑P c Indicates the number of services that exist on the cth fiber core, B l,c represents the number of idle spectrum segments on the cth fiber core of the lth link, It represents the number of idle frequency slots in the qth idle spectrum segment on the cth fiber core of the lth link.

4. The resource allocation method for space-division multiplexing elastic optical network according to claim 1, characterized in that: The determining the selected spectrum position by the minimum indicator change difference according to the flexible core spectrum fragmentation indicator and the spectrum block required by the service includes: Arrange the fiber cores of the non-adjacent groups in descending order according to spectral regularity; Traversing each fiber core in the non-adjacent group, and determining whether the non-adjacent group has a spectrum block required by the service; If the non-adjacent group does not have the spectrum block required by the service, determining that the non-adjacent group has the first service congestion; If the non-adjacent group has a spectrum block required by the service, selecting a spectrum position with the smallest change value of the core spectrum fragmentation index before and after the task allocation as the target spectrum position; Determine whether the crosstalk value after the target spectrum position is assigned to the service exceeds the crosstalk threshold. If the crosstalk value after the target spectrum position is assigned to the service does not exceed the crosstalk threshold, the target spectrum position is assigned to the service and the service transmission is successful. If the crosstalk value after the target spectrum position is assigned to the service exceeds the crosstalk threshold, it is determined that the non-adjacent group has experienced the first service congestion.

5. The resource allocation method for space-division multiplexing elastic optical network according to claim 1, characterized in that: The core spectrum fragmentation index SMF is expressed as: Wherein, FFS represents the number of free spectrum blocks, Cbb represents the number of blank continuous spectrum blocks, MaxnubCbb represents the maximum number of blank continuous spectrum blocks, Maxsize represents the maximum size of blank continuous spectrum blocks, MinnubCbb represents the minimum number of blank continuous spectrum blocks, Minsize represents the minimum size of blank continuous spectrum blocks, Smax represents the maximum frequency gap index number of this fiber core, and Smin represents the minimum frequency gap index number of this fiber core; The minimum index change difference is expressed as: min[ΔSMF=SMF before -SMF after ] Among them, SMF before Indicates the core spectrum fragmentation index before allocating the service to a certain spectrum position, SMF after It represents the core spectrum fragmentation index after the service is allocated to the spectrum position, and ΔSMF represents the change value of the core spectrum fragmentation index before and after the service is allocated to the spectrum position.

6. The resource allocation method for space-division multiplexing elastic optical network according to claim 1, characterized in that: The allocating, for the service, a spectrum position least affected by crosstalk and fragmentation according to the crosstalk-fragmentation effect value, the spectrum regularity, and the spectrum block required by the service, comprises: Traversing each fiber core in descending order of spectrum regularity to find candidate spectrum positions of all spectrum blocks that meet the needs of the service; Traversing each candidate spectrum position, and calculating the crosstalk-fragmentation effect value of each candidate spectrum position; Determine whether the candidate spectrum position with the smallest crosstalk-fragmentation effect value is on the fiber core with the largest spectrum regularity; If the candidate spectrum position with the smallest crosstalk-fragmentation effect value is on the fiber core with the largest spectrum regularity, it is determined whether the crosstalk value after allocating the candidate spectrum position to the service exceeds the crosstalk threshold. If the crosstalk value after allocating the candidate spectrum position to the service does not exceed the crosstalk threshold, the candidate spectrum position is allocated to the service, and the service transmission is successful. If the candidate spectrum position with the smallest crosstalk-fragmentation effect value is not on the fiber core with the largest spectrum regularity, the allocation effect value of each candidate spectrum position is calculated, and a determination is made as to whether the crosstalk value after allocating the candidate spectrum position with the smallest allocation effect value to the service exceeds the crosstalk threshold; if the crosstalk value after allocating the candidate spectrum position with the smallest allocation effect value to the service does not exceed the crosstalk threshold, the candidate spectrum position with the smallest allocation effect value is allocated to the service, and the service transmission is successful.

7. The resource allocation method for space-division multiplexing elastic optical network according to claim 6, characterized in that: The crosstalk-debris effect value is expressed as: Among them, G l,c represents the crosstalk-debris effect value of the candidate spectrum position on the cth fiber core of the lth link, represents the number of frequency slots that the cth fiber core of the lth link overlaps with the jth adjacent fiber core, n represents the number of fiber cores adjacent to the cth fiber core, and F r represents the number of frequency slots required for the service on the cth core, represents the total number of available spectrum blocks on the c-th core of the l-th link after the candidate spectrum position on the c-th core of the l-th link is allocated to the service, represents the number of free frequency slots in the ith free and continuous spectrum block in the cth fiber core of the lth link, and S represents the number of free and continuous spectrum blocks in the cth fiber core of the lth link; The distribution effect value V of the candidate spectrum position on the cth fiber core of the lth link l,c It is expressed as: Among them, CSC l,c Represents the spectrum regularity of the cth fiber core of the lth link.

8. The resource allocation method for a space-division multiplexing elastic optical network according to any one of claims 1 to 7, characterized in that: After calculating the spectrum regularity of each fiber core of the kth path, the resource allocation method of the space division multiplexing elastic optical network further includes: Determine whether there is a spectrum block required by the service on the kth path; If the spectrum block required by the service does not exist on the k-th path, k is added by 1 to obtain a new k, and the process jumps to the step of calculating the spectrum block required by the service based on the path length of the k-th path and is executed in a loop; Accordingly, the determining whether the adjacent group of the k-th path has a service includes: If the spectrum block required by the service exists on the k-th path, it is determined whether the adjacent group of the k-th path has any service.

9. A terminal, characterized in that: It comprises a memory and a processor, wherein the memory is used to store a computer program, and the processor is used to call and run the computer program stored in the memory to execute the resource allocation method for a space-division multiplexing elastic optical network as described in any one of claims 1 to 8.

10. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the steps of the resource allocation method for a space-division multiplexing elastic optical network as claimed in any one of claims 1 to 8 are implemented.

Images