CN113438173B - Routing and spectrum allocation method, device, storage medium and electronic equipment - Google Patents
Routing and spectrum allocation method, device, storage medium and electronic equipment Download PDFInfo
- Publication number
- CN113438173B CN113438173B CN202111000041.7A CN202111000041A CN113438173B CN 113438173 B CN113438173 B CN 113438173B CN 202111000041 A CN202111000041 A CN 202111000041A CN 113438173 B CN113438173 B CN 113438173B
- Authority
- CN
- China
- Prior art keywords
- frequency slot
- frequency
- slots
- path
- connection request
- 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.)
- Active
Links
- 238000001228 spectrum Methods 0.000 title claims abstract description 148
- 238000000034 method Methods 0.000 title claims abstract description 50
- 239000013598 vector Substances 0.000 claims abstract description 67
- 239000011159 matrix material Substances 0.000 claims abstract description 48
- 230000003287 optical effect Effects 0.000 claims description 45
- 238000004590 computer program Methods 0.000 claims description 7
- 238000004364 calculation method Methods 0.000 claims description 5
- 238000010586 diagram Methods 0.000 description 9
- 230000008569 process Effects 0.000 description 7
- 230000000903 blocking effect Effects 0.000 description 5
- 230000002787 reinforcement Effects 0.000 description 5
- 230000005540 biological transmission Effects 0.000 description 4
- 239000003795 chemical substances by application Substances 0.000 description 4
- 239000013307 optical fiber Substances 0.000 description 4
- 230000003595 spectral effect Effects 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 230000033001 locomotion Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012549 training Methods 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000010801 machine learning Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
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/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a routing and spectrum allocation method, a device, a storage medium and an electronic device, wherein the method comprises the following steps: the method comprises the steps of obtaining a service connection request, obtaining candidate paths and corresponding links, establishing a path link relation matrix according to the candidate paths and the corresponding links, calculating the number of idle frequency slots, idle frequency slot slots, the number of idle frequency slot slots and the average size of the idle frequency slot slots on each candidate path, obtaining an available frequency slot set according to the number of frequency slots to be occupied and the idle frequency slot slots, obtaining the initial position and size of the available frequency slot in the available frequency slot set, obtaining a one-dimensional spectrum state distribution vector, inputting the service connection request, the path link relation matrix and the spectrum state distribution vector into a trained route and spectrum distribution model, obtaining a route and spectrum distribution result corresponding to the service connection request, and improving the utilization rate of spectrum resources.
Description
Technical Field
The present invention relates to the field of optical fiber communication technologies, and in particular, to a routing and spectrum allocation method, apparatus, storage medium, and electronic device.
Background
In recent years, research on applying deep reinforcement learning to routing and spectrum allocation of an optical network has been receiving attention. For machine learning problems, data and features determine the upper limit of performance, and models and algorithms only approach this upper limit. In deep reinforcement learning based routing and spectrum allocation, the input state represents the structure and characteristics of data, so state representation is very critical.
However, most of the current routing and spectrum allocation methods based on deep reinforcement learning do not consider the problems of whether frequency slot resource distribution of links in an optical network is concentrated and whether the frequency slot resource state is congested in the state representation, so that the frequency slot resource utilization rate is low and the network blocking rate is high in the routing and spectrum allocation process of the optical network.
Disclosure of Invention
Based on this, the present invention provides a routing and spectrum allocation method, apparatus, medium, and electronic device, which have the advantages of improving the utilization rate of spectrum resources and reducing the network blocking rate.
According to a first aspect of embodiments of the present application, there is provided a routing and spectrum allocation method, including the following steps:
acquiring a service connection request and a frequency slot resource state of a current optical network, wherein the service connection request comprises a source node, a destination node and a spectrum width;
acquiring a plurality of candidate paths between the source node and the destination node and the number of frequency slots required to be occupied by the service connection request on each candidate path according to the service connection request and the frequency slot resource state of the current optical network; wherein each of the candidate paths consists of one or more links;
establishing a path link relation matrix according to the candidate paths and the corresponding links;
according to the state of each frequency slot on the candidate paths, calculating the number of idle frequency slots, the number of idle frequency slots and the average size of the idle frequency slots on each candidate path;
obtaining an available frequency slot set according to the frequency slot number to be occupied and the idle frequency slot;
obtaining the initial position and the size of the available frequency slot which is positioned most front on the frequency slot axis in the available frequency slot set;
splicing the number of the idle frequency slots, the number of the idle frequency slot slots, the size of the available frequency slot set, the initial position and the size of the available frequency slot and the average size of the idle frequency slot to obtain a one-dimensional spectrum state distribution vector;
and inputting the service connection request, the path link relation matrix and the spectrum state distribution vector into a trained routing and spectrum allocation model to obtain a routing and spectrum allocation result corresponding to the service connection request.
According to a second aspect of the embodiments of the present application, there is provided a routing and spectrum allocation apparatus, including:
the request acquisition module is used for acquiring a service connection request and the frequency slot resource state of the current optical network, wherein the service connection request comprises a source node, a destination node and a spectrum width;
a path obtaining module, configured to obtain, according to the service connection request and a frequency slot resource state of the current optical network, multiple candidate paths between the source node and the destination node and a number of frequency slots that the service connection request needs to occupy on each candidate path; wherein each of the candidate paths consists of one or more links;
a matrix establishing module, configured to establish a path link relationship matrix according to the candidate path and the corresponding link;
the frequency slot calculation module is used for calculating the number of idle frequency slots, the average size of the idle frequency slots and the average size of the idle frequency slots on each candidate path according to the state of each frequency slot on each candidate path;
a frequency slot obtaining module, configured to obtain an available frequency slot set according to the number of frequency slots to be occupied and the idle frequency slots;
a position obtaining module, configured to obtain, in the available frequency slot set, a starting position and a size of an available frequency slot that is located most forward on a frequency slot axis;
a vector obtaining and splicing module, configured to splice the number of idle frequency slots, the size of the available frequency slot set, the initial position and size of the available frequency slot, and the average size of the idle frequency slots, to obtain a one-dimensional spectrum state distribution vector;
and the result obtaining module is used for inputting the service connection request, the path link relation matrix and the spectrum state distribution vector into a trained routing and spectrum allocation model to obtain a routing and spectrum allocation result corresponding to the service connection request.
According to a third aspect of embodiments of the present application, there is provided an electronic apparatus, including: a processor and a memory; wherein the memory stores a computer program adapted to be loaded by the processor and to perform the routing and spectrum allocation method according to any of the above.
According to a fourth aspect of embodiments of the present application, there is provided a computer-readable storage medium, on which a computer program is stored, which, when executed by a processor, implements a routing and spectrum allocation method as described in any one of the above.
According to the method and the device, a service connection request and a frequency slot resource state of a current optical network are obtained, wherein the service connection request comprises a source node, a destination node and a spectrum width, and a plurality of candidate paths between the source node and the destination node and the number of frequency slots required to be occupied by the service connection request on each candidate path are obtained according to the service connection request and the frequency slot resource state of the current optical network; wherein, each candidate path is composed of one or more links, a path link relation matrix is established according to the candidate path and the corresponding link, the number of idle frequency slots, and the average size of idle frequency slots on each candidate path are calculated according to the state of each frequency slot on the candidate path, an available frequency slot set is obtained according to the number of frequency slots to be occupied and the idle frequency slots, the initial position and size of the available frequency slot positioned most forward on a frequency slot axis in the available frequency slot set are obtained, the number of idle frequency slots, the size of the available frequency slot set, the initial position and size of the available frequency slot, and the average size of the idle frequency slot are spliced to obtain a one-dimensional spectrum state distribution vector, and inputting the service connection request, the path link relation matrix and the spectrum state distribution vector into a trained routing and spectrum allocation model to obtain a routing and spectrum allocation result corresponding to the service connection request. The invention takes the service connection request, the path link relation matrix and the spectrum state distribution vector as the input of the route and spectrum allocation model, thereby fully considering the problems of whether the frequency gap resource distribution of the link in the optical network is centralized and whether the frequency gap resource state is blocked, further reducing the network blocking rate of the route and spectrum allocation by the route and spectrum allocation model and improving the utilization rate of the spectrum resource.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application.
For a better understanding and practice, the invention is described in detail below with reference to the accompanying drawings.
Drawings
FIG. 1 is a schematic flow chart of a routing and spectrum allocation method of the present invention;
FIG. 2 is a flow chart illustrating the calculation of the visual saliency map at S20 in the routing and spectral allocation method of the present invention;
fig. 3 is a schematic flow chart of S22 in the routing and spectrum allocation method of the present invention;
FIG. 4 is a schematic diagram of the topology of the optical network in the routing and spectrum allocation method according to the present invention;
fig. 5 is a schematic flow chart of S30 in the routing and spectrum allocation method of the present invention;
fig. 6 is a schematic flow chart of S40 in the routing and spectrum allocation method of the present invention;
FIG. 7 is a schematic diagram of a link frequency slot state in the routing and spectrum allocation method of the present invention;
fig. 8 is a schematic flow chart of S50 in the routing and spectrum allocation method of the present invention;
fig. 9 is a schematic flow chart of S80 in the routing and spectrum allocation method of the present invention;
fig. 10 is a block diagram of a routing and spectrum allocation apparatus according to the present invention;
fig. 11 is a block diagram of the route obtaining module 92 of the routing and spectrum allocation apparatus according to the present invention;
fig. 12 is a block diagram of a frequency slot number calculating unit 924 of the routing and spectrum allocation apparatus according to the present invention;
fig. 13 is a block diagram of a matrix building module 93 for a routing and spectrum allocation apparatus according to the present invention;
fig. 14 is a block diagram of the frequency slot calculating module 94 of the routing and spectrum allocation apparatus according to the present invention;
fig. 15 is a block diagram of a slot acquisition module 95 of the routing and spectrum allocation apparatus according to the present invention;
fig. 16 is a block diagram of the result obtaining module 98 of the routing and spectrum allocation apparatus according to the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more clear, embodiments of the present application will be described in further detail below with reference to the accompanying drawings.
It should be understood that the embodiments described are only a few embodiments of the present application, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The terminology used in the embodiments of the present application is for the purpose of describing particular embodiments only and is not intended to be limiting of the embodiments of the present application. As used in the examples of this application and the appended claims, the singular forms "a", "an", and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It should also be understood that the term "and/or" as used herein refers to and encompasses any and all possible combinations of one or more of the associated listed items.
When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the application, as detailed in the appended claims. In the description of the present application, it is to be understood that the terms "first," "second," "third," and the like are used solely to distinguish one from another and are not necessarily used to describe a particular order or sequence, nor are they to be construed as indicating or implying relative importance. The specific meaning of the above terms in the present application can be understood by those of ordinary skill in the art as appropriate.
Further, in the description of the present application, "a plurality" means two or more unless otherwise specified. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship.
Referring to fig. 1, an embodiment of the present invention provides a routing and spectrum allocation method, including the following steps:
s10, acquiring service connection request and current optical network frequency gap resource state, wherein the service connection request includes source node, destination node and spectrum width.
The optical network is a wide area network, a metropolitan area network or a newly-built large-scale local area network which uses optical fibers as main transmission media, the optical fibers are connected through nodes, and a plurality of adjacent nodes are connected to form links of the optical network. The frequency slots are units for storing and transmitting data in the links, the fixed bandwidth of each frequency slot is 12.5Gbps, the frequency slot resources are the number of the frequency slots which can be accommodated on all the links in the optical network, and the spectrum resource states comprise the occupied state and the idle state of the frequency slots. The occupied state of the frequency slot refers to the state of the frequency slot which is allocated in the service connection process, and the idle state refers to the state of the frequency slot which is not allocated in the service connection process.
The service connection request is a request for establishing optical fiber communication from one node of the optical network to another node and transmitting service data, the node for inputting data is a source node, the node for receiving data is a destination node, and the data transmission rate is the spectrum width.
In the embodiment of the present application, after the optical network operates for a period of time, in the dynamic establishment and removal process of the service connection, the frequency slots are continuously allocated, released, and reused, so that some frequency slots in the optical network are in an occupied state, and some frequency slots are in an idle state, and therefore, when the service connection request is established, the current frequency slot resource state of the optical network should be acquired. The source node and the destination node are generated from the current optical network through a poisson process, and the spectrum bandwidth is set to be a multiple of 12.5 between 25 and 100, and the unit is Gbps. Wherein the poisson process is to select two random nodes in the optical network topology and make the two nodes mutually exclusive.
S20, according to the service connection request and the frequency slot resource state of the current optical network, obtaining a plurality of candidate paths between the source node and the destination node and the number of frequency slots required to be occupied by the service connection request on each candidate path; wherein each of the candidate paths is composed of one or more links.
In the embodiment of the present application, a plurality of links are formed between adjacent nodes from a source node to a destination node through a plurality of other nodes, and the plurality of links form a path in combination, so that a plurality of paths exist from the source node to the destination node, and these paths are candidate paths of a service connection request of the present application, where each candidate path is composed of one or more links. According to the different selected positions of the source node and the destination node and the different spectrum widths in the specific service connection request, the number of frequency slots required to be occupied by the service connection request on each candidate path can be calculated.
And S30, establishing a path link relation matrix according to the candidate paths and the corresponding links.
The path link relation matrix is used for representing the connection relation among a plurality of links on each candidate path in the optical network topology structure.
And S40, calculating the number of idle frequency slots, the average size of the idle frequency slots and the average size of the idle frequency slots on each candidate path according to the state of each frequency slot on the candidate paths.
In the embodiment of the present application, the state of each frequency slot includes an occupied state and an unoccupied state (idle state). On a frequency slot axis, the occupied state can be represented by 0, the idle state can be represented by 1, and the number of idle frequency slots on each candidate path can be calculated by accumulating the frequency slots which are 1 on the frequency slot axis on each candidate path.
The idle frequency slot is composed of one or more consecutive adjacent idle frequency slots. When the idle slot is acquired, the state representation corresponding to the adjacent frequency slots can be obtained by and operation on the frequency slot axis. Wherein, the calculation rule of AND operation is as follows: 1&1=1, 1&0=0, 0&0=0, when a frequency slot is represented by 0 for an occupied state and a frequency slot is represented by 1 for an idle state, and when a plurality of consecutive adjacent frequency slots are all idle states, the and operation result of these consecutive adjacent frequency slots is 1, and when the next adjacent frequency slot is represented by 0 for an occupied state, the and operation result is 0, then a plurality of adjacent idle frequency slots before the occupied state are taken as one idle frequency slot, and thus, the number of idle frequency slot slots on each candidate path is calculated.
The average size of the idle frequency slot is the ratio of the number of the idle frequency slots to the number of the idle frequency slots, and if the value is large, the idle frequency slot is sparsely distributed, the link flow is concentrated, and the network state is not blocked. On the contrary, if the value is small, the idle frequency slot distribution is dense, the link traffic distribution is scattered, and the network state is congested.
And S50, obtaining an available frequency slot set according to the frequency slot number to be occupied and the idle frequency slot.
In this embodiment of the present application, there may be a plurality of idle frequency slots, and if the number of idle frequency slots corresponding to the idle frequency slot is greater than or equal to the number of frequency slots to be occupied, the idle frequency slot is an available frequency slot that satisfies the service connection request, and the available frequency slots form an available frequency slot set.
S60, obtaining the starting position and size of the available frequency slot located most forward on the frequency slot axis in the available frequency slot set.
Alternatively, the starting position and size of the available slot positioned most forward on the frequency slot axis may be acquired by the First-Fit method. The First-First method is one of continuous physical memory allocation methods, and idle memory blocks are connected in a mode of increasing addresses. When the memory is allocated, the memory is searched backwards from the head of the chain table, namely, the memory is searched from a low address to a high address, and once the memory block which can meet the requirement is found, the memory block is allocated. The starting position and size are characteristic information of the available frequency bins that meet the bandwidth requirements.
And S70, splicing the number of the idle frequency slots, the size of the available frequency slot set, the initial position and the size of the available frequency slot and the average size of the idle frequency slot to obtain a one-dimensional spectrum state distribution vector.
In this embodiment of the present application, the number of idle frequency slots, the size of the available frequency slot set, the starting position and size of the available frequency slot, and the average size of the idle frequency slot are spliced into a one-dimensional spectrum state distribution vector, and 6 elements in the spectrum state distribution vector corresponding to the 6 values are used to represent the spectrum distribution state of the link.
And S80, inputting the service connection request, the path link relation matrix and the spectrum state distribution vector into a trained routing and spectrum allocation model to obtain a routing and spectrum allocation result corresponding to the service connection request.
Before inputting the service connection request, the path link relation matrix, and the spectrum state distribution vector to the trained routing and spectrum allocation model, the embodiment of the present application also trains the routing and spectrum allocation model. The routing and spectrum allocation model is composed of a plurality of agents which run in parallel, and the routing and spectrum allocation model is trained based on an asynchronous dominant motion evaluation method of deep reinforcement learning, wherein each agent receives state representation of an optical network, then selects a candidate path from a plurality of candidate paths from a source node to a destination node for routing and spectrum allocation, if the routing and spectrum allocation are successful, a received reward value is positive, and if the routing and spectrum allocation are unsuccessful, the received reward value is negative. In this embodiment of the present application, the state representation includes a service connection request, the path link relation matrix, and the spectrum state distribution vector. Specifically, each agent includes a policy network and a value network, the policy network receives the status representation, then how to process and generate actions, the actions act on the optical network to select a candidate path from the optical network for routing and spectrum allocation, and the reward value is received after allocation is completed. The value network evaluates the reward value. If the data transmission in the service connection request is successful from the source node to the destination node, the routing and the spectrum allocation are successful; if the data transmission in the service connection request fails, the routing and spectrum allocation fails, and the reward value is-1.
Policy network for each agent
And value network
Setting the weight parameter of the policy network
And weight parameters of said value network
，
Is a representation of the state of the optical network received at time t,
is the time t policy network base
Generated action, update weight parameter
And
is carried out for each period of time, each period of time comprising
A continuous movement (time step)
To
) The weight parameter is composed of
To the direction of
，
To the direction of
And (6) updating. After a period of training, the parameters are given by the following formula for a small batch (batch size is
) A gradient up or down update is performed. Wherein, the updating formula is as follows:
wherein,
is an estimate of the merit function, given by
By applying the embodiment of the invention, a plurality of candidate paths between a source node and a destination node and the number of frequency slots required to be occupied by a service connection request on each candidate path are obtained according to the service connection request and the frequency slot resource state of the current optical network by obtaining the service connection request and the frequency slot resource state of the current optical network, wherein the service connection request comprises the source node, the destination node and the spectral width; wherein, each candidate path is composed of one or more links, a path link relation matrix is established according to the candidate path and the corresponding link, the number of idle frequency slots, and the average size of idle frequency slots on each candidate path are calculated according to the state of each frequency slot on the candidate path, an available frequency slot set is obtained according to the number of frequency slots to be occupied and the idle frequency slots, the initial position and size of the available frequency slot positioned most forward on a frequency slot axis in the available frequency slot set are obtained, the number of idle frequency slots, the size of the available frequency slot set, the initial position and size of the available frequency slot, and the average size of the idle frequency slot are spliced to obtain a one-dimensional spectrum state distribution vector, and inputting the service connection request, the path link relation matrix and the spectrum state distribution vector into a trained routing and spectrum allocation model to obtain a routing and spectrum allocation result corresponding to the service connection request. The invention takes the service connection request, the path link relation matrix and the frequency spectrum state distribution vector as the input of the routing and frequency spectrum distribution model, thereby fully considering the problems of whether the frequency gap resource distribution of the link in the optical network is centralized and whether the frequency gap resource state is blocked, reducing the network blocking rate of the routing and frequency spectrum distribution model and improving the utilization rate of the frequency spectrum resource.
In an alternative embodiment, referring to fig. 2, the step S20 includes steps S21 to S22, which are as follows:
s21, according to the service connection request and the frequency slot resource state of the current optical network, calculating a plurality of candidate paths between a source node and a destination node by a shortest path method;
in the embodiment of the present application, a plurality of candidate paths between a source node and a destination node are calculated by a shortest path method, specifically, the shortest path method is a Dijkstra method, and a path through which a path from a certain node passes along an edge of a directed graph with weights to another node is called a shortest path, where a sum of weights on each edge is the smallest.
And S22, calculating the frequency slot number occupied by the service connection request on each candidate path according to the distance of each candidate path and the spectrum width.
In the embodiment of the application, different service connection requests have different requirements on frequency spectrum width and different numbers of frequency slots to be occupied by calculation due to different distances from a source node to a destination node. Specifically, the distance of each candidate path is compared with a preset distance interval, and a distance interval corresponding to each candidate path is obtained. And for the same distance interval, calculating the frequency slot number according to the ratio of the frequency spectrum width to the frequency spectrum fixed bandwidth.
In an alternative embodiment, referring to fig. 3, the step S22 includes steps S221 to S222, which are as follows:
s221, acquiring all links of each candidate path, traversing nodes of each link, acquiring the distance of each link according to a preset node topology distance table, and summing the distances to obtain the distance of each candidate path;
s222, comparing the distance of each candidate path with a preset distance interval, and calculating the frequency slot number of the service connection request on each candidate path according to the distance interval of the distance of each candidate path and the frequency spectrum width; the frequency slot number is calculated in the following way:
wherein,
is shown as
The distance of the candidate path is determined,
，
is a fixed bandwidth of one slot, with a size of 12.5Gbps,
for the said width of the frequency spectrum,
requesting for said service connection at
And the number of frequency slots required to be occupied on the candidate path.
In the embodiment of the present application, for the same spectrum width, the farther the distance is, the more frequency slots need to be occupied, and the closer the distance is, the less frequency slots need to be occupied. For service connection requests in the same distance range, the larger the frequency spectrum width is, the more the frequency slots need to be occupied, the smaller the frequency spectrum width is, the less the frequency slots need to be occupied, the distance of the candidate paths is divided into four distance intervals, and the frequency slots need to be occupied on each candidate path of the service connection requests are calculated according to the distance intervals and the frequency spectrum width. As shown in fig. 4, there are three nodes in the optical network, where node 1 is a source node, node 2 is a destination node, node 3 is an intermediate node, the total number K of candidate paths from the source node to the destination node is 2, the total number L of corresponding links is 6, and the corresponding sequence numbers (i) to (ii) are zero. For the first candidate path, if the distance of the link (i) is 500km and the spectrum width is 50Gbps, the calculated frequency slot number is 2; for the second candidate path, the distance of the link c is 750km, the second candidate path is 1500km, the spectrum width is 50Gbps, and the calculated frequency slot number is 3.
In an alternative embodiment, referring to fig. 5, the step S30 includes steps S31 to S33, which are as follows:
s31, acquiring the total number K of the candidate paths and the total number L of the links;
s32, acquiring the serial number of the link in the total link
And the link number corresponding to each candidate path k of the link
Wherein
，
，
represents the candidate path k
A link;
s33, constructing a path link relation matrix R with the size of KxL, wherein elements of the path link relation matrix
Representing candidate paths
And a link
If the link is
Corresponds to a candidate path
In (1)
Elements of the path-link relation matrix
Is arranged as
(ii) a Otherwise, the element is processed
Is set to 0.
In the embodiment of the present application, as shown in fig. 4, for a first candidate path, that is, a link (i) is a 1 st link of the first candidate path, and for a second candidate path, that is, a link (c) to a link (c), the link (c) and the link (c) are respectively a 1 st link and a 2 nd link of the second candidate path, so as to construct a path-link relationship matrix R as follows:
in an alternative embodiment, referring to fig. 6, the step S40 includes steps S41 to S42, which are as follows:
s41, calculating the comprehensive state of each frequency slot on each candidate path according to the occupation state of each frequency slot in each link on the candidate path; wherein if the frequency slot is occupied in one or more links on the candidate path, the integrated state of the frequency slot on the candidate path is occupied, and if the frequency slot is not occupied in all links on the candidate path, the integrated state of the frequency slot on the candidate path is idle;
s42, obtaining the number of idle frequency slots, the number of idle frequency slot slots and the average size of the idle frequency slot slots on each candidate path according to the comprehensive state of each frequency slot on the candidate path; the idle frequency slot is composed of one or more continuous idle frequency slots, and the average size of the idle frequency slot is the ratio of the number of the idle frequency slots to the number of the idle frequency slots.
In the embodiment of the present application, please refer to fig. 7, there are 6 gap frequency slots (blank squares) and 4 occupied frequency slots (grey squares) on the frequency slot axis of the link (r) of the first candidate path. Since the first candidate path only has the link (r), the integrated state of each frequency slot of the first candidate path is the state of each frequency slot on the link (r). Specifically, the slot includes 3 idle frequency slots, the 1 st idle frequency slot includes 2 idle frequency slots, the 2 nd idle frequency slot includes 3 idle frequency slots, the 3 rd idle frequency slot includes 1 idle frequency slot, and the average size of the idle frequency slot is 2. On the frequency slot axis of the link (c) of the second candidate path, there are 6 gap frequency slots and 4 occupied frequency slots; on the frequency gap axis of link (c), there are 7 gap frequency gaps and 3 occupied frequency gaps. Since the frequency slots with the numbers of 7, 8 and 9 on the frequency slot axis are occupied in the link three and the link five, the frequency slots with the numbers of 0, 1, 2, 4 and 5 on the second candidate path are in an idle state, the rest are in an occupied state, the number of idle frequency slots is 5, the number of idle frequency slots is 2, the 1 st idle frequency slot comprises 3 idle frequency slots, the 2 nd idle frequency slot comprises 2 idle frequency slots, and the average size of the idle frequency slots is 2.5.
In an alternative embodiment, referring to fig. 8, the step S50 includes steps S51 to S53, which are as follows:
s51, comparing the maximum value of the idle frequency slot number corresponding to each idle frequency slot on each candidate path with the frequency slot number to be occupied;
s52, if the maximum value of the idle frequency slot number is larger than or equal to the frequency slot number to be occupied, determining the idle frequency slot as the available frequency slot meeting the service connection request;
and S53, obtaining the available frequency slot set meeting the service connection request according to the available frequency slot.
In this embodiment of the present application, for a first candidate path, since the number of frequency slots required to be occupied by a service connection request is 2, and the number of idle frequency slots of a 1 st idle frequency slot and a 2 nd idle frequency slot is 2 and 3, respectively, the 1 st idle frequency slot and the 2 nd idle frequency slot are both determined as available frequency slots, and the two idle frequency slots form an available frequency slot set. For the second candidate path, since the number of frequency slots required to be occupied by the service connection request is 3 and the number of idle frequency slots of the 1 st idle frequency slot is 3, the 1 st idle frequency slot is determined as an available frequency slot.
In an alternative embodiment, referring to fig. 9, the step S80 includes steps S81 to S83, which are as follows:
s81, converting the source node and the destination node in the service connection request into two one-dimensional row vectors
And
converting the path link relation matrix K multiplied by L into a one-dimensional row vector M; the one-dimensional row vector M has a row dimension of 1 and a column dimension of K × L;
s82, converting the one-dimensional row vector
And
vector splicing is carried out on the one-dimensional row vector M and the frequency spectrum state distribution vector to obtain a state vector S;
and S83, inputting the state vector S into the trained routing and spectrum allocation model to obtain the routing and spectrum allocation result.
In the embodiment of the present application, the source node and the destination node are respectively modeled as a one-dimensional row vector
And
each element on the one-dimensional row vector represents a node of the optical network, the source node and the destination node are 1, and the other nodes are 0. That is to say that the first and second electrodes,
，
. Converting the path link relation matrix K multiplied by L into a one-dimensional row vector
. For the first candidate path, the spectrum state distribution vector
. For the second candidate wayPath of the spectral state distribution vector
. The vector is measured
、
、
、
And
and splicing to obtain the state vector S.
Referring to fig. 10, an embodiment of the present invention provides a routing and spectrum allocation apparatus 9 based on deep reinforcement learning, which includes:
a request obtaining module 91, configured to obtain a service connection request and a frequency slot resource state of a current optical network, where the service connection request includes a source node, a destination node, and a spectrum width;
a path obtaining module 92, configured to obtain, according to the service connection request and a frequency slot resource state of the current optical network, multiple candidate paths between the source node and the destination node and a number of frequency slots that the service connection request needs to occupy on each candidate path; wherein each of the candidate paths consists of one or more links;
a matrix establishing module 93, configured to establish a path link relationship matrix according to the candidate path and the corresponding link;
a frequency slot calculating module 94, configured to calculate, according to a state of each frequency slot on the candidate paths, the number of idle frequency slots, and an average size of the idle frequency slots on each candidate path;
a frequency slot obtaining module 95, configured to obtain an available frequency slot set according to the number of frequency slots to be occupied and the idle frequency slots;
a position obtaining module 96, configured to obtain, in the set of available frequency slots, a starting position and a size of an available frequency slot located most forward on a frequency slot axis;
a vector obtaining module 97, configured to splice the number of idle frequency slots, the size of the available frequency slot set, the starting position and size of the available frequency slot, and the average size of the idle frequency slots, to obtain a one-dimensional spectrum state distribution vector;
a result obtaining module 98, configured to input the service connection request, the path link relation matrix, and the spectrum state distribution vector to a trained routing and spectrum allocation model, and obtain a routing and spectrum allocation result corresponding to the service connection request.
Optionally, referring to fig. 11, the path obtaining module 92 includes:
a path calculating unit 922, configured to calculate, according to the service connection request and the frequency slot resource state of the current optical network, multiple candidate paths between a source node and a destination node by using a shortest path method;
a frequency slot number calculating unit 924, configured to calculate, according to the distance of each candidate path and the spectrum width, the number of frequency slots that the service connection request needs to occupy on each candidate path.
Optionally, referring to fig. 12, the frequency slot number calculating unit 924 includes:
a link obtaining unit 926, configured to obtain all links of each candidate path, traverse nodes of each link, obtain a distance of each link according to a preset node topology distance table, and sum the distances to obtain a distance of each candidate path;
a distance dividing unit 928, configured to divide the distance of each candidate path into a preset number of distance intervals, and calculate, according to the distance intervals and the spectrum width, the number of frequency slots that the service connection request needs to occupy on each candidate path.
Optionally, referring to fig. 13, the matrix building module 93 includes:
a number obtaining unit 932, configured to obtain the total number K of the candidate paths and the total number L of the links;
a number obtaining unit 934 for obtaining the number of the link in the total link
And the link number corresponding to each candidate path k of the link
Wherein
，
，
represents the candidate path k
A link;
a matrix constructing unit 936, configured to construct a path-link relation matrix R with a size of K × L, where an element of the path-link relation matrix R
Representing candidate paths
And a link
If the link is
Corresponds to a candidate path
In (1)
Elements of the path-link relation matrix
Is arranged as
(ii) a Otherwise, the element is processed
Is set to 0.
Optionally, referring to fig. 14, the frequency slot calculating module 94 includes:
a state calculating unit 942, configured to calculate, according to an occupation state of each frequency slot in each link on the candidate path, a comprehensive state of each frequency slot on each candidate path; wherein if the frequency slot is occupied in one or more links on the candidate path, the integrated state of the frequency slot on the candidate path is occupied, and if the frequency slot is not occupied in all links on the candidate path, the integrated state of the frequency slot on the candidate path is idle;
an idle frequency slot obtaining unit 944, configured to obtain, according to the comprehensive state of each frequency slot on the candidate path, the number of idle frequency slots, the number of idle frequency slot slots, and an average size of the idle frequency slot slots on each candidate path; the idle frequency slot is composed of one or more continuous idle frequency slots, and the average size of the idle frequency slot is the ratio of the number of the idle frequency slots to the number of the idle frequency slots.
Optionally, referring to fig. 15, the frequency slot obtaining module 95 includes:
a frequency slot ratio comparing unit 952, configured to compare the maximum value of the number of idle frequency slots corresponding to each idle frequency slot on each candidate path with the number of frequency slots to be occupied;
a frequency slot determining unit 954, configured to determine the idle frequency slot as an available frequency slot that satisfies the service connection request if the maximum value of the number of idle frequency slots is greater than or equal to the number of frequency slots to be occupied;
a slot set obtaining unit 956, configured to obtain, according to the available slot, an available slot set that satisfies the service connection request.
Optionally, referring to fig. 16, the result obtaining module 98 includes:
a vector conversion unit 982 for converting the source node and the destination node in the service connection request into two one-dimensional row vectors
And
converting the path link relation matrix K multiplied by L into a one-dimensional row vector M; the one-dimensional row vector M has a row dimension of 1 and a column dimension of K × L;
a vector stitching unit 984 for stitching the one-dimensional row vectors
And
vector splicing is carried out on the one-dimensional row vector M and the frequency spectrum state distribution vector to obtain a state vector S;
a state input unit 986, configured to input the state vector S to the trained routing and spectrum allocation model, so as to obtain a routing and spectrum allocation result.
By applying the embodiment of the invention, a plurality of candidate paths between a source node and a destination node and the number of frequency slots required to be occupied by a service connection request on each candidate path are obtained according to the service connection request and the frequency slot resource state of the current optical network by obtaining the service connection request and the frequency slot resource state of the current optical network, wherein the service connection request comprises the source node, the destination node and the spectral width; wherein, each candidate path is composed of one or more links, a path link relation matrix is established according to the candidate path and the corresponding link, the number of idle frequency slots, and the average size of idle frequency slots on each candidate path are calculated according to the state of each frequency slot on the candidate path, an available frequency slot set is obtained according to the number of frequency slots to be occupied and the idle frequency slots, the initial position and size of the available frequency slot positioned most forward on a frequency slot axis in the available frequency slot set are obtained, the number of idle frequency slots, the size of the available frequency slot set, the initial position and size of the available frequency slot, and the average size of the idle frequency slot are spliced to obtain a one-dimensional spectrum state distribution vector, and inputting the service connection request, the path link relation matrix and the spectrum state distribution vector into a trained routing and spectrum allocation model to obtain a routing and spectrum allocation result corresponding to the service connection request. The invention takes the service connection request, the path link relation matrix and the spectrum state distribution vector as the input of the routing and spectrum allocation model, thereby fully considering whether the frequency slot resource distribution of the link in the optical network is centralized and whether the frequency slot resource state is blocked, reducing the network blocking rate of the routing and spectrum allocation performed by the routing and spectrum allocation model, and improving the utilization rate of the spectrum resource.
The present application further provides an electronic device, comprising: a processor and a memory; wherein the memory stores a computer program adapted to be loaded by the processor and to perform the method steps of the above embodiments.
The present application further provides a computer-readable storage medium, on which a computer program is stored, which computer program, when being executed by a processor, carries out the method steps of the above-mentioned embodiments.
The above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the invention. It should be noted that, to those skilled in the art, changes and modifications may be made without departing from the spirit of the present invention, and it is intended that the present invention encompass such changes and modifications.
Claims (10)
1. A method of routing and spectrum allocation, comprising:
acquiring a service connection request and a frequency slot resource state of a current optical network, wherein the service connection request comprises a source node, a destination node and a spectrum width;
acquiring a plurality of candidate paths between the source node and the destination node and the number of frequency slots required to be occupied by the service connection request on each candidate path according to the service connection request and the frequency slot resource state of the current optical network; wherein each of the candidate paths consists of one or more links;
establishing a path link relation matrix according to the candidate paths and the corresponding links;
according to the state of each frequency slot on the candidate paths, calculating the number of idle frequency slots, the number of idle frequency slots and the average size of the idle frequency slots on each candidate path;
obtaining an available frequency slot set according to the frequency slot number to be occupied and the idle frequency slot;
obtaining the initial position and the size of the available frequency slot which is positioned most front on the frequency slot axis in the available frequency slot set;
splicing the number of the idle frequency slots, the number of the idle frequency slot slots, the size of the available frequency slot set, the initial position and the size of the available frequency slot and the average size of the idle frequency slot to obtain a one-dimensional spectrum state distribution vector;
and inputting the service connection request, the path link relation matrix and the spectrum state distribution vector into a trained routing and spectrum allocation model to obtain a routing and spectrum allocation result corresponding to the service connection request.
2. The method according to claim 1, wherein the obtaining a plurality of candidate paths between the source node and the destination node and the number of frequency slots that the service connection request needs to occupy on each of the candidate paths according to the service connection request and the frequency slot resource status of the current optical network comprises:
calculating a plurality of candidate paths between a source node and a destination node by a shortest path method according to the service connection request and the frequency slot resource state of the current optical network;
and calculating the frequency slot number of the service connection request on each candidate path according to the distance of each candidate path and the spectrum width.
3. The method according to claim 2, wherein the calculating the number of frequency slots required to be occupied by the service connection request on each of the candidate paths according to the distance of each of the candidate paths and the spectrum width comprises:
acquiring all links of each candidate path, traversing nodes of each link, acquiring the distance of each link according to a preset node topology distance table, and summing the distances to obtain the distance of each candidate path;
comparing the distance of each candidate path with a preset distance interval, and calculating the frequency slot number of the service connection request on each candidate path according to the distance interval of the distance of each candidate path and the frequency spectrum width; the frequency slot number is calculated in the following way:
wherein,
is shown as
The distance of the candidate path is determined,
k represents a total number of the plurality of candidate paths,
is a fixed bandwidth of one slot, with a size of 12.5Gbps,
for the said width of the frequency spectrum,
requesting for said service connection at
And the number of frequency slots required to be occupied on the candidate path.
4. The method of claim 1, wherein said constructing a path-link relationship matrix from said candidate paths and corresponding said links comprises:
acquiring the total number K of the candidate paths and the total number L of the links;
obtaining the number of the link in the total link
And the link number corresponding to each candidate path k of the link
Wherein
，
，
represents the candidate path k
A link;
constructing a path link relation matrix R with the size of KxL, wherein elements of the path link relation matrix
Representing candidate paths
And a link
If the link is
Corresponds to a candidate path
In (1)
Elements of the path-link relation matrix
Is arranged as
(ii) a Otherwise, the element is processed
Is set to 0.
5. The method according to claim 1, wherein said calculating the number of free frequency slots, the average size of free frequency slots, and the average size of free frequency slots on each of the candidate paths according to the state of each frequency slot on the candidate paths comprises:
calculating the comprehensive state of each frequency slot on each candidate path according to the occupation state of each frequency slot in each link on the candidate path; wherein if the frequency slot is occupied in one or more links on the candidate path, the integrated state of the frequency slot on the candidate path is occupied, and if the frequency slot is not occupied in all links on the candidate path, the integrated state of the frequency slot on the candidate path is idle;
acquiring the number of idle frequency slots, the number of idle frequency slot slots and the average size of the idle frequency slot slots on each candidate path according to the comprehensive state of each frequency slot on the candidate path; the idle frequency slot is composed of one or more continuous idle frequency slots, and the average size of the idle frequency slot is the ratio of the number of the idle frequency slots to the number of the idle frequency slots.
6. The method according to claim 1, wherein said obtaining a set of available frequency slot slots according to the number of frequency slots to be occupied and the idle frequency slot slots comprises:
comparing the maximum value of the number of idle frequency slots corresponding to each idle frequency slot on each candidate path with the number of frequency slots to be occupied;
if the maximum value of the idle frequency slot number is larger than or equal to the frequency slot number to be occupied, determining the idle frequency slot as an available frequency slot meeting the service connection request;
and obtaining an available frequency slot set meeting the service connection request according to the available frequency slot.
7. The method according to claim 1, wherein the inputting the service connection request, the path link relation matrix, and the spectrum state distribution vector into a trained routing and spectrum allocation model to obtain a routing and spectrum allocation result corresponding to the service connection request comprises:
converting the source node and the destination node in the service connection request into two one-dimensional row vectors
And
converting the path link relation matrix into a one-dimensional row vector M; the one-dimensional row vector M has a row dimension of 1 and a column dimension of K × L; k is the total number of the candidate paths, and L is the total number of the links;
the one-dimensional row vector is processed
And
vector splicing is carried out on the one-dimensional row vector M and the frequency spectrum state distribution vector to obtain a state vector S;
and inputting the state vector S into a trained routing and spectrum allocation model to obtain a routing and spectrum allocation result.
8. A routing and spectrum allocation apparatus, comprising:
the request acquisition module is used for acquiring a service connection request and the frequency slot resource state of the current optical network, wherein the service connection request comprises a source node, a destination node and a spectrum width;
a path obtaining module, configured to obtain, according to the service connection request and a frequency slot resource state of the current optical network, multiple candidate paths between the source node and the destination node and a number of frequency slots that the service connection request needs to occupy on each candidate path; wherein each of the candidate paths consists of one or more links;
a matrix establishing module, configured to establish a path link relationship matrix according to the candidate path and the corresponding link;
the frequency slot calculation module is used for calculating the number of idle frequency slots, the average size of the idle frequency slots and the average size of the idle frequency slots on each candidate path according to the state of each frequency slot on each candidate path;
a frequency slot obtaining module, configured to obtain an available frequency slot set according to the number of frequency slots to be occupied and the idle frequency slots;
a position obtaining module, configured to obtain, in the available frequency slot set, a starting position and a size of an available frequency slot that is located most forward on a frequency slot axis;
a vector obtaining module, configured to splice the number of idle frequency slots, the size of the available frequency slot set, the initial position and size of the available frequency slot, and the average size of the idle frequency slots to obtain a one-dimensional spectrum state distribution vector;
and the result obtaining module is used for inputting the service connection request, the path link relation matrix and the spectrum state distribution vector into a trained routing and spectrum allocation model to obtain a routing and spectrum allocation result corresponding to the service connection request.
9. An electronic device, comprising: a processor and a memory; wherein the memory stores a computer program adapted to be loaded by the processor and to perform the routing and spectrum allocation method according to any of claims 1 to 7.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the routing and spectrum allocation method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111000041.7A CN113438173B (en) | 2021-08-30 | 2021-08-30 | Routing and spectrum allocation method, device, storage medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111000041.7A CN113438173B (en) | 2021-08-30 | 2021-08-30 | Routing and spectrum allocation method, device, storage medium and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113438173A CN113438173A (en) | 2021-09-24 |
| CN113438173B true CN113438173B (en) | 2021-11-23 |
Family
ID=77798280
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111000041.7A Active CN113438173B (en) | 2021-08-30 | 2021-08-30 | Routing and spectrum allocation method, device, storage medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113438173B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114584871B (en) * | 2022-04-28 | 2022-08-05 | 华南师范大学 | Spectrum allocation method, device, storage medium and equipment of elastic optical network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104836736A (en) * | 2015-05-26 | 2015-08-12 | 重庆邮电大学 | Spectrum sensing-based energy efficiency resource allocation and path reconfiguration method in elastic optical network |
| CN108134967A (en) * | 2017-11-27 | 2018-06-08 | 全球能源互联网研究院有限公司 | A kind of electric power optical-fiber network routing frequency spectrum distributing method and system |
| CN112383846A (en) * | 2020-11-13 | 2021-02-19 | 国网河南省电力公司信息通信公司 | Cloud-fog elastic optical network-oriented spectrum resource allocation method for advance reservation request |
| CN112911429A (en) * | 2021-02-04 | 2021-06-04 | 烽火通信科技股份有限公司 | Routing frequency spectrum allocation method and device based on dynamic elastic optical network |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2748957B1 (en) * | 2011-08-23 | 2019-02-20 | Telefonaktiebolaget LM Ericsson (publ) | Routing and bandwidth assignment for flexible grid wavelength switched optical networks |
| US9252912B2 (en) * | 2012-04-09 | 2016-02-02 | Telefonaktiebolaget L M Ericsson (Publ) | Method for routing and spectrum assignment |
| CN111865800B (en) * | 2020-07-07 | 2021-11-30 | 烽火通信科技股份有限公司 | Routing frequency spectrum allocation method and device suitable for elastic optical network |
| CN112995805B (en) * | 2021-02-04 | 2022-08-26 | 南京邮电大学 | Routing and spectrum allocation method based on path idleness in EON |
-
2021
- 2021-08-30 CN CN202111000041.7A patent/CN113438173B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104836736A (en) * | 2015-05-26 | 2015-08-12 | 重庆邮电大学 | Spectrum sensing-based energy efficiency resource allocation and path reconfiguration method in elastic optical network |
| CN108134967A (en) * | 2017-11-27 | 2018-06-08 | 全球能源互联网研究院有限公司 | A kind of electric power optical-fiber network routing frequency spectrum distributing method and system |
| CN112383846A (en) * | 2020-11-13 | 2021-02-19 | 国网河南省电力公司信息通信公司 | Cloud-fog elastic optical network-oriented spectrum resource allocation method for advance reservation request |
| CN112911429A (en) * | 2021-02-04 | 2021-06-04 | 烽火通信科技股份有限公司 | Routing frequency spectrum allocation method and device based on dynamic elastic optical network |
Non-Patent Citations (1)
| Title |
|---|
| 基于频谱候选窗的弹性光网络频谱分配方案;刘晓玲 等;《光通信技术》;20181130(第11期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113438173A (en) | 2021-09-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7072304B2 (en) | Network path selection based on bandwidth | |
| US20230333898A1 (en) | Working method and device for deep learning training task | |
| US6882627B2 (en) | Methods and apparatus for selecting multiple paths taking into account shared risk | |
| US6044075A (en) | Apparatus and method for routing a communication in a network | |
| CN106961343B (en) | Virtual mapping method and device | |
| CN109639575B (en) | Routing planning method based on link congestion coefficient | |
| US20140160980A1 (en) | Assigning Telecommunications Nodes to Community of Interest Clusters | |
| CN108696777A (en) | The flexible optical network resource distribution method of space division multiplexing frequency spectrum of minimum cross-talk | |
| CN110636007B (en) | Route arranging method, route arranger and system for edge computing network | |
| CN103699443B (en) | Task distribution method and scanner | |
| GB2536607A (en) | Optimizing a network topology to satisfy predicted growth | |
| CN1167554A (en) | Routing in a communication network | |
| CN102546440B (en) | Routing and wavelength assignment method and system | |
| CN109361547B (en) | Network slice link deployment method and device | |
| CN113438173B (en) | Routing and spectrum allocation method, device, storage medium and electronic equipment | |
| EP1378841A1 (en) | Method and apparatus for routing optimisation | |
| US7308494B1 (en) | Reprovisioning technique for an interconnect fabric design | |
| CN109302647B (en) | Spectrum allocation method, device and storage medium | |
| CN110996196A (en) | Optimal route optimizing method for optical transmission network optical path fiber core utilization | |
| de Oliveira et al. | Comparing multi-armed bandit algorithms and Q-learning for multiagent action selection: a case study in route choice | |
| CN111800352B (en) | Service function chain deployment method and storage medium based on load balancing | |
| CN112702267A (en) | Distributed training routing method, system, storage medium and computer equipment | |
| CN101651600B (en) | Method and device for updating link cost in grid network | |
| CN112671631B (en) | Packet transport network optimization method and system | |
| CN100440867C (en) | Method of real time soft seizing wave length route photo network |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |