CN103391258A - Resource distribution method and device based on distributed fragment concentration ratios - Google Patents
Resource distribution method and device based on distributed fragment concentration ratios Download PDFInfo
- Publication number
- CN103391258A CN103391258A CN2013102776953A CN201310277695A CN103391258A CN 103391258 A CN103391258 A CN 103391258A CN 2013102776953 A CN2013102776953 A CN 2013102776953A CN 201310277695 A CN201310277695 A CN 201310277695A CN 103391258 A CN103391258 A CN 103391258A
- Authority
- CN
- China
- Prior art keywords
- time slot
- slot section
- frequency spectrum
- network
- resource
- 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
- 238000000034 method Methods 0.000 title claims abstract description 120
- 239000012634 fragment Substances 0.000 title claims abstract description 102
- 238000001228 spectrum Methods 0.000 claims abstract description 105
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 11
- 238000013468 resource allocation Methods 0.000 claims description 41
- 230000000903 blocking effect Effects 0.000 abstract description 6
- 230000003287 optical effect Effects 0.000 abstract description 3
- 238000004891 communication Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 5
- 238000011437 continuous method Methods 0.000 description 4
- 239000013307 optical fiber Substances 0.000 description 4
- 238000013467 fragmentation Methods 0.000 description 3
- 238000006062 fragmentation reaction Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000000205 computational method Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 230000003595 spectral effect Effects 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a resource distribution method and device based on distributed fragment concentration ratios and relates to the technical field of optical network communication. The method and device includes the following steps: S1 finding a path for network service through the shortest path algorithm and determining the public frequency spectrum of each link where the path passes; S2 finding a first time slot section which is a time slot section in the public frequency spectrum and with the continuous free time slot number smaller than the threshold M; S3 browsing a continuous frequency spectrum on the first time slot section according to the frequency gap number required by the network service, determining various resource distribution modes of the continuous frequency spectrum, then calculating the sum of the fragment concentration ratios of each link under each resource distribution mode, and selecting the resource distribution mode enabling the sum of the fragment concentration ratios of each link to be the largest to conduct resource distribution on the network service. A device is further provided. The method and device reduces link fragment degree of the links and reduces service blocking rate in the network service and enables the success rate for distributing continuous resources for the following services to be higher.
Description
Technical field
The present invention relates to technical field of optical network communication, be specifically related to a kind of resource allocation methods based on distributed fragment concentration degree and device.
Background technology
conventional wave long route wavelength division multiplexing (Wavelength Division Multiplexing, WDM) optical-fiber network has many good qualities, but its resource partition size (least unit is a wavelength) is excessive, cause the utilization of resources insufficient, for this problem, this area proposed frequency spectrum burst elasticity optical-fiber network SLICE(Spectrum ?Sliced Elastic Optical Path Network) concept, frequency spectrum burst elasticity optical-fiber network SLICE is to light path end to end according to the frequency spectrum resource of the suitable size of data rate allocation of user request rather than fixed size.In network when having new service request to arrive, we should set up new passage and distribute rational frequency spectrum resource for it, but the distribution of resource must meet spectral continuity and consistency constraint, namely distributes the continuous frequency spectrum of same sequence number on every optical fiber link.The end of transmitting along with business connects and will be removed, and shared resource also can be released and be used for new service request.In dynamic service request situation, the foundation of channel and demolishing process will cause gap resource fragmentation frequently, noncontinuity due to these resource fragmentation, its utilance can be very low, make the success rate of for the resource of subsequent network business, distributing to improve by the problem of improving frequency spectrum resource fragment problems and service blocking rate, become the SLICE problem demanding prompt solution.
When the business that takies different gap numbers frequently arrived, it was the Network Resources allocation that prior art adopts initial hit F-F method and optimum Match (M-U) method etc. usually.First of initial hit F-F method employing common frequency gap be the initial frequency gap of available frequency spectrum continuously, namely spectrum allocation may is being hanged down on the initial frequency gap of sequence number as far as possible, optimum Match (M-U) method adopts in the continuous idle gap frequently of all segments of common frequency spectrum, select idle gap number frequently and the lucky consistent a bit of idle frequency spectrum of the required frequency gap of Network number, and Resources allocation.
For two kinds of methods of the prior art, when the business duration arrives, discharge the frequency spectrum that this business takies, these idle frequency spectrums can be the traffic assignments resource that next arrives again, in the process that takies and discharge of frequency spectrum, will produce a large amount of noncontinuities gap resource fragmentation frequently, its frequency spectrum resource fragment problems is serious, reduce the utilance of frequency spectrum, made the success rate of into the resource of subsequent network business, distributing not high.
Summary of the invention
(1) technical problem that solves
For the deficiencies in the prior art, the invention provides a kind of resource allocation methods based on distributed fragment concentration degree and device, improved the link fragment intensity of business being carried out the link that passes through in resource allocation process.
(2) technical scheme
For realizing above purpose, the present invention is achieved by the following technical programs:
A kind of resource allocation methods based on distributed fragment concentration degree comprises following steps:
S1, by shortest path first, be that path is found in Network, determine path the common frequency spectrum of every link of process;
S2, find out the first time slot section, described the first time slot section be continuous free timeslot number in common frequency spectrum less than the time slot section of threshold value M, described threshold value M is positive integer;
S3, the frequency gap number required according to Network, travel through continuous frequency spectrum on described the first time slot section, determine the multiple resources method of salary distribution of described continuous frequency spectrum, then calculates the fragment concentration degree sum of every link under every kind of resource distribution mode; Selection makes the resource distribution mode of the fragment concentration degree sum maximum of described every link, resource is carried out in Network distribute.
Wherein, shortest path first described in step S1 is dijkstra algorithm.
Wherein, the method further comprises: find out the second time slot section, described the second time slot section be continuous free timeslot number in common frequency spectrum more than or equal to the time slot section of threshold value M, described the second time slot section is set to the state that uses;
Also comprise step after step S3:, if in step S3, Network distributes not success, Network is distributed in described being set in the second time slot section of using state.
Wherein, describedly Network is distributed in described being set to uses the second time slot section of state to comprise: Network is started resource and distributes from the described from left to right position from left to right of first the second time slot section of using state that is set to.
The present invention also provides a kind of resource allocation device based on distributed fragment concentration degree, comprises with lower module:
The first processing module, be that path is found in Network by shortest path first, determine path the common frequency spectrum of every link of process;
The second processing module, find out the first time slot section, described the first time slot section be continuous free timeslot number in common frequency spectrum less than the time slot section of threshold value M, described threshold value M is positive integer;
The 3rd processing module, the frequency gap number required according to Network, travel through continuous frequency spectrum on described the first time slot section, determine the multiple resources method of salary distribution of described continuous frequency spectrum, then calculates the fragment concentration degree sum of every link under every kind of resource distribution mode; Selection makes the resource distribution mode of the fragment concentration degree sum maximum of described every link, resource is carried out in Network distribute.
Wherein, shortest path first described in the first processing module is dijkstra algorithm.
Wherein, also comprise:
Manages module everywhere, finds out the second time slot section, described the second time slot section be continuous free timeslot number in common frequency spectrum more than or equal to the time slot section of threshold value M, described the second time slot section is set to the state that uses; , if in the 3rd processing module, Network distributes not success, Network is distributed in described being set in the second time slot section of using state.
Wherein, describedly Network is distributed in described being set to uses the second time slot section of state to comprise: Network is started resource and distributes from the described from left to right position from left to right of first the second time slot section of using state that is set to.
(3) beneficial effect
the present invention is by providing a kind of resource allocation methods based on distributed fragment concentration degree and device, by being set, free timeslot counts threshold value M, preferential Resources allocation on the first time slot section, can select a kind of method of salary distribution that makes the link fragment concentration degree maximum of path process for every paths, allow through the idling-resource of every link relatively concentrated, and the business priority allocation is being hanged down on the frequency spectrum of sequence number, be compared to F-F method and optimum Match (M-U) method of adopting, improved greatly the link fragment intensity in the resource allocation process, make as having higher success rate that the resource of subsequent network business is distributed.
The present invention is on the second time slot section during Resources allocation, not only pay close attention to the fragment degree that reduces link, and consider according to the Resources allocation of direction from left to right, be compared to optimum Match (M-U) method that adopts, greatly reduce service blocking rate, make as having higher success rate that the resource of subsequent network business is distributed.
Description of drawings
Fig. 1 is the flow chart of a kind of embodiment of the resource allocation methods based on distributed fragment concentration degree of the present invention;
Fig. 2 is the flow chart of a kind of preferred embodiment of the resource allocation methods based on distributed fragment concentration degree of the present invention;
Fig. 3 is of the present invention based on 5 kinds of method of salary distribution schematic diagrames in a kind of embodiment of distributed fragment concentration degree resource allocation methods;
Fig. 4 is the comparison schematic diagram of F-F method, optimum Match (M-U) method and the resource allocation methods based on distributed fragment concentration degree of the present invention;
Fig. 5 is of the present invention based on 3 kinds of method of salary distribution schematic diagrames in a kind of embodiment of distributed fragment concentration degree resource allocation methods;
Fig. 6 is the schematic diagram of a kind of embodiment based on distributed fragment concentration degree resource allocation device of the present invention.
Embodiment
For the purpose, technical scheme and the advantage that make the embodiment of the present invention clearer, below in conjunction with the accompanying drawing in the embodiment of the present invention, technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment in the present invention, those of ordinary skills, not making under the creative work prerequisite the every other embodiment that obtains, belong to the scope of protection of the invention.
At first implication and the computational methods thereof of fragment concentration degree are described:
The fragment concentration degree, refer to one section continuous idle frequency spectrum, can be that all need the different business of gap numbers frequently, the summation of the product of the distribution method number of the continuous frequency spectrum that the every kind of required frequency gap of business number and traffic assignments for this reason are required.As one section continuous 12 idle frequency spectrum, can be 1 for the initial frequency gap of the traffic assignments sequence number of 12 continuous frequency spectrums of needs, end frequency gap sequence number is 12 continuous frequency spectrum; For the initial frequency gap of the traffic assignments sequence number of 11 continuous frequency spectrums of needs is 1, finishing gap sequence number frequently is 11, and initial frequency gap sequence number is 2, finishes gap sequence number frequently and be 12 continuous frequency spectrum; In like manner as can be known, can be 1 to 11 for the initial frequency gap of the traffic assignments sequence number of 2 continuous frequency spectrums of needs, finish accordingly frequency spectrum and be 2 to 12 continuous frequency spectrum.
If the frequency gap number that in a period of time, business takies is 1 to 6,12 continuous frequency spectrum fragment concentration degrees are (as table one), 8 continuous frequency spectrum fragment concentration degrees (as table two):
Table one: 12 continuous frequency spectrum fragment concentration degrees:
| ? | ? | ? | ? | ? | ? | ? | ? | ? | ? | ? | ? |
12:（6*7）+（5*8）+（4*9）+（3*10）+（2*11）+（1*12）=182
Table two: 8 continuous frequency spectrum fragment concentration degrees:
| ? | ? | ? | ? | ? | ? | ? | ? |
8：（6*3）+（5*4）+（4*5）+（3*6）+（2*7）+（1*8）=98
One section continuous idle frequency spectrum, idle gap number frequently is more, and the fragment concentration degree is larger.The fragment concentration degree can be used for representing that the continuous frequency spectrum of one period free time can be the method sum of traffic assignments resource, that is: link fragment concentration degree is larger, and link circuit resource is more concentrated.Fragment concentration degree numerical value is larger, and this section frequency spectrum is that the method for traffic assignments resource is more, and the possibility of Resources allocation success is larger, and is corresponding because resource distributes the not enough service blocking rate that causes just lower, reduced service blocking rate.
, if the frequency gap number that in a period of time, business takies is 3 to 6, after business routing success, be these traffic assignments frequency gaps.As shown in Table 1, suppose that the common frequency gap is 12 idle gaps frequently continuously.As long as we are in these 12 continuous idle gaps frequently of statistics so, for 3 continuous methods of the traffic assignments of gap number frequently of needs are 10 kinds, for 4 continuous methods of the traffic assignments of gap number frequently of needs have 9 kinds, for 5 continuous methods of the traffic assignments of gap number frequently of needs are 8 kinds, for 6 continuous methods of the traffic assignments of gap number frequently of needs have 7 kinds, the fragment concentration degree is: 3*10+4*9+5*8+6*7=148.Need not consider that continuously frequency gap number is 1 to 2 and 7 to 12 situation this moment, because the required minimum continuous frequency gap number of business is 3, it is nonsensical adding up two continuous gap numbers frequently, because continuous two frequency gap numbers can not be these traffic assignments resource requirements, in like manner, it is also nonsensical adding up 7 to 12 continuous frequency spectrums,, because the continuous frequency gap number that business takies mostly is 6 most, adds up 7 to 12 continuous gap numbers frequently and can cause the statistics that repeats of same allocated method.
The flow chart of the resource allocation methods of an embodiment of the present invention as shown in Figure 1, this embodiment comprises following steps:
S1, by shortest path first, be that path is found in Network, determine path the common frequency spectrum of every link of process;
S2, find out the first time slot section, described the first time slot section be continuous free timeslot number in common frequency spectrum less than the time slot section of threshold value M, described threshold value M is positive integer;
S3, the frequency gap number required according to Network, travel through continuous frequency spectrum on described the first time slot section, determine the multiple resources method of salary distribution of described continuous frequency spectrum, then calculates the fragment concentration degree sum of every link under every kind of resource distribution mode; Selection makes the resource distribution mode of the fragment concentration degree sum maximum of described every link, resource is carried out in Network distribute.
The embodiment of the present invention 1 is by providing a kind of resource allocation methods based on distributed fragment concentration degree, for the ultra broadband business, by being set, free timeslot counts threshold value, preferential Resources allocation on the first time slot section, fully take into account the fragment degree of link, allow through the fragment concentration degree of every link larger, idling-resource is relatively concentrated, and the business priority allocation on the frequency spectrum of low sequence number, is made as having higher success rate that the resource of subsequent network business is distributed.
Embodiment 2,
Be illustrated in figure 2 as the flow chart of the resource distribution mode of a preferred embodiment of the invention, this embodiment comprises following steps:
Sa, by shortest path first, be that path is found in Network, determine path the common frequency spectrum of every link of process;
Wherein shortest path first described in step Sa is dijkstra algorithm.
Dijkstra's algorithm is typical shortest path algorithm, is used for calculating the shortest path of a node to other all nodes.Main feature is outwards expansion layer by layer centered by starting point, until expand to terminal.Dijkstra's algorithm can draw the optimal solution of shortest path.
In a paths, in the link of adjacent two nodes of all of path process, get the idle public part of gap frequently of every link, only have when the frequency gap that is in same sequence number of every link all in idle situation, the frequency gap that is in this sequence number of common frequency spectrum just is idle condition, otherwise the frequency gap that is in this sequence number is seizure condition.
Sb, find out the first time slot section, described the first time slot section be continuous free timeslot number in common frequency spectrum less than the time slot section of threshold value M, described threshold value M is positive integer;
The preferred value of threshold value M is that simulation result is determined.
Sc, the frequency gap number required according to Network, travel through continuous frequency spectrum on described the first time slot section, determine the multiple resources method of salary distribution of described continuous frequency spectrum, then calculates the fragment concentration degree sum of every link under every kind of resource distribution mode; Selection makes the resource distribution mode of the fragment concentration degree sum maximum of described every link, resource is carried out in Network distribute;
Wherein, the described continuous frequency spectrum of traversal on described the first time slot section, select all continuous available frequency gap numbers to be greater than or equal to the idle frequency spectrum section of the required frequency gap number of Network on described continuous frequency spectrum, determine all required resource distribution modes of this business on every section idle frequency spectrum section, namely select all available required frequency gap numbers of business continuously, and initial frequency spectrum is made marks.
In hypothetical network, the frequency gap number of all service needed is 1～6, probability is identical, in the present embodiment, supposition needs 2 Network of gap arrivals frequently continuously, after the dijkstra's algorithm routing, select continuously available frequency gap number to be greater than or equal to 2 continuous frequency spectrum on continuous frequency spectrum, and initial frequency spectrum is made marks.
As shown in Figure 3, the frequency spectrum that takies situation and common link part for the frequency gap of every link of path process takies situation, the threshold value M that supposes this moment is 4, free timeslot section on common frequency spectrum is all the first time slot at this moment, this moment, the link of the first time slot had 5 kinds of resource distribution modes, and the fragment concentration degree sum of 5 kinds of methods of salary distribution is respectively:
Distribution method 1:(1+1+56+10)+(4+98+10)+(4+98+10)+(1+1+56+10)+(4+98+10)+(1+4+10)=487; The fragment concentration degree sum that is distribution method 1 is 487;
Distribution method 2:(4+56+10)+(10+84+10)+(10+84+10)+(4+56+1)+(10+84+10)+(1+4=10)=467; The fragment concentration degree sum that is distribution method 2 is 467;
Distribution method 3:(20+4+4+10)+(98+4+10)+(98+4+10)+(20+4+4+10)+(98+4+10)+(10+10)=432; The fragment concentration degree sum that is distribution method 3 is 432;
Distribution method 4:20+56+1)+(182+1)+(182+1)+(20+56+1)+(182+1)+(10+4+1)=718; The fragment concentration degree sum that is distribution method 4 is 718;
Distribution method 5:20+56+1)+(182+1)+(182+1)+(20+56+1)+(182+1)+(10+4+1)=718; The fragment concentration degree sum that is distribution method 5 is 718;
As shown in Figure 3, the fragment concentration degree sum in the method for salary distribution 4 and 5 is maximum at this moment, and when the resource of the link in two kinds of distribution methods distributed fragment concentration degree sum identical, preferentially selecting initial frequency gap was than the resource allocation methods of low frequency gap.In this example, the 4th kind with the 5th kind of resource allocation methods in, preferentially select the 4th kind of resource allocation methods.
Sd, find out the second time slot section, described the second time slot section be continuous free timeslot number in common frequency spectrum more than or equal to the time slot section of threshold value M, described the second time slot section is set to the state that uses;
If in step Sc, Network distributes not success, Network is distributed in described in step Sb and is set in the second time slot section of using state,
Its method of salary distribution is: Network is set to the from left to right position from left to right of first the second time slot section of using state from step Sb and starts the resource distribution.
Be below the comparison of F-F method, M-U method and distributed fragment concentration degree method:
As shown in Figure 4, set forth successively lower initial hit F-F method, the M-U(Most Used of adopting) method, distributed fragment concentration degree method.
1) F-F method:
As shown in Figure 3, First Fit method, known to figure, first of the common frequency gap continuously initial frequency gap of available frequency spectrum is sequence number 2, uses the F-F method, and the characteristics of initial hit know, and the frequency gap sequence number of traffic assignments is 2,3 for this reason; This moment, the fragment concentration degree sum of link was:
（1+1+56+10）+（4+98+10）+（4+98+10）+（1+1+56+10）+（4+98+10）+（1+4+10）=487。
2) optimum Match (M-U) method:
As shown in Figure 3, in frequency gap of continuous free time of all segments of common frequency spectrum, select idle frequency gap number and the lucky consistent a bit of idle frequency spectrum of the required frequency gap of business number, and Resources allocation;
This moment, the fragment concentration degree sum of link was:
（20+4+4+10）+（98+4+10）+（98+4+10）+（20+4+4+10）+（98+4+10）+（10+10）=432。
3) distributed fragment concentration degree method:
As shown in Figure 3, in the continuous idle gap frequently of common frequency spectrum the first time slot, select idle gap number frequently to be greater than or equal to the segment idle frequency spectrum of the required frequency gap of business number, in the idle frequency spectrum of these sections, select the required continuous frequency gap number of all business to carry out Resources allocation, 5 kinds of resource distribution modes are arranged, under every kind of resource distribution mode, the fragment concentration degree sum of every link of calculating path process, finally, select the resource distribution mode of the fragment concentration degree sum maximum that makes every link as final resource distribution mode; Through the continuous frequency spectrum on the traversal common frequency spectrum, this moment, the resource distribution mode fragment concentration degree sum of link was maximum, was 718.
As shown in Figure 4, by the three in example more as can be known, select the resource allocation methods of distributed fragment concentration degree, the fragment concentration degree sum of link is greater than F-F, the resource distribution mode of M-U, this kind resource distribution mode is adopted in this explanation, and the frequency spectrum fragment of every link is more concentrated.After the thought Resources allocation of this moment according to the resource allocation methods of distributed fragment concentration degree, the fragment concentration degree of every link of path process is larger, and idling-resource is relatively concentrated, and every link is that follow-up business is distributed having higher success rate of continuous resource.
What be illustrated in figure 5 as a preferred embodiment of the invention is traffic assignments resource on the horizon according to distributed fragment concentration degree method:
In all first time slot sections of common frequency spectrum, select idle gap number frequently to be greater than or equal to the first time slot section idle frequency spectrum of the required frequency gap of business number, in the idle frequency spectrum of these the first time slot sections, select the required continuous frequency gap number of all business to carry out Resources allocation, suppose to have resource distribution mode in n, under every kind of resource distribution mode, the fragment concentration degree sum of every link of calculating path process, finally, select the resource distribution mode of the fragment concentration degree sum maximum that makes every link as final resource distribution mode.
The link of adjacent two nodes of all of path process and the frequency spectrum idle condition of common link are as shown in Figure 5.If on the horizon is to need gap number frequently to be respectively 2,2 successively, three business of 4, when the resource allocation methods according to distributed fragment concentration degree is traffic assignments resource on the horizon:
in this example, given threshold M is 4, when first needs the business of 2 frequency gap numbers to arrive, all continuous idle frequency spectrum sections on the traversal common frequency spectrum, find out the second time slot section, described the second time slot section is that the continuous free timeslot number in common frequency spectrum is deposited greater than the time slot section of threshold value M, then these the second time slot sections all are set to and have used state in public time slot table, for processing public time slot table later, namely in the public time slot table of continuous idle number less than the time slot section of M, carrying out resource in the method for the distributed fragment concentration degree of the first above-mentioned proposition of time slot Duan Liyong distributes, three kinds of methods of salary distribution are arranged this moment, be 15 for traffic assignments frequency gap sequence number as can be known by result of calculation, 16 and 16, 17 o'clock, the fragment concentration degree sum of link is maximum, be 359.
As shown in Figure 5, be the schematic diagram of three kinds of methods of salary distribution:
Distribution method 1:(4+4+10)+(1+10+4+10)+(1+10+4+10)+(4+4+10)+(1+10+4+10)+(10)=121, namely the fragment concentration degree sum of distribution method 1 is 121;
Distribution method 2:(56+1)+(1+78+1)+(1+78+1)+(56+1)+(1+78+1)+(1+4)=359, namely the fragment concentration degree sum of distribution method 1 is 359;
Distribution method 3:(56+1)+(1+78+1)+(1+78+1)+(56+1)+(1+78+1)+(1+4)=359, namely the fragment concentration degree sum of distribution method 1 is 359;
When the resource of the link in several distribution methods distributed fragment concentration degree sum identical, preferentially selecting initial frequency gap was than the resource allocation methods of low frequency gap, and therefore giving the frequency gap sequence number of this traffic assignments is 15,16.
Resource allocation methods according to distributed fragment concentration degree can draw, and when the business of 2 frequency gap numbers of second needs arrives, is 10,11 frequency spectrum for its distribution frequency gap sequence number;
When 4 of the 3rd needs frequently the gap numbers business then, resource allocation methods by distributed fragment concentration degree: if in step Sc, Network distributes not success, Network is distributed in described being set in the second time slot section of using state, the method for salary distribution is: Network is set to the from left to right position from left to right of first the second time slot section of using state from step Sb and starts the resource distribution.Can draw: be that the 3rd traffic assignments frequency gap sequence number is 2 to 5 continuous frequency spectrum, the resource allocation methods of distributed fragment concentration degree can be successfully the 3rd traffic assignments resource.
Embodiment 4,
The present invention also provides a kind of resource allocation device based on distributed fragment concentration degree:
As shown in Figure 6, this device comprises with lower module:
The first processing module, be that by shortest path first Network finds path, determine path the common frequency spectrum of every link of process;
The second processing module, find out the first time slot section, described the first time slot section be continuous free timeslot number in common frequency spectrum less than the time slot section of threshold value M, described threshold value M is positive integer;
The 3rd processing module, the frequency gap number required according to Network, travel through continuous frequency spectrum on described the first time slot section, determine the multiple resources method of salary distribution of described continuous frequency spectrum, then calculates the fragment concentration degree sum of every link under every kind of resource distribution mode; Selection makes the resource distribution mode of the fragment concentration degree sum maximum of described every link, resource is carried out in Network distribute.
Shortest path first described in the first processing module is dijkstra algorithm.
Wherein, this device also comprises:
Manages module everywhere, finds out the second time slot section, described the second time slot section be continuous free timeslot number in common frequency spectrum more than or equal to the time slot section of threshold value M, described the second time slot section is set to the state that uses; , if in the 3rd processing module, Network distributes not success, Network is distributed in described being set in the second time slot section of using state.
Wherein, this device is described is distributed in described being set to Network and uses the second time slot section of state to comprise: Network is started resource and distributes from the described from left to right position from left to right of first the second time slot section of using state that is set to.
the resource allocation methods of the distributed fragment concentration degree in the embodiment of the present invention and device combine the advantage of optimum Match (M-U) method and F-F method Resources allocation, why fragment concentration degree in the resource allocation process can be provided and reduce service blocking rate, , because the resource allocation methods of distributed fragment concentration degree is paid the utmost attention in the first time slot, business is carried out the resource distribution, namely adopting the resource allocation methods of distributed fragment concentration degree in the first time slot is the traffic assignments resource, be only that the traffic assignments resource is when unsuccessful in the first time slot, just consider the second time slot, be the continuous frequency spectrum that the initial frequency gap of traffic assignments sequence number is the position from left to right of first the second time slot from left to right.Adopt the resource allocation methods of distributed fragment concentration degree to carry out the resource distribution to business in the first time slot, even the fragment concentration degree of every link of path process is larger, idling-resource is relatively concentrated, maximize the fragment degree that reduces link, for follow-up business is distributed having higher success rate of continuous resource.When in the first time slot being traffic assignments resource when unsuccessful, then in the second time slot Resources allocation,, according to order from left to right, business is distributed on the frequency spectrum of low sequence number as far as possible, thereby makes as having higher success rate that the resource of subsequent network business is distributed.
It should be noted that finally: above embodiment only, in order to technical scheme of the present invention to be described, is not intended to limit; Although with reference to previous embodiment, the present invention is had been described in detail, those of ordinary skill in the art is to be understood that: it still can be modified to the technical scheme that aforementioned each embodiment puts down in writing, and perhaps part technical characterictic wherein is equal to replacement; And these modifications or replacement do not make the essence of appropriate technical solution break away from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (8)
1. the resource allocation methods based on distributed fragment concentration degree, is characterized in that, comprises following steps:
S1, by shortest path first, be that path is found in Network, determine path the common frequency spectrum of every link of process;
S2, find out the first time slot section, described the first time slot section be continuous free timeslot number in common frequency spectrum less than the time slot section of threshold value M, described threshold value M is positive integer;
S3, the frequency gap number required according to Network, travel through continuous frequency spectrum on described the first time slot section, determine the multiple resources method of salary distribution of described continuous frequency spectrum, then calculates the fragment concentration degree sum of every link under every kind of resource distribution mode; Selection makes the resource distribution mode of the fragment concentration degree sum maximum of described every link, resource is carried out in Network distribute.
2. a kind of resource allocation methods based on distributed fragment concentration degree as claimed in claim 1, is characterized in that, shortest path first described in step S1 is dijkstra algorithm.
3. a kind of resource allocation methods based on distributed fragment concentration degree as claimed in claim 1, it is characterized in that, the method further comprises: find out the second time slot section, described the second time slot section be continuous free timeslot number in common frequency spectrum more than or equal to the time slot section of threshold value M, described the second time slot section is set to the state that uses;
Also comprise step after step S3:, if in step S3, Network distributes not success, Network is distributed in described being set in the second time slot section of using state.
4. a kind of resource allocation methods based on distributed fragment concentration degree as claimed in claim 3, it is characterized in that, describedly Network is distributed in described being set to uses the second time slot section of state to comprise: Network is started resource and distributes from the described from left to right position from left to right of first the second time slot section of using state that is set to.
5. the resource allocation device based on distributed fragment concentration degree, is characterized in that, comprises with lower module:
The first processing module, be that path is found in Network by shortest path first, determine path the common frequency spectrum of every link of process;
The second processing module, find out the first time slot section, described the first time slot section be continuous free timeslot number in common frequency spectrum less than the time slot section of threshold value M, described threshold value M is positive integer;
The 3rd processing module, the frequency gap number required according to Network, travel through continuous frequency spectrum on described the first time slot section, determine the multiple resources method of salary distribution of described continuous frequency spectrum, then calculates the fragment concentration degree sum of every link under every kind of resource distribution mode; Selection makes the resource distribution mode of the fragment concentration degree sum maximum of described every link, resource is carried out in Network distribute.
6. a kind of resource allocation device based on distributed fragment concentration degree as claimed in claim 5, is characterized in that, shortest path first described in the first processing module is dijkstra algorithm.
7. a kind of resource allocation device based on distributed fragment concentration degree as claimed in claim 5, is characterized in that, also comprises:
Manages module everywhere, finds out the second time slot section, described the second time slot section be continuous free timeslot number in common frequency spectrum more than or equal to the time slot section of threshold value M, described the second time slot section is set to the state that uses; , if in the 3rd processing module, Network distributes not success, Network is distributed in described being set in the second time slot section of using state.
8. a kind of resource allocation device based on distributed fragment concentration degree as claimed in claim 6, it is characterized in that, describedly Network is distributed in described being set to uses the second time slot section of state to comprise: Network is started resource and distributes from the described from left to right position from left to right of first the second time slot section of using state that is set to.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310277695.3A CN103391258B (en) | 2013-07-03 | 2013-07-03 | Resource distribution method and device based on distributed fragment concentration ratios |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310277695.3A CN103391258B (en) | 2013-07-03 | 2013-07-03 | Resource distribution method and device based on distributed fragment concentration ratios |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103391258A true CN103391258A (en) | 2013-11-13 |
| CN103391258B CN103391258B (en) | 2017-04-19 |
Family
ID=49535419
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310277695.3A Expired - Fee Related CN103391258B (en) | 2013-07-03 | 2013-07-03 | Resource distribution method and device based on distributed fragment concentration ratios |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103391258B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016037510A1 (en) * | 2014-09-09 | 2016-03-17 | 国家电网公司 | Power line communication frequency spectrum defragmentation method and device |
| CN105490934A (en) * | 2016-01-25 | 2016-04-13 | 重庆邮电大学 | Fair routing and spectrum assignment method based on fragment processing |
| WO2016082596A1 (en) * | 2014-11-27 | 2016-06-02 | 中兴通讯股份有限公司 | Method, device and processor for continuously reserving resource based on time spectrum |
| CN111836135A (en) * | 2019-04-23 | 2020-10-27 | 华为技术有限公司 | Spectrum allocation method and device |
| CN112714498A (en) * | 2021-01-27 | 2021-04-27 | 四川安迪科技实业有限公司 | Satellite network frequency spectrum defragmentation method, device, system and storage medium |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE602005006292T2 (en) * | 2005-11-10 | 2009-07-23 | Research In Motion Ltd., Waterloo | Method and apparatus for channel allocation for data communication in a radio communication system |
| CN102523068B (en) * | 2011-12-07 | 2014-07-30 | 北京邮电大学 | Frequency spectrum resource distribution method in elastic optical network and system thereof |
| CN102724113B (en) * | 2012-05-31 | 2015-02-04 | 北京邮电大学 | Method for reconstructing frequency slot resources |
| CN103051547B (en) * | 2012-12-24 | 2015-08-05 | 北京邮电大学 | The route of resource perception and frequency spectrum resource allocation method and system in elastic optical network |
-
2013
- 2013-07-03 CN CN201310277695.3A patent/CN103391258B/en not_active Expired - Fee Related
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016037510A1 (en) * | 2014-09-09 | 2016-03-17 | 国家电网公司 | Power line communication frequency spectrum defragmentation method and device |
| WO2016082596A1 (en) * | 2014-11-27 | 2016-06-02 | 中兴通讯股份有限公司 | Method, device and processor for continuously reserving resource based on time spectrum |
| CN105490934A (en) * | 2016-01-25 | 2016-04-13 | 重庆邮电大学 | Fair routing and spectrum assignment method based on fragment processing |
| CN105490934B (en) * | 2016-01-25 | 2018-08-21 | 重庆邮电大学 | A kind of fair routing and frequency spectrum distributing method based on fragment processing |
| CN111836135A (en) * | 2019-04-23 | 2020-10-27 | 华为技术有限公司 | Spectrum allocation method and device |
| CN111836135B (en) * | 2019-04-23 | 2022-06-24 | 华为技术有限公司 | Spectrum allocation method and device |
| US11825248B2 (en) | 2019-04-23 | 2023-11-21 | Huawei Technologies Co., Ltd. | Spectrum allocation method and apparatus |
| CN112714498A (en) * | 2021-01-27 | 2021-04-27 | 四川安迪科技实业有限公司 | Satellite network frequency spectrum defragmentation method, device, system and storage medium |
| CN112714498B (en) * | 2021-01-27 | 2022-08-12 | 四川安迪科技实业有限公司 | Satellite network frequency spectrum defragmentation method, device, system and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103391258B (en) | 2017-04-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103327501B (en) | Based on the resource allocation methods of distributed fragment concentration degree | |
| CN104836751B (en) | The optical-fiber network frequency spectrum distributing method of single path business separation-merging based on frequency spectrum perception | |
| CN103391258A (en) | Resource distribution method and device based on distributed fragment concentration ratios | |
| CN105827528B (en) | A kind of route selection method suitable for the flexible optical-fiber network of frequency spectrum | |
| CN102447623A (en) | Cascade method of optical network frequency spectrum resource fragments and apparatus thereof | |
| CN103051547A (en) | Routing and spectrum resource allocation method and system for resource awareness in elastic optical path network | |
| CN101801091A (en) | Method and device for allocating resources in OFDM/MIMO system | |
| CN103812790A (en) | Self-adapting modulation format RSA (Routing and Spectrum Allocation) method in flexible optical network | |
| Kosaka et al. | Shared protected elastic optical path network design that applies iterative re-optimization based on resource utilization efficiency measures | |
| CN106953710A (en) | What the distribution of minimum cost frequency spectrum and fragment were perceived in elastic optical network reconfigures routing mechanism | |
| CN107135056B (en) | Anycast service resource allocation method for reducing frequency spectrum fragments and time delay | |
| CN102546435A (en) | Spectrum resource assignment method and device | |
| CN107124376B (en) | Spectrum allocation method based on segmented modulation in Elastic Optical Network (EON) | |
| US8787761B2 (en) | Multi-service provisioning in orthogonal frequency division multiplexing-passive optical network OFDMA-PON | |
| CN111698584A (en) | Routing fiber core frequency spectrum allocation method based on physical damage perception in multi-core fiber | |
| Morita et al. | Dynamic spectrum allocation method for reducing crosstalk in multi-core fiber networks | |
| WO2020215992A1 (en) | Frequency spectrum allocation method and apparatus | |
| CN113489617A (en) | Minimum network energy consumption optimization method and system based on traffic grooming | |
| CN110035337B (en) | Active multi-stream spectrum allocation method based on exponential division frequency block in elastic optical network | |
| EP2815624B1 (en) | Resource allocation | |
| CN106961641A (en) | A kind of frequency spectrum distributing method perceived in elastic optical network based on service priority | |
| CN102420656B (en) | Trigger method of frequency spectrum resource reconstruction in all-optical network and system thereof | |
| CN102783100B (en) | Method and apparatus for allocating bandwidth resources | |
| CN105634990B (en) | Based on the continuous method for obligating resource of time frequency spectrum, device and processor | |
| CN113692058A (en) | Spectrum resource evaluation set-based satellite optical network spectrum allocation method and system |
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 |
Granted publication date: 20170419 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |