CN100479421C - User apparatus and method for carrying out resource scheduling in wireless network - Google Patents
User apparatus and method for carrying out resource scheduling in wireless network Download PDFInfo
- Publication number
- CN100479421C CN100479421C CNB2004100668851A CN200410066885A CN100479421C CN 100479421 C CN100479421 C CN 100479421C CN B2004100668851 A CNB2004100668851 A CN B2004100668851A CN 200410066885 A CN200410066885 A CN 200410066885A CN 100479421 C CN100479421 C CN 100479421C
- Authority
- CN
- China
- Prior art keywords
- user
- business
- logic channel
- buffer
- dispatching cycle
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention provides a method for improving the resource dispatching of ascending chain circuit and relative in the user device of wireless network. It is characterized in that: the invention combines the information of delay memory and the time delay Qos information of service to express the resource demand and distribute the resource for each logical channel or service for reaching the better utilization of resource and avoiding the phenomenon of hungry to dead.
Description
Technical field
The present invention relates to wireless communication field, relate in particular to the user's set and the method for in wireless network, carrying out scheduling of resource.
Background technology
In wireless network, user's set (UE) when sending data, need distribute certain bandwidth resources to base station (Node B) request at every turn.Because bandwidth resources are limited in the wireless network, the corresponding bandwidth resource must be distributed according to the real needs of user's set in the base station, thereby reaches the resources effective utilization.
At prior art [1] (T R2-041346, " TFC of guaranteed qos selects " LG Electronics, Inc.) in HSUPA, mentions, in HSUPA, wish to support professional such as stream, interaction service, background business etc. pass through to use the R99TFC selection algorithm in interior Packet data service in the transmission on the E-DCH in HSUPA, some may be occupied by the business transaction of other higher priority owing to limited resources the business of delay sensitive, and in a very long time, can't carry out transfer of data, and finally be dropped---be called " hungry to death phenomenon ", priority of logical channels carries out because the R99TFC in user's set selects to be based on.In the prior art [1], also advise in TFC selects, considering minimum Qos characteristic, for example minimal bit rate, guarantee bit rate, propagation delay time etc., but it does not provide a complete exact algorithm, and only is that some simple descriptions are introduced.
In addition, as a solution, at prior art [2] (R2-041010, " EUL QoS framework ", Qyakcomm) and [3] (R2-040917, " the multiplexing and transport channel structures of E-DCH ", Ericsson) logic channel that suggestion allows to have different priorities in is multiplexed among the single E-DCH.Yet, only allow that priority is multiplexing can not avoid " dying of hunger " phenomenon fully.Its reason is that the selection of TFC remains on the logic-based channel priority basis, therefore can not avoid above-mentioned " dying of hunger " phenomenon fully.
In addition, (MMCE) 3 new parameters of well-defined MLP definition are introduced in middle suggestion for R2-041393, " logic channel of HSUPA " is died of hunger " and TFC selects " in prior art [4], accurately express the demand of different application in the mode of speed, this helps avoid " dying of hunger " phenomenon.But they have only provided the vague definition of these three new arguments, do not provide how to determine this three parameters.
For Packet Service, limited time delay is a most important Qos information, but does not all have in the prior art about how using the exact algorithm of this limited time delay Qos information.In addition, in above-mentioned prior art, all there is not to propose how to avoid the concrete solution of " dying of hunger " phenomenon in logic channel aspect and service layer.
The present invention has advised a kind of scheme of avoiding " dying of hunger " phenomenon in the scheduling of resource of user's set based on time delay Qos information, and can more effectively utilize Limited resources.Below, Qos information is refered in particular to a kind of limited time delay of business.
Summary of the invention
In the prior art, user's set is only with the information of its buffer (also promptly wherein institute's stored packet data volume) informing base station, the bandwidth resources that the base station decides user's set to take according to the buffer information that is received are so that all groupings in described buffer can be transmitted in next uplink transmission cycle.The paroxysmal characteristics that this does not consider Packet data service must reduce the utilization ratio to limited resources.
The present invention recognizes with regard to Packet data service how many resources a logic channel can take is in order to guarantee professional Qos.And for Packet data service, a kind of most important Qos information is time delay.Because Packet data service is sudden, packet data package will arrive in the different moment, and can allow different time delays in the grouping that difference arrives constantly.Like this, do not have necessity all packets in the transmission buffer device in next transmission cycle (or dispatching cycle).Based on this understanding, the present invention proposes a kind of technical scheme of coming to express resource requirement based on the Qos information of business to the base station, and in user's set by based on the reasonable resource sharing policy of Qos time delay information, so that on the logic channel aspect of user's set or service layer, avoid the phenomenon of " dying of hunger ", improve systematic function.By buffer information and professional Qos information (time delay) are combined to the needs of Node B (base station) expression user's set to Radio Resource, can more effectively utilize limited bandwidth resources like this.Obtain the resource authorization of Node B at user's set after, the resource-sharing strategy by based on Qos time delay information so that business as much as possible can obtain the chance of transfer of data, improves systematic function.
According to a first aspect of the invention, provide a kind of in the user's set of wireless network, be used on enhanced uplink, carrying out the method for scheduling of resource, wherein, described wireless network comprises base station and a plurality of user's set, described user's set comprises a buffer, it is used to store the data that will send, and described user's set has a plurality of ongoing business and logic channel, each logic channel belongs to a kind of business with different Q os, and this method may further comprise the steps: described user's set is determined each logic channel required minimum transmission rate in next dispatching cycle according to the information of described buffer and with the Qos information of described business; After receiving the Radio Resource mandate that comes from described base station, described user's set is according to determined each logic channel required minimum transmission rate in next dispatching cycle, to each logical channel assignment corresponding radio resource.
According to a second aspect of the invention, provide a kind of in wireless network, be used for carrying out the user's set of scheduling of resource in enhanced uplink, wherein, described wireless network comprises base station and a plurality of user's set, described user's set comprises a buffer, it is used to store the data that will send, and described user's set has a plurality of ongoing business and logic channel, each logic channel belongs to a kind of business with different Q os, it is characterized in that, this user's set also comprises: a calculation element is used for calculating each logic channel required minimum transmission rate in next dispatching cycle according to the information of described buffer and with the Qos information of described business; With a control device, after receiving the Radio Resource mandate that comes from described base station, be used for according to the minimum transmission rate of determined each logic channel in next dispatching cycle, to each logical channel assignment corresponding radio resource.
According to a third aspect of the invention we, also provide a kind of in the user's set of wireless network, be used on enhanced uplink, carrying out the method for scheduling of resource, wherein, described wireless network comprises base station and a plurality of user's set, described user's set comprises a buffer, it is used to store the data that will send, and described user's set has a plurality of ongoing business and logic channel, and this method may further comprise the steps: described user's set is determined each business required minimum transmission rate in next dispatching cycle according to the information of described buffer and with the Qos information of described business; After receiving the Radio Resource mandate that comes from described base station, described user's set is according to determined each business required minimum transmission rate in next dispatching cycle, to each traffic assignments corresponding radio resource.
According to a forth aspect of the invention, also provide a kind of in wireless network, be used on enhanced uplink, carrying out the user's set of scheduling of resource, wherein, described wireless network comprises base station and a plurality of user's set, described user's set comprises a buffer, it is used to store the data that will send, and described user's set has a plurality of ongoing business and logic channel, it is characterized in that, this user's set also comprises: a calculation element is used for calculating each business required minimum transmission rate in next dispatching cycle according to the information of described buffer and with the Qos information of described business; With a control device, after receiving the Radio Resource mandate that comes from described base station, be used for according to the minimum transmission rate of determined each business in next dispatching cycle, to each traffic assignments corresponding radio resource.
Unlike the prior art, not only adopt the information of buffer in the user's set among the present invention, also come to be summed to each logic channel or traffic assignments resource to the need that express resource the base station in conjunction with professional Qos information, can represent accurate demand so more accurately to resource, and can avoid phenomenon-limited resources hungry to death by logic channels or professional shared such as higher priority effectively in logic channel aspect or service layer, make some logic channels or professional can't transmit data, cause data overtime and the machine that is sent out abandons owing to can not get resource for a long time.
Description of drawings
Fig. 1 is according to the topological diagrams such as wireless network that are used for scheduling of resource of the present invention;
Fig. 2 carries out the flow chart of the method for scheduling of resource in the logic channel aspect for user's set according to a preferred embodiment of the present invention;
Fig. 3 carries out the flow chart of the method for scheduling of resource in service layer for user's set according to a preferred embodiment of the present invention;
Fig. 4 is the block diagram according to user's set of the present invention;
Embodiment
Below with reference to accompanying drawing, and in conjunction with specific embodiments the present invention is described in detail.Should be appreciated that the present invention is not limited to specific embodiment.
Fig. 1 is according to a wireless network schematic diagram of the present invention, and this wireless network 1 comprises base station 2 and a plurality of user's set (for simplicity, only demonstrating two user's sets 3 and user's set 4 among the figure).In wireless network 1, user's set 3 and 4 need send resource request information to base station (Node B) 3, to require to distribute certain bandwidth resources.
At first, we discuss the resource scheduling scheme of the logic channel aspect based on user's set of the present invention with one of them user's set 3, also promptly how at user's set 3 places, distribute limited resources at the Different Logic interchannel.
Suppose that at first a logic channel is corresponding to the business with different Q OS.How many resources a logic channel can take is in order to guarantee professional Qos.For Packet data service, a kind of most important Qos information is time delay information.Because the bursty nature of Packet data service, packet data package will arrive user's set at different time.According to time delay, can allow different time delays in the packet data package that difference arrives constantly.Consider this idea, we redefine three new arguments:
TW: dispatching cycle, occupied therebetween resource remains unchanged.
MinR: be to guarantee professional Qos information (time delay information), the minimum transmission rate that user's set is required; Its unit is Bits/TW.
MaxR: peak transfer rate.MaxR is that user's set can be in all transmission of Information speed in buffer of next one transmission logic channel in dispatching cycle.But only be assigned to all logic channels at MinR, this rate requirement just is considered.
Therefore, we say that above-mentioned three parameters of a logic channel are relevant with this professional Qos information (time delay), and should dynamically be calculated as follows in the TW in different dispatching cycles:
TW: the multiple that is transmission time periods TTI.Node B 2 will decide this parameter according to its report of load condition, surplus resources situation and UE, then this parameter be sent to the UE that is scheduled.This can be at Su Shuai ﹠amp; " time " of using in the time scheduling scheme.If TW=1 this means that the speed of logic channel can be dispatched in each TTI.
About latter two parameter, for general and for simplicity, we suppose that user's set 3 has m ongoing logic channel, each channel belong to a kind of business with different Q os we, suppose P
iIndividual grouping is stored in the buffer, and for each grouping, we have following parameter,
A.t
b, be position (or byte) number of b grouping;
B.TO
b, for, according to the Qos information (time delay) of business, b grouping still can be stored in the time (number of TTI) in the buffer
Here, and b ∈ [1, P
i], i ∈ [1, m].
Like this, we know, in order to guarantee professional time delay Qos, the affairs amount that UE must transmit in next transmission time periods TTI (or dispatching cycle TW) is as follows:
Here, 0≤β
i＜1 is a factor, and it is relevant with i priority of logical channels and service priority, and this factor can be determined by emulation.Work as β
i=0 o'clock, this means and when carrying out resource request, do not consider priority of logical channels.
Like this, i the needed minimum transmission rate of logic channel of user's set 3 is:
We can see, except priority of logical channels and service priority, and MinR
i lMade up buffer information (l
b) and professional time delay information (TO
b), these information are the resource requirement of presentation logic channel accurately.Therefore, utilize the present invention, can more effective use Limited resources, and help on the logic channel aspect, to avoid " dying of hunger " phenomenon
And for all the preservation information in the buffer that is transmitted in logic channel in next dispatching cycle (TW), i the needed peak transfer rate of logic channel is:
At formula (1)-(3), l
b, b ∈ [1, P
i] be the size of grouping, it is that user's set 3 can obtain.Parameter TO
b, b ∈ [1, P
i] information-related with professional time delay with the due in of grouping.For concrete Packet data service, time delay information can obtain.And the arrival of a grouping is labeled, so TO
b, b ∈ [1, P
i] also can obtain for user's set 3.Has only factor-beta
iCan decide by emulation.In order to simplify, we select β
i=0, because Logic Priority level and service priority will be considered in scheduling process.Therefore, formula (2) is feasible, and is easy to calculate for each logic channel at user's set 3 places.
User's set 3 is obtaining from the resource authorization (SG) of Node B afterwards, and user's set 3 can be according to coming Resources allocation in the Different Logic channel in following manner:
-the order of successively decreasing with priority is each logical channel assignment resource, makes its transmission rate reach MinR as far as possible,
-after the transmission rate of all logic channels all reaches MinR,, then entering for second step if also have resources left, the order of successively decreasing with priority is the further Resources allocation of each logic channel, makes its transmission rate reach MaxR as far as possible,
-last step is if also have resources left, then the logic channel service (as possible property business-best-effort service) of order for still having remaining data of still successively decreasing with priority.
Can be used for the chance in next dispatching cycle, transmitted so that each logic channel has like this.Thereby on the professional Qos of assurance basis, avoid " dying of hunger " phenomenon on the logic channel aspect.
In addition, it is pointed out that above-mentioned formula (2) and (3) represented be transmission rate, but adopt the minimum transmitted in the TW in next dispatching cycle and maximum amount of data, because both are actually and are equal to equally also applicable to the present invention.
Then, we discuss the resource scheduling scheme of the service layer based on user's set of the present invention, also promptly how in user's set 3 places, Resources allocation between different business, to effectively utilize limited resources, guaranteeing on service layer, to avoid " dying of hunger " phenomenon on the professional QOS characteristic basis.
For the scheduling of resource mechanism of above-mentioned logic-based channel aspect, we suppose that each logic channel is mapped to different business.But we know that a plurality of logic channels with equal priority may belong to same business.Service layer rather than logic channel aspect define and Qos information is based on.Therefore, we can come scheduled transmission based on service layer.We know that the logic channel that belongs to identical services may often be mapped to a MAC-d (stream of medium access control-d), and the Different Logic channel that belongs to different business can not be mapped to identical MAC-d stream.As can be seen, be identical with scheduling of resource on the MAC-d aspect in fact for avoiding scheduling of resource that " dying of hunger " phenomenon carries out on the service layer for avoiding " dying of hunger " phenomenon to carry out.
With discussed above the same, supposing for each user's set 3 has n different business to carry out, and we suppose that each MAC-d stream is mapped to a business.For j professional (MAC-d stream), we have following parameter:
-lc
j, belong to the number of the logic channel of j professional (MAC-d stream).For i the logic channel of j professional (MAC-d stream), we have P at supposition
iIndividual grouping is buffered in the buffer, here i ∈ [1, lc
j], and for each grouping, we have l
bBe the bit number of b grouping,
TO
b, being b grouping still can be buffered in time in the buffer according to the QOS parameter (time delay information) of business.Here, and b ∈ [1, P
i].
Like this, we know that in order to guarantee professional time delay QOS, j business needs following speed in the TW in next dispatching cycle:
Here, 0≤β
j＜1 is a factor relevant with service priority, and can determine by emulation.As mentioned above, β
j=0 means when request resource requires, and does not consider service priority.And service priority information will be considered in scheduling step subsequently.Therefore, we know MinR
j sBe that j business is in next TW (or TTI), in order to ensure its time delay Qos, needed minimum-rate.And speed is for all groupings in the buffer that is transmitted in j business, also promptly:
Like this, after obtaining resource authorization by Node B 2, user's set 3 comes Resources allocation in different business (MAC-d stream) according to following manner:
-be each business (MAC-d stream) Resources allocation in proper order with successively decreasing of service priority, be that the transmission rate of each business (MAC-d stream) reaches MinR as far as possible
j s,
-all reached MinR when the transmission rate of all business (MAC-d stream)
j sIf resource also has residue, then entered for second step, be further Resources allocation of each business (MAC-d stream) in proper order with successively decreasing of service priority, make its transmission rate reach MaxR as far as possible
j s,
-last step is if still have resources left, and then the order of still successively decreasing with priority is business (MAC-d stream) service that still the has remaining data (property of doing the best business-best-effortservice).
We we can say that each business (MAC-d stream) has and be used for the chance transmitted in next dispatching cycles.Thereby avoid " dying of hunger " phenomenon on service layer, and professional QOS delay character is guaranteed also
Fig. 2 is according to of the present invention, and user's set 3 carries out the method flow diagram of resource allocation in the logic channel aspect.
Here, the topological structure schematic diagram in conjunction with wireless network shown in Figure 1 comes whole scheduling process is described.Suppose that user's set 3 has m logic channel that is carrying out (on going), and each logical mappings is to a kind of business with different delay.For i logic channel, suppose P
iIndividual grouping is stored in the buffer, and each grouping has following parameter:
A) l
b, be position (or byte) number of b grouping;
B) TO
b, for, according to the Qos information (time delay) of business, b grouping still can be stored in the time (number of TTI) in the buffer
Here, and b ∈ [1, P
i], i ∈ [1, m].
In step 201, for each logic channel i, user's set 3 obtains parameters such as the time that reaches, time delay information of corresponding grouping number Pi, each grouping in buffer memory.
In step 202, user's set is according to the time of advent of each grouping in the buffer memory and the time delay information of corresponding service, and user's set calculates this grouping still can be stored in time T O in the buffer memory
b
In step 203, user's set calculates by following formula (2), in order to guarantee professional time delay Qos, i logic channel required minimum transmission rate in next one TW dispatching cycle:
Here, 0≤β
i＜1 is a factor, and it is relevant with i priority of logical channels and service priority, and this factor can be determined by emulation.Work as β
i=0 o'clock, mean and when carrying out resource request, do not consider the Logic Priority level.
In step 204, user's set calculates by following formula (3), and for all the preservation information in the buffer that is transmitted in logic channel at the next one dispatching cycle among the TW, i the needed maximum rate of logic channel is:
In step 205, user's set 3 is with resource request signaling SI notice Node B (base station) 2.
In step 206, after the resource authorization SG that obtains from Node B, user's set 3 is each logical channel assignment resource according to the order of successively decreasing of priority of logical channels, makes its transmission rate reach MinR as far as possible
In step 207, user's set judges whether whether the transmission rate of each logic channel reaches MinR and still have unnecessary resource to be allocated, if then enter next step 208; If not, ending resource assigning process then.
In step 208, user's set 3 is the further Resources allocation of each logic channel according to the order of successively decreasing with priority, makes its transmission rate reach MaxR as far as possible.
In step 209, user's set 3 judges whether to still have logic channel to have remaining data, and still has resources left, if then enter next step 210; If not, ending resource assigning process then.
In step 210, the logic channel service (as possible property business) of order that user's set 3 still successively decreases with priority for still having remaining data.
Fig. 3 is according to of the present invention, and user's set 3 carries out the method flow diagram of scheduling of resource in service layer.
At this, still the topological structure schematic diagram in conjunction with wireless network shown in Figure 1 comes whole scheduling of resource process is described.Suppose that user's set 3 has m logic channel that is carrying out (on going), and each logical mappings is to a kind of business with different delay.For i logic channel, suppose P
iIndividual grouping is stored in the buffer, and each grouping has following parameter:
A) l
b, be position (or byte) number of b grouping;
B) TO
b, for, according to the Qos information (time delay) of business, b grouping still can be stored in the time (number of TTI) in the buffer
Here, and b ∈ [1, P
i], i ∈ [1, m].
In step 301, for each logic channel i, user's set 3 obtains parameters such as the time that reaches, time delay information of corresponding grouping number Pi, each grouping in buffer memory.
In step 302, user's set is according to the time of advent of each grouping in the buffer memory and the time delay information of corresponding service, and user's set calculates this grouping still can be stored in time T O in the buffer memory
b
In step 303, user's set calculates by following formula (4), and in order to guarantee professional time delay Qos, j professional (MAC-d stream) is required minimum transmission rate in next one TW dispatching cycle:
Here, 0≤β
j＜1 is a factor relevant with service priority, and can determine by emulation.As mentioned above, β
j=0 means when request resource requires, and does not consider service priority.And service priority information will be considered in scheduling step subsequently.
In step 304, user's set calculates by following formula (5), and in order to be transmitted in j all preservation information in the professional buffer among the TW in next dispatching cycle, j professional (MAC-d stream) needed maximum rate is:
In step 305, user's set 3 is with resource request signaling SI notice Node B (base station) 2.
In step 306, after the resource authorization SG that obtains from Node B, user's set 3 is each traffic assignments resource according to the order of successively decreasing of professional (MAC-d stream) priority, makes its transmission rate reach MinR as far as possible
In step 307, user's set judges whether whether each professional transmission rate reaches MinR and still have unnecessary resource to be allocated, if then enter next step 308; If not; Ending resource assigning process then.
In step 308, user's set 3 for each professional further Resources allocation, makes its transmission rate reach MaxR according to the order of successively decreasing with priority as far as possible.
In step 309, user's set 3 judges whether whether each professional transmission rate reaches MaxR and still have unnecessary resource to be allocated, if then enter next step 310; If not, ending resource assigning process then.
In step 310, if still have resources left, business (MAC-d stream) service (as possible property business) of order that user's set 3 still successively decreases with priority for still having remaining data.
It should be noted that, what describe in conjunction with Fig. 2 and 3 above is a preferred embodiment of the present invention, to be user's sets combine the Qos information of business and logic channel or professional buffer information in logic channel aspect or service layer main points of the present invention, comes the request of expressing bandwidth resources to Node B (base station) 2.To the consideration such as other information of priority of logical channels, service priority etc. all is to belong to optional feature.
Fig. 4 is the block diagram according to user's set of the present invention.Below, in conjunction with Fig. 1 user's set is specifically described.This user's set 3 is arranged in a wireless network 1, links to each other with wireless network by NodeB (base station) 2, and when needs transmission information, need be to the certain bandwidth resources of Node B (base station) 2 requests.
This user's set 3 comprises a buffer 41, calculation element 42, a controller 43 and a storage device 44.In buffer 41, store the data that will send, and this user have a plurality of ongoing logic channels, the corresponding a kind of business of each logic channel.Storage is by each logic channel and professional precedence information in storage device 44.
At first, we discuss the preferred embodiment that carries out the user's set 3 of scheduling of resource in the logic channel aspect.
Particularly, suppose that user's set 3 has m logic channel that is carrying out (on going), and each logical mappings is to a kind of business with different delay.For i logic channel, suppose P
iIndividual grouping is stored in the buffer, and each grouping has following parameter:
A) l
b, be position (or byte) number of b grouping;
B) TO
b, for, according to the Qos information (time delay) of business, b grouping still can be stored in the time (number of TTI) in the buffer
Here, and b ∈ [1, P
i], i ∈ [1, m].
When needs carried out scheduling of resource, for i logic channel, control device 43 need be by obtaining corresponding grouping number Pi, the time that reaches of each grouping, each professional time delay information in buffer memory.And control device 43 is also by the precedence information that obtains each professional relevant information (being preferably time delay Qos) and each logic channel in the storage device 44.
Control device 43 is given calculation element 42 with these message transmission, and is calculated by following formula (2) by calculation element 42, in order to guarantee professional time delay Qos, i logic channel required minimum transmission rate in next one TW dispatching cycle:
Here, 0≤β
i＜1 is a factor, and it is relevant with i priority of logical channels and service priority, and this factor can be determined by emulation.Work as β
i=0 o'clock, mean and when carrying out resource request, do not consider the Logic Priority level.
Then, calculation element also calculates by following formula (3), and for all the preservation information in the buffer that is transmitted in logic channel at the next one dispatching cycle among the TW, i the needed maximum rate of logic channel is:
Calculation element 42 is transferred to control device 43 with result of calculation.Then, control device 43 control user's sets 3 are with resource request signaling SI notice Node B (base station) 2.
After the resource authorization SG that obtains from Node B, control device 3 can also basis come Resources allocation in the Different Logic channel in following manner:
-be in proper order each logical channel assignment resource to make its transmission rate reach MinR with successively decreasing of priority of logical channels as far as possible,
-after the transmission rate of all logic channels all reaches MinR,, then entering for second step if also have resources left, the order of successively decreasing with priority is the further Resources allocation of each logic channel, makes its transmission rate reach MaxR as far as possible,
-last step is if also have resources left, then the logic channel service (as possible property business) of order for still having remaining data of still successively decreasing with priority.
Secondly, we discuss the preferred embodiment that carries out the user's set 3 of scheduling of resource in service layer.
When needs transmission information, control device 43 is at first by the current state information that obtains buffer in the buffer 41 (also promptly wherein institute's stored packet data volume), and by obtaining each professional relevant information (being preferably time delay Qos) and each professional precedence information in the storage device 44.
Particularly, supposing for each user's set 3 has n different business to carry out, and for j professional (MAC-d stream), we have following parameter:
-lc
j, belong to the number of the logic channel of j professional (MAC-d stream).For i the logic channel of j professional (MAC-d stream), we have P at supposition
iIndividual grouping is buffered in the buffer, here i ∈ [1, lc
j], and for each grouping, we have
-l
bBe the bit number of b grouping,
-TO
b, being b grouping still can be buffered in time in the buffer according to the QOS parameter (time delay information) of business.Here, and b ∈ [1, P
i].
When needs carried out scheduling of resource, for j professional (MAC-d stream), control device 43 need be by obtaining corresponding grouping number Pi, the time that reaches of each grouping, each professional parameter such as time delay information in buffer memory in the buffer.And control device 43 is also by the precedence information that obtains each business (MAC-d stream) in the storage device 44.
Control device 43 is given calculation element 42 with these message transmission, and is calculated by following formula (4) by calculation element 42, in order to guarantee professional time delay Qos, j business required minimum transmission rate in next one TW dispatching cycle:
Here, 0≤β
j＜1 is a factor relevant with service priority, and can determine by emulation.As mentioned above, β
j=0 means when request resource requires, and does not consider service priority.And service priority information will be considered in scheduling step subsequently.Therefore, we know MinR
j sBe that j business is in next TW (or TTI), in order to ensure its time delay Qos, needed minimum-rate.And speed is for all groupings in the buffer that is transmitted in j business, also promptly:
Calculation element 42 is transferred to control device 43 with result of calculation.Then, control device 43 control user's sets 3 are with resource request signaling SI notice Node B (base station) 2.
After the resource authorization SG that obtains from Node B, control device 3 can also basis come Resources allocation in different business in following manner:
-be each business (MAC-d stream) Resources allocation in proper order with successively decreasing of service priority, be that the transmission rate of each business (MAC-d stream) reaches MinR as far as possible
j s,
-all reached MinR when the transmission rate of all business (MAC-d stream)
j sIf, also have resources left, then entered for second step, be further Resources allocation of each business (MAC-d stream) in proper order with successively decreasing of service priority, make its transmission rate reach MaxR as far as possible
j s,
-last step is if also have resources left, and then the order of still successively decreasing with priority is business (MAC-d stream) service that still the has remaining data (property of doing the best business-best-effortservice).
More than specific embodiments of the invention are described.Need to understand being, the present invention is not limited to above-mentioned specific for execution mode, and those skilled in the art can make various distortion or modification within the scope of the appended claims.
Claims (16)
1. method that in the user's set of wireless network, is used on enhanced uplink, carrying out scheduling of resource, wherein, described wireless network comprises base station and a plurality of user's set, described user's set comprises a buffer, it is used to store the data that will send, and described user's set has a plurality of ongoing business and logic channel, and each logic channel belongs to a kind of business with different Q os, and this method may further comprise the steps:
Described user's set is determined each logic channel required minimum transmission rate in next dispatching cycle according to the information of described buffer and with the time delay Qos information of described business;
After receiving the Radio Resource mandate that comes from described base station, described user's set is stolen speed according to determined each logic channel required brief biography in next dispatching cycle, to each logical channel assignment corresponding radio resource.
2. method according to claim 1 is characterized in that, described user's set is determined i logic channel required minimum transmission rate in next dispatching cycle according to following formula:
Wherein, TW is dispatching cycle,
Described user's set has m ongoing logic channel, and for i logic channel, has Pi grouped data to be kept in the buffer, l
b20 bits or byte number for b grouping in the buffer; TO
bFor according to described time delay Qos information, b grouping still can be stored in the time in the buffer, wherein 1≤i≤m; , 1≤b≤P
i
3. method according to claim 1 and 2, it is characterized in that, described user's set is also further, determines each logic channel needed minimum transmission rate in next dispatching cycle based on each priority of logical channels and corresponding service precedence information.
4. according to each described method among the claim 1-3, it is characterized in that described user's set may further comprise the steps for the step of each logical channel assignment Radio Resource:
After the Radio Resource mandate of receiving from described base station, described user's set is according to the order of successively decreasing of the priority of each logic channel, come to be this logical channel assignment corresponding radio resource according to described each logic channel required minimum-rate in next dispatching cycle
After each logic channel all reaches corresponding minimum-rate, if also have resources left, then described user's set comes all to be transmitted required peak transfer rate according to described each logic channel all data in buffer in next dispatching cycle and further distributes corresponding radio resource for this logic channel according to the order of successively decreasing of the priority of each logic channel.
5. user's set that in wireless network, is used for carrying out scheduling of resource in enhanced uplink, wherein, described wireless network comprises base station and a plurality of user's set, described user's set comprises a buffer, it is used to store the data that will send, and described user's set has a plurality of ongoing business and logic channel, and each logic channel belongs to a kind of business with different Q os, it is characterized in that this user's set also comprises:
A calculation element is used for calculating each logic channel required minimum transmission rate in next dispatching cycle according to the information of described buffer and with the time delay Qos information of described business; With
A control device after receiving the Radio Resource mandate that comes from described base station, is used for according to the minimum transmission rate of determined each logic channel in next dispatching cycle, to each logical channel assignment corresponding radio resource.
6. user's set according to claim 5 is characterized in that, described calculation element is used for calculating i logic channel required minimum transmission rate in next dispatching cycle according to following formula:
Wherein, TW is dispatching cycle,
Described user's set has m ongoing logic channel, and for i logic channel, has Pi grouped data to be kept in the buffer, l
bBit or byte number for b grouping in the buffer; TO
bFor according to described time delay Qos information, b grouping still can be stored in the time in the buffer, wherein, and 1≤i≤m; , 1≤b≤P
i
7. according to claim 5 or 6 described user's sets, it is characterized in that, described calculation element also is used for, and based on each priority of logical channels and corresponding service precedence information, calculates each logic needed minimum transmission rate in next dispatching cycle.
8. according to claim 5 or 6 described user's sets, it is characterized in that, described control device also is used for, after the Radio Resource mandate of receiving from described base station, according to the order of successively decreasing of the priority of each logic channel, come to be this logical channel assignment corresponding radio resource according to described each logic channel required minimum transmission rate in next dispatching cycle; With
After each logic channel all reaches corresponding minimum transmission rate, if also have surplus resources, described control device comes all to be transmitted required maximum rate according to described each logic channel all data in buffer in next dispatching cycle and comes to be this logical channel assignment corresponding radio resource according to the order of successively decreasing of the priority of each logic channel.
9. method that in the user's set of wireless network, is used on enhanced uplink, carrying out scheduling of resource, wherein, described wireless network comprises base station and a plurality of user's set, described user's set comprises a buffer, it is used to store the data that will send, and described user's set has a plurality of ongoing business, and this method may further comprise the steps:
Described user's set is determined each business required minimum transmission rate in next dispatching cycle according to the information of described buffer and with the time delay Qos information of described business; After receiving the Radio Resource mandate that comes from described base station, described user's set is according to determined each business required minimum transmission rate in next dispatching cycle, to each traffic assignments corresponding radio resource.
10. method according to claim 9 is characterized in that, described user's set is determined j business required minimum transmission rate in next dispatching cycle according to following formula:
Wherein, TW is dispatching cycle,
Described user's set has n ongoing business, lc
jFor belonging to the number of j professional logic channel; For j i professional logic channel, there be Pi grouped data to be kept in the buffer l
bBit or byte number for b grouping in the buffer; TO
bFor according to described time delay Qos information, b grouping still can be stored in the time in the buffer, wherein i ∈ [1, lc
j]; , 1≤b≤P
i
11. according to claim 9 or 10 described methods, it is characterized in that described user's set is also further,, determine each business needed minimum transmission rate in next dispatching cycle based on each professional precedence information.
12., it is characterized in that described user's set may further comprise the steps for the step of each traffic assignments Radio Resource according to claim 9 or 10 described methods:
After the Radio Resource mandate of receiving from described base station, described user's set is according to the order of successively decreasing of each professional priority, come to be this traffic assignments corresponding radio resource according to described each business required minimum transmission rate in next dispatching cycle, after each business all reaches corresponding minimum-rate, if also have resources left, then described user's set comes all to be transmitted required peak transfer rate according to described each business all data in buffer in next dispatching cycle and further distributes corresponding radio resource for this business according to the order of successively decreasing of each professional priority.
13. user's set that in wireless network, is used on enhanced uplink, carrying out scheduling of resource, wherein, described wireless network comprises base station and a plurality of user's set, described user's set comprises a buffer, it is used to store the data that will send, and described user's set has a plurality of ongoing business, it is characterized in that, this user's set also comprises:
A calculation element is used for calculating each business required minimum transmission rate in next dispatching cycle according to the information of described buffer and with the time delay Qos information of described business; With
A control device after receiving the Radio Resource mandate that comes from described base station, is used for according to the minimum transmission rate of determined each business in next dispatching cycle, to each traffic assignments corresponding radio resource.
14. user's set according to claim 13 is characterized in that, described calculation element is used for determining j business required minimum transmission rate in next dispatching cycle according to following formula:
Wherein, TW is dispatching cycle,
Have n ongoing business, lc in described user's dress
jFor belonging to the number of j professional logic channel; For j i professional logic channel, there be Pi grouped data to be kept in the buffer l
bBit or byte number for b grouping in the buffer; TO
bFor according to described time delay Qos information, b grouping still can be stored in the time in the buffer, wherein i ∈ [1, lc
j]; , 1≤b≤P
i
15. according to claim 13 or 14 described user's sets, it is characterized in that described calculation element also is used for,, calculate this business needed minimum transmission rate in next dispatching cycle based on each professional precedence information.
16. according to claim 13 or 14 described user's sets, it is characterized in that, described control device also is used for, after the Radio Resource mandate of receiving from described base station, according to the order of successively decreasing of each professional priority, come to be each traffic assignments corresponding radio resource according to described each business required minimum-rate in next dispatching cycle; With
After each business all reaches corresponding minimum-rate, if also have resources left, then described user's set comes all to be transmitted required maximum rate according to described each business all data in buffer in next dispatching cycle and comes to be this traffic assignments corresponding radio resource according to the order of successively decreasing of each professional priority.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100668851A CN100479421C (en) | 2004-09-29 | 2004-09-29 | User apparatus and method for carrying out resource scheduling in wireless network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100668851A CN100479421C (en) | 2004-09-29 | 2004-09-29 | User apparatus and method for carrying out resource scheduling in wireless network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1756228A CN1756228A (en) | 2006-04-05 |
| CN100479421C true CN100479421C (en) | 2009-04-15 |
Family
ID=36689174
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100668851A Active CN100479421C (en) | 2004-09-29 | 2004-09-29 | User apparatus and method for carrying out resource scheduling in wireless network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100479421C (en) |
Families Citing this family (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101132220B (en) * | 2006-08-22 | 2011-11-30 | 上海贝尔阿尔卡特股份有限公司 | Method and device for reporting ascending scheduling request or emergency in wireless network |
| US8116805B2 (en) * | 2006-12-17 | 2012-02-14 | Qualcomm Incorporated | Uplink scheduling for OFDM systems |
| CN101232696B (en) * | 2007-01-24 | 2012-02-01 | 华为技术有限公司 | System and method for processing uplink time delay insensitiveness service |
| CN101282286B (en) * | 2007-04-02 | 2012-09-05 | 中兴通讯股份有限公司 | Method for reducing transmission block set coarseness during access of high speed upstream packet |
| CN101282190B (en) * | 2007-04-02 | 2011-05-11 | 中兴通讯股份有限公司 | Method for multiplexing scheduling and non-scheduling service transmission in high speed upstream packet access |
| CN101299706B (en) * | 2007-04-30 | 2011-01-19 | 上海贝尔阿尔卡特股份有限公司 | Method for implementing inquiry processing of data packet, communication system and sending terminal equipment |
| US8665735B2 (en) * | 2007-07-20 | 2014-03-04 | Broadcom Corporation | Method and system for quality of service management in a multi-standard mesh of networks |
| CN101459588B (en) * | 2007-12-13 | 2011-11-16 | 华为技术有限公司 | Method, apparatus and system for flow control |
| CN101222298B (en) * | 2008-01-22 | 2011-04-06 | 中兴通讯股份有限公司 | Forward package out-of-order regulation method and base station used in HRPD system |
| CN101499848B (en) * | 2008-01-31 | 2012-12-19 | 电信科学技术研究院 | Uplink scheduling method and apparatus |
| JP4833316B2 (en) * | 2009-04-28 | 2011-12-07 | 株式会社エヌ・ティ・ティ・ドコモ | Wireless base station |
| CN101902817B (en) * | 2009-05-26 | 2015-07-22 | 中兴通讯股份有限公司 | Uplink radio resource dispatching method and device for wireless communication system |
| EP3301986A1 (en) * | 2016-09-30 | 2018-04-04 | Panasonic Intellectual Property Corporation of America | Improved uplink resource allocation among different ofdm numerology schemes |
-
2004
- 2004-09-29 CN CNB2004100668851A patent/CN100479421C/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN1756228A (en) | 2006-04-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6850540B1 (en) | Packet scheduling in a communications system | |
| KR101177136B1 (en) | Method and apparatus for managing packet data resources | |
| CN102577499B (en) | For the method and apparatus of resource management | |
| US5970062A (en) | Method and apparatus for providing wireless access to an ATM network | |
| US8111652B2 (en) | Base station, radio communication system, and communication method | |
| JP3898965B2 (en) | Radio resource allocation method and base station | |
| CN101790895B (en) | Cellular communication system, apparatus and method for management of backhaul resources | |
| US8797863B2 (en) | Mobile communication system and communication control method | |
| US9107100B2 (en) | Prioritization of data packets | |
| CN100479421C (en) | User apparatus and method for carrying out resource scheduling in wireless network | |
| US7817660B2 (en) | High capacity scheduler | |
| CN101123622B (en) | A method and device for Iub interface traffic control | |
| CN109618375B (en) | UAV ad hoc network time slot scheduling method based on service priority and channel interruption probability | |
| CN101467403A (en) | Mapping services to radio bearers and allocating bandwidth to the radio bearers according to weight values | |
| WO2001063855A1 (en) | Packet scheduling in umts using several calculated transfer rates | |
| JP2002057699A (en) | Packet transmission system, packet transmission method and recording medium | |
| CN1996942A (en) | A method and system for traffic control | |
| Garrido-Hidalgo et al. | Efficient online resource allocation in large-scale LoRaWAN networks: A multi-agent approach | |
| JP4607037B2 (en) | Radio frame control apparatus and radio communication apparatus | |
| CN101854622A (en) | High-speed uplink packet access terminal and data transmission method thereof | |
| CN100433637C (en) | Base station for carrying out resource scheduling for user device in wireless network and its method | |
| CN100394725C (en) | Method, wireless network and user device for carrying out resource scheduling | |
| CN102132602B (en) | Method of allocating channel time for variable bit rate (VBR) service, apparatus for processing data and method thereof | |
| KR100606898B1 (en) | The method to manage radio resources for packet scheduling, and system using the same | |
| JP4908241B2 (en) | Radio frame control apparatus, radio communication apparatus, and radio frame control method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C56 | Change in the name or address of the patentee |
Owner name: SHANGHAI ALCATEL-LUCENT CO., LTD. Free format text: FORMER NAME: BEIER AERKATE CO., LTD., SHANGHAI |
|
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 201206 Pudong Jinqiao Export Processing Zone, Nanjing Road, No. 388, Shanghai Patentee after: Shanghai Alcatel-Lucent Co., Ltd. Address before: 201206 Pudong Jinqiao Export Processing Zone, Nanjing Road, No. 388, Shanghai Patentee before: Beier Aerkate Co., Ltd., Shanghai |
|
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 201206 Pudong Jinqiao Export Processing Zone, Nanjing Road, No. 388, Shanghai Patentee after: Shanghai NOKIA Baer Limited by Share Ltd Address before: 201206 Pudong Jinqiao Export Processing Zone, Nanjing Road, No. 388, Shanghai Patentee before: Shanghai Alcatel-Lucent Co., Ltd. |