CN114205284A - Routing resource allocation method and device - Google Patents
Routing resource allocation method and device Download PDFInfo
- Publication number
- CN114205284A CN114205284A CN202111283271.9A CN202111283271A CN114205284A CN 114205284 A CN114205284 A CN 114205284A CN 202111283271 A CN202111283271 A CN 202111283271A CN 114205284 A CN114205284 A CN 114205284A
- Authority
- CN
- China
- Prior art keywords
- path
- spectrum
- selectable
- slot
- optional
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/123—Evaluation of link metrics
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
One or more embodiments of the present specification provide a method and an apparatus for allocating routing resources, including: determining a shortest path between a source node and a destination node according to a new service request, determining at least one optional path which accords with an overlapping constraint condition with the shortest path from established paths, calculating frequency spectrum resources required by the new service request, pre-distributing the frequency spectrum resources on each optional path to obtain a pre-distribution result of each optional path, calculating a state index of each optional path according to the pre-distribution result, and selecting an optimal optional path as a path of the new service request according to the state index. The method and the device can improve the utilization rate of network resources and can realize more flexible and diversified services.
Description
Technical Field
One or more embodiments of the present disclosure relate to the field of network technologies, and in particular, to a method and an apparatus for allocating routing resources.
Background
With the popularization of networking, the internet has gradually developed towards diversity and individuation, and higher requirements are put forward on the flexibility and the efficiency of the network technology. In a conventional optical network, an optical signal must occupy a dedicated frequency range, and cannot share spectrum resources with other optical signals, and routing and spectrum resource allocation are realized on the basis of the premise. The use of signal overlap techniques allows two independently generated optical signals having the same center frequency to use the same spectral resources, and there is no resource allocation method currently available for the optical signals that can be overlapped.
Disclosure of Invention
In view of the above, an object of one or more embodiments of the present disclosure is to provide a method and an apparatus for allocating routing resources to solve the problem of resource allocation of overlapping signals.
In view of the above, one or more embodiments of the present specification provide a routing resource allocation method, including:
determining the shortest path between a source node and a destination node according to the new service request;
determining at least one optional path which accords with an overlapping constraint condition with the shortest path from the established paths;
calculating spectrum resources required by the new service request, and pre-distributing the spectrum resources on each optional path to obtain a pre-distribution result of each optional path;
calculating the state index of each selectable path according to the pre-distribution result;
and selecting the optimal optional path as the path of the new service request according to the state index.
Optionally, determining at least one optional path that meets the overlap constraint with the shortest path from the established paths includes:
selecting an intermediate path which is superposed with the shortest path at a superposed node and then continuously transmitted along the same path from the paths;
and determining the intermediate path with the use times less than two as the optional path.
Optionally, the pre-allocating the spectrum resources on each selectable path includes:
splitting an optional path into a first path and a second path, wherein the first path is from the source node to the coincident node, and the second path is from the coincident node to the destination node;
determining a frequency spectrum interval corresponding to the occupied frequency spectrum resource of the selectable path on the first path, and searching for a continuous frequency spectrum slot with the same size as the frequency spectrum resource, wherein one part of the frequency spectrum slot is partially overlapped with the frequency spectrum interval, and the other part of the frequency spectrum slot is an idle frequency spectrum slot;
and searching for a spectrum slot which is equal to the spectrum resource in size and is continuous on the second path, wherein one part of the spectrum slot is partially overlapped with the occupied spectrum resource of the selectable path, and the other part of the spectrum slot is a free spectrum slot.
Optionally, the state index of each optional path is calculated as:
and calculating the state index according to the number of the spectrum gaps occupied by the spectrum resources and the spectrum resources occupied by the selectable path on the superposed path, the number of the rest idle spectrum sections on the superposed path, the number of the spectrum gaps contained in the rest idle spectrum sections and the preset optimal state parameter of the overlapped spectrum resources.
Optionally, according to the state index, selecting an optimal optional path as follows:
and selecting the selectable path with the maximum state index value as the optimal selectable path.
An embodiment of the present specification further provides a routing resource allocation apparatus, including:
the shortest path calculation module is used for determining the shortest path between the source node and the destination node according to the new service request;
the optional path determining module is used for determining at least one optional path which accords with the overlapping constraint condition with the shortest path from the established paths;
the pre-allocation module is used for calculating the spectrum resources required by the new service request, and pre-allocating the spectrum resources on each selectable path to obtain the pre-allocation result of each selectable path;
the index calculation module is used for calculating the state indexes of all the selectable paths according to the pre-distribution result;
and the path determining module is used for selecting the optimal optional path as the path of the new service request according to the state index.
Optionally, the optional path determining module is configured to select, from the paths, an intermediate path that is overlapped with the shortest path at one overlapped node and then continuously transmitted along the same path; and determining the intermediate path with the use times less than two as the optional path.
Optionally, the pre-allocation module is configured to split an optional path into a first path and a second path, where the first path is from the source node to the coincident node, and the second path is from the coincident node to the destination node; determining a frequency spectrum interval corresponding to the occupied frequency spectrum resource of the selectable path on the first path, and searching for a continuous frequency spectrum slot with the same size as the frequency spectrum resource, wherein one part of the frequency spectrum slot is partially overlapped with the frequency spectrum interval, and the other part of the frequency spectrum slot is an idle frequency spectrum slot; and searching for a spectrum slot which is equal to the spectrum resource in size and is continuous on the second path, wherein one part of the spectrum slot is partially overlapped with the occupied spectrum resource of the selectable path, and the other part of the spectrum slot is a free spectrum slot.
Optionally, the index calculation module is configured to calculate the state index according to the number of spectrum slots occupied by the spectrum resources and the spectrum resources occupied by the selectable path on the overlapping path, the number of remaining idle spectrum segments on the overlapping path, the number of spectrum slots included in the remaining idle spectrum segments, and a preset optimal state parameter of the overlapped spectrum resources.
Optionally, the path determining module is configured to select the selectable path with the largest state index value as the optimal selectable path.
As can be seen from the foregoing, in the routing resource allocation method and apparatus provided in one or more embodiments of the present disclosure, according to a new service request, a shortest path between a source node and a destination node is determined, at least one optional path that meets an overlap constraint condition with the shortest path is determined from established paths, a spectrum resource required by the new service request is calculated, the spectrum resource is pre-allocated on each optional path, a pre-allocation result of each optional path is obtained, a state index of each optional path is calculated according to the pre-allocation result, and an optimal optional path is selected as a path of the new service request according to the state index. By using the method of the specification, resource allocation is realized based on signal overlapping, the utilization rate of network resources can be improved, and more flexible and diversified services can be realized.
Drawings
In order to more clearly illustrate one or more embodiments or prior art solutions of the present specification, the drawings that are needed in the description of the embodiments or prior art will be briefly described below, and it is obvious that the drawings in the following description are only one or more embodiments of the present specification, and that other drawings may be obtained by those skilled in the art without inventive effort from these drawings.
FIG. 1 is a schematic flow chart of a method according to one or more embodiments of the present disclosure;
FIG. 2 is a schematic flow chart of a method according to another embodiment of the present disclosure;
fig. 3 is a shortest path diagram for one embodiment of the present description;
FIG. 4A is the bookEstablished path r for one embodiment of the specification1A schematic diagram;
FIG. 4B is a diagram illustrating an established path r according to an embodiment of the present disclosure2A schematic diagram;
FIG. 4C is a diagram illustrating an established path r according to an embodiment of the present disclosure3A schematic diagram;
FIG. 4D is an established path r according to an embodiment of the present disclosure4A schematic diagram;
fig. 5A is a schematic diagram of a spectrum occupation state of a 1-2-4 segment link according to an embodiment of the present disclosure;
FIG. 5B is a schematic diagram illustrating a spectrum occupation state of a 4-6-7 segment link according to an embodiment of the present disclosure;
FIG. 6A is a graph of a path r according to one embodiment of the present disclosure2A schematic diagram of the pre-allocated spectrum resource occupation state;
FIG. 6B is a diagram of a path r according to an embodiment of the present disclosure3A schematic diagram of the pre-allocated spectrum resource occupation state;
FIG. 6C illustrates an embodiment of the present disclosure at path r4A schematic diagram of the pre-allocated spectrum resource occupation state;
FIG. 7 is a schematic diagram of an apparatus according to one or more embodiments of the present disclosure;
fig. 8 is a schematic structural diagram of an electronic device according to one or more embodiments of the present disclosure.
Detailed Description
For the purpose of promoting a better understanding of the objects, aspects and advantages of the present disclosure, reference is made to the following detailed description taken in conjunction with the accompanying drawings.
It is to be noted that unless otherwise defined, technical or scientific terms used in one or more embodiments of the present specification should have the ordinary meaning as understood by those of ordinary skill in the art to which this disclosure belongs. The use of "first," "second," and similar terms in one or more embodiments of the specification is not intended to indicate any order, quantity, or importance, but rather is used to distinguish one element from another. The word "comprising" or "comprises", and the like, means that the element or item listed before the word covers the element or item listed after the word and its equivalents, but does not exclude other elements or items. The terms "connected" or "coupled" and the like are not restricted to physical or mechanical connections, but may include electrical connections, whether direct or indirect. "upper", "lower", "left", "right", and the like are used merely to indicate relative positional relationships, and when the absolute position of the object being described is changed, the relative positional relationships may also be changed accordingly.
As shown in fig. 1 and 2, an embodiment of the present specification provides a routing resource allocation method, including:
s101: determining the shortest path between a source node and a destination node according to the new service request;
in this embodiment, a new service request is received, a source node and a destination node for data transmission are determined according to the new service request, and at least one shortest path between the source node and the destination node is determined by using a predetermined shortest routing algorithm. The shortest routing algorithm used is not particularly limited.
S102: determining at least one optional path which accords with the overlapping constraint condition with the shortest path from the established paths;
in this embodiment, according to the determined shortest path and the established paths, the selectable path satisfying the overlap constraint condition is selected from the established paths, and the selectable path and the shortest path can implement signal overlap transmission, thereby improving the resource utilization rate. The established path refers to a path which is already established according to the service request before the new service request comes, and service related data is transmitted on the established path.
S103: calculating spectrum resources required by the new service request, and pre-distributing the spectrum resources on each optional path to obtain a pre-distribution result of each optional path;
in this embodiment, after the shortest path and the selected optional path are determined, the spectrum resource occupied by the new service request is calculated, and the spectrum resource is pre-allocated in sequence on each optional path to obtain the pre-allocation result on each optional path.
In some approaches, the method of computing spectrum resources is:
wherein, BmFor spectrum resources, speed is a transmission rate required by a service request, m is a spectrum efficiency of a signal modulation format, a numerical value of the spectrum efficiency decreases as a routing length of the service request increases, and a relationship between the spectrum efficiency of the signal modulation format and a transmission distance is shown in table 1:
table 1 modulation format spectral efficiency and longest transmission distance
S104: calculating the state index of each selectable path according to the pre-distribution result;
s105: and selecting the optimal optional path as the path of the new service request according to the state index.
In this embodiment, after the pre-allocation is performed on each selectable path, the pre-allocation result corresponding to each selectable path is obtained, then, the state index of each selectable path is calculated according to the pre-allocation result, the optimal selectable path is selected according to the state index to serve as the path of the new service request, and the data of the new service request is transmitted by using the path.
The embodiment provides a routing resource allocation method, which comprises the steps of determining the shortest path between a source node and a destination node according to a new service request, determining at least one optional path which accords with the overlapping constraint condition with the shortest path from established paths, calculating the frequency spectrum resource required by the new service request, pre-allocating the frequency spectrum resource on each optional path to obtain the pre-allocation result of each optional path, calculating the state index of each optional path according to the pre-allocation result, and selecting the optimal optional path as the path of the new service request according to the state index. According to the method, the new service request and the ongoing service can share the spectrum resource through signal overlapping, and meanwhile, the optimal path is distributed for the overlapping signals, so that the resource is efficiently, flexibly and reasonably utilized.
In some embodiments, determining at least one alternative path from the established paths that meets the overlap constraint with the shortest path comprises:
selecting an intermediate path which is superposed with the shortest path at a superposed node from the established paths and then continuously transmitted along the same path;
and determining the intermediate path with the use times less than two as the optional path.
In this embodiment, based on the signal overlapping technology, the overlap constraint condition is determined as follows: selecting an intermediate path from all established paths, wherein the basis for selecting the intermediate path is as follows: and determining a coincident node of the shortest path and the established path according to the shortest path and the established path, wherein the shortest path and the established path reach the same destination node along a common path from the coincident node. Considering that the receiver can detect two paths of signals through coherent detection, therefore, the same section of spectrum resource can be occupied by at most two service requests simultaneously, based on this, based on the selected intermediate path, whether the intermediate path has been used twice is judged, if the intermediate path has been used twice, the intermediate path cannot be reused, if the intermediate path is used only once, the intermediate path is selected as an alternative path for signal overlapping with the new service request.
In some embodiments, pre-allocating spectrum resources on each selectable path includes:
splitting the selectable path into a first path and a second path; the first path is from the source node to the coincident node, and the second path is from the coincident node to the destination node;
determining a frequency spectrum interval corresponding to the occupied frequency spectrum resource of the selectable path on the first path, and searching continuous frequency spectrum slots with the same size as the frequency spectrum resource, wherein one part is partially overlapped with the frequency spectrum interval, and the other part is an idle frequency spectrum slot;
and searching for a continuous spectrum slot with the same size as the spectrum resource on the second path, wherein one part of the spectrum slot is partially overlapped with the occupied spectrum resource of the optional path, and the other part of the spectrum slot is a free spectrum slot.
In this embodiment, considering that services on each selectable path are different and occupied spectrum resources are different, spectrum resources of a new service request are overlapped on different selectable paths, and each selectable path may generate spectrum fragments of different degrees, which affects establishment of a subsequent new service request and resource utilization rate of the whole network. Therefore, after selecting a plurality of selectable paths, allocating the spectrum resource of the new service request on each selectable path in advance, and selecting a most suitable selectable path as a path which is suitable for being overlapped with the new service request and can establish connection for the new service request according to an allocation result.
For each optional path, when the spectrum resource of the new service request is pre-allocated, the optional path is firstly split into two paths, wherein one path is from a source node to a coincident node, and the other path is from the coincident node to a destination node, and whether the spectrum resource of the new service request can be allocated on the two paths is respectively judged. For the first path, although the shortest path of the new service request does not coincide with the optional path, and there is no situation that the spectrum resource occupied by the established path overlaps with the spectrum resource of the new service request, the influence of the occupied spectrum resource on the spectrum resource of the new service request still needs to be considered in consideration of the consistency and continuity of the spectrum resource allocation of the elastic optical network. Therefore, during pre-allocation, the two split paths both need to satisfy the spectrum resource allocation requested by the new service.
And on the first path, determining a frequency spectrum interval corresponding to the frequency spectrum resource occupied by the selectable path, searching a starting point in the frequency spectrum interval, and starting from the starting point, wherein the starting point has the same number of continuous frequency spectrum slots as the frequency spectrum slots required by the new service request. If the first path has a starting point in a spectrum interval and has continuous spectrum slots with the required number of spectrum slots, one part of the continuous spectrum slots is partially overlapped with the spectrum interval, and the other part of the continuous spectrum slots is idle spectrum slots, the first path can meet the spectrum resource allocation of a new service request.
And on the second path, the optional path occupied spectrum resources exist, the occupied spectrum resource segment is taken as a search interval, a starting point is searched in the search interval, and the starting point has the same number of continuous spectrum slots as the number of the spectrum slots required by the new service request. If the second path has a starting point in the search interval and has continuous spectrum slots with the required number of spectrum slots, one part of the continuous spectrum slots is partially overlapped with the spectrum interval, and the other part of the continuous spectrum slots is idle spectrum slots, the second path can meet the spectrum resource allocation of the new service request. In this way, by pre-allocating resources on the first path and the second path, the selectable paths which can be overlapped with the established paths and meet the resource allocation required by the new service request are further screened out, and the pre-allocation results of the pre-allocated selectable paths are obtained.
In some embodiments, the spectrum resource requested by the new service is pre-allocated on the optional path to obtain a pre-allocation result, and the state index of the optional path is calculated according to the pre-allocation result, where the calculation method is as follows: and calculating the state index according to the number of the spectrum gaps occupied by the spectrum resources and the spectrum resources occupied by the selectable path on the superposed path, the number of the rest idle spectrum sections on the superposed path, the number of the spectrum gaps contained in the rest idle spectrum sections and the preset optimal state parameter of the overlapped spectrum resources. In this embodiment, when it is determined that the first path and the second path of the selectable path both have the spectrum resources available for the new service request, a connection may be established for the new service request on the selectable path, and the resource state on the selectable path after the resources are allocated by the overlapping signal is evaluated by using the state index in combination with the resources occupied on the overlapping signal path and the degree of influence on the idle spectrum resources.
In some embodiments, the formula for calculating the status indicator is:
wherein, SUColThe spectrum resource representing the new service request and the number of spectrum slots occupied by the spectrum resource occupied by the optional path on the superposed path, and the NSC represents the number of idle spectrum segments on the superposed path，NSnIndicating the number of spectrum slots, Max, contained in the nth free spectrum segmentfThe method is characterized in that the preset optimal state parameter of the overlapped spectrum resource is calculated according to the number of spectrum slots in the optical fiber link, and the optimal state of the overlapped spectrum resource is as follows: when one coincidence path is occupied by only one existing service and a newly arrived service (occupied by only occupied spectrum resources and spectrum resources requested by a new service), the calculation formula of the state index corresponding to the first spectrum slot of the overlapped spectrum resources is as follows:
according to the state index, SUC, shown in equation (2)olThe smaller the spectrum resource requested by the new service and the spectrum resource of the established path, that is, the less the spectrum resource occupied by the overlapped signal, the larger the second term of the formula, the more complete the idle spectrum resource existing after the pre-allocation, and the less likely to generate fragments, so that the larger the state index value is, the more suitable it is to be selected to be overlapped with the new service request in combination with the used spectrum resource and the unoccupied idle spectrum resource.
Therefore, according to the state indexes, the optimal optional path is selected as follows: and selecting the selectable path with the maximum state index value as the optimal selectable path. That is, when the screened multiple selectable paths can meet the service requirement of the new service request, according to the state index after the spectrum resource of the new service request is pre-allocated to the selectable paths, the selectable path with the maximum state index value is selected as the optimal selectable path, and the new service request establishes connection with the optimal selectable path to realize service data transmission. The selected optimal selectable path occupies less frequency spectrum resources, is not easy to generate fragments, and improves the resource utilization rate.
The following describes a routing resource allocation method according to this specification with reference to a specific embodiment.
As shown in fig. 3, the network topology includes 7 nodes 1-7, and when a new service request R arrives, the shortest path from the source node 1 to the destination node 7 is determined to be 1-2-4-6-7 (assuming that there is only one shortest path) according to the shortest routing algorithm. For ease of illustration, the paths shown represent transmission distances in terms of number of hops.
As shown in fig. 4A, 4B, 4C, and 4D, the established paths in the network are obtained, and four paths R having the same destination node as the new service request R are screened out1、r2、r3And r4. Wherein, the path r1Is 2-4-5-6-7, path r2Is 3-4-6-7, path r3Is 5-6-7, path r4Is 2-5-6-7.
And for the four paths, further screening out selectable paths according to the overlapping constraint conditions. For path r1Shortest path and path r1The coincident node of (2) is node 4, and from node 4, the shortest path and path r1Along different paths to the destination node 7, whereby path r1The overlap constraint is not satisfied. For path r2Shortest path and path r2The coincident node of (2) is node 4, and from node 4, the shortest path and path r2Along the same path 4-6-7 to the destination node 7, and path r2Used only once, and thus, path r2And may be selected as an alternative path. For path r3Shortest path and path r3The coincident node of (2) is a node 6, and the shortest path and the path r start from the node 63Along the same path 6-7 to the destination node 7, and path r3Used only once, and thus, path r3And may be selected as an alternative path. For path r4Shortest path and path r4The coincident node of (2) is a node 6, and the shortest path and the path r start from the node 64Along the same path 6-7 to the destination node 7, and path r4Used only once, and thus, path r4And may be selected as an alternative path. Thus, through screening of the overlapping constraint conditions, the selectable path is determined to be r2、r3、r4。
And then, calculating the frequency spectrum resources required by the new service request, setting the transmission rate required by the new service to be 100bits/s, setting the frequency spectrum efficiency m of the modulation format to be 3, and obtaining the required frequency spectrum slots with the number of 3 according to the calculation formula.
As shown in fig. 5A, 5B, the desired spectral slots are pre-allocated on alternative paths. A total of 11 spectrum slots are set on a link. The shortest path is split into a first path 1-2-4 and a second path 4-6-7.
For path r2Which over 11 spectral slots of the path 3-4-6-7, occupies 3 consecutive spectral slots starting from the 3 rd spectral slot. On a first path, determining a spectrum interval corresponding to occupied spectrum resources, namely determining a spectrum interval formed by 3 rd to 5 th spectrum slots on the first path, starting from the 3 rd spectrum slot to the 5 th spectrum slot, searching whether spectrum resources required by a new service request exist, namely, searching whether continuous 3 spectrum slots exist starting from the 3 rd spectrum slot, finding that the 5 th spectrum slot overlaps with the spectrum interval, and the 6 th to 7 th spectrum slots are continuous idle spectrum slots (as shown in fig. 5A), and determining that the first path can meet resource allocation of the new service request. On the second path, the occupied search interval is formed by the 3 rd to 5 th spectrum slots, the 5 th to 7 th spectrum slots are found to be partially overlapped with the search interval, and the non-overlapped part is an idle spectrum slot, namely, the 5 th spectrum slot is overlapped with the occupied spectrum slot, the 6 th and 7 th spectrum slots are idle spectrum slots (as shown in fig. 5B), it is determined that the second path can meet the resource allocation of the new service request, and on the first and second paths, the 5 th to 7 th spectrum slots all meet the condition, and can meet the requirements of spectrum continuity and consistency.
FIG. 6A shows the path r2The pre-allocation result obtained by the resource state of the spectrum resource of the new service pre-allocation request is as follows: occupied spectrum slot and spectrum slot required by new service request are on path r2The number of occupied frequency spectrum slots is 5 (3 rd to 7 th frequency spectrum slots), and the pre-allocated path r2The number of the last remaining free spectrum portions is 2, the number of spectrum slots of the first free spectrum portion is 1 (2 nd spectrum slot), and the number of spectrum slots of the second free spectrum portion is 1 (11 th spectrum slot). On path r according to the new service request2Calculating the state index according to the pre-distribution result:
wherein Max is calculated according to equation (3) for a link having 11 spectral slotsfThe value is 100.
For path r3Which over 11 spectral slots of the path 5-6-7 occupies 3 consecutive spectral slots starting from the 4 th spectral slot. On the first path, determining a frequency spectrum interval formed from the 4 th frequency spectrum slot to the 6 th frequency spectrum slot, starting from the 4 th frequency spectrum slot to the 6 th frequency spectrum slot, searching whether continuous 3 frequency spectrum slots exist, and enabling R and R to be3Not only meets the condition that the part is overlapped, but also the part which is not overlapped is a free spectrum slot; and determining that the 5 th to the 7 th frequency spectrum slots are overlapped with the 5 th and the 6 th frequency spectrum slots, and the 7 th frequency spectrum slot is idle, and determining that the first path can meet the resource allocation of the new service request. On the second path, the occupied search interval is formed by the 4 th to the 6 th spectrum slots, the 5 th to the 7 th spectrum slots are found to be partially overlapped with the search interval, and the non-overlapped part is an idle spectrum slot, namely, the 5 th and the 6 th spectrum slots are overlapped with the occupied spectrum slot, and the 7 th spectrum slot is an idle spectrum slot, and the second path is determined to be capable of meeting the resource allocation of the new service request.
FIG. 6B shows the path r3The pre-allocation result obtained by the resource state of the spectrum resource of the new service pre-allocation request is as follows: occupied spectrum slot and spectrum slot required by new service request are on path r3The number of occupied frequency spectrum slots is 4 (4 th to 7 th frequency spectrum slots), and the pre-allocated path r3The number of the last remaining free spectrum segments is 3, the number of spectrum slots of the first free spectrum segment is 3 (1 st to 3 rd spectrum slots), the number of spectrum slots of the second free spectrum segment is 1 (8 th spectrum slot), and the number of spectrum slots of the third free spectrum segment is 1 (11 th spectrum slot). On path r according to the new service request3Calculating the state index according to the pre-distribution result:
for path r4Which over 11 spectral slots of the path 2-5-6-7, occupies 3 consecutive spectral slots starting from the 3 rd spectral slot. According to path r2The determining method determines that the first path and the second path can meet the resource allocation of the new service request. FIG. 6C shows the path r4The pre-allocation result obtained by the resource state of the spectrum resource of the new service pre-allocation request is as follows: occupied spectrum slot and spectrum slot required by new service request are on path r4The number of occupied frequency spectrum slots is 5 (3 rd to 7 th frequency spectrum slots), and the pre-allocated path r4The number of the last remaining free spectrum segments is 3, the number of spectrum slots of the first free spectrum segment is 2 (1 st-2 nd spectrum slots), the number of spectrum slots of the second free spectrum segment is 1 (8 th spectrum slot), and the number of spectrum slots of the third free spectrum segment is 1 (11 th spectrum slot). On path r according to the new service request4Calculating the state index according to the pre-distribution result:
with reference to fig. 2, an embodiment of the present disclosure provides a routing resource allocation method, where when a new service request arrives, a shortest path is calculated first, then an optional path that meets an overlap constraint condition with the shortest path is selected from established paths, spectrum resources required by the new service are pre-allocated on the optional path, a state index is calculated according to a pre-allocation result, and an optional path with an optimal state index is selected for carrying service data transmission of the new service request, so as to update a network resource state; if no optional path meeting the conditions is found, or the state index of the optional path does not reach a preset value, a K shortest path algorithm (selecting the K paths with the shortest distance in all reachable paths) and/or a first hit algorithm (searching whether enough continuous spectrum slots can accommodate the request in the public spectrum resources of the passed paths according to the number of the spectrum slots required by the new service request, and allocating the found first spectrum segment meeting the conditions to the new service request) are adopted to select a proper path for establishing connection for the new service request. The method of the embodiment preferentially selects the frequency spectrum resource which can be overlapped and shared with the established path, allocates the optimal resource for the new service request, and can provide the resource utilization rate.
It should be noted that the method of one or more embodiments of the present disclosure may be performed by a single device, such as a computer or server. The method of the embodiment can also be applied to a distributed scene and completed by the mutual cooperation of a plurality of devices. In such a distributed scenario, one of the devices may perform only one or more steps of the method of one or more embodiments of the present disclosure, and the devices may interact with each other to complete the method.
It should be noted that the above description describes certain embodiments of the present disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.
As shown in fig. 7, an embodiment of the present specification provides a routing resource allocation apparatus, including:
the shortest path calculation module is used for determining the shortest path between the source node and the destination node according to the new service request;
the optional path determining module is used for determining at least one optional path which accords with the overlapping constraint condition with the shortest path from the established paths;
the pre-allocation module is used for calculating the spectrum resources required by the new service request, pre-allocating the spectrum resources on each selectable path and obtaining the pre-allocation result of each selectable path;
the index calculation module is used for calculating the state indexes of all the selectable paths according to the pre-distribution result;
and the path determining module is used for selecting the optimal optional path as the path of the new service request according to the state index.
For convenience of description, the above devices are described as being divided into various modules by functions, and are described separately. Of course, the functionality of the modules may be implemented in the same one or more software and/or hardware implementations in implementing one or more embodiments of the present description.
The apparatus of the foregoing embodiment is used to implement the corresponding method in the foregoing embodiment, and has the beneficial effects of the corresponding method embodiment, which are not described herein again.
Fig. 8 is a schematic diagram illustrating a more specific hardware structure of an electronic device according to this embodiment, where the electronic device may include: a processor 1010, a memory 1020, an input/output interface 1030, a communication interface 1040, and a bus 1050. Wherein the processor 1010, memory 1020, input/output interface 1030, and communication interface 1040 are communicatively coupled to each other within the device via bus 1050.
The processor 1010 may be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits, and is configured to execute related programs to implement the technical solutions provided in the embodiments of the present disclosure.
The Memory 1020 may be implemented in the form of a ROM (Read Only Memory), a RAM (Random Access Memory), a static storage device, a dynamic storage device, or the like. The memory 1020 may store an operating system and other application programs, and when the technical solution provided by the embodiments of the present specification is implemented by software or firmware, the relevant program codes are stored in the memory 1020 and called to be executed by the processor 1010.
The input/output interface 1030 is used for connecting an input/output module to input and output information. The i/o module may be configured as a component in a device (not shown) or may be external to the device to provide a corresponding function. The input devices may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output devices may include a display, a speaker, a vibrator, an indicator light, etc.
The communication interface 1040 is used for connecting a communication module (not shown in the drawings) to implement communication interaction between the present apparatus and other apparatuses. The communication module can realize communication in a wired mode (such as USB, network cable and the like) and also can realize communication in a wireless mode (such as mobile network, WIFI, Bluetooth and the like).
It should be noted that although the above-mentioned device only shows the processor 1010, the memory 1020, the input/output interface 1030, the communication interface 1040 and the bus 1050, in a specific implementation, the device may also include other components necessary for normal operation. In addition, those skilled in the art will appreciate that the above-described apparatus may also include only those components necessary to implement the embodiments of the present description, and not necessarily all of the components shown in the figures.
The electronic device of the foregoing embodiment is used to implement the corresponding method in the foregoing embodiment, and has the beneficial effects of the corresponding method embodiment, which are not described herein again.
Computer-readable media of the present embodiments, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device.
Those of ordinary skill in the art will understand that: the discussion of any embodiment above is meant to be exemplary only, and is not intended to intimate that the scope of the disclosure, including the claims, is limited to these examples; within the spirit of the present disclosure, features from the above embodiments or from different embodiments may also be combined, steps may be implemented in any order, and there are many other variations of different aspects of one or more embodiments of the present description as described above, which are not provided in detail for the sake of brevity.
In addition, well-known power/ground connections to Integrated Circuit (IC) chips and other components may or may not be shown in the provided figures, for simplicity of illustration and discussion, and so as not to obscure one or more embodiments of the disclosure. Furthermore, devices may be shown in block diagram form in order to avoid obscuring the understanding of one or more embodiments of the present description, and this also takes into account the fact that specifics with respect to implementation of such block diagram devices are highly dependent upon the platform within which the one or more embodiments of the present description are to be implemented (i.e., specifics should be well within purview of one skilled in the art). Where specific details (e.g., circuits) are set forth in order to describe example embodiments of the disclosure, it should be apparent to one skilled in the art that one or more embodiments of the disclosure can be practiced without, or with variation of, these specific details. Accordingly, the description is to be regarded as illustrative instead of restrictive.
While the present disclosure has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of these embodiments will be apparent to those of ordinary skill in the art in light of the foregoing description. For example, other memory architectures (e.g., dynamic ram (dram)) may use the discussed embodiments.
It is intended that the one or more embodiments of the present specification embrace all such alternatives, modifications and variations as fall within the broad scope of the appended claims. Therefore, any omissions, modifications, substitutions, improvements, and the like that may be made without departing from the spirit and principles of one or more embodiments of the present disclosure are intended to be included within the scope of the present disclosure.
Claims (10)
1. A method for allocating routing resources, comprising:
determining the shortest path between a source node and a destination node according to the new service request;
determining at least one optional path which accords with an overlapping constraint condition with the shortest path from the established paths;
calculating spectrum resources required by the new service request, and pre-distributing the spectrum resources on each optional path to obtain a pre-distribution result of each optional path;
calculating the state index of each selectable path according to the pre-distribution result;
and selecting the optimal optional path as the path of the new service request according to the state index.
2. The method of claim 1, wherein determining at least one alternative path from the established paths that meets an overlap constraint with the shortest path comprises:
selecting an intermediate path which is superposed with the shortest path at a superposed node and then continuously transmitted along the same path from the paths;
and determining the intermediate path with the use times less than two as the optional path.
3. The method of claim 2, wherein pre-allocating the spectrum resources on alternative paths comprises:
splitting an optional path into a first path and a second path, wherein the first path is from the source node to the coincident node, and the second path is from the coincident node to the destination node;
determining a frequency spectrum interval corresponding to the occupied frequency spectrum resource of the selectable path on the first path, and searching for a continuous frequency spectrum slot with the same size as the frequency spectrum resource, wherein one part of the frequency spectrum slot is partially overlapped with the frequency spectrum interval, and the other part of the frequency spectrum slot is an idle frequency spectrum slot;
and searching for a spectrum slot which is equal to the spectrum resource in size and is continuous on the second path, wherein one part of the spectrum slot is partially overlapped with the occupied spectrum resource of the selectable path, and the other part of the spectrum slot is a free spectrum slot.
4. A method according to claim 2 or 3, characterized by calculating the status indicator of each alternative path as:
and calculating the state index according to the number of the spectrum gaps occupied by the spectrum resources and the spectrum resources occupied by the selectable path on the superposed path, the number of the rest idle spectrum sections on the superposed path, the number of the spectrum gaps contained in the rest idle spectrum sections and the preset optimal state parameter of the overlapped spectrum resources.
5. The method of claim 4, wherein according to the status indicator, selecting the optimal alternative path is:
and selecting the selectable path with the maximum state index value as the optimal selectable path.
6. A routing resource allocation apparatus, comprising:
the shortest path calculation module is used for determining the shortest path between the source node and the destination node according to the new service request;
the optional path determining module is used for determining at least one optional path which accords with the overlapping constraint condition with the shortest path from the established paths;
the pre-allocation module is used for calculating the spectrum resources required by the new service request, and pre-allocating the spectrum resources on each selectable path to obtain the pre-allocation result of each selectable path;
the index calculation module is used for calculating the state indexes of all the selectable paths according to the pre-distribution result;
and the path determining module is used for selecting the optimal optional path as the path of the new service request according to the state index.
7. The apparatus of claim 6,
the optional path determining module is used for selecting an intermediate path which is superposed with the shortest path at a superposed node and then continuously transmitted along the same path from the paths; and determining the intermediate path with the use times less than two as the optional path.
8. The apparatus of claim 7,
the pre-allocation module is configured to split the selectable path into a first path and a second path, where the first path is from the source node to the coincident node, and the second path is from the coincident node to the destination node; determining a frequency spectrum interval corresponding to the occupied frequency spectrum resource of the selectable path on the first path, and searching for a continuous frequency spectrum slot with the same size as the frequency spectrum resource, wherein one part of the frequency spectrum slot is partially overlapped with the frequency spectrum interval, and the other part of the frequency spectrum slot is an idle frequency spectrum slot; and searching for a spectrum slot which is equal to the spectrum resource in size and is continuous on the second path, wherein one part of the spectrum slot is partially overlapped with the occupied spectrum resource of the selectable path, and the other part of the spectrum slot is a free spectrum slot.
9. The apparatus according to claim 6 or 7,
and the index calculation module is used for calculating the state index according to the number of the spectrum gaps occupied by the spectrum resources and the spectrum resources occupied by the selectable path on the superposed path, the number of the remaining idle spectrum segments on the superposed path, the number of the spectrum gaps contained by the remaining idle spectrum segments and the preset optimal state parameter of the overlapped spectrum resources.
10. The apparatus of claim 9,
the path determining module is configured to select the selectable path with the largest state index value as the optimal selectable path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111283271.9A CN114205284A (en) | 2021-11-01 | 2021-11-01 | Routing resource allocation method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111283271.9A CN114205284A (en) | 2021-11-01 | 2021-11-01 | Routing resource allocation method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114205284A true CN114205284A (en) | 2022-03-18 |
Family
ID=80646601
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111283271.9A Pending CN114205284A (en) | 2021-11-01 | 2021-11-01 | Routing resource allocation method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114205284A (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130266316A1 (en) * | 2012-04-09 | 2013-10-10 | Ming Xia | Method for routing and spectrum assignment |
| CN106506362A (en) * | 2016-11-23 | 2017-03-15 | 重庆邮电大学 | A kind of elastic optical network multilink fault probability guard method of minimum failure risk loss |
| CN106973335A (en) * | 2017-01-23 | 2017-07-21 | 苏州大学 | The frequency spectrum resource optimal method and system perceived based on reliability |
| CN110011922A (en) * | 2019-04-07 | 2019-07-12 | 西安电子科技大学 | Using the RSA method of traffic forecast and frequency spectrum conversion in elastic optical network |
| CN111641556A (en) * | 2020-04-27 | 2020-09-08 | 北京邮电大学 | Routing resource allocation method and device of optical network |
| CN111865800A (en) * | 2020-07-07 | 2020-10-30 | 烽火通信科技股份有限公司 | Routing frequency spectrum allocation method and device suitable for elastic optical network |
| WO2021088420A1 (en) * | 2019-11-05 | 2021-05-14 | 苏州大学 | Dedicated protection method and system for multi-fiber-core flexible spectrum optical network |
| CN112995805A (en) * | 2021-02-04 | 2021-06-18 | 南京邮电大学 | Routing and spectrum allocation method based on path idleness in EON |
| CN113099328A (en) * | 2021-04-07 | 2021-07-09 | 重庆邮电大学 | Resource allocation method of multi-core elastic optical network based on node and crosstalk perception |
-
2021
- 2021-11-01 CN CN202111283271.9A patent/CN114205284A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130266316A1 (en) * | 2012-04-09 | 2013-10-10 | Ming Xia | Method for routing and spectrum assignment |
| CN106506362A (en) * | 2016-11-23 | 2017-03-15 | 重庆邮电大学 | A kind of elastic optical network multilink fault probability guard method of minimum failure risk loss |
| CN106973335A (en) * | 2017-01-23 | 2017-07-21 | 苏州大学 | The frequency spectrum resource optimal method and system perceived based on reliability |
| CN110011922A (en) * | 2019-04-07 | 2019-07-12 | 西安电子科技大学 | Using the RSA method of traffic forecast and frequency spectrum conversion in elastic optical network |
| WO2021088420A1 (en) * | 2019-11-05 | 2021-05-14 | 苏州大学 | Dedicated protection method and system for multi-fiber-core flexible spectrum optical network |
| CN111641556A (en) * | 2020-04-27 | 2020-09-08 | 北京邮电大学 | Routing resource allocation method and device of optical network |
| CN111865800A (en) * | 2020-07-07 | 2020-10-30 | 烽火通信科技股份有限公司 | Routing frequency spectrum allocation method and device suitable for elastic optical network |
| CN112995805A (en) * | 2021-02-04 | 2021-06-18 | 南京邮电大学 | Routing and spectrum allocation method based on path idleness in EON |
| CN113099328A (en) * | 2021-04-07 | 2021-07-09 | 重庆邮电大学 | Resource allocation method of multi-core elastic optical network based on node and crosstalk perception |
Non-Patent Citations (4)
| Title |
|---|
| PEIYI LI: "Spectrum Overlap based Routing and Resource Allocation (SO-RRA) in Elastic Optical Networks (EON)"", 《2021 19TH INTERNATIONAL CONFERENCE ON OPTICAL COMMUNICATIONS AND NETWORKS (ICOCN)》, pages 1 - 3 * |
| YONGJUN ZHANG: "Overview on routing and resource allocation based machine learning in optical networks", 《OPTICAL FIBER TECHNOLOGY》 * |
| 张盛峰等: "弹性光网络中资源节约型组播路由和频谱分配策略", 《光通信技术》 * |
| 张盛峰等: "弹性光网络中资源节约型组播路由和频谱分配策略", 《光通信技术》, no. 03, 15 March 2018 (2018-03-15) * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114268371B (en) | Quantum channel resource allocation method and device and electronic equipment | |
| CN109002357B (en) | Resource allocation method and device and Internet of things system | |
| CN111031519B (en) | Terminal access authentication method and device based on edge calculation | |
| CN103813475A (en) | Data transmission method, data acquisition method and electronic device | |
| CN112491741B (en) | Virtual network resource allocation method and device and electronic equipment | |
| CN111641556B (en) | Routing resource allocation method and device of optical network | |
| CN113179154B (en) | Resource joint distribution method in quantum key distribution Internet of things and related equipment | |
| CN112418389A (en) | Data processing method and device, electronic equipment and computer readable storage medium | |
| CN114205296A (en) | Network access method, device, medium and electronic equipment | |
| CN114205284A (en) | Routing resource allocation method and device | |
| CN110839166B (en) | Data sharing method and device | |
| CN110933758B (en) | Interference coordination method and device, and base station | |
| CN113163408B (en) | Wireless resource allocation method and device | |
| CN115729645A (en) | Micro-service configuration method and device, electronic equipment and readable storage medium | |
| CN114157573A (en) | Method and device for deploying virtualized network function | |
| CN112600765B (en) | Method and device for scheduling configuration resources | |
| CN114253730A (en) | Method, device and equipment for managing database memory and storage medium | |
| CN111090520B (en) | User allocation method and device for exclusive resources, electronic equipment and storage medium | |
| CN112688793B (en) | Data packet obtaining method and device and electronic equipment | |
| CN112883239A (en) | Resource allocation method and device, computer equipment and storage medium | |
| CN113596630B (en) | Routing resource allocation method and device of hybrid grid optical network | |
| CN111585784A (en) | Network slice deployment method and device | |
| CN110366205B (en) | Method and device for selecting initial source node in mobile opportunity network traffic unloading | |
| CN114785851B (en) | Resource call processing method and device, storage medium and electronic equipment | |
| CN118118437A (en) | Method for computing and unloading and related equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20230718 Address after: 750001 No.716, Huanghe East Road, Jinfeng District, Yinchuan City, Ningxia Hui Autonomous Region Applicant after: ELECTRIC POWER RESEARCH INSTITUTE OF STATE GRID NINGXIA ELECTRIC POWER Co.,Ltd. Applicant after: Beijing University of Posts and Telecommunications Applicant after: STATE GRID NINGXIA ELECTRIC POWER Co.,Ltd. Address before: 750001 No.716, Huanghe East Road, Jinfeng District, Yinchuan City, Ningxia Hui Autonomous Region Applicant before: ELECTRIC POWER RESEARCH INSTITUTE OF STATE GRID NINGXIA ELECTRIC POWER Co.,Ltd. Applicant before: Beijing University of Posts and Telecommunications |