CN105490934B - A kind of fair routing and frequency spectrum distributing method based on fragment processing - Google Patents
A kind of fair routing and frequency spectrum distributing method based on fragment processing Download PDFInfo
- Publication number
- CN105490934B CN105490934B CN201610049605.9A CN201610049605A CN105490934B CN 105490934 B CN105490934 B CN 105490934B CN 201610049605 A CN201610049605 A CN 201610049605A CN 105490934 B CN105490934 B CN 105490934B
- Authority
- CN
- China
- Prior art keywords
- business
- frequency spectrum
- path
- routing
- fairness
- 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
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/22—Alternate routing
-
- 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
- H04L47/80—Actions related to the user profile or the type of traffic
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0005—Switch and router aspects
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a kind of fair routing based on fragment processing and frequency spectrum distributing methods, belong to elastic optical network routing and frequency spectrum distributing technique field.In the method, it is virtually " resource pool " by Internet resources such as routing and frequency spectrums, meets by using two-dimensional rectangle Packing model solutions " the small rectangular block " of frequency spectrum double constraints condition；By the perception service duration, the time departure of business is calculated, is the frequency spectrum resource that traffic assignments are neighbouring similar in time departure, reduces the generation of frequency spectrum fragment；Same particle sizes business is packaged into " small rectangular block " and is distributed with frequency spectrum to carry out routing by the fairness model for building combination grain business.This method disclosure satisfy that frequency spectrum adjacency and successional double constraints, avoids causing to block, improves the overall performance of network.
Description
Technical field
The invention belongs to elastic optical network routings and frequency spectrum distributing technique field, are related to a kind of justice handled based on fragment
Routing and frequency spectrum distributing method.
Background technology
As HD video, cloud computing equiband intensity business emerge in multitude, the information based on optical-fiber network passes
Defeated facility subjects the increasing pressure in terms of high bandwidth.Due to existing wavelength division multiplexed optical network (Wavelength
Division Multiplexing, WDM) using fixed channel spacing, i.e., it is the bandwidth resources of photosphere are coarse, uniform, rigidly
It is limited in a wavelength magnitude (generally 50GHz), leads to that WDM optical-fiber network flexibilities are low, bandwidth waste is serious, it is difficult to be supported
The application of super 100G business has not adapted to the following large capacity, high bandwidth, expansible flexible transmission needs.For this purpose, based on just
Hand over the elastic optical network of frequency multiplexing technique (Orthogonal Frequency Division Multiplexing, OFDM)
(Elastic Optical Networks, EONs) was suggested in 2009.EON uses OFDM technology by the bandwidth allocation of photosphere
Particle size reduction to the sub-wavelength magnitude (6.25GHz or 12.5GHz) of channel subcarrier, the i.e. basic unit of photosphere signal transmission not
It is the wavelength of coarseness again, but " frequency band " of more fine granulation (Frequency Slot, FS).It is mixed when bandwidth demand is different
When conjunction granularity service occurs, as long as the FS of number needed for its distribution.To effectively realize photosphere resource virtualization and by
It needs to configure, substantially increases network bandwidth utilization factor and flexible rate, so that it can support the business of 1Tb/s to transmit.
Routing is to realize that elastic optical network is high with frequency spectrum distribution (Routing and Spectrum Assignment, RSA)
The most basic problem of bandwidth for transmission.The distinctive resource fine granularity of elastic optical network turns to bandwidth allocation and brings new challenge, packet
The double constraints for how meeting frequency spectrum adjacency and spectral continuity are included, influence of the frequency spectrum fragment to resource utilization how is reduced
And how to guarantee fairness.Document [Jinno M, Kozicki B, Takara H, et al.Distance-adaptive
spectrum resource allocation in spectrum-sliced elastic optical path network
[J].IEEE Communications Magazine,2010,48(8):138-145.] from the angle for meeting RSA double constraints
Set out, it is proposed that it is a kind of apart from adaptive spectrum resource allocation methods to ensure that the frequency spectrum number used is minimum, spectrum efficiency compared with
Height, but the problem for also bringing complexity excessively high.Document [Christodoulopoulos K, Tomkos I, Varvarigos E
A.Elastic bandwidth allocation in flexible OFDM-based optical networks[J]
.Journal of Lightwave Technology,2011,29(9):1354-1366.] will routing and frequency spectrum distributing method point
Solution is routing, modulation and frequency spectrum distribute two benches and handle respectively, and reach drop to business sorting consistence using simulated annealing method
Low computation complexity, the purpose for improving the availability of frequency spectrum, but there is no the influences for considering frequency spectrum fragment.For this purpose, document [Castro
A,Velasco L,Ruiz M,et al.Dynamic routing and spectrum(re)allocation in future
flexgrid optical networks[J].Computer Networks,2012,56(12):2869-2883.] propose frequency
Spectrum reconstruction method provides required frequency band for service dynamic, to reduce the generation of frequency spectrum fragment, reduce the blocking rate of network.
Although document above route for elastic optical network and proposes different solutions in frequency spectrum assignment problem, all do not examine
Consider the fairness problem of different grain size business RSA.Make full use of and the flexible dispatching of elastic optical network resource are to sacrifice justice
Property for cost, the refinement of frequency spectrum granularity so that the granularity of business it is slightly larger may be unsatisfactory for frequency spectrum adjacency and it is successional about
Beam, to block.And such case is just less prominent by the WDM optical-fiber networks of basic allocation unit of wavelength.As it can be seen that
The refinement of bandwidth unit leads to the blocking rate of combination grain business, and there are larger differences, this is to big granularity service in elastic optical network
It brings and seriously affects, cause the deterioration of network overall performance.
For this purpose, document [Fujii S, HirotaY, Murakami K, et al.Path division method for
fairness in dynamic elastic optical path networks[C]//2012International
Conference on Photonics in Switching(PS2012),Ajaccio,France:IEEE press,2012:
1-3.] relationship that utilizes path distance and modulation, long jump business is divided into several short jumps, and the method for hop-by-hop pathfinding avoids list
A business obstruction, achievees the effect that reduce network blocking probability.However this design lacks only for single business to combination grain
The processing of gap between business.Document [Ma S, Wang Y, Guo B, et al.A fairness-aware dynamic
spectrum allocation scheme in elastic optical networks[C]//OptoElectronics
and Communications Conference and Photonics in Switching(OECC/PS2013),Kyoto
Japan:IEEE press,2013:1-2.] frequency spectrum in network is uniformly divided into several regions first, then blocking rate is differed
Maximum region is handled, to improve fairness.But do not consider the availability of frequency spectrum.Document [Ma Songwei, Guo Bingli, it is old
Newly, fairness perception dynamic frequency spectrum deployment scheme (English) [J] photon journals based on effectiveness in elastic optical networks are waited,
2014,43(7):1-5.] using utility function reduce blocking rate gap between different grain size business, to balance fairness and
Contradiction between blocking rate.But lacks the processing to frequency spectrum fragment, influence network performance.Document [Bonani LH, dos
Santos Tozetti A,Callegati F,et al.Routing issues on spectrum sharing and
partitioning for flexible optical networks[C]//201416th International
Conference on Transparent Optical Networks(ICTON2014),Graz,Austria:IEEE
press,2014:1-4.] network is equally assigned into the identical region of n size, and transmit identical grain in each spectral regions
The business of degree, to reduce the probability of frequency spectrum fragment formation, but since the frequency band number that different grain size business needs is different, for not
One-size traffic assignments size same asset may bring inequitable problem.Document [Callegati F, Bonani L,
Lezama F,et al.Trunk Reservation for Fair Utilization in Flexible Optical
Networks[J].IEEE Communication Letters,2014,18(5):1-4.] by main line future mechanism (Trunk
Reservation, TR) introduce elastic optical network to handle fairness problem, i.e., if business granularity exceeds thresholding, block
The business.The fairness between different grain size business can be realized well by setting thresholding, but fairness is runed counter to blocking rate,
Thus method guarantees fairness so that blocking rate is higher.
Invention content
In view of this, the purpose of the present invention is to provide a kind of fair routing based on fragment processing and frequency spectrum distribution sides
Method, this method, can be using current network entirety situations as foundation, when the business of considering as a whole reaches by considering the business duration
The service condition of rear resources in network is left with business.
In order to achieve the above objectives, the present invention provides the following technical solutions：
A kind of fair routing and frequency spectrum distributing method based on fragment processing, in the method, by nets such as routing and frequency spectrums
Network resource is virtually " resource pool ", meets the " small of frequency spectrum double constraints condition by using two-dimensional rectangle Packing model solutions
Rectangular block "；By the perception service duration, the time departure of business is calculated, is that traffic assignments similar in time departure are neighbouring
Frequency spectrum resource, reduce the generation of frequency spectrum fragment；The fairness model for building combination grain business, same particle sizes business is packaged
It is distributed with frequency spectrum at " small rectangular block " to carry out routing.
Further, in the method, described business time departure is calculated by the business duration to be：tleaving=
tarrival+tholding, wherein tleaving、tarrivalAnd tholdingRespectively the time departure of business, reach time and duration；
Business has been distributed there may be multiple time departures are identical in network, to determine path optimizing, optimizes road
Diameter back-and-forth method (Optimal Path SelectedPolicy, OPSP), specifically includes following steps：
Step 1：It finds in immediate distributed near business of time departure and can use frequency band, if it is present being determined as
Path optimizing；
Step 2：If the path that step 1 obtains is not unique, it is maximum that continuous frequency band is discharged after selecting business to leave away；
Step 3：If path optimizing is not still unique, frequency spectrum continuity degree is high is allocated for selection；Frequency spectrum continuity degree is fixed
Justice is：Maxmize(2*x+y),t≥tleave, wherein x, y are followed successively by business and leave generation in continuation degree horizontally and vertically.
Further, the method distributed with frequency spectrum that route is：First according to combination grain fairness model by different grains
Degree business is packaged as transmission block, then obtains K alternative path by KSP methods, then perceive by the business duration, according to
OPSP obtains path optimizing, if path optimizing is not unique at this time, is selected as far as possible according to two-dimensional rectangle Packing models basic principle
The position in the lower left corner is selected, compact layout is carried out, specifically includes following steps：
Step 1：Business is packaged into transmission block；
Step 2：To each transmission block, determine that k items are alternative by k shortest-path methods (k-shortest-path, KSP)
Set of paths；For each business in block, path is selected according to OPSP step 1, if the path is unique, it is determined that it is excellent
Change path；If there are a plurality of such path, step 3 is jumped to；If there are a business can not find path optimizing, jump to
Step 5；
Step 3：Path optimizing is selected according to OPSP step 2；If there is a plurality of path optimizing, then step 4 is jumped to；If
Such path can not be found, then jumps to step 5；
Step 4：To determine path optimizing, screened by OPSP step 3；If the selection result is unique, it is determined that it is
Path optimizing；If can not still determine, according to two-dimensional rectangle Packing model basic principles, lower-left angular frequency is selected as far as possible
Spectrum；Otherwise, step 5 is jumped to；
Step 5：Block all business, method in the transmission block to terminate.
The beneficial effects of the present invention are：The method of the invention will be route and the Internet resources such as frequency spectrum are virtually " resource
Pond " solves " the small rectangular block " for meeting frequency spectrum double constraints condition by using two-dimensional rectangle Packing theories；Pass through perception
The business duration is the frequency spectrum resource that traffic assignments are neighbouring similar in time departure, reduces the generation of frequency spectrum fragment；Structure is mixed
Same particle sizes business is packaged into " small rectangular block " and is distributed with frequency spectrum to carry out routing by the fairness model for closing granularity service.
Description of the drawings
In order to keep the purpose of the present invention, technical solution and advantageous effect clearer, the present invention provides following attached drawing and carries out
Explanation：
Fig. 1 is two-dimensional rectangle Packing schematic diagrames；
Fig. 2 is continuation degree schematic diagram；
Fig. 3 is frequency spectrum distribution schematic diagram；
Fig. 4 is the flow diagram of the method for the invention.
Specific implementation mode
Below in conjunction with attached drawing, the preferred embodiment of the present invention is described in detail.
Fig. 4 is the flow diagram of the method for the invention, in the method, the Internet resources such as routing and frequency spectrum are virtual
For " resource pool ", meet by using two-dimensional rectangle Packing model solutions " the small rectangular block " of frequency spectrum double constraints condition；It is logical
The perception service duration is spent, the time departure of business is calculated, is the frequency spectrum resource that traffic assignments are neighbouring similar in time departure,
Reduce the generation of frequency spectrum fragment；The fairness model for building combination grain business, " small rectangle is packaged by same particle sizes business
Block " distributes to carry out routing with frequency spectrum.
Specifically：
Due to the present invention is directed to the fairness of Strengthens network resource allocation, reducing network spectrum fragment.Related notion and weighing apparatus
Amount means are as follows：
One, fairness
Fairness is the average sex chromosome mosaicism for handling Internet resources distribution, is suitable for judging whether resource is average with one kind
Mode distribute to business.The distribution according to need of elastic optical network exacerbates the difference of combination grain service blocking rate, and then influences
The fairness of business.It is to judge whether resource is fair to the obstruction of different grain size business to define fairness in the present invention.
To carry out quantitative evaluation to fairness, the concept of fairness index (Fairness Index, FI) is proposed.It is basic herein
On, for the fairness quantification problem of combination grain business, propose combination grain business fairness index.For convenience of measurement, by grain
It spends identical business and is divided into same class, the fairness of different classes of business judges as follows：
Define 1：Combination grain business fairness index, i.e., the measurement of fairness between different grain size class of service, such asIt is shown.Indicate m class service blocking rates.N' indicates class of service number present in network
Mesh.FImulti-granularityFor combination grain business fairness index.
Wherein, the blocking rate of m classes businessIt can be byIt acquires.For obstruction
M class business numbers, andFor all m classes business numbers.
FI ∈ [0,1] indicate that fairness has boundedness, and value indicates that fairness is better closer to 1.Conversely, indicating public
Levelling needs to be improved.If all kinds of service blocking rates are identical, that is, meetFairness is best, at this time FI values
It is 1.If all kinds of service blocking rates are inconsistent, fairness can deteriorate with the aggravation of inconsistent degree.
Theorem 1：All kinds of service blocking rates are closer, and fairness is better, fair when all kinds of service blocking rates are identical
Property is best.Proof is given below.
It can be seen that fairness optimizes when all kinds of service blocking rates are identical.
By above-mentioned elaboration it is found that improve combination grain business fairness, all kinds of service blocking rates need to be reduced as far as possible
Gap.However, the RSA processes of elastic optical network need to meet frequency spectrum adjacency and successional constraint.Meanwhile business is continuous
Ground generates a large amount of frequency spectrum fragment during establishing with dismounting, is degrading the blocking rate of business.For this purpose, introducing two-dimensional rectangle
Packing models, business duration solve the above problems successively.Finally, reduced by combination grain business fairness model
The difference of blocking rate between different grain size business.
Two, two-dimensional rectangle Packing models
Spectral unit is that FS needs to meet the transmission requirement of combination grain business during RSA in elastic optical network
Meet the double constraints of spectral continuity and adjacency.For this purpose, can route resource and frequency spectrum resource be uniformly considered as Internet resources
That is " resource pool " is put into virtual " resource pool " and carrys out integrated completion routing choosing according to adjacency and successional constraints
It selects and is distributed with frequency spectrum.For this purpose, introducing two-dimensional rectangle Packing models.
Two-dimensional rectangle Packing refer to any given big rectangle frame of a length and width and limited a length and width respectively arbitrarily to
Fixed small rectangular block, it is desirable that these small rectangular blocks are put into as much as possible in big rectangle frame, the area utilization of frame is made to reach
It is maximum.Similar, big rectangle frame can be considered as to " resource pool " for holding Internet resources, as shown in Fig. 1 (a).The resource pool
It is made of different path rectangle frames, as shown in Fig. 1 (b).Wherein, horizontal axis is link all in network, and the longitudinal axis is frequency spectrum.So
And the characteristics of conventional two-dimensional rectangle Packing models, is, small rectangular block is directly placed in big rectangle frame；The horizontal axis of small rectangular block is indulged
Axis all has arbitrariness.And the two-dimensional rectangle Packing models that the present invention is implemented, business is in business rectangle frame, rather than big square
Transmission in shape frame；Just because of this reason, horizontal axis, i.e. transmission path are fixed.The only longitudinal axis, i.e. frequency spectrum are flexibility and changeabilities
's.
After business determines path, the respective links in big rectangle frame are taken out into composition business rectangle frame, such as Fig. 1 (b) institutes
Show.As it can be seen that need to only ensure that the frequency spectrum adjacency limitation that can continuously meet of business horizontal axis requires.Meanwhile the continuous energy on the longitudinal axis
Enough ensure that spectral continuity constrains to be met.In this way, just solution will be converted into the problem of meeting two constraints during RSA
Certainly two-dimensional rectangle Packing.The basic principle of two-dimensional rectangle Packing be " preemption angle, after account for side, finally account for " center ", by
This decision proceeds by distribution from the lower left corner of each business rectangle frame as far as possible when distributing frequency spectrum.
Convert Internet resources assignment problem to and solve two-dimensional rectangle Packing, can ensure frequency spectrum adjacency with it is continuous
The constraint of property.It can be ensured by two-dimensional rectangle Packing basic principles " compactedness " of distribution.However, different from tradition two
Small rectangle is already present in dimension rectangle Packing, and business to be allocated is that dynamic arrives, and may be arrived and departed from any time.For
This, be routed distributed with frequency spectrum when, it is necessary to the business duration is taken into account, to realize dynamic small rectangle
Block fills big rectangle frame.
Three, the perception of business duration
Two-dimensional rectangle Packing models can preferably map frequency spectrum double constraints.But it need to further consider how to determine dynamic
The path optimizing of state business.For this purpose, introducing the concept of business duration.The business duration refer to some business in a network
Existing duration.And path-calculating element (Path Computation Element, PCE) technology and general multiple protocols mark are handed over
Change the fast development of agreement (Generalized Multi-Protocol Label Switching, GMPLS) so that network exists
Line service level is substantially improved, can be with the duration of effectively perceive to the business after business reaches.As it can be seen that make " resource
Pond " more effectively accommodates dynamic service, calculates business time departure by business arrival time, business duration, and is
The immediate traffic assignments adjacent spectra of time departure, to make the big rectangle frame for playing the part of " resource pool " role insert more as far as possible
More small rectangular block (i.e. business), to achieve the purpose that reduce blocking rate, reduce frequency spectrum fragment.
Can calculate business time departure by the business duration is：tleaving=tarrival+tholding, wherein
tleaving、tarrivalAnd tholdingRespectively the time departure of business, reach time and duration.There may be more in network
A time departure is identical to have distributed business, to determine path optimizing, proposes path optimizing back-and-forth method (Optimal Path
SelectedPolicy,OPSP)。
Step 1：It finds in immediate distributed near business of time departure and can use frequency band, if it is present being determined as
Path optimizing.
Step 2：If the path that step 1 obtains is not unique, it is maximum that continuous frequency band is discharged after selecting business to leave away.
Step 3：If path optimizing is not still unique, frequency spectrum continuity degree is high is allocated for selection.Frequency spectrum continuity degree is fixed
Justice is：Maxmize(2*x+y),t≥tleave.Wherein, x, y are followed successively by business and leave generation in continuation degree horizontally and vertically, such as
Shown in Fig. 2.After business is left in dotted line in Fig. 2 (a) as shown in 2 (b), at this point, the continuation degree generated is 3*x+4*2*y.
The business duration selects alternative path according to now Network status.It is generated simultaneously according to the business departure time maximum
Path optimizing can be determined with frequency band.The selection that frequency band can be used just because of this maximum reaches and reduces frequency spectrum fragment, improves resource
The purpose of utilization rate.However, the problem of fairness of combination grain, is still unresolved.
Four, combination grain fairness model
Frequency spectrum distribution instantly is avoided to influence subsequent allocations by the introducing of business duration.But compared to WDM light nets
Network, the fine granularity and frequency spectrum fragment of elastic optical network cause network fairness to decline, thus, combination grain business fairness is asked
It inscribes urgently to be resolved hurrily.For this purpose, proposing combination grain fairness model to ensure the fairness of combination grain business in elastic optical network.
Assuming that there are the business that n' class granularities are different, i.e. G={ G in network1, G2L Gn'}。Gn'Indicate the n-th ' class granularity phase
Same business.AsIt indicates per class business to include the identical business of j' size.Indicate m class industry
Jth in business ' a business.J-th of business composition transmission block B is now taken out from all kinds of businessj, such as B={ B1, B2L BjWithIt is shown.B={ B1, B2L BjIndicate to include j transmission block in network.Indicate every
A transmission block includes n' business, BjIndicate j-th of transmission block, it includes the business that j is designated as under in n' class business.When certain class industry
When the business of a certain label being not present in business, useIt indicates.
After business reaches, the division of transmission block is completed according to above procedure.If being handled one by one business, due to business granularity
Difference, lead to the difference of blocking rate between different grain size business.Different grain size business is now formed into transmission block, as certain (a) in block
A little business can not be transmitted, and all business in the transmission block are blocked.Block with small grain size business in this way, avoiding big granularity service
The difference of rate ensure that the fairness of combination grain business.
In conclusion combination grain fairness can reduce the difference of blocking rate between combination grain, ensure to mix in EONs
The fairness of granularity service.
Five, routing and frequency spectrum distributing method
The basic ideas of RSA problems are：First different grain size business is packaged as passing according to combination grain fairness model
Defeated piece.Then K alternative path is obtained by KSP methods, then is perceived by the business duration, optimization road is obtained according to OPSP
Diameter selects the position in the lower left corner according to two-dimensional rectangle Packing models basic principle as far as possible if path optimizing is not unique at this time
It sets, carries out compact layout.It is specifically described the realization step of the method below.
Step 1：Business is packaged into transmission block.
Step 2：To each transmission block, determine that k items are alternative by k shortest-path methods (k-shortest-path, KSP)
Set of paths.For each business in block, path is selected according to OPSP step 1, if the path is unique, it is determined that it is excellent
Change path.If there are a plurality of such path, step 3 is jumped to.If there are a business can not find path optimizing, jump to
Step 5.
Step 3：Path optimizing is selected according to OPSP step 2.If there is a plurality of path optimizing, then step 4 is jumped to.If
Such path can not be found, then jumps to step 5.
Step 4：To determine path optimizing, screened by OPSP step 3.If the selection result is unique, it is determined that it is
Path optimizing.If can not still determine, according to two-dimensional rectangle Packing model basic principles, lower-left angular frequency is selected as far as possible
Spectrum.Otherwise, step 5 is jumped to.
Step 5：Block all business in the transmission block.
Step 6：Method terminates.
It is described in detail by taking Fig. 3 as an example below.Assuming that there are 4 links in network, each of the links include 8 frequency bands.
Existing 8 business：N1-N8.Pending business is N9, size 1FS, alternative path C-F-G, C-B-G.Each business is left
Time is as shown in table 1, table 2.
1 business N1-N4 time departures of table
| Business time departure | N1 | N2 | N3 | N4 |
| Fig. 3 (b) | t1 | t1 | t2 | t3 |
| Fig. 3 (d) | t1 | t2 | t1 | t3 |
| Fig. 3 (f) | t1 | t2 | t3 | t1 |
| Fig. 3 (h) | t1 | t1 | t3 | t2 |
2 business N5-N9 time departures of table
Fig. 3 (a) is " resource pool ", facilitates the service condition of each link in observation whole network.Fig. 3 (b) -3 (g) is right successively
It is to select path optimizing according to two-dimensional rectangle Packing basic principles that the process of path optimizing, Fig. 3 (i) should be selected according to formula OPSP
Process.In Fig. 3 (b), it is first determined 2,4,6 be available frequency band, and business not identical with N9 time departures in Fig. 3 (c),
Thus determine that path optimizing is C-F-G.In conjunction with time departure, in Fig. 3 (b), N1 and N2 and N9 leave simultaneously, are walked according to OPSP
Frequency band 2 between rapid selected N1, a N2.In Fig. 3 (d), it is 2,6,8 that can use frequency band.By business N1, N3 known to time departure,
N9 leaves simultaneously.In Fig. 3 (e), it is 2,4,6 that can use frequency band.It is left simultaneously by business N5, N9 known to time departure.At this point, root
It is selected according to OPSP step 2.2, No. 6 positions are placed in Fig. 3 (d) will be sequentially generated 5,7 available frequency bands, and in Fig. 3 (e),
4 available frequency bands will be generated No. 2 positions.It thus determines that C-F-G is path optimizing, and selectes No. 6 spectrum positions.Fig. 3 (f)
In, available position 2,6, while N1, N4, N9 leave together just, and the frequency band generated is 6FSs.And in Fig. 3 (g),
Available position only has No. 2 positions, while N5, N9 leave together, and the frequency band of generation is 4FSs.At this point, can according to OPSP step 3
It determines that path optimizing is C-F-G, since the frequency band block that position 6 generates is more complete, selectes No. 6 frequency spectrums.In Fig. 3 (h), available position
It is 2,6.Determine that No. 2 positions are best according to formula (6)-(8).In Fig. 3 (i), available position 1,4, and determine No. 1 position most
It is good.Since the position of No. 1 position compared to No. 2 more meets the principle of " lower-left " position, thus determine that path optimizing is C-B-G, it is excellent
It is 1 to change position.
Finally illustrate, preferred embodiment above is merely illustrative of the technical solution of the present invention and unrestricted, although logical
It crosses above preferred embodiment the present invention is described in detail, however, those skilled in the art should understand that, can be
Various changes are made to it in form and in details, without departing from claims of the present invention limited range.
Claims (2)
1. a kind of fair routing and frequency spectrum distributing method based on fragment processing, it is characterised in that：In the method, will routing and
Spectrum network resource is virtually " resource pool ", meets frequency spectrum double constraints item by using two-dimensional rectangle Packing model solutions
" the small rectangular block " of part；By the perception service duration, the time departure of business is calculated, is business point similar in time departure
With neighbouring frequency spectrum resource, the generation of frequency spectrum fragment is reduced；The fairness model for building combination grain business, by same particle sizes industry
Business is packaged into " small rectangular block " and is distributed with frequency spectrum to carry out routing；
In the method, described business time departure is calculated by the business duration to be：tleaving=tarrival+tholding,
Middle tleaving、tarrivalAnd tholdingThe respectively time departure of business, arrival time and duration；
Business has been distributed there are multiple time departures are identical in network, to determine path optimizing, optimizes routing method
(OptimalPath SelectedPolicy, OPSP), specifically includes following steps：
Step 1：It finds in immediate distributed near business of time departure and can use frequency band, if it is present being determined as optimizing
Path；
Step 2：If the path that step 1 obtains is not unique, it is maximum that continuous frequency band is discharged after selecting business to leave away；
Step 3：If path optimizing is not still unique, frequency spectrum continuity degree is high is allocated for selection；Frequency spectrum continuity degree is defined as：
Maxmize(2*x+y),t≥tleaving, wherein x, y are followed successively by business and leave generation in continuation degree horizontally and vertically.
2. a kind of fair routing and frequency spectrum distributing method based on fragment processing according to claim 1, it is characterised in that：
The method distributed with frequency spectrum of routeing is：First different grain size business is packaged as transmitting according to combination grain fairness model
Then block obtains K alternative path by KSP methods, then is perceived by the business duration, optimization road is obtained according to OPSP
Diameter selects the position in the lower left corner according to two-dimensional rectangle Packing model basic principles if path optimizing is not unique at this time, carries out
Compact layout specifically includes following steps：
Step 1)：Business is packaged into transmission block；
Step 2)：To each transmission block, k alternative path is determined by k shortest-path methods (k-shortest-path, KSP)
Set；For each business in block, path is selected according to OPSP steps 1, if the path is unique, it is determined that it is optimization road
Diameter；If there are a plurality of such path, step 3) is jumped to；If there are a business can not find path optimizing, step is jumped to
It is rapid 5)；
Step 3)：Path optimizing is selected according to OPSP steps 2；If there is a plurality of path optimizing, then step 4) is jumped to；If can not
Such path is found, then jumps to step 5)；
Step 4)：To determine path optimizing, screened by OPSP steps 3；If the selection result is unique, it is determined that it is optimization
Path；If can not still determine, according to two-dimensional rectangle Packing model basic principles, lower-left angular spectrum is selected；Otherwise, it jumps
To step 5)；
Step 5)：Block all business, method in the transmission block to terminate.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610049605.9A CN105490934B (en) | 2016-01-25 | 2016-01-25 | A kind of fair routing and frequency spectrum distributing method based on fragment processing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610049605.9A CN105490934B (en) | 2016-01-25 | 2016-01-25 | A kind of fair routing and frequency spectrum distributing method based on fragment processing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105490934A CN105490934A (en) | 2016-04-13 |
| CN105490934B true CN105490934B (en) | 2018-08-21 |
Family
ID=55677664
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610049605.9A Active CN105490934B (en) | 2016-01-25 | 2016-01-25 | A kind of fair routing and frequency spectrum distributing method based on fragment processing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105490934B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105933174B (en) * | 2016-07-12 | 2018-10-19 | 重庆邮电大学 | A kind of precomputation restoration methods based on apart from adaptive routing and frequency spectrum distribution |
| CN106850427A (en) * | 2017-01-17 | 2017-06-13 | 北京工业大学 | The route frequency spectrum distributing method of the elastic optical multicast network that network-oriented coding is enabled |
| CN107135056B (en) * | 2017-04-28 | 2019-12-27 | 重庆邮电大学 | Anycast service resource allocation method for reducing frequency spectrum fragments and time delay |
| CN107682134B (en) * | 2017-09-28 | 2022-07-01 | 全球能源互联网研究院 | Spectrum allocation method and system |
| CN109818803A (en) * | 2019-02-26 | 2019-05-28 | 重庆邮电大学 | A kind of frequency spectrum fragment avoiding method based on machine learning |
| CN110035337B (en) * | 2019-04-16 | 2021-09-07 | 郑州轻工业学院 | Active multi-stream spectrum allocation method based on exponential division frequency block in elastic optical network |
| CN110365589B (en) * | 2019-07-30 | 2021-09-28 | 国网福建省电力有限公司 | Electric power optical transmission route and frequency spectrum allocation method based on elastic optical network |
| CN111182379B (en) * | 2020-01-03 | 2021-08-13 | 中原工学院 | Frequency spectrum allocation method for plastic reserved service in elastic optical network |
| CN112203167B (en) * | 2020-09-10 | 2021-09-07 | 烽火通信科技股份有限公司 | Routing spectrum allocation method, device, equipment and readable storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102447623A (en) * | 2011-11-22 | 2012-05-09 | 北京邮电大学 | Cascade method of optical network frequency spectrum resource fragments and apparatus thereof |
| CN102548001A (en) * | 2012-03-01 | 2012-07-04 | 重庆邮电大学 | Coexistence method for WIA-PA network and IEEE 802.15.4 network |
| CN102752757A (en) * | 2011-04-19 | 2012-10-24 | 深圳清华大学研究院 | Method for optimizing frequency spectrum allocation according to minimal waste criterion in frequency spectrum aggregation process |
| CN103327501A (en) * | 2013-05-17 | 2013-09-25 | 北京邮电大学 | Resource allocation method based on distributed debris concentration ratio |
| CN103391258A (en) * | 2013-07-03 | 2013-11-13 | 北京邮电大学 | Resource distribution method and device based on distributed fragment concentration ratios |
| CN103684726A (en) * | 2013-09-30 | 2014-03-26 | 广西大学 | Routing and frequency spectrum allocating method and routing and frequency spectrum allocating equipment |
| CN103916926A (en) * | 2014-04-22 | 2014-07-09 | 国家电网公司 | Routing and spectrum allocation method based on non-interval frequency spectrum |
| CN104836736A (en) * | 2015-05-26 | 2015-08-12 | 重庆邮电大学 | Spectrum sensing-based energy efficiency resource allocation and path reconfiguration method in elastic optical network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9413485B2 (en) * | 2013-06-24 | 2016-08-09 | Nec Corporation | Network followed by compute load balancing procedure for embedding cloud services in software-defined flexible-grid optical transport networks |
-
2016
- 2016-01-25 CN CN201610049605.9A patent/CN105490934B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102752757A (en) * | 2011-04-19 | 2012-10-24 | 深圳清华大学研究院 | Method for optimizing frequency spectrum allocation according to minimal waste criterion in frequency spectrum aggregation process |
| CN102447623A (en) * | 2011-11-22 | 2012-05-09 | 北京邮电大学 | Cascade method of optical network frequency spectrum resource fragments and apparatus thereof |
| CN102548001A (en) * | 2012-03-01 | 2012-07-04 | 重庆邮电大学 | Coexistence method for WIA-PA network and IEEE 802.15.4 network |
| CN103327501A (en) * | 2013-05-17 | 2013-09-25 | 北京邮电大学 | Resource allocation method based on distributed debris concentration ratio |
| CN103391258A (en) * | 2013-07-03 | 2013-11-13 | 北京邮电大学 | Resource distribution method and device based on distributed fragment concentration ratios |
| CN103684726A (en) * | 2013-09-30 | 2014-03-26 | 广西大学 | Routing and frequency spectrum allocating method and routing and frequency spectrum allocating equipment |
| CN103916926A (en) * | 2014-04-22 | 2014-07-09 | 国家电网公司 | Routing and spectrum allocation method based on non-interval frequency spectrum |
| CN104836736A (en) * | 2015-05-26 | 2015-08-12 | 重庆邮电大学 | Spectrum sensing-based energy efficiency resource allocation and path reconfiguration method in elastic optical network |
Non-Patent Citations (3)
| Title |
|---|
| Fast Fault Localization Mechanism Based on Minimum Dominating Set Clustering in WDM Networks;Yu Xiong 等;《Optical Switching and Networking》;20151130;全文 * |
| Resource Allocation Using Fragmented-Spectrum Synchronous OFDM-CDMA in Cognitive Radio Networks;Farhad Akhoondi 等;《IEEE》;20140508;全文 * |
| 面向频谱融合的路由频谱分配和碎片整理算法;鞠卫国 等;《光子学报》;20130703;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105490934A (en) | 2016-04-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105490934B (en) | A kind of fair routing and frequency spectrum distributing method based on fragment processing | |
| Abkenar et al. | Study and analysis of routing and spectrum allocation (RSA) and routing, modulation and spectrum allocation (RMSA) algorithms in elastic optical networks (EONs) | |
| US9654248B2 (en) | Optical data transmission method and apparatus | |
| Yousefi et al. | Novel fragmentation-aware algorithms for multipath routing and spectrum assignment in elastic optical networks-space division multiplexing (EON-SDM) | |
| CN105827528B (en) | A kind of route selection method suitable for the flexible optical-fiber network of frequency spectrum | |
| US7249169B2 (en) | System and method for network control and provisioning | |
| CN105721962B (en) | System, method and integrated manipulator for communication network | |
| CN105721961B (en) | Wavelength and the spectrum assignment being grouped in optical-fiber network | |
| Fadini et al. | A subcarrier-slot partition scheme for wavelength assignment in elastic optical networks | |
| WO2013037570A1 (en) | Allocation of spectral capacity in a wavelength-division multiplexing optical network | |
| CN108134967B (en) | Power optical network routing frequency spectrum distribution method and system | |
| Walkowiak et al. | Dynamic routing of anycast and unicast traffic in elastic optical networks | |
| Beyragh et al. | IF-RSCA: intelligent fragmentation-aware method for routing, spectrum and core assignment in space division multiplexing elastic optical networks (SDM-EON) | |
| CN106953710A (en) | What the distribution of minimum cost frequency spectrum and fragment were perceived in elastic optical network reconfigures routing mechanism | |
| CN105530199B (en) | Method for mapping resource and device based on SDN multi-area optical network virtualization technology | |
| CN106998295B (en) | Optimized routing and spectrum allocation method and system based on special protection combined fault probability constraint | |
| EP3504813B1 (en) | Method and apparatus for efficient network utilization using superchannels | |
| Singh et al. | Non-disruptive spectrum defragmentation with holding-time awareness in optical networks | |
| CN110035337A (en) | The active multithread frequency spectrum distributing method of frequency block is divided in elastic optical network based on index | |
| Knapińska et al. | On advantages of traffic prediction and grooming for provisioning of time-varying traffic in multilayer networks | |
| Vyas et al. | An improved scheduled traffic model utilizing bandwidth splitting in elastic optical networks | |
| Abkenar et al. | Best fit (BF): A new spectrum allocation mechanism in elastic optical networks (EONs) | |
| Lan et al. | A fragmentation-aware load-balanced RMSCA algorithm in space-division multiplexing elastic optical networks | |
| de Lira et al. | On combining split spectrum technique with a slot-continuity capacity loss heuristic in elastic optical networks | |
| CN104202111B (en) | Triggered aggregation optical path reconstruction method based on channel density and minimum clearance |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |