Frequency spectrum allocation method based on disjoint connection group optimization in elastic optical network
Technical Field
The invention relates to an elastic optical network, and belongs to the technical field of spectrum resource allocation, in particular to a spectrum allocation method based on disjoint connection group optimization in an elastic optical network.
Background
The traditional Wavelength Division Multiplexing (WDM) network adopts a fixed grid spectrum allocation mode, and the coarse spectrum granularity of the traditional WDM network causes low utilization rate and poor flexibility of the optical network spectrum. In order to reduce the waste of Frequency spectrum resources, an Optical Orthogonal Frequency Division Multiplexing (O-OFDM) technology is introduced into an Elastic Optical Network (EON), so that a traditional WDM wavelength channel is supported to be converted into a Frequency Slot (FS) with smaller Frequency spectrum granularity for resource allocation, and meanwhile, the corresponding Frequency Slot can be allocated or combined according to service requirements, thereby improving the utilization rate of Network resources and transmission efficiency.
In the elastic optical network, an end-to-end route needs to be established for each newly arrived service and enough continuous Spectrum resources, namely, Route and Spectrum Allocation (RSA) needs to be allocated on each link. Spectrum allocation needs to meet spectrum consistency and continuity constraints: the spectrum consistency constraint means that each service must occupy the same frequency slot on all links passed by the route; the spectral continuity constraint means that the frequency slots occupied by each traffic on each link must be continuous and gapless. In the dynamic establishment and removal process of a network connection, a situation that remaining available frequency slots on a single link are discontinuous or adjacent idle frequency spectrums are inconsistent occurs, which is called a Spectrum Fragmentation (SF) problem, and problems such as a reduction in network resource utilization rate and an increase in service request blocking rate may be caused.
For spectrum allocation and fragmentation problems in the elastic optical network, some spectrum fragmentation reconstruction strategies are proposed by the academia, but a fragmentation reconstruction mechanism may interrupt service transmission, thereby reducing service transmission efficiency. Aiming at the defect, SeydouBa and the like propose a defragmentation strategy for Exchanging the services transmitted on the working Path and the Backup Path in 1+1, exchange the services transmitted on the working Path with the Backup Path, and defragment the services on the Backup Path, thereby ensuring uninterrupted transmission of data on the working Path, and the defect is that a defragmentation mechanism can be triggered under specific conditions, and has certain limitation for improving the utilization rate of spectrum resources [ Seydou Ba, Bijoy channel and Chatterjee, Eiji Oki. Xin Chen et al propose a route spectrum allocation strategy based on fragment sensing, determine system resource capacity by combining bandwidth allocation and service request size, adopt a spectrum allocation scheme with the lowest Fragmentation degree, have the advantages of low network blocking rate and the disadvantage of not considering the relation between spectrum allocation and service request rate [ X.Chen, J.Li, P.Zhu, R.Tang, Z.Chen and Y.He, Fragmentation-aware and allocation scheme based on distribution of traffic bandwidth in electronic networks.in IEEE/OSA Journal of Optical communication and network, Nov.1,2015,11(7): 1064-. Liu et al propose a defragmentation spectrum allocation strategy based on spectrum partitioning, define a dedicated region by request type and service strength, adopt First Fit allocation if there is an available frequency slot, otherwise search for the lowest conflict region and adopt Last Fit allocation, and finally start a recombination mechanism to dynamically calculate a dedicated spectrum block. Its advantages are high utilization rate of Spectrum, considering distribution result at different request rate, and high calculation complexity (H.L.Liu, L.Lv, Y.Chen and C.Wei.fragmentation-associating Spectrum Assignment Strategy Based on electronic Optical networks in IEEE semiconductors Journal, Oct.2017,5(9): 1-13.) as the number of partitions increases.
Disclosure of Invention
The invention aims to provide a frequency spectrum allocation method based on disjoint connection group optimization in an elastic optical network, which can improve the utilization rate of network links and reduce the service blocking rate.
In order to achieve the purpose, the invention adopts the following technical scheme: the frequency spectrum allocation method based on the disjoint connection group optimization in the elastic optical network comprises the following steps:
step (1): defining the service reached by each request as a connection group and marking the connection group as a vertex, generating a vertex parameter according to the bandwidth requirement and the routing length of each service, and storing the vertex into a vertex set until all the services reached by the requests are marked;
step (2): if an intersecting link exists between the two services, establishing an edge between vertexes corresponding to the two services, and storing the edge into an edge set until all the intersecting links are traversed;
and (3): generating a connection group graph according to the vertex set obtained in the step (1) and the edge set obtained in the step (2);
and (4): arranging all the top points which are not grouped in a descending order according to the size of the bandwidth demand, and executing the step (5) when the top point with the maximum bandwidth demand has two or more than two; when only one vertex with the maximum bandwidth requirement exists, selecting the vertex with the maximum bandwidth requirement as a mark vertex, and executing the step (6);
and (5): arranging vertexes with the same bandwidth requirement in a descending order according to the routing length, and selecting a vertex with the largest routing length as a mark vertex;
and (6): putting the service corresponding to the marked vertex into a non-intersecting connection group, adopting a first arrival matching strategy to carry out spectrum allocation, then putting the service corresponding to other vertexes adjacent to the marked vertex into the intersecting connection group, and adopting a last arrival matching strategy to carry out spectrum allocation;
and (7): and (4) if the residual non-grouped vertexes exist, executing the step (4) until the spectrum allocation of all services is completed.
Further, in the foregoing spectrum allocation method based on disjoint connection group optimization in an elastic optical network, the method includes: in step (1), the service request arrival rates are subject to poisson distribution with mean λ, and the service duration time is subject to negative exponential distribution with mean μ.
Through the implementation of the technical scheme, the invention has the beneficial effects that: based on the relation between fragments and service request characteristics, a network service topological graph is converted into a constructed attached graph, the link condition between services can be clearly reflected, the network blocking rate can be effectively reduced by preferentially distributing services with high bandwidth requirement and large routing length, and the spectrum inconsistency of different links can be avoided as far as possible by dividing the spectrum distribution strategies of a non-intersected connection group and an intersected connection group, so that the fragmentation degree in the network is reduced.
Drawings
Fig. 1 is a schematic diagram of a spectrum allocation result obtained after the First policy described in the background art is adopted.
Fig. 2 is a flowchart of a spectrum allocation method based on disjoint connection group optimization in an elastic optical network according to the present invention.
Fig. 3 is a schematic structural diagram of a network topology according to the present invention.
FIG. 4 is a schematic structural diagram of a connection group diagram according to the present invention.
Fig. 5 is a schematic diagram of a spectrum allocation result obtained by using the spectrum allocation method based on disjoint connection group optimization in the elastic optical network according to the present invention.
Detailed Description
The invention is further described with reference to the following figures and specific examples.
As shown in fig. 2, the method for allocating frequency spectrums based on disjoint connection group optimization in a resilient optical network includes the following steps:
step (1): service C to which each request arrivesiDefined as a connected set and marked as a vertex viAnd generating a vertex parameter w from the bandwidth requirement of each trafficiGenerating a vertex parameter r from the route length of each trafficiLet vertex vi(wi,ri) Storing the vertex set { V } until all the services which are requested to arrive are marked; namely: marking all service requests C1,C2,……C12Is a vertex v1,v2,……,v12The vertex parameters (w) are generated separately from the bandwidth requirement and route length of each request1,r1),(w2,r2),……,(w12,r12) Wherein, N service requests arrive, the arrival rates of the service requests obey Poisson distribution with the mean value of lambda, and the service duration obeys negative exponential distribution with the mean value of mu;
referring to fig. 3, a network topology diagram of 6 nodes and 8 links is assumed that 12 services arrive within a time window, and the source-destination node routing and bandwidth requirements corresponding to each service are shown in table 1:
table 1 traffic routing information
Business
|
Source node
|
Destination node
|
Routing path
|
Seizing a link
|
Route length
|
Bandwidth requirement
|
C1 |
A
| B
|
A-F-B | |
|
2,3
|
2
|
2
|
C2 |
F
|
C
|
F-B-C
|
3,4
|
2
|
1
|
C3 |
B
| E
|
B-C-E | |
|
4,5
|
2
|
3
|
C4 |
C
| E
|
C-E |
|
5
|
1
|
3
|
C5 |
B
| F
|
B-A-F | |
|
1,2
|
2
|
1
|
C6 |
F
|
B
|
F-B
|
3
|
1
|
2
|
C7 |
B
| D
|
B-C-D | |
|
4,6
|
2
|
1
|
C8 |
B
| C
|
B-C |
|
4
|
1
|
1
|
C9 |
C
| E
|
C-D-E | |
|
6,7
|
2
|
1
|
C10 |
C
| F
|
C-D-E-F | | |
|
6,7,8
|
3
|
1
|
C11 |
D
| E
|
D-E |
|
7
|
1
|
1
|
C12 |
A
| B
|
A-B |
|
1
|
1
|
4 |
Step (2): if two services CiAnd CjThere is an intersecting link between them, then the vertex v corresponding to two servicesiAnd vjBetween them establishes a side eijAnd the edge e is connectedijStoring the edge set { E } until all the intersected links are traversed;
and (3): generating a connection group diagram according to the vertex set { V } obtained in the step (1) and the edge set { E } obtained in the step (2); as shown in fig. 4, with service C2For example, Table 1 shows C2Is the service with the bandwidth requirement of 1 and the routing length of 2, and the vertex parameter generated by the serviceIs v is2(1, 2); additional service C2The service passing through the link 3 and the link 4 and also passing through the two links has C1、C3、C6、C7And C8Then vertex v2And v1、v3、v6、v7And v8Respectively establishing connection, and traversing all services and intersecting links to generate a connection group diagram;
and (4): all non-grouped vertexes are according to the bandwidth requirement wiArranging the sizes in a descending order, and executing the step (5) when two or more vertexes with the largest bandwidth requirements exist; when the peak with the largest bandwidth requirement is only one, selecting the bandwidth requirement wiThe largest vertex is taken as the labeled vertex v0Executing the step (6);
and (5): will bandwidth demand wiThe same vertex is routed by length riArranged in descending order, selecting the routing length riThe largest vertex is taken as the labeled vertex v0;
And (6): will mark the vertex v0Putting the corresponding service into a non-intersecting connection group, adopting a first arrival matching strategy (FirstFit strategy) to carry out spectrum allocation, and then marking a vertex v0Putting the services corresponding to other adjacent vertexes into an intersecting connection group, and performing spectrum allocation by adopting a last arrival matching strategy (LastFit strategy);
and (7): and (4) if the residual non-grouped vertexes exist, executing the step (4) until the spectrum allocation of all services is completed.
As shown in FIG. 3, all vertices are based on the bandwidth requirement wiIn descending order, with the largest being w12When the vertex v is equal to 4, the vertex v is set12Put into disjoint connection groups, corresponding service C12Adopting a First spectrum allocation algorithm; in addition, with v12Adjacent vertex v5Put into an intersecting connection group, corresponding service C5Adopting a Last Fit spectrum allocation algorithm; in the remaining ungrouped vertices, the bandwidth requirement wiThe largest vertex has v3And v4By the routing length riDescending order, select v3Putting in a phase as a mark vertexSet of intersections, v adjacent to the vertex2、v4、v7And v8Putting the service into an intersecting connection group, and sequentially distributing corresponding services based on a Last Fit spectrum distribution algorithm; selecting w among the remaining ungrouped verticesiAnd r isiMaximum vertex v1V placed adjacent to disjoint sets of connections6Putting the service into an intersecting connection group, and then distributing the corresponding service to the frequency slot of the corresponding link; the remaining three vertices wiIs equal according to riSorting in descending order v10Putting in a disjoint connection group, allocating corresponding services, after putting all vertices adjacent to the vertex in the intersected connection group, all vertices have traversed, table 2 is the final vertex grouping situation, the service spectrum allocation situation optimized by the spectrum allocation method of the present invention is shown in fig. 5, and it can be known that the spectrum allocation result diagram (as shown in fig. 5) obtained by adopting the spectrum allocation method based on disjoint connection group optimization in an elastic optical network of the present invention in fig. 5 is compared with the spectrum allocation result diagram (as shown in fig. 1) obtained by adopting the FirstFit policy in the background art, and the spectrum allocation method based on disjoint connection group optimization in the elastic optical network of the present invention has a higher network link utilization rate and a lower service blocking rate than the network link utilization rate of the spectrum allocation method in the background art.
TABLE 2 disjoint connection set and Cross connection set establishment
|
Step 1
|
Step 2
|
Step 3
|
Step 4
|
Disjoint sets of connections
|
v12 |
v3 |
v1 |
v10 |
Crossing connection group
|
v5 |
v2 v4 v7 v8 |
v6 |
v9 v11 |
Through the implementation of the technical scheme, the invention has the advantages that: based on the relation between fragments and service request characteristics, a network service topological graph is converted into a constructed attached graph, the link condition between services can be clearly reflected, the network blocking rate can be effectively reduced by preferentially distributing services with high bandwidth requirement and large routing length, and the spectrum inconsistency of different links can be avoided as far as possible by dividing the spectrum distribution strategies of a non-intersected connection group and an intersected connection group, so that the fragmentation degree in the network is reduced.