CN108093485A - A kind of resource allocation methods and device - Google Patents
A kind of resource allocation methods and device Download PDFInfo
- Publication number
- CN108093485A CN108093485A CN201711366340.6A CN201711366340A CN108093485A CN 108093485 A CN108093485 A CN 108093485A CN 201711366340 A CN201711366340 A CN 201711366340A CN 108093485 A CN108093485 A CN 108093485A
- Authority
- CN
- China
- Prior art keywords
- priority
- logic channel
- channel
- queue
- logic
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention proposes a kind of resource allocation methods and device.A kind of resource allocation methods, including：Obtain the information for the multiple logic channels for needing to distribute resource；According to Delay Priority division rule in default absolute priority hierarchical rule and layer, processing is ranked up to the multiple logic channel, obtains priority of logical channels queue；Since first logic channel in the priority of logical channels queue, the logic channel in the priority of logical channels queue is traveled through successively, and be the logical channel assignment resource that traverses, until resource allocation finish or the priority of logical channels queue in logic channel be traversed and finish.Above-mentioned technical proposal can be logical channel assignment resource according to priority of logical channels, can ensure the service quality of end-to-end data transmission.
Description
Technical field
The present invention relates to wireless communication technology field more particularly to a kind of resource allocation methods and device.
Background technology
Only there are one scheduling of resource host node in wireless mesh network MESH systems, remaining is from node, host node and institute
Some jumps connection between node one, is connected from node and from multi-hop between node, from the data transmission between node needs
The forwarding of intermediate node.It can be seen that the data transmission of MESH network has the characteristics that multi-hop, forwarding.In above-mentioned multi-hop, forwarding net
In network, for a certain node, can according to priority of logical channels scheduling resource, be to ensure end-to-end data transmission clothes
The main path for quality of being engaged in.
And existing resource scheduling algorithm is all based on single-hop networks design (such as RR, MAX C/I, PF, M_LWDF), nothing
Method is used to ensure the MESH network of multi-hop service quality end to end；Other have the characteristics that multi-hop, system (such as WiFi of forwarding
MESH), data transmission is link multi-hop, is not ensured service quality, and for multiple business type, be cannot be distinguished preferential
Grade.Therefore, it is necessary to redesign the resource scheduling algorithm suitable for broadband MESH network, to ensure its end-to-end data transmission
Service quality.
The content of the invention
The defects of based on the above-mentioned prior art and deficiency, the present invention propose a kind of resource allocation methods and device, Neng Gougen
Resource is distributed according to service priority, ensures the service quality of end-to-end data transmission.
In order to achieve the above object, the following technical solutions are proposed by the present invention：
First aspect present invention proposes a kind of resource allocation methods, including：Obtaining needs the multiple logics for distributing resource letter
The information in road；According to Delay Priority division rule in default absolute priority hierarchical rule and layer, to the multiple logic
Channel is ranked up processing, obtains priority of logical channels queue；It is patrolled from first in the priority of logical channels queue
It collects channel to start, travels through the logic channel in the priority of logical channels queue, and the logic channel point to traverse successively
With resource, until resource allocation finish or the priority of logical channels queue in logic channel be traversed and finish.As it can be seen that it adopts
When with above-mentioned technical proposal being logical channel assignment resource, priority classification first is carried out to each logic channel, therefore can foundation
The priority of each communication service and distribute resource, can ensure the service quality of end-to-end data transmission.
Second aspect of the present invention proposes a kind of resource allocation device, including：Information acquisition unit needs to distribute for obtaining
The information of multiple logic channels of resource；Sort processing unit, for according in default absolute priority hierarchical rule and layer
Delay Priority division rule is ranked up processing to the multiple logic channel, obtains priority of logical channels queue；Resource
Allocation unit, for since first logic channel in the priority of logical channels queue, traveling through the logic successively
Logic channel in channel priority queue, and be the logical channel assignment resource that traverses, until resource allocation finishes or institute
It states the logic channel in priority of logical channels queue and is traversed and finish.As it can be seen that above device is used to be provided for logical channel assignment
During source, by for each logic channel prioritization, distributing resource so as to the priority according to each communication service, therefore
It can ensure the service quality of end-to-end data transmission.
Third aspect present invention proposes another resource allocation device, including：Memory and processor；Wherein, it is described to deposit
Reservoir is connected to the processor, for storing the data generated in program and program operation process；The processor, for leading to
The program run and stored in the processor is crossed, realizes following functions：Obtain the letter for the multiple logic channels for needing to distribute resource
Breath；According to Delay Priority division rule in default absolute priority hierarchical rule and layer, to the multiple logic channel into
Row sequence is handled, and obtains priority of logical channels queue；From first logic channel in the priority of logical channels queue
Start, travel through the logic channel in the priority of logical channels queue, and the logical channel assignment resource to traverse successively,
Until resource allocation finish or the priority of logical channels queue in logic channel be traversed and finish.As it can be seen that using above-mentioned
When device is logical channel assignment resource, by for each logic channel prioritization, so as to according to each communication service
Priority and distribute resource, therefore can ensure the service quality of end-to-end data transmission.
In one implementation, it is described to be divided according to Delay Priority in default absolute priority hierarchical rule and layer
Rule is ranked up processing to the multiple logic channel, obtains priority of logical channels queue, including：According to default exhausted
To priority hierarchical rule, priority level division processing is carried out to the multiple logic channel, is obtained comprising logic channel
One or more logic channel levels；According to Delay Priority division rule in default layer, in each logic channel level
Comprising logic channel carry out Delay Priority sequence processing；Logically the priority of channel level from high to low and is patrolled
The order of the Delay Priority of logic channel in channel level from high to low is collected, place is ranked up to the multiple logic channel
Reason, obtains priority of logical channels queue.As it can be seen that when being ranked up processing to logic channel using the above program, according to logic
Channel priority and Delay Priority double standards are ranked up logic channel, and sort more scientific more realistic demand.
In one implementation, according to Delay Priority division rule in default layer, to being wrapped in logic channel level
The logic channel contained carries out Delay Priority sequence processing, including：Be calculated respectively included in logic channel level it is each
The residual time delay of logic channel；It is preferential for each logic channel setting according to the residual time delay of each logic channel
Grade, wherein, the residual time delay of logic channel is smaller, then the priority of logic channel is higher；According to priority from high to low suitable
Sequence is ranked up processing to each logic channel.In above-mentioned realization method, determined according to logic channel residual time delay
The Delay Priority of logic channel.Logic channel residual time delay can more embody demand of the logic channel business to time delay, therefore, on
The mode that priority of logical channels is set is stated, more meets practical business delay requirement.
In one implementation, in the order according to priority from high to low, each logic channel is arranged
During sequence processing, this method further includes：If there are the identical logic channel of priority in each logic channel, according to than
Example fair scheduling algorithm determines the Proportional Fair priority of the identical logic channel of each priority；It is proportionally fair to adjust
The order of priority from high to low is spent, the logic channel identical to each priority is ranked up processing.Using above-mentioned side
Case for the identical logic channel of priority, distinguishes its priority, so as to realize again by proportional fair scheduling
Absolute division to priority of logical channels makes the more realistic demand of resource allocation.
It is in one implementation, described since first logic channel in the priority of logical channels queue,
The logic channel in the priority of logical channels queue, and the logical channel assignment resource to traverse are traveled through successively, including：
Since first logic channel in the priority of logical channels queue, the priority of logical channels queue is traveled through successively
In logic channel, when often traversing a logic channel, perform following operation：It is saved according to the source of the logic channel traversed
Point, whether the number of nodes for judging current scheduling is more than default number of nodes threshold value；If the number of nodes of current scheduling is no more than pre-
If number of nodes threshold value, then the logical channel assignment resource to traverse；If the number of nodes of current scheduling is more than default section
Points threshold value, then continue to travel through next logic channel.
In one implementation, this method further includes：The information for the logic channel for having distributed resource is sequentially added
Scheduling logic channel queue；When the logic channel in the priority of logical channels queue, which is traversed, to be finished, if also object
Reason resource block not yet distributes, then the order according to priority from high to low, successively in the scheduled logical channel queue
Logic channel carries out Greedy resource allocation.It, will still after for each logical channel assignment resource in above-mentioned realization method
Unappropriated physical origin block distributes to the logic channel for having distributed resource further according to the priority of each logic channel, so as into one
Step ensures the quality of service of high priority logic channel.
Description of the drawings
It in order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
There is attached drawing needed in technology description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
The embodiment of invention, for those of ordinary skill in the art, without creative efforts, can also basis
The attached drawing of offer obtains other attached drawings.
Fig. 1 is a kind of flow diagram of resource allocation methods disclosed by the embodiments of the present invention；
Fig. 2 is the flow diagram of another resource allocation methods disclosed by the embodiments of the present invention；
Fig. 3 is a kind of MESH network linear topology schematic diagram disclosed by the embodiments of the present invention；
Fig. 4 is a kind of structure diagram of resource allocation device disclosed by the embodiments of the present invention；
Fig. 5 is the structure diagram of another resource allocation device disclosed by the embodiments of the present invention.
Specific embodiment
Below in conjunction with the attached drawing in the embodiment of the present invention, the technical solution in the embodiment of the present invention is carried out clear, complete
Site preparation describes, it is clear that described embodiment is only part of the embodiment of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, those of ordinary skill in the art are obtained every other without making creative work
Embodiment belongs to the scope of protection of the invention.
Shown in Figure 1 the embodiment of the invention discloses a kind of resource allocation methods, this method includes：
S101, acquisition need to distribute the information of multiple logic channels of resource；
Specifically, logic channel is to transfer the channel that different information categories are formed on the physical channel, it is that media access control sublayer is upward
The service that layer provides, what the content for representing carrying is, MAC layer provides data transport services on logical channels.Logic channel
It can be generally divided into two classes：Control channel and Traffic Channel.Control channel is used for transmission control plane information, and Traffic Channel is used
In transmission user plane information.Technical solution of the embodiment of the present invention is used to solve the service quality problem of end-to-end data transmission,
Wherein involved logic channel is both comprising control channel, also comprising Traffic Channel.
Technical solution of the embodiment of the present invention is used for transmission the network node, in particular to Wireless MESH of business datum
Slave node in network.In embodiments of the present invention, node receives logic channel, is that finger joint point is received through logic channel biography
Defeated business datum, since each node is all by corresponding logical channel transmission business datum, node receives logic letter
Road, that is, receive the business datum that other nodes are sent by the logic channel.Also, one in Wireless MESH network from
Node can receive or get simultaneously multiple logic channel business.
The information of above-mentioned multiple logic channels, in particular to the information for the logic channel for being used for transmission business datum, including
The type of logic channel, the traffic data type transmitted etc..Also, multiple logic channels can both include the logic received letter
Road can also include the logic channel that itself sends.
Furthermore, it should be pointed out that if the slave node of MESH network receives single logic channel, immediately directly to receive
The logical channel assignment resource arrived, only when receive no less than two logic channels or due to itself send logic
When channel and making needs to distribute the logic channel quantity more than two, i.e. multiple logic channels of resource, be just related to should first to
Which logical channel assignment resource, that is, the problem of being related to ensureing service quality, at this point it is possible to implement proposition of the embodiment of the present invention
Resource allocation methods be need distribute resource multiple logical channel assignment resources.
S102, according to Delay Priority division rule in default absolute priority hierarchical rule and layer, to the multiple
Logic channel is ranked up processing, obtains priority of logical channels queue；
Specifically, in Wireless MESH network, different types of logic channel has different priority, and inhomogeneity
Specific type of service in the logic channel of type has different delay requirements, i.e., with different delay priority requirement.
The embodiment of the present invention is using the type of multiple logic channels obtained as foundation, according to preset absolute priority
Hierarchical rule is drawn to different types of logic channel prioritization level, and according to Delay Priority in preset layer
Divider then, to the logic channel of the specific type of service in each level carries out Delay Priority division, more so as to obtain
A logic channel carries out priority and sorts from high in the end, obtains priority of logical channels queue.
S103, since first logic channel in the priority of logical channels queue, travel through the logic successively
Logic channel in channel priority queue, and be the logical channel assignment resource that traverses, until resource allocation finishes or institute
It states the logic channel in priority of logical channels queue and is traversed and finish.
Specifically, the embodiment of the present invention is to each logic channel in priority of logical channels queue, according to priority by
High to Low order is sequentially allocated resource, and the bgical channel priority for making priority requirement higher obtains resource, so as to ensure that end is arrived
The service quality of end data transmission.
The embodiment of the present invention is followed successively by priority of logical channels queue by the way of priority of logical channels queue is traveled through
In logical channel assignment resource.Specifically, in a TTI, from first logic letter in priority of logical channels queue
Road starts, and travels through logic channel successively, when often traversing a logic channel, as long as also assignable Physical Resource Block, just
For the logical channel assignment physical resource traversed, when all available Physical Resource Block are assigned or logic channel is excellent
Logic channel traversal in first grade queue finishes, then completes this resource allocation process.
The resource allocation methods that the embodiment of the present invention proposes are obtaining the information for the multiple logic channels for needing to distribute resource
Afterwards, according to Delay Priority division rule in default absolute priority hierarchical rule and layer, to the multiple logic channel into
Row sequence is handled, and obtains priority of logical channels queue；Then from first logic in the priority of logical channels queue
Channel starts, and travels through the logic channel in the priority of logical channels queue, and the logical channel assignment to traverse successively
Resource, until resource allocation finish or the priority of logical channels queue in logic channel be traversed and finish.By above-mentioned skill
Art scheme is applied to network node, can distribute resource according to the priority of each communication service, can ensure end-to-end data
The service quality of transmission.
Fig. 2 shows the specific implementation procedure of above-mentioned resource allocation methods.Shown in Figure 2, the embodiment of the present invention discloses
Resource allocation methods specifically include：
S201, acquisition need to distribute the information of multiple logic channels of resource；
Specifically, technical solution of the embodiment of the present invention be used for transmission business datum network node, in particular to
Slave node in Wireless MESH network.In embodiments of the present invention, node receives logic channel (Logical Channel, LC),
It is business datum of the finger joint point reception by logical channel transmission, since each node all passes through corresponding logical channel transmission industry
Business data, therefore, node receives logic channel, that is, receives the business datum that other nodes are sent by the logic channel.
Also, since Wireless MESH network has the characteristics that multi-hop, forwarding, one in Wireless MESH network can be same from node
When receive or get multiple logic channel business.
The information of above-mentioned multiple logic channels, in particular to the information for the logic channel for being used for transmission business datum, including
The type of logic channel, the traffic data type transmitted etc..
S202, according to default absolute priority hierarchical rule, priority level is carried out to multiple logic channels of acquisition
Division is handled, and obtains including one or more logic channel levels of logic channel；
Specifically, for different types of logic channel, the type of service of transmission is different, and the requirement to time delay is just not yet
Together.When a node receives the logic channel of multiple and different types, should first priority be carried out according to logical channel type
Stage layered.
The embodiment of the present invention sets absolute priority hierarchical rule, as shown in table 1：Set Signaling Radio Bearer
The priority of (Signaling Radio Bearers, SRB) type LC identifies (Quality higher than service quality rating
OfService Class Identifier, QCI5) type LC priority, the priority of QCI5 types LC is higher than ensureing bit
The priority of rate (Guaranteed Bit Rate, GBR) type LC, the priority of GBR types LC is higher than non-guaranteed bit speed
The priority of rate Non-GBR types LC.
Table 1
The priority relationship shown in upper table can be represented simply as SRB>QCI5>GBR>Non-GBR.
The type of each LC that identification of the embodiment of the present invention receives, then according to above-mentioned absolute priority hierarchical rule,
Priority level division is carried out to the LC of reception, in each the LC level obtained in division, all comprising at least one LC.
S203, the residual time delay that each logic channel included in each logic channel level is calculated respectively；
Specifically, the residual time delay of above-mentioned logic channel, the node for referring to implement technical solution of the embodiment of the present invention is connecing
At the time of receiving LC, at the time of being transferred to destination node to the LC between duration.
The embodiment of the present invention calculates the residual time delay of LC by equation below：
pdbleft=(pdb-predelay)-nextdelay
In formula, pdbleftFor the residual time delay of LC；It is for the time delay budget of each LC, i.e., total from LC source node to destination node
Time delay budget；Propagation delay time predelay be as each jump is constantly updated, be the cumulative of multi-hop time delay and, for forwarding
LC is the propagation delay time from source node to this node, is the wait time delay to scheduling instance for new biography LC；nextdelay
The Time-delay Prediction value of destination node is reached for this node.
Wherein, the predictor method of nextdelay is specifically and carries out estimating calculating according to equation below：
Nextdelay=hopleft*Singledelay
Wherein, hopeleft is to look into the hop count that this node that routing table obtains arrives destination node；Singledelay is to estimate
Each jump time delay, meanwhile, needed in above-mentioned calculating process consider on the basis of Frame frames duration (20ms) plus one
Reserved duration a bit.
According to above-mentioned computational methods, it can be calculated and implement the surplus of each LC that the node of the embodiment of the present invention receives
Remaining time delay.
The residual time delay of S204, each logic channel in each logic channel level are each logic channel layer
Each logic channel setting priority in grade, wherein, the residual time delay of logic channel is smaller, then the priority of logic channel is got over
It is high；
Specifically, for a LC, the pdb that is calculatedleftIt is worth smaller, illustrates that the delay requirement of the LC is tighter
Anxious, Delay Priority is also higher；If the on the contrary, pdb of LCleftValue is bigger, illustrates the delay requirement relative loose of the LC, when
It is also lower to prolong priority.
According to above-mentioned rule, the embodiment of the present invention is set excellent according to the residual time delay of each LC received for each LC
First grade.
The example that the priority being given below in logic channel level calculates：
Fig. 3 gives the Wireless MESH network linear topology figure for including 5 nodes, it is assumed that source node 1 and destination node 4 it
Between have GBRLC1 data transmissions, then LC 1 needs the forwarding by intermediate node 2,3, and when being forwarded to node 3, node 3 has simultaneously
New biography data GBRLC2, is transmitted to destination node 5.If the pdb of LC 1 and LC2 is respectively 150ms and 100ms, LC1 to node 3
Predelay for 60ms, it is 35ms that LC2 to scheduling instance, which has waited time delay, and singledelay takes Frame frame lengths herein
(20ms)+reserved time delay (10ms)=30ms, then
LC1：Hopleft=1, nextdelay=1*30ms=30ms, pdbleft=(150-60) -30=60ms
LC2：Hopleft=2, nextdelay=2*30ms=60ms, pdbleft=(100-35) -60=5ms
It can be obtained by more than result of calculation, in GBR layers, the priority of LC 2>The priority of LC 1.
S205, the order according to priority from high to low, to each logic channel in above-mentioned each logic channel level
It is ranked up processing；
Specifically, using the priority of each LC as foundation, each LC in each logic channel level is subjected to priority
By the higher LC sequences of priority preceding, the relatively low LC of priority is sorted rear for sequence.
If it should be noted that there are the identical LC of priority in each LC in above-mentioned each logic channel level,
The ratio of the identical logic channel of each priority is then determined according to Proportional Fair (Proportional Fair, PF) algorithm
Example equity dispatching priority；
Above-mentioned PF algorithms are the tune of the factors such as a kind of consideration channel quality of use of the embodiment of the present invention, historical throughput
Algorithm is spent, for distinguishing the priority of the equal LC of each residual time delay again.In fact, it is arbitrary it can be considered that channel quality,
The dispatching algorithm of the factors such as historical throughput may serve to distinguish the priority of the equal LC of each residual time delay.
The computational methods of PF algorithm dispatching weights are as follows：
Wherein, α is channel quality Dynamic gene, and the value of α is smaller, illustrates that influence of the channel quality to priority is smaller, instead
It is bigger；β is the Dynamic gene for authorizing throughput, and β value is smaller, illustrates that the throughput of history mandate is smaller to priority-sensitive,
It is otherwise bigger., acquiescence value α=β=1.
Assuming that the rate newer cycle is, in above formula：
For dispatching priority weights of j-th of LC within i-th of right value update cycle, bigger, dispatching priority weights are got over
It is high；
For momentary rates of j-th of LC within i-th of right value update cycle, parameter reflection is the current channel of node
Quality can be belonged to from the broadband CQI of node using the LC and is calculated.
For Mean Speeds of j-th of LC (i-1)-th right value update cycle, which only updates in both cases：1)
It is updated after carrying scheduling；2) the priority update cycle of carrying comes interim.The mode of specific usable forgetting factor filtering carries out
Update, calculation formula are：
It is weighting parameter in above formula, the most long time correlation for failing service that the value of the parameter can be born with node, more
Greatly, show that the non-service time that node can be born is longer.
After the ratio dispatching priority weights to each LC are calculated, proportionally equity dispatching priority is from high to low
Sequentially, the logic channel identical to each priority is ranked up processing, you can realize by the identical LC of residual time delay into
Row major grade is distinguished.
The priority of S206, logically channel level from high to low and in logic channel level logic channel when
Prolong the order of priority from high to low, processing is ranked up to the multiple logic channel, obtains priority of logical channels queue；
Specifically, by each LC in each logic channel level respectively according to above-mentioned steps S202~S205 order into
Row sequence, while each logic channel level is sorted successively according to the order of priority from high to low, you can realizing will be all
The LC received carries out priority ranking, and the queue arranged by all LC received finally obtained forms LC priority
Queue.
Wherein, it is necessary to illustrate, when node performs above-mentioned technical proposal, if network topology is changed,
Next changed LC of destination node wouldn't participate in epicycle scheduling, and changed node can be reported actively certainly to host node
Oneself neighboring BS relationship waits at least 20ms, and host node can re-broadcast the neighborhood and topological structure of the whole network, and current business is held
Routing update is carried, after treating that new bearing link is built up, the LC after routing update is added in into urgent queue.At this moment, queue is excellent
First grade is：Urgent queue>Common queue.LC in urgent queue is still according to SRB>QCI5>GBR>Non-GBR carries out layering row
Sequence is recalculated in each layer, and the value of the singledelay of the LC in urgent queue is more than the LC's in common queue
The value of singledelay, for example, it can be set to the value of the singledelay of LC in urgent queue is 20ms, common team
The value of the singledelay of LC in row is 30ms.If LC's, abandon the LC；If LC's, smaller LC in every layer,
Priority is higher.
S207, since first logic channel in above-mentioned priority of logical channels queue, travel through successively the logic letter
Logic channel in road priority query when often traversing a logic channel, performs step S208, according to what is traversed successively
The source node of logic channel, whether the number of nodes for judging current scheduling is more than default number of nodes threshold value；
Specifically, the number of nodes that a node can be dispatched in a TTI is conditional.Assuming that Wireless MESH network
Slave node in a TTI N number of scheduling node distribution resource can at most be given to send data, then whenever from node traverses to one
During a LC, the source node of the LC is identified, if scheduled number of nodes is not above N, resource is distributed to the LC.
If the number of nodes of current scheduling is no more than default number of nodes threshold value, performs step S209, traverse
Logical channel assignment resource；
If the number of nodes of current scheduling be more than default number of nodes threshold value, perform step S210, continue to travel through it is next
A logic channel, and return perform step S208, until all available Physical Resource Block be allocated finish or above-mentioned logic letter
Logic channel in road priority query, which is traversed, to be finished.
If specifically, when traversing some LC, the source node of the LC is not yet scheduled, and scheduled number of nodes
It is N number of enough, then resource is not distributed for the LC, continue to dispatch next LC, and verify whether the source node of the LC of traversal is full
Sufficient above-mentioned requirements；If traverse some LC, although scheduled number of nodes enough N, the source node of the LC
It is some in scheduled node, then distributes resource for the LC.Until all physical source distributings finish or logic
LC in channel priority queue is traversed when finishing, and terminates this resource allocation.
The method of salary distribution of each LC resource is as follows：
SRB and QCI5 is distributed according to greedy mode；
GBR is distributed according to token and buffer buffer memories, takes the two smaller value；
Non-GBR is distributed according to token and buffer buffer memories, takes the two smaller value；
In resource allocation process, if Physical Resource Block (Physical Resource Block, PRB) has divided, then it is assumed that money
Source distribution terminates；If still there are PRB and LC priority queries still to have next LC, continue to travel through next LC.
In the LC in traveling through above-mentioned priority of logical channels queue and while distribute resource for qualified LC,
The embodiment of the present invention also performs step S211, the information for the logic channel for having distributed resource is sequentially added scheduled logic channel
Queue；
Specifically, whenever traverse a LC and for its distribute resource after, which is added to by the embodiment of the present invention
Dispatch LC queues in, and join the team order with traversal LC and distribute resource sequencing it is identical.
When all LC traversals in above-mentioned priority of logical channels queue are finished, if also Physical Resource Block is not yet
Distribution, then perform step S212, the order according to priority from high to low, successively in the scheduled logical channel queue
Logic channel carries out Greedy resource allocation.
Specifically, all logic channels in above-mentioned priority of logical channels queue has been traveled through and be logical channel assignment
After resource, a scheduled logical channel queue is obtained.If at this point, there is still unappropriated PRB, according to priority by height
To low order, the LC being followed successively by scheduled logical channel queue carries out Greedy resource allocation, until all PRB are distributed
It finishes.
Fig. 4 is a kind of structure diagram of resource allocation device disclosed by the embodiments of the present invention, shown in Figure 4, the dress
Put including：
Information acquisition unit 100, for obtaining the information for the multiple logic channels for needing to distribute resource；
Sort processing unit 110, for being divided according to Delay Priority in default absolute priority hierarchical rule and layer
Rule is ranked up processing to the multiple logic channel, obtains priority of logical channels queue；
Resource allocation unit 120, for since first logic channel in the priority of logical channels queue, according to
Logic channel in the secondary traversal priority of logical channels queue, and the logical channel assignment resource to traverse, Zhi Daozi
Source be assigned or the priority of logical channels queue in logic channel be traversed and finish.
Wherein, sort processing unit 110, including：
Level division unit 111, for according to default absolute priority hierarchical rule, to the multiple logic channel into
The division of row major grade level is handled, and obtains including one or more logic channel levels of logic channel；
Layer internal sort unit 112, for according to Delay Priority division rule in default layer, to each logic channel layer
The logic channel included in grade carries out Delay Priority sequence processing；
Integrated ordered unit 113, for logically channel level priority from high to low and logic channel level
The order of the Delay Priority of interior logic channel from high to low is ranked up processing to the multiple logic channel, obtains logic
Channel priority queue.
Wherein, layer internal sort unit 112 is according to Delay Priority division rule in default layer, in logic channel level
Comprising logic channel carry out Delay Priority sequence processing when, be specifically used for：
The residual time delay of each logic channel included in logic channel level is calculated respectively；
According to the residual time delay of each logic channel, priority is set for each logic channel, wherein, logic
The residual time delay of channel is smaller, then the priority of logic channel is higher；
According to the order of priority from high to low, processing is ranked up to each logic channel.
Layer internal sort unit 112 is ranked up each logic channel in the order according to priority from high to low
During processing, it is additionally operable to：
If there are the identical logic channel of priority in each logic channel, according to proportional fair scheduling
Determine the Proportional Fair priority of the identical logic channel of each priority；
The proportionally order of equity dispatching priority from high to low, the logic channel identical to each priority into
Row sequence is handled.
Specifically, the specific works content of the unit of above-mentioned resource allocation device, refers to above method embodiment
Content, details are not described herein again.
Fig. 5 is the structure diagram of another resource allocation device disclosed by the embodiments of the present invention, shown in Figure 5, should
Device includes：
Memory 501 and processor 502；
Wherein, memory 501 is connected with processor 502, for storing the data generated in program and program operation process；
Processor 502 for passing through the program run and stored in the processor 501, realizes following functions：
Obtain the information for the multiple logic channels for needing to distribute resource；
According to Delay Priority division rule in default absolute priority hierarchical rule and layer, the multiple logic is believed
Road is ranked up processing, obtains priority of logical channels queue；
Since first logic channel in the priority of logical channels queue, it is excellent that the logic channel is traveled through successively
Logic channel in first grade queue, and be the logical channel assignment resource that traverses, until resource allocation finishes or the logic
Logic channel in channel priority queue, which is traversed, to be finished.
Wherein, processor 502 travels through successively since first logic channel in the priority of logical channels queue
Logic channel in the priority of logical channels queue, and for traverse logical channel assignment resource when, be specifically used for：
Since first logic channel in the priority of logical channels queue, it is excellent that the logic channel is traveled through successively
Logic channel in first grade queue when often traversing a logic channel, performs following operation：
According to the source node of the logic channel traversed, whether the number of nodes for judging current scheduling is more than default number of nodes
Threshold value；
If the number of nodes of current scheduling is no more than default number of nodes threshold value, for the logical channel assignment money traversed
Source；
If the number of nodes of current scheduling is more than default number of nodes threshold value, continue to travel through next logic channel.
Wherein, processor 502 is additionally operable to：
The information for the logic channel for having distributed resource is sequentially added into scheduled logical channel queue；
When the logic channel in the priority of logical channels queue, which is traversed, to be finished, if also Physical Resource Block is still
It is unallocated, then the order according to priority from high to low, successively to the logic channel in the scheduled logical channel queue into
Row Greedy resource allocation.
Specifically, the specific works content of each several part of above-mentioned resource allocation device, refers to above method embodiment
Content, details are not described herein again.
The foregoing description of the disclosed embodiments enables professional and technical personnel in the field to realize or use the present invention.
A variety of modifications of these embodiments will be apparent for those skilled in the art, it is as defined herein
General Principle can be realized in other embodiments without departing from the spirit or scope of the present invention.Therefore, it is of the invention
The embodiments shown herein is not intended to be limited to, and is to fit to and the principles and novel features disclosed herein phase one
The most wide scope caused.
Claims (13)
1. a kind of resource allocation methods, which is characterized in that including：
Obtain the information for the multiple logic channels for needing to distribute resource；
According to Delay Priority division rule in default absolute priority hierarchical rule and layer, to the multiple logic channel into
Row sequence is handled, and obtains priority of logical channels queue；
Since first logic channel in the priority of logical channels queue, the priority of logical channels is traveled through successively
Logic channel in queue, and be the logical channel assignment resource that traverses, until resource allocation finishes or the logic channel
Logic channel in priority query, which is traversed, to be finished.
It is 2. according to the method described in claim 1, it is characterized in that, described according to default absolute priority hierarchical rule and layer
Interior Delay Priority division rule is ranked up processing to the multiple logic channel, obtains priority of logical channels queue, bag
It includes：
According to default absolute priority hierarchical rule, priority level division processing is carried out to the multiple logic channel, is obtained
To one or more logic channel levels comprising logic channel；
According to Delay Priority division rule in default layer, when being carried out to the logic channel included in each logic channel level
Prolong priority ranking processing；
Logically the Delay Priority of the priority of channel level logic channel from high to low and in logic channel level by
High to Low order is ranked up processing to the multiple logic channel, obtains priority of logical channels queue.
It is 3. right according to the method described in claim 2, it is characterized in that, according to Delay Priority division rule in default layer
The logic channel included in logic channel level carries out Delay Priority sequence processing, including：
The residual time delay of each logic channel included in logic channel level is calculated respectively；
According to the residual time delay of each logic channel, priority is set for each logic channel, wherein, logic channel
Residual time delay it is smaller, then the priority of logic channel is higher；
According to the order of priority from high to low, processing is ranked up to each logic channel.
4. according to the method described in claim 3, it is characterized in that, in the order according to priority from high to low, to described each
When a logic channel is ranked up processing, this method further includes：
If it is determined in each logic channel there are the identical logic channel of priority according to proportional fair scheduling
The Proportional Fair priority of the identical logic channel of each priority；
The proportionally order of equity dispatching priority from high to low, the logic channel identical to each priority are arranged
Sequence processing.
5. according to the method described in claim 1, it is characterized in that, it is described from the priority of logical channels queue first
A logic channel starts, and travels through the logic channel in the priority of logical channels queue, and the logic letter to traverse successively
Road distributes resource, including：
Since first logic channel in the priority of logical channels queue, the priority of logical channels is traveled through successively
Logic channel in queue when often traversing a logic channel, performs following operation：
According to the source node of the logic channel traversed, whether the number of nodes for judging current scheduling is more than default number of nodes threshold
Value；
If the number of nodes of current scheduling is no more than default number of nodes threshold value, for the logical channel assignment resource traversed；
If the number of nodes of current scheduling is more than default number of nodes threshold value, continue to travel through next logic channel.
6. according to the method described in claim 5, it is characterized in that, this method further includes：
The information for the logic channel for having distributed resource is sequentially added into scheduled logical channel queue；
When the logic channel in the priority of logical channels queue, which is traversed, to be finished, if also Physical Resource Block not yet divides
Match somebody with somebody, then the order according to priority from high to low, the logic channel in the scheduled logical channel queue is coveted successively
Greedy formula resource allocation.
7. a kind of resource allocation device, which is characterized in that including：
Information acquisition unit, for obtaining the information for the multiple logic channels for needing to distribute resource；
Sort processing unit, right for according to Delay Priority division rule in default absolute priority hierarchical rule and layer
The multiple logic channel is ranked up processing, obtains priority of logical channels queue；
Resource allocation unit, for since first logic channel in the priority of logical channels queue, traveling through successively
Logic channel in the priority of logical channels queue, and the logical channel assignment resource to traverse, until resource allocation
Finish or the priority of logical channels queue in logic channel be traversed and finish.
8. device according to claim 7, which is characterized in that the sequence processing unit, including：
Level division unit, for according to default absolute priority hierarchical rule, to the multiple logic channel into row major
The division processing of grade level obtains including one or more logic channel levels of logic channel；
Layer internal sort unit, for according to Delay Priority division rule in default layer, to being wrapped in each logic channel level
The logic channel contained carries out Delay Priority sequence processing；
Integrated ordered unit, for priority logic from high to low and in logic channel level of logically channel level
The order of the Delay Priority of channel from high to low is ranked up processing to the multiple logic channel, it is excellent to obtain logic channel
First grade queue.
9. device according to claim 8, which is characterized in that the layer internal sort unit is excellent according to time delay in default layer
First grade division rule when Delay Priority sequence processing is carried out to the logic channel included in logic channel level, is specifically used for：
The residual time delay of each logic channel included in logic channel level is calculated respectively；
According to the residual time delay of each logic channel, priority is set for each logic channel, wherein, logic channel
Residual time delay it is smaller, then the priority of logic channel is higher；
According to the order of priority from high to low, processing is ranked up to each logic channel.
10. device according to claim 9, which is characterized in that the layer internal sort unit according to priority by height to
Low order when being ranked up processing to each logic channel, is additionally operable to：
If it is determined in each logic channel there are the identical logic channel of priority according to proportional fair scheduling
The Proportional Fair priority of the identical logic channel of each priority；
The proportionally order of equity dispatching priority from high to low, the logic channel identical to each priority are arranged
Sequence processing.
11. a kind of resource allocation device, which is characterized in that including：
Memory and processor；
Wherein, the memory is connected to the processor, for storing the data generated in program and program operation process；
The processor for passing through the program run and stored in the processor, realizes following functions：
Obtain the information for the multiple logic channels for needing to distribute resource；
According to Delay Priority division rule in default absolute priority hierarchical rule and layer, to the multiple logic channel into
Row sequence is handled, and obtains priority of logical channels queue；
Since first logic channel in the priority of logical channels queue, the priority of logical channels is traveled through successively
Logic channel in queue, and be the logical channel assignment resource that traverses, until resource allocation finishes or the logic channel
Logic channel in priority query, which is traversed, to be finished.
12. according to the devices described in claim 11, which is characterized in that the processor is from the priority of logical channels queue
In first logic channel start, travel through the logic channel in the priority of logical channels queue successively, and to traverse
Logical channel assignment resource when, be specifically used for：
Since first logic channel in the priority of logical channels queue, the priority of logical channels is traveled through successively
Logic channel in queue when often traversing a logic channel, performs following operation：
According to the source node of the logic channel traversed, whether the number of nodes for judging current scheduling is more than default number of nodes threshold
Value；
If the number of nodes of current scheduling is no more than default number of nodes threshold value, for the logical channel assignment resource traversed；
If the number of nodes of current scheduling is more than default number of nodes threshold value, continue to travel through next logic channel.
13. device according to claim 12, which is characterized in that the upper processor is additionally operable to：
The information for the logic channel for having distributed resource is sequentially added into scheduled logical channel queue；
When the logic channel in the priority of logical channels queue, which is traversed, to be finished, if also Physical Resource Block not yet divides
Match somebody with somebody, then the order according to priority from high to low, the logic channel in the scheduled logical channel queue is coveted successively
Greedy formula resource allocation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711366340.6A CN108093485B (en) | 2017-12-18 | 2017-12-18 | Resource allocation method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711366340.6A CN108093485B (en) | 2017-12-18 | 2017-12-18 | Resource allocation method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108093485A true CN108093485A (en) | 2018-05-29 |
| CN108093485B CN108093485B (en) | 2020-10-27 |
Family
ID=62177015
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711366340.6A Active CN108093485B (en) | 2017-12-18 | 2017-12-18 | Resource allocation method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108093485B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109152061A (en) * | 2018-09-28 | 2019-01-04 | 彩讯科技股份有限公司 | Channel agility method, apparatus, server and storage medium |
| CN110624192A (en) * | 2019-07-15 | 2019-12-31 | 国网浙江省电力有限公司嘉兴供电公司 | Fire extinguishing control method based on combustible classification and adopting multi-nozzle cooperative operation |
| WO2020034717A1 (en) * | 2018-08-16 | 2020-02-20 | 电信科学技术研究院有限公司 | Resource allocation method and device |
| CN111404831A (en) * | 2020-03-19 | 2020-07-10 | 重庆富民银行股份有限公司 | Method and system for improving processing performance of wind control system |
| CN111428973A (en) * | 2020-03-11 | 2020-07-17 | 慧镕电子系统工程股份有限公司 | Virtual resource allocation method capable of effectively improving resource utilization rate |
| CN114172850A (en) * | 2021-12-03 | 2022-03-11 | 中国电信集团系统集成有限责任公司 | Network channel scheduling method and device |
| CN115564204A (en) * | 2022-09-26 | 2023-01-03 | 爱彼希科技(北京)有限公司 | Parallel processing method for demand resource allocation in supply chain |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103857050A (en) * | 2012-12-07 | 2014-06-11 | 普天信息技术研究院有限公司 | Method for scheduling resources in TD-LTE trunking communication system |
| CN104066193A (en) * | 2014-06-06 | 2014-09-24 | 电信科学技术研究院 | Scheduling method and device |
| US20160345296A1 (en) * | 2013-01-14 | 2016-11-24 | Qualcomm Incorporated | Broadcast and system information for machine type communication |
| CN107302503A (en) * | 2016-04-15 | 2017-10-27 | 展讯通信（上海）有限公司 | A kind of data transmission method for uplink and device |
-
2017
- 2017-12-18 CN CN201711366340.6A patent/CN108093485B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103857050A (en) * | 2012-12-07 | 2014-06-11 | 普天信息技术研究院有限公司 | Method for scheduling resources in TD-LTE trunking communication system |
| US20160345296A1 (en) * | 2013-01-14 | 2016-11-24 | Qualcomm Incorporated | Broadcast and system information for machine type communication |
| CN104066193A (en) * | 2014-06-06 | 2014-09-24 | 电信科学技术研究院 | Scheduling method and device |
| CN107302503A (en) * | 2016-04-15 | 2017-10-27 | 展讯通信（上海）有限公司 | A kind of data transmission method for uplink and device |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020034717A1 (en) * | 2018-08-16 | 2020-02-20 | 电信科学技术研究院有限公司 | Resource allocation method and device |
| CN109152061A (en) * | 2018-09-28 | 2019-01-04 | 彩讯科技股份有限公司 | Channel agility method, apparatus, server and storage medium |
| CN109152061B (en) * | 2018-09-28 | 2023-05-02 | 彩讯科技股份有限公司 | Channel allocation method, device, server and storage medium |
| CN110624192A (en) * | 2019-07-15 | 2019-12-31 | 国网浙江省电力有限公司嘉兴供电公司 | Fire extinguishing control method based on combustible classification and adopting multi-nozzle cooperative operation |
| CN111428973A (en) * | 2020-03-11 | 2020-07-17 | 慧镕电子系统工程股份有限公司 | Virtual resource allocation method capable of effectively improving resource utilization rate |
| CN111428973B (en) * | 2020-03-11 | 2024-04-12 | 慧镕电子系统工程股份有限公司 | Virtual resource allocation method capable of effectively improving resource utilization rate |
| CN111404831A (en) * | 2020-03-19 | 2020-07-10 | 重庆富民银行股份有限公司 | Method and system for improving processing performance of wind control system |
| CN114172850A (en) * | 2021-12-03 | 2022-03-11 | 中国电信集团系统集成有限责任公司 | Network channel scheduling method and device |
| CN115564204A (en) * | 2022-09-26 | 2023-01-03 | 爱彼希科技(北京)有限公司 | Parallel processing method for demand resource allocation in supply chain |
| CN115564204B (en) * | 2022-09-26 | 2023-04-18 | 爱彼希科技(北京)有限公司 | Parallel processing method for demand resource allocation in supply chain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108093485B (en) | 2020-10-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108093485A (en) | A kind of resource allocation methods and device | |
| CN104301933B (en) | A kind of method for being used for computation bandwidth and distribution bandwidth in wireless self-networking | |
| US8451862B2 (en) | Systems and methods for resource allocation serving communication requirements and fairness | |
| US8284715B2 (en) | Method and apparatus for network wide adaptive resource allocation for OFDMA/TDMA networks | |
| JP5038530B2 (en) | System and method for assigning communication cells to servers in a cellular communication system | |
| CN103781120B (en) | Mobility load balancing method combined with hierarchical dynamic resource distribution | |
| CN106879071A (en) | Wireless Mesh netword low time delay optimization method based on dynamic time slot allocation | |
| CN105813218B (en) | The business scheduling method of wireless self-organization network | |
| US10469395B2 (en) | Packet transmission credit allocation | |
| JP2014187421A (en) | Communication device and packet scheduling method | |
| Li et al. | Application-driven virtual network embedding for industrial wireless sensor networks | |
| US11929911B2 (en) | Shaping outgoing traffic of network packets in a network management system | |
| CN103327542B (en) | A kind of QoS support method and device that is applied to MANET network | |
| Chen et al. | Exploiting spectral reuse in routing, resource allocation, and scheduling for IEEE 802.16 mesh networks | |
| CN1565143A (en) | Distributed transmission of traffic flows in communication networks | |
| CN114449589A (en) | Time slot resource reservation system and method | |
| US20150016409A1 (en) | System and method for communication resource allocation | |
| CN113094857A (en) | Energy-saving controller layout method for software defined vehicle network | |
| CN102694724A (en) | Method for distributing routing wavelength of intelligent optical network supporting differentiated services | |
| CN103139780B (en) | inter-cell interference coordination method and device | |
| CN105704756A (en) | Multirate wireless Mesh network routing metric and channel distribution combination method | |
| CN102413570B (en) | Base station in a kind of wireless communication system and resource regulating method | |
| CN104243263B (en) | A kind of on-line mixing mapping method of virtual network | |
| Kao et al. | Auction-based bandwidth allocation in multi-hop wireless ad hoc networks | |
| Kao et al. | Multi-hop auction-based bandwidth allocation in wireless ad hoc networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |