CN104202111A - Triggered aggregation optical path reconstruction method based on channel density and minimum clearance - Google Patents
Triggered aggregation optical path reconstruction method based on channel density and minimum clearance Download PDFInfo
- Publication number
- CN104202111A CN104202111A CN201410465308.3A CN201410465308A CN104202111A CN 104202111 A CN104202111 A CN 104202111A CN 201410465308 A CN201410465308 A CN 201410465308A CN 104202111 A CN104202111 A CN 104202111A
- Authority
- CN
- China
- Prior art keywords
- new
- connection request
- frequency spectrum
- spectrum
- channel density
- 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.)
- Granted
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a triggered aggregation optical path reconstruction method based on the channel density and minimum clearance and aims to solve the problems that in the prior art, an optimal reconstruction scheme cannot be selected, the spectrum shifting is performed only, the optimization of the blocking rate is low, and the spectrum utilizing rate is low. The method includes 1, selecting paths and allocating the spectrum for a fresh connecting request by the Dijkstra method and the first hit method; 2, finding out optical paths conflicting with the connecting request of the failed spectrum allocation; 3, reconstructing the conflicting optical paths by selecting the alternative optical paths with the maximum density and the minimum clearance; 4, reallocating the spectrum for the connecting request after the reconstruction. Compared with the prior art, the method has the advantages that the blocking rate is low, the spectrum utilizing rate is high, the load of key links is reduced, the network traffic is more balanced, and the method can be applied to the arrangement of spectrum fragmentation in an elastic optical network.
Description
Technical field
The invention belongs to communication technical field, further relate to light path reconstructing method, the arrangement to frequency spectrum fragment in available elasticity optical-fiber network.
Background technology
In traditional Wave division multiplexing WDM network, each wavelength capacities is fixed; and by protection bandwidth, separate to guarantee the filtering of signal quality and receiving terminal between adjacent wavelength; shortcoming is that bandwidth granularity is large and use dumb; protection bandwidth between wavelength also can cause the waste of frequency spectrum resource, need for this reason a data rate more elasticity, flexibly, the optical-fiber network that more effectively utilizes of restructural and resource.The frequency spectrum burst elasticity optical-fiber network proposing recently, SLICE can give traffic assignments bandwidth varying neatly, and utilizes efficiently frequency spectrum resource.In actual applications, for guaranteeing signal quality and the filter effect of receiving terminal, when distributing frequency spectrum resource, observe frequency spectrum consistency constraint, spectral continuity constraint and frequency spectrum conflict constraint, the frequency gap that does not meet these three constraintss in link can not be assigned with.In a dynamic service scene, the foundation of optical channel and demolishing process can cause the fragmentation of frequency spectrum.Usable spectrum in little discontinuous frequency band is that fragment can cause the spectrum efficiency in network influenced, and having reduced is the possibility that enough continuous frequency spectrums are found in a connection.Although there are enough frequency spectrums to use, newly arrived request or the more network spectrum of necessary use, or get clogged.Therefore, frequency spectrum fragment can cause the availability of frequency spectrum to reduce and service blocking rate rising.At present, this problem of frequency spectrum fragment is had to following several solution:
The people such as Patel A.N. are at document " Defragmentation of Transparent Flexible Optical WDM (FWDM) Networks " (Optical Fiber Communication Conference and Exposition, 2011, proposed first the concept of frequency spectrum fragment and provided two kinds of periodic light path restructing algorithms in pp.1-3): Greedy algorithm and shortest path SP algorithm.Greedy algorithm and shortest path SP algorithm, be that the connection request that occupies maximum sequence number frequency spectrum is re-assigned on the frequency spectrum of smallest sequence number, and be according to the connection request of all existence of shared frequency spectrum sequence number descending reconstruct.Like this can be so that the connection request of all existence focus in the spectral range of little sequence number, still reconstruct is each time selected is not preferred plan, after reconstruct completes, still can take more frequency spectrum, makes blocking rate higher.
Weiguo Ju, Shanguo Huang, Zhenzhen Xu, Jie Zhang, the people such as Wanyi Gu are at document " Dynamic Adaptive Spectrum Defragmentation Scheme in Elastic Optical Path Networks ", (Opto-Electronics and Communications Conference, 2012, pp.21-22) in, proposed maximum spectrum gain rerouting algorithm MSGR and dynamic spectrum moving algorithm DSSD, these two kinds of algorithms are all trigger-type light path restructing algorithms.MSGR algorithm is only after the connection request of bulky grain degree leaves, while discharging enough frequency spectrum resources, just can be triggered, this algorithm only allows the connection request with maximum spectrum gain to be reconstructed, although it is less that this algorithm carries out the number of times of light path reconstruct, but the connection request impact on follow-up arrival is little, unless follow-up connection request just in time takies d/d frequency spectrum resource.DSSD algorithm only just can be triggered when minimum clearance surpasses certain threshold value, and this algorithm only carries out frequency spectrum shift, and not to connection request again routing, frequency spectrum fragment is still very large like this, blocking rate is improved little.
Alberto Castro, Luis Velasco, the people such as Marc Ruiz are at document " Dynamic routing and spectrum (re) allocation in future flexgrid optical networks " (Journal of Computer Networks, 2012, Volume 56, Issue12, pp.2869-2883) middle dynamic routing and spectrum allocation may algorithm RSA and the SPRESSO algorithm of proposing.SPRESSO algorithm is trigger-type light path restructing algorithm, and when newly arrived connection request cannot be set up, algorithm is triggered.This algorithm will have the connection request conflicting to carry out frequency spectrum shift with on new arrival connection request shortest path, but path can not change.
Yawei Yin, Ke Wen, David J.Geisler, Ruiting Liu, the people such as and S.J.B.Yoo document " Dynamic on-demand defragmentation in flexible bandwidth elastic optical networks " (OPTICS EXPRESS, 2012, Volume 20, pp.1798-1804) in, by setting up auxiliary view, light path reconstruct is converted to the problem of asking auxiliary view maximum independent set MIS.When network size hour, solve MIS problem institute spended time few, but increase when network size, the complexity that MIS solves increases greatly, computing time is very long, and is not suitable for dynamic scene.
Summary of the invention
The object of the invention is to for above-mentioned the deficiencies in the prior art, propose a kind of trigger-type polymerization light path reconstructing method based on channel density and minimum clearance, to improve the availability of frequency spectrum under dynamic scene, reduce blocking rate.
Realizing the object of the invention technical thought is: the connection request of distribute " loosening " is aggregated into " closely " state, be about to have passage aisle density and be converted to major path density and little minimum clearance with the connection request of large minimum clearance, thereby improve network resource utilization.Concrete steps comprise as follows:
(1) to newly arrived connection request (s in network
new, d
new, B
new) with Di Jiesite pulling method, select one from source node s
newto destination node d
newpath, and in limited frequency spectrum resource, distribute frequency spectrum according to the method for initial hit, if continuous idle frequency spectrum is more than or equal to bandwidth on demand B on institute's routing path
new, successfully set up one from s
newto d
newtake the light path of continuous frequency spectrum, finish and wait for next connection request; Otherwise, execution step (2);
(2) travel through and on selected path, be more than or equal to bandwidth on demand B
newfrequency spectrum c
i, i=1,2 ..., N-B
new+ 1, will form the set that conflicts with the afoul connection request of ci
i=1,2 ..., N-B
new+ 1, wherein N represents limited frequency spectrum resource width, and finds out the minimum set of element number, called after reconstruct set T from these conflict set
r;
(3) statistics reconstruct set T
rin channel density and the minimum clearance of all built light path of connection request, and to reconstruct set T
rin connection request sort, its ordering rule is: first by channel density ascending sort, then to the equal connection request of channel density according to minimum clearance descending sort;
(4) find out the rear reconstruct set T of sequence
rin all and original optical path frequency spectrum of each connection request new light path of not conflicting, calculate channel density and the minimum clearance of every new light path, and all new light paths are sorted, its ordering rule is: first by channel density descending sort, the newer light path that channel density is equated is according to minimum clearance ascending sort; After selecting sequence, first new light path is reconstructed operation, distributes frequency spectrum and discharge the frequency spectrum on original optical path to new light path;
(5) judgement reconstruct set T
rin all connection requests whether all carried out reconstructed operation, if so, turn back to step (1); Otherwise, abandon this connection request, finish and wait for next connection request.
The present invention has the following advantages compared with the prior art:
The first, reduced blocking rate, improved the availability of frequency spectrum.
The new light path of the minimum and maximum gap of density, selector channel of the present invention minimum is reconstructed; Channel density is larger, is reflected in the number of links average number of hops more and institute's road construction footpath that connection request takies in network in identical spectral range fewer; More the speak more service efficiency of bright link of the number of links taking is higher, and the probability that those links that are of little use are used increases, thereby has alleviated the burden of crucial link; The average number of hops average resource that bright connection request takies of more saving your breath is fewer, and the resource here refers to the frequency spectrum sum that connection request takies on link.Minimum clearance is less, reflects that adjacent connection request arranges tightr on frequency spectrum.Overcome in prior art only unilateral consideration connection request compact arranged shortcoming on frequency spectrum.Can be so that frequency spectrum fragment be less, thus can reduce blocking rate and improve the availability of frequency spectrum.
The second, saved more frequency spectrum resource.
Reconstructed operation selects each time is all best new light path in the present invention, and having overcome in prior art reconstruct each time selected is not the shortcoming of preferred plan, uses frequency spectrum resource still less to reach identical effect, has saved more frequency spectrum resource.
The 3rd, alleviated the burden of crucial link, make network traffics more balanced.
The present invention not only carries out frequency spectrum shift to connection request, and it is carried out to routing again, and overcome prior art and only carried out frequency spectrum shift, and the shortcoming to connection request again routing not.Can alleviate the burden of crucial link, connection request institute's road construction footpath is readjusted on those more idle links, improve link service efficiency, make network traffics more balanced.
Accompanying drawing explanation
Fig. 1 is the network structure that the present invention uses;
Fig. 2 is realization flow figure of the present invention;
Fig. 3 the present invention and existing methodical blocking rate performance simulation comparison diagram;
Fig. 4 is the present invention and existing methodical availability of frequency spectrum simulation comparison figure;
Fig. 5 is the present invention and existing methodical average computation time simulation comparison figure;
Fig. 6 is the present invention and existing methodical reconstruct number of times simulation comparison figure.
Embodiment
Below in conjunction with accompanying drawing, technical scheme of the present invention and effect are described in further detail.
With reference to Fig. 1, the network that the present invention uses is by 14 nodes and 21 NSFNET networks that link forms.For marked network more clearly, node is numbered as from 0 to 13.Link is the physical connection between adjacent two nodes, and as link (0,7) represents to have a physical connection between No. 0 node and No. 7 nodes, the length of this link is 480 kilometers.(s, d, B) expression for connection request, s is source node, and d is destination node, and B is bandwidth on demand.Wherein source node s and place node d choose in 14 nodes of NSFNET, and bandwidth on demand B can not surpass the number of gap set F intermediate frequency gap frequently.The present invention also can use other networks, such as CHNNET etc.
With reference to Fig. 2, performing step of the present invention is as follows:
Step 1, carries out routing to newly arrived connection request.
Adopting Di Jiesite pulling method is newly arrived connection request (s
new, d
new, B
new) in network, select one from source node s
newto place node d
newa shortest path p
new.For example, for the NSFNET network using, if source node is 0, place node is 12, and the shortest path that Di Jiesite pulling method is calculated is 0 → 7 → 8 → 12, and path total length is 690 kilometers.
Step 2, carries out spectrum allocation may to the connection request after routing.
Distribute frequency spectrum resource to the connection request after routing, can adopt the methods such as initial hit, Random assignment and maximum sum, adopted initial hit method in this example, the concrete steps of this step are as follows:
2a) adopt gap set F={fs frequently
1, fs
2..., fs
i..., fs
n, 1≤i≤N forms limited frequency spectrum in network, and its intermediate frequency gap fsi is the low speed subcarrier of beared information, and phase adjacent frequency gap has 1/2 spectrum overlapping, and N is frequency gap number;
2b) make i=1;
2c) from frequency gap set F, i frequency gap fsi starts, and takes out continuous B
newindividual frequency gap, B
newbe the bandwidth on demand that newly arrives connection request, form passage
2d) judgement shortest path p
newin each link upper channel c
iwhether interior each frequently gap be idle: if idle, by this shortest path p
newin B in each link
newindividual continuous frequency gap is distributed to connection request, and resource is allocated successfully, and waits for that next connection request arrives, and returns to step 1; Otherwise, execution step 2e);
2e) change i value, make it automatically increase 1; Judge again the size of i, if i≤N-B
new+ 1, return to step 2c); Otherwise resource is distributed unsuccessfully, execution step 3.
Step 3, finds out and the afoul existing connection request of the unsuccessful connection request of spectrum allocation may, and forms reconstruct set T
r.
3a) make j=1;
3b) j frequency gap fs from frequency gap set F
jstart, take out continuous B
newindividual frequency gap, forms passage
3c) will with shortest path p
newin on each link with passage c
jthe connection request of spectrum overlapping forms conflict set
3d) j value increases 1 automatically; Judgement j value size, if j≤N-B
new+ 1, return to step 3b); Otherwise, execution step 3e);
3e) find out all conflict set
in the minimum conflict set of element number, by its called after reconstruct set T
r, record its passage c
min.
Step 4, sorts to the connection request in reconstruct set Tr based on channel density and minimum clearance.
The present invention proposes the concept of channel density and minimum clearance.Channel density refers to the connection request number that in network, all links are covered by passage.Channel density is larger, is reflected in the number of links average number of hops more and institute's road construction footpath that connection request takies in network in identical spectral range fewer; More the speak more service efficiency of bright link of the number of links taking is higher, and the probability that those links that are of little use are used increases, thereby has alleviated the burden of crucial link; The average number of hops average resource that bright connection request takies of more saving your breath is fewer, and the resource here refers to the frequency spectrum sum that connection request takies on link.Minimum clearance refers in all links in the selected path of connection request, and the interval of numerical value minimum between adjacent connection request frequency spectrum.Minimum clearance is less, reflects that adjacent connection request arranges tightr on frequency spectrum.
The concrete steps of this step are as follows:
4a) make k=1;
4b) according to reconstruct set T
rin k the passage that the built light path of connection request takies, add up its channel density;
4c) according to reconstruct set T
rin link in k the built light path of connection request, add up its minimum clearance;
4d) k value increases 1 automatically; Judgement k value size, if k≤| T
r|, return to step 4b), otherwise, execution step 4e), wherein | T
r| be reconstruct set T
rmould, represent reconstruct set T
rthe number of middle element;
4e) to reconstruct set T
rin connection request sort, first press channel density ascending sort, then to the equal connection request of channel density according to minimum clearance descending sort, form new reconstruct set T
r'.
Step 5, to the reconstruct set T after sequence
r' in connection request use the operation that is reconstructed of best alternative light path.
5a) make m=1, m represents reconstruct set T
r' in the sequence number of element;
5b) select reconstruct set T
r' in m connection request (s
m, d
m, B
m);
Be 5c) m connection request routing again, obtain minimum hop count path p
m;
Change all linkage lengths of NSFNET network in accompanying drawing 1 into 1, re-using Di Jiesite pulling method is m connection request routing again, obtains minimum hop count path p
m; In this example, if source node is 1, place node is 7, and minimum hop count path is 1 → 0 → 7, and path total length is 690 kilometers, and path jumping figure is 2;
5d) make n=1, n represents the sequence number of gap set F intermediate frequency gap frequently;
5e) n frequency gap fs from frequency gap set F
nstart, take out continuous B
mindividual frequency gap, B
mreconstruct set T
r' in the bandwidth on demand of m connection request, form passage
5f) judgement minimum hop count path p
min each link upper channel c
nwhether interior each frequently gap be idle: if idle, by (p
m, c
n) as an alternative light path, join reconstruct set T
r' in the alternative set LP of m connection request
min, otherwise, execution step 5g);
5g) n value adds 1 automatically; Judgement n value size: if n≤N-B
m+ 1, return to step 5e); Otherwise, execution step 5h);
5h) judge alternative set LP
mwhether be empty set: if, representing that can not find new light path is reconstructed, reconstructed operation failure, waits for that next connection request arrives, and returns to step 1; Otherwise, execution step 5i);
5i) add up respectively alternative set LP
min channel density and the minimum clearance of all alternative light paths;
5j) to alternative set LP
min alternative light path sort, first press channel density descending sort, then to the equal connection request of channel density according to minimum clearance ascending sort, form new alternative set LP
m';
5k) select the alternative set LP after sequence
m' in the alternative light path that makes number one be reconstructed operation:
First, be that m connection request set up new light path (p
m, c
n);
Then, then discharge the frequency spectrum on original optical path, the frequency spectrum resource arranging on original optical path is the free time;
5l) m value adds 1 automatically; Judgement m value size: if m≤| T
r' |, return to step 5b); Otherwise reconstructed operation finishes, execution step 6, wherein | T
r' | be reconstruct set T
r' mould, represent reconstruct set T
r' in the number of element.
Step 6, for newly arrived connection request is redistributed frequency spectrum.
By shortest path p
newin frequency spectrum in each link
distribute to newly arrived connection request, then wait for that next connection request arrives, and returns to step 1, wherein c
minthe passage minimum with newly arrived connection request number of conflicts.
Effect of the present invention can further illustrate by following emulation:
1. simulated environment setting
For the performance of the present invention in real network is described, adopted the method for Computer Simulation.Hardware environment: I3 CPU, 3.30GHz/4GB RAM.In emulation experiment, the Poisson distribution that arrival rate is λ is obeyed in the generation of connection request, and the duration of each connection request obeys the negative exponent that average is μ and distributes, and wherein average duration is 10 hours.The former place node of each connection request is to being to produce at random in the topology of NSFNET shown in Fig. 1, and the frequency gap number of bandwidth on demand generates uniformly between [1,10], and the shared spectrum width of each frequency gap is 2.5GHz, has 160 gaps frequently on every link.Between adjacent connection request, need to have 2 protections gap frequently.What the weights in topology represented is the distance between neighborhood of nodes.
2. emulation content and interpretation of result
Emulation 1 with the present invention and existing MSGR algorithm, DSSD algorithm, SPRESSO algorithm and without the D-FF method of light path reconstruct, is carried out emulation to blocking rate respectively in identical simulated environment, and result is as Fig. 3.In Fig. 3, transverse axis represents network traffic, and the longitudinal axis represents blocking rate.
As can be seen from Figure 3, maximum without the D-FF algorithm blocking rate of light path reconstruct, MSGR, DSSD and SPRESSO algorithm performance all have improvement in various degree, and blocking rate of the present invention is minimum.The present invention compares with the D-FF method without light path reconstruct, and when traffic carrying capacity is increased to 300 Ireland from 100 Ireland, the improvement degree of its blocking rate has been increased to 16.7% from 6.46%.
Emulation 2 with the present invention and existing MSGR algorithm, DSSD algorithm, SPRESSO algorithm and without the D-FF method of light path reconstruct, is carried out emulation to the availability of frequency spectrum respectively in identical simulated environment, and result is as Fig. 4.In Fig. 4, transverse axis represents network traffic, and the longitudinal axis represents the availability of frequency spectrum.
As can be seen from Figure 4, the availability of frequency spectrum of the present invention is the highest, minimum without the D-FF method of defragmentation.The present invention has improved 27.66%～56.03% than the availability of frequency spectrum of the D-FF method without defragmentation.
Emulation 3 with the present invention and existing MSGR algorithm, DSSD algorithm and SPRESSO algorithm, is carried out emulation to the average computation time respectively in identical simulated environment, and result is as Fig. 5.In Fig. 5, transverse axis represents network traffic, and the longitudinal axis represents the average computation time.
As can be seen from Figure 5, the computing time of this several method is all between 0.16～0.52 second, wherein SPRESSO algorithm is minimum, the average computation time of the present invention is slightly larger than SPRESSO algorithm when traffic carrying capacity is lower, when traffic carrying capacity reaches 270 Ireland, the average computation time of the present invention is lower than SPRESSO algorithm.
Emulation 4 with the present invention and existing MSGR algorithm, DSSD algorithm and SPRESSO algorithm, is carried out emulation to reconstruct number of times respectively in identical simulated environment, and result is as Fig. 6.In Fig. 6, transverse axis represents network traffic, and the longitudinal axis represents reconstruct number of times.
As can be seen from Figure 6, MSGR algorithm reconstruct number of times, the reconstruct number of times of DSSD algorithm and SPRESSO algorithm is fluctuation within the specific limits all, the present invention is reconstruct least number of times when traffic carrying capacity is little, along with traffic carrying capacity increases, reconstruct number of times is along with increasing, and traffic carrying capacity is while reaching 190 Ireland, and reconstruct number of times will surpass DSSD algorithm and SPRESSO algorithm.
To sum up, the present invention can farthest reduce blocking rate, and has the highest availability of frequency spectrum, and real-time is better, and reconstruct number of times is more.
Claims (4)
1. the trigger-type polymerization light path reconstructing method based on channel density and minimum clearance, comprises the steps:
(1) to newly arrived connection request (s in network
new, d
new, B
new) with Di Jiesite pulling method, select one from source node s
newto destination node d
newpath, and in limited frequency spectrum resource, distribute frequency spectrum according to the method for initial hit, if continuous idle frequency spectrum is more than or equal to bandwidth on demand B on institute's routing path
new, successfully set up one from s
newto d
newtake the light path of continuous frequency spectrum, finish and wait for next connection request; Otherwise, execution step (2);
(2) travel through and on selected path, be more than or equal to bandwidth on demand B
newfrequency spectrum ci, i=1,2 ..., N-B
new+ 1, will with c
iafoul connection request forms conflict set
i=1,2 ..., N-B
new+ 1, wherein N represents limited frequency spectrum resource width, and finds out the minimum set of element number, called after reconstruct set T from these conflict set
r;
(3) statistics reconstruct set T
rin channel density and the minimum clearance of all built light path of connection request, and to reconstruct set T
rin connection request sort, its ordering rule is: first by channel density ascending sort, then to the equal connection request of channel density according to minimum clearance descending sort;
(4) find out the rear reconstruct set T of sequence
rin all and original optical path frequency spectrum of each connection request new light path of not conflicting, calculate channel density and the minimum clearance of every new light path, and all new light paths are sorted, its ordering rule is: first by channel density descending sort, the newer light path that channel density is equated is according to minimum clearance ascending sort; After selecting sequence, first new light path is reconstructed operation, distributes frequency spectrum and discharge the frequency spectrum on original optical path to new light path;
(5) judgement reconstruct set T
rin all connection requests whether all carried out reconstructed operation, if so, turn back to step (1); Otherwise, abandon this connection request, finish and wait for next connection request.
2. method according to claim 1, wherein said step is distributed frequency spectrum according to the method for initial hit in (1) in limited frequency spectrum resource, comprises the steps:
1a) adopt gap set F={fs frequently
1, fs
2..., fs
i..., fs
n, 1≤i≤N forms limited frequency spectrum in network, its intermediate frequency gap fs
ibe the low speed subcarrier of beared information, phase adjacent frequency gap has 1/2 spectrum overlapping, and N is frequency gap number;
1b) make i=1;
1c) from frequency gap set F, i frequency gap fsi starts, and takes out continuous B
newindividual frequency gap, forms passage
1d) judgement is through each link upper channel c in the selected path of Di Jiesite pulling method
iwhether interior each frequently gap be idle: if idle, by passage c
iin B
newindividual continuous frequency gap is distributed to connection request, and ending resource distributes; Otherwise, execution step 1e);
1e) change i value, make it automatically increase 1; Judge again the size of i, if i≤N-B
new+ 1, return to step 1c); Otherwise resource is distributed failure and is finished.
3. method according to claim 1, the channel density in wherein said step (3), refers to the connection request number that in network, all links are covered by passage.
4. method according to claim 1, the minimum clearance in wherein said step (3), refers in all links in the selected path of connection request, and the interval of numerical value minimum between adjacent connection request frequency spectrum.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410465308.3A CN104202111B (en) | 2014-09-12 | 2014-09-12 | Triggered aggregation optical path reconstruction method based on channel density and minimum clearance |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410465308.3A CN104202111B (en) | 2014-09-12 | 2014-09-12 | Triggered aggregation optical path reconstruction method based on channel density and minimum clearance |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104202111A true CN104202111A (en) | 2014-12-10 |
| CN104202111B CN104202111B (en) | 2017-04-19 |
Family
ID=52087349
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410465308.3A Expired - Fee Related CN104202111B (en) | 2014-09-12 | 2014-09-12 | Triggered aggregation optical path reconstruction method based on channel density and minimum clearance |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104202111B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108616783A (en) * | 2018-04-03 | 2018-10-02 | 南京邮电大学 | The frequency spectrum based on frequency spectrum perception arranges triggering method in a kind of elastic optical network |
| CN110915138A (en) * | 2017-08-28 | 2020-03-24 | 日立汽车系统株式会社 | Electronic control device and circuit reconfiguration method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102546435A (en) * | 2012-02-17 | 2012-07-04 | 中兴通讯股份有限公司 | Spectrum resource assignment method and device |
| CN103404057A (en) * | 2010-06-22 | 2013-11-20 | 技术研究及发展基金公司 | Optical network unit, optical access network and a method for exchanging information |
-
2014
- 2014-09-12 CN CN201410465308.3A patent/CN104202111B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103404057A (en) * | 2010-06-22 | 2013-11-20 | 技术研究及发展基金公司 | Optical network unit, optical access network and a method for exchanging information |
| CN102546435A (en) * | 2012-02-17 | 2012-07-04 | 中兴通讯股份有限公司 | Spectrum resource assignment method and device |
Non-Patent Citations (1)
| Title |
|---|
| 徐展琦: "弹性光网络中选路和频谱指派的建模和高效启发式算法", 《光子学报》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110915138A (en) * | 2017-08-28 | 2020-03-24 | 日立汽车系统株式会社 | Electronic control device and circuit reconfiguration method |
| CN110915138B (en) * | 2017-08-28 | 2023-07-25 | 日立安斯泰莫株式会社 | Electronic control device and circuit reconstruction method |
| CN108616783A (en) * | 2018-04-03 | 2018-10-02 | 南京邮电大学 | The frequency spectrum based on frequency spectrum perception arranges triggering method in a kind of elastic optical network |
| CN108616783B (en) * | 2018-04-03 | 2020-12-01 | 南京邮电大学 | Spectrum sorting triggering method based on spectrum sensing in elastic optical network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104202111B (en) | 2017-04-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yousefi et al. | Fragmentation-aware algorithms for multipath routing and spectrum assignment in elastic optical networks | |
| JP6958649B2 (en) | Optical node device, optical network control device, and optical network control method | |
| CN105245307B (en) | Method and apparatus for determining communication path in a communication network | |
| CN105391651B (en) | Virtual optical network multi-layer resource convergence method and system | |
| Shen et al. | Fragmentation aware routing and spectrum assignment algorithm for elastic optical networks | |
| CN113489617A (en) | Minimum network energy consumption optimization method and system based on traffic grooming | |
| CN113055767B (en) | Routing frequency spectrum allocation method and device based on flexible grid | |
| CN113078942B (en) | Survivability virtual network mapping method based on related light path resource awareness | |
| CN104202111A (en) | Triggered aggregation optical path reconstruction method based on channel density and minimum clearance | |
| CN108616782A (en) | A kind of frequency spectrum distributing method based on the optimization of non-intersecting connection group in elastic optical network | |
| CN110035337A (en) | The active multithread frequency spectrum distributing method of frequency block is divided in elastic optical network based on index | |
| Zhu et al. | Multi-dimensional resource virtualization in spectral and spatial domains for inter-datacenter optical networks | |
| Gu et al. | Resource-efficient and QoS guaranteed 5G RAN slice migration in elastic metro aggregation networks using heuristic-assisted deep reinforcement learning | |
| You et al. | Reduce spectrum defragmentation latency in EONs with effective parallelization of connection reconfigurations | |
| Bórquez-Paredes et al. | Does fragmentation avoidance improve the performance of dynamic spectrum allocation in elastic optical networks? | |
| Kim et al. | Blocking fairness in two-service EONs with uneven arrival rates | |
| CN104202112B (en) | Periodical aggregation optical path reconstruction method based on channel density and minimum clearance | |
| CN115765988A (en) | Time slot perception shared path protection method and system in QKD optical network | |
| Comellas et al. | Efficient spectrum assignment in elastic optical networks | |
| Kmiecik et al. | A performance study of dynamic routing algorithm for SDM translucent optical networks with assistive storage | |
| Chen et al. | Spectrum-space-divided spectrum allocation approaches in software-defined elastic optical networks | |
| Cao et al. | Mode conversion-based crosstalk-aware routing, spectrum and mode assignment in space-division multiplexing elastic optical networks | |
| RU2596155C2 (en) | Method and device for separation of spectral range | |
| Comellas et al. | Periodic defragmentation in elastic optical networks | |
| CN103312630A (en) | Resource reconstruction method based on service remaining time sequencing in elastic exchange network |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170419 Termination date: 20170912 |