CN101383991B - Customer scheduling method and device in packet service - Google Patents
Customer scheduling method and device in packet service Download PDFInfo
- Publication number
- CN101383991B CN101383991B CN200710121446XA CN200710121446A CN101383991B CN 101383991 B CN101383991 B CN 101383991B CN 200710121446X A CN200710121446X A CN 200710121446XA CN 200710121446 A CN200710121446 A CN 200710121446A CN 101383991 B CN101383991 B CN 101383991B
- Authority
- CN
- China
- Prior art keywords
- user
- adjusted
- data volume
- buffer
- thresholding
- 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)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a user dispatching method in the grouping service. The method comprises the following steps: a dispatching user queue is established utilizing dispatching arithmetic; for the preceding users with the number of W in the dispatching user queue, the positions of the users with the number of W are adjusted in sequence according to the data size in a buffer corresponding to each user; the users are dispatched in sequence according to the adjusted dispatching user queue, wherein the W is an integer more than 1. In the invention, when the users are dispatched in sequence according to the adjusted dispatching user queue, the invention not only considers the signal channel quality of each user, but also takes the data size in the buffer corresponding to each user into account. When the users are dispatched, the data size in the buffer is taken into account, thereby the user dispatching and flow control can better work in harmony so as to avoid the buffer in a narrow band (NB) underflowing or overflowing caused by the time delay of the flow control. The invention also discloses a user dispatching device in the grouping service.
Description
Technical field
The present invention relates to the user's dispatching technique in the 3-G (Generation Three mobile communication system), relate in particular to user scheduling method and device in a kind of Packet Service.
Background technology
In 3-G (Generation Three mobile communication system), introduced the new transmission channel of high-speed downlink shared channel (HS-DSCH).For HS-DSCH, compare with current downlink sharied signal channel, provide such as fast automatic repetitive requests agreement, rapid link is adaptive some new functions such as scheduling relevant with Fast Channel.All these new functions are located at and are positioned at the base station (Node B is called in NB) in the new functional entity on medium access control (MAC) layer of MAC-hs entity.In addition, also introduced Frame Protocol, be used for deal with data transmission and carry out current control between the user cache device of network controller (RNC) and NB.
When a plurality of subscriber equipmenies (UE) when NB sends service request, for example ask downlink data, NB adopts dispatching algorithm to finish usually and select to accept this dispatching cycle the UE of service from the UE of a plurality of transmission requests.NB sends a control frame that allows to issue data by Iub interface, and to the RNC request msg, RNC sends data to NB according to the indicated data volume of described control frame.NB is temporary in the pairing buffer of relevant UE with the data that RNC sends.When the data volume in certain buffer was too big, NB can send a control frame of forbidding issuing data by Iub interface, and request RNC stops to send related data.RNC will stop to send related data according to the indication of described control frame.When NB is dispatched to certain UE, will be from this UE corresponding cache device reading of data, and send data to this UE by the Uu mouth.
As can be seen, NB can carry out current control by control frame.The main purpose of the flow control scheme that performance is good is, regulates the amount of user data that is sent to the corresponding buffer the NB from RNC, and the data volume of transmitting between not negative effect NB and the relevant UE.This means in the buffer data volume should keep relatively steadily moderate, should underflow or overflow.So-called " underflow " is meant that the data volume in the buffer is too little, to such an extent as to buffer is drained, invalid scheduling occurs; So-called " overflow " is meant that the data volume in the buffer is too big, to such an extent as to there are data to lose because of putting into buffer.
Can regulate the data volume that storage is gone back in input by current control, dispatch the data volume that to regulate output state by the user.As can be seen, can guarantee the balance of the data volume of input and output buffer, reduce the probability of buffer generation underflow or overflow by the coordination between current control and the user scheduling.
But under the very violent situation of variations, especially in the middle of high speed downlink packet inserted (HSDPA) business, there was certain hysteresis in the data traffic control that flow control algorithm and dispatching algorithm are carried out.
With regard to current control, send a control frame that allows to issue data from NB to RNC, the time delay that is assembled into first Frame to RNC is 30 milliseconds (ms), is 10ms and send the time delay that a control frame of forbidding issuing data comes into force to this control frame from NB to RNC.These two time delays when variations is violent, might cause the underflow or the overflow of buffer among the NB fully.
For example, when the channel quality of certain UE sharply promoted, with this UE of priority scheduling, reading of data sent to this UE to NB from the corresponding cache device by dispatching algorithm, and by allowing to issue the control frame of data to the RNC request msg.Because the existence of time delay, RNC can't in time send relevant data, and this will cause described buffer underflow.
Again for example, when the channel quality of certain UE sharply descended, NB may no longer dispatch this UE, stop to send data to this UE, and by forbidding that the control frame request RNC that issues data stops to send related data.Because the existence of time delay, RNC can't in time stop to send relevant data, and this will cause described buffer overflow.
Summary of the invention
In view of this, the technical problem that the present invention solves provides the user scheduling method in a kind of Packet Service, can avoid underflow or overflow owing to buffer among the NB that time delay caused of current control to a certain extent.
For this reason, technical scheme provided by the invention is as follows:
User scheduling method in a kind of Packet Service comprises:
Utilize dispatching algorithm to set up the dispatched users formation;
For preceding W user of described dispatched users formation, adjust a described W user's position successively according to the data volume in the pairing buffer of each user;
By adjusted dispatched users formation dispatched users successively;
Wherein, W is the integer greater than 1.
Wherein, when the data volume in the buffer during, the user of correspondence is adjusted backward, and the associated user is adjusted one forward less than first thresholding.
Preferably, when the data volume in the buffer during, the user of correspondence is adjusted into last user among the described W user less than first thresholding.
Wherein, described associated user is among the described W user, is in described respective user all users afterwards.
Wherein, when the data volume in the buffer during, further comprise less than first thresholding:
Whether the user who judges described correspondence is last user among the described W user;
If then do not adjust; Otherwise, the user of described correspondence is adjusted into last user among the described W user.
Wherein, when the data volume in the buffer during, the user of correspondence is adjusted forward, and the associated user is adjusted one backward greater than second thresholding.
Preferably, when the data volume in the buffer during, the user of correspondence is adjusted into first user among the described W user greater than second thresholding.
Wherein, described associated user is among the described W user, is in described respective user all users before.
Wherein, when the data volume in the buffer during, further comprise greater than second thresholding:
Whether the user who judges described correspondence is first user among the described W user;
If then do not adjust; Otherwise, the user of described correspondence is adjusted into first user among the described W user.
Wherein, further comprise:
Adjustment cycle is set;
After setting up the dispatched users formation, judge whether to arrive adjustment cycle;
If then adjust a described W user's position, by adjusted dispatched users formation dispatched users successively;
Otherwise, directly by the dispatched users formation of setting up dispatched users successively.
Preferably, the speed according to variations is provided with adjustment cycle.
Wherein, by the speed of following step, adjustment cycle is set according to variations:
The signal to noise ratio snr that accounting base-station is measured in the measurement period that presets;
SNR variance in the counting statistics cycle;
Described SNR variance is big more, and adjustment cycle is provided with shortly more.
The present invention also provides the user dispatching device in a kind of Packet Service, and this device comprises:
The unit is set up in formation, is used to utilize dispatching algorithm to set up the dispatched users formation;
Adjustment unit is used for preceding W user at described dispatched users formation, adjusts a described W user's position successively according to the data volume in the pairing buffer of each user; With
Scheduling unit is used for by adjusted dispatched users formation dispatched users successively.
Wherein, adjustment unit comprises:
First comparing unit is used for successively the data volume and first thresholding of each buffer of described W user's correspondence are compared; With
The back is to adjustment unit, when being used for data volume when buffer less than first thresholding, the user of correspondence being adjusted backward, and the associated user is adjusted one forward.
Preferably, when the data volume in the buffer during less than first thresholding, the back is adjusted into last user among the described W user to adjustment unit with the user of correspondence.
Wherein, described associated user is among the described W user, is in described respective user all users afterwards.
Wherein, also comprise:
First judging unit, when being used for data volume at buffer less than first thresholding, whether the user who judges described correspondence is last user among the described W user;
If not, then trigger the back and adjust to adjustment unit.
Wherein, adjustment unit comprises:
Second comparing unit is used for successively the data volume and second thresholding of each buffer of described W user's correspondence are compared; With
The forward direction adjustment unit when being used for data volume when buffer greater than second thresholding, being adjusted the user of correspondence forward, and the associated user is adjusted one backward.
Preferably, when the data volume in the buffer during greater than second thresholding, the forward direction adjustment unit is adjusted into first user among the described W user with the user of correspondence.
Wherein, described associated user is among the described W user, is in described respective user all users before.
Wherein, also comprise:
Second judging unit, when being used for data volume at buffer greater than second thresholding, whether the user who judges described correspondence is first user among the described W user;
If not, then trigger the forward direction adjustment unit and adjust.
Wherein, also comprise the 3rd judging unit and direct scheduling unit;
After formation was set up the unit and set up the dispatched users formation, whether the 3rd judgment unit judges arrived the adjustment cycle of setting;
If then trigger adjustment unit and carry out associative operation;
Otherwise, trigger direct scheduling unit, directly by the dispatched users formation of setting up dispatched users successively.
In the present invention, utilize dispatching algorithm to set up the dispatched users formation after, also need successively preceding W user of described dispatched users formation to be adjusted according to the data volume in the corresponding buffer.Therefore, when by adjusted dispatched users formation dispatched users successively, not only consider each user's channel quality, also taken into account the data volume in each user's corresponding cache device.Exactly because when dispatched users, taken into account the data volume in the buffer, thereby the user is dispatched and current control co-ordination better, and then avoided to a certain extent because the underflow or the overflow of buffer among the NB that time delay caused of current control.
Description of drawings
Fig. 1 is the flow chart of the user scheduling method in a kind of Packet Service;
Fig. 2 is a flow chart of adjusting customer location among the present invention;
Fig. 3 is the flow chart of the user scheduling method in the another kind of Packet Service;
Fig. 4 is the schematic diagram of the user dispatching device in a kind of Packet Service;
Fig. 5 is the schematic diagram of the user dispatching device in the another kind of Packet Service.
Embodiment
Under the very violent situation of variations, the time delay of current control causes buffer generation underflow or the overflow among the NB probably.Also can't address this problem by the threshold value of adjusting current control,,, increase the possibility of overflow though reduced the possibility of underflow because when the threshold value of current control is higher.In like manner, when the threshold value of current control is hanged down,, increased the possibility of underflow though reduced the possibility of overflow.
Can't solve the problem that the current control time delay is caused by the threshold value of adjusting current control, the present invention proposes a kind of new user scheduling method from the angle of user's scheduling, thereby the user is dispatched and current control co-ordination better, and then avoid underflow or overflow to a certain extent owing to buffer among the NB that time delay caused of current control.
Dispatching algorithm commonly used at present mainly comprises circulation (Roun-Robin, RR) dispatching algorithm, max carrier to interference algorithm and direct ratio justice (Proportional-Fair Scheduler, PF) dispatching algorithm.When the actual schedule user, at first set up a dispatched users formation according to dispatching algorithm, according to the order of dispatched users formation the user is dispatched then.Wherein, the RR dispatching algorithm is arranged the user according to each user's order, and the max carrier to interference algorithm is arranged the user according to each user's carrier/interface ratio, and the PF dispatching algorithm is arranged the user according to each user's scheduling value.
As can be seen, max carrier to interference algorithm and PF dispatching algorithm mainly are according to user's channel quality the user to be dispatched.
The data volume of the present invention from each buffer of NB considered, on the basis of existing dispatching algorithm the scheduling Subscriber Queue carried out " fine setting ", to finish the optimization to existing dispatching algorithm.By this optimization, can make NB when dispatched users, not only consider this user's channel quality, can also take into account the data volume in this user's corresponding cache device, thereby reduce the possibility of buffer underflow or overflow to a certain extent.
For making those skilled in the art understand the present invention better, method provided by the invention is specified below in conjunction with specific embodiment.
Fig. 1 shows the flow chart of the user scheduling method in a kind of Packet Service.
For realizing to preestablish Several Parameters to the optimization of existing dispatching algorithm.This Several Parameters comprises:
Adjusting range W: in the dispatched users formation, only a preceding W user is adjusted.By the setting of W, can control controlled user's number.Only limited dispatched users adjusted, can improve the efficient that the user adjusts, this point shows particularly outstandingly when user's scheduling queue is long.
Underflow thresholding L
1: when the data volume in the buffer during less than this thresholding, underflow might take place in buffer.In this case, need to suspend the corresponding user of scheduling, pending data sends to by the Iub mouth after the described buffer, the more corresponding user of scheduling.
Overflow thresholding L
h: when the data volume in the buffer during greater than this thresholding, overflow might take place in buffer.In this case, need the user of priority scheduling correspondence, as early as possible the data in the buffer being read and to send to corresponding user, thereby when preventing that data from sending to described buffer by the Iub mouth, overflow takes place by the Uu mouth.
In step 11, set up the dispatched users formation according to dispatching algorithm.
Here the dispatching algorithm that relates to includes but not limited to any in RR dispatching algorithm, max carrier to interference algorithm and the PF dispatching algorithm.
In addition, according to the renewal of dispatching algorithm to the scheduling Subscriber Queue, its essence also is to rebulid the dispatched users formation.
In step 12,, adjust a described W user's position successively according to the data volume in the pairing buffer of each user for preceding W user of described dispatched users formation.
In step 13, by adjusted dispatched users formation dispatched users successively.
Adjustment to customer location in step 12 had both comprised that accent also comprised accent backward forward, and the flow process of adjustment customer location as shown in Figure 2.
In step 201, first user of dispatched users formation is set to active user L (i), at this moment i=1.
In step 202, with data volume in the pairing buffer of active user and underflow thresholding L
1Relatively.
In step 203, the data volume in buffer is less than underflow thresholding L
1The time, active user L (i) is adjusted into last user L (w) of a described W user.
And, in step 204, with user L (i+1), L (i+2) ..., L (w) adjusts one forward, become L (i), L (i+1) ..., L (w-1).
Data volume in buffer is more than or equal to underflow thresholding L
1The time, keep active user's invariant position.
In step 205, with data volume in the pairing buffer of active user and overflow thresholding L
hRelatively.
In step 206, the data volume in buffer is greater than underflow thresholding L
hThe time, active user L (i) is adjusted into first user L (1) of a described W user.
And, in step 207, with user L (1) ..., L (i-2), L (i-1) adjust one backward, become L (2), L (i-1) ..., L (i).
Data volume in buffer is less than or equal to overflow thresholding L
hThe time, keep active user's invariant position.
In step 208, do to add an operation, that is, and i=i+1.
In step 209, whether judge i greater than W, that is, whether active user L (i) exceeds adjusting range.
If i greater than W, then in step 210, finishes to adjust.
If i is less than or equal to W, then change step 202.
In flow process shown in Figure 2, between step 202 and step 203, can also increase a determining step, judge whether active user L (i) is last user L (w) of a described W user.
If then do not adjust; Otherwise, adjust, promptly execution in step 203.
In like manner, between step 205 and step 206, can also increase a determining step, judge whether active user L (i) is first user L (1) of a described W user.
If then do not adjust; Otherwise, adjust, promptly execution in step 206.
Wherein,, can all carry out, perhaps also can carry out once every several dispatching cycles in each dispatching cycle to the adjustment of scheduling Subscriber Queue.By adjustment cycle T is set, can control the frequency of adjusting the dispatched users formation.If adopt round-robin scheduling algorithmic dispatching user, then user's sequence of positions is fixed in the dispatched users formation.In this case, adjustment cycle T can be provided with more greatly.If adopt max carrier to interference algorithm or direct ratio justice than dispatching algorithm, then dispatching cycle very short, the dispatched users formation is upgraded than very fast.In this case, adjustment cycle T can be provided with smallerly.
Perhaps, can dynamically arrange adjustment cycle T according to the speed degree of variations, its process comprises:
The signal to noise ratio (snr) that statistics NB measures in the measurement period t that presets;
SNR variance in the counting statistics cycle t;
It is big more to calculate the SNR variance that obtains, and it is also fast more to be illustrated in the interior variations of measurement period t, correspondingly, adjustment cycle T should be provided with short more.
After being provided with adjustment cycle T, the flow process of adjustment customer location as shown in Figure 3.
In step 31, set up the dispatched users formation according to dispatching algorithm.
In step 32, judge whether to arrive adjustment cycle.
If the arrival adjustment cycle then in step 33, for preceding W user of described dispatched users formation, is adjusted a described W user's position successively according to the data volume in the pairing buffer of each user.Then, in step 34, by adjusted dispatched users formation dispatched users successively.
If still the no show adjustment cycle then in step 35, is pressed dispatched users formation dispatched users successively.
In the above-described embodiments, the adjustment of customer location both having been comprised transferring forward also comprise backward and transferring, and still, adjusted the method for customer location forward and adjust the method for customer location backward, is independent of each other between the two, without any corresponding relation.
As can be seen, the user scheduling method in the described Packet Service of the foregoing description is not only applicable to NB, is applicable to RNC yet.This method both can be used for the HSDPA business, also can be used for other Packet Service.
Based on above-mentioned user scheduling method, the invention allows for the user dispatching device in a kind of Packet Service, Fig. 4 is this schematic representation of apparatus.User dispatching device in the Packet Service comprises: cell S 41, adjustment unit S42 and scheduling unit S43 are set up in formation.
Formation is set up cell S 41 and is used to utilize dispatching algorithm to set up the dispatched users formation.Here the dispatching algorithm that relates to includes but not limited to any in RR dispatching algorithm, max carrier to interference algorithm and the PF dispatching algorithm.In addition, according to the renewal of dispatching algorithm to the scheduling Subscriber Queue, its essence also is to rebulid the dispatched users formation.
For preceding W user of described dispatched users formation, adjustment unit S42 will adjust a described W user's position successively according to the data volume in the pairing buffer of each user.Scheduling unit S43 will be by adjusted dispatched users formation dispatched users successively.
Wherein, adjustment unit S42 had both comprised to the adjustment of customer location that accent also comprised accent backward forward.Adjustment unit S42 can realize the back to adjustment of user by it first comparing unit that comprises and back to adjustment unit, and adjustment unit S42 can realize user's forward direction adjustment by it second comparing unit that comprises and forward direction adjustment unit.
Utilize first comparing unit, can successively data volume in each buffer of described W user's correspondence and underflow thresholding be compared.When the data volume in certain buffer during less than the underflow thresholding, the back can be adjusted the pairing user of this buffer backward to adjustment unit, and the associated user is adjusted one forward.
More particularly, when supposing that data volume in user L (i) the corresponding cache device is less than the lower limit thresholding, the back can be adjusted into user L (i) last user L (w) of a described W user to adjustment unit, and with user L (i+1), L (i+2) ..., L (w) adjusts one forward, become L (i), L (i+1) ..., L (w-1).
Utilize second comparing unit successively data volume in each buffer of described W user's correspondence and overflow thresholding to be compared.When the data volume in certain buffer during greater than the overflow thresholding, the forward direction adjustment unit can be adjusted the pairing user of this buffer forward, and the associated user is adjusted one backward.
More particularly, when supposing that data volume in user L (i) the corresponding cache device is greater than the overflow thresholding, the forward direction adjustment unit can be adjusted into user L (i) first user L (1) of a described W user, and with user L (1) ..., L (i-2), L (i-1) adjust one backward, become L (2), L (i-1) ..., L (i).
In actual applications, between adjustment unit, can also connect one first judging unit at first comparing unit and back.When the data volume in certain buffer during less than the underflow thresholding, whether the pairing user of the described buffer of first judgment unit judges is last user among the described W user.If not, then trigger the back and adjust to adjustment unit.
In like manner, between second comparing unit and forward direction adjustment unit, can also connect one second judging unit.When the data volume in certain buffer during greater than the overflow thresholding, whether the pairing user of the described buffer of second judgment unit judges is first user among the described W user.If not, then trigger the forward direction adjustment unit and adjust.
Wherein,, can all carry out, perhaps also can carry out once every several dispatching cycles in each dispatching cycle to the adjustment of scheduling Subscriber Queue.By adjustment cycle T is set, can control the frequency of adjusting the dispatched users formation.If adopt round-robin scheduling algorithmic dispatching user, then user's sequence of positions is fixed in the dispatched users formation.In this case, adjustment cycle T can be provided with more greatly.If adopt max carrier to interference algorithm or direct ratio justice than dispatching algorithm, then dispatching cycle very short, the dispatched users formation is upgraded than very fast.In this case, adjustment cycle T can be provided with smallerly.Perhaps, can dynamically arrange adjustment cycle T according to the speed degree of variations.
After being provided with adjustment cycle T, the user dispatching device in the Packet Service as shown in Figure 5.Compare with device shown in Figure 4, device shown in Figure 5 has increased the 3rd judging unit S51 and direct scheduling unit S52.
After formation was set up cell S 41 and set up the dispatched users formation, the 3rd judging unit S51 judged whether to arrive the adjustment cycle of setting.
If the 3rd judging unit S51 will trigger adjustment unit S42 and carry out associative operation; Otherwise the 3rd judging unit S51 will trigger direct scheduling unit S52, directly by the dispatched users formation of setting up dispatched users successively.
Those skilled in the art can understand, various exemplary method step of describing in conjunction with the disclosed embodiments and device unit all can electronic hardware here, software or the combination of the two realize.In order to be clearly shown that the interchangeability between the hardware and software, more than various exemplary steps and unit are all carried out generally description with its functional form.This functional be to realize or realize depending on the design constraint that specific application and whole system are realized with software with hardware.Those skilled in the art can be at each specific application, realize in many ways described functional, but the result of this realization should not be construed as and on the contrary deviates from scope of the present invention.
Utilize general processor, digital signal processor (DSP), application-specific integrated circuit (ASIC) (ASIC), field programmable gate array (FPGA) or other programmable logical device, discrete gate or transistor logic, discrete hardware components or the combination in any among them, can realize or carry out the various exemplary unit of describing in conjunction with embodiment disclosed herein.General processor may be a microprocessor, but in another kind of situation, this processor may be processor, controller, microcontroller or the state machine of any routine.Processor also may be implemented as the combination of computing equipment, for example, and the combination of DSP and microprocessor, a plurality of microprocessor, one or more microprocessor or any other this kind structure in conjunction with the DSP core.
In conjunction with the step of the described method of above-mentioned disclosed embodiment can directly be presented as hardware, the software module carried out by processor or the combination of these two.Software module may be present in the storage media of RAM memory, flash memory, ROM memory, eprom memory, eeprom memory, register, hard disk, mobile disk, CD-ROM or any other form well known in the art.The coupling of a kind of exemplary storage medium and processor, thus make processor can be from this storage media read message, and can be to this storage media write information.In replacing example, storage media is the part of processor.Processor and storage media may be present among the ASIC.This ASIC may be present in the subscriber station.Replace in the example at one, the discrete assembly that processor and storage media can be used as in the subscriber station exists.
According to described disclosed embodiment, can be so that those skilled in the art can realize or use the present invention.To those skilled in the art, the various modifications of these embodiment are conspicuous, and the general principles of definition here also can be applied to other embodiment on the basis that does not depart from the scope of the present invention with purport.Above-described embodiment only is preferred embodiment of the present invention, and is in order to restriction the present invention, within the spirit and principles in the present invention not all, any modification of being done, is equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (14)
1. the user scheduling method in the Packet Service is characterized in that, comprising:
Utilize dispatching algorithm to set up the dispatched users formation;
Preceding W user for described dispatched users formation, adjust a described W user's position successively according to the data volume in the pairing buffer of each user, when the data volume in the buffer during less than first thresholding, the user of correspondence is adjusted backward, and the associated user adjusted one forward, and the user of correspondence is adjusted into last user among the described W user, when the data volume in the buffer during greater than second thresholding, the user of correspondence is adjusted forward, and the associated user adjusted one backward, the user of correspondence is adjusted into first user among the described W user;
By adjusted dispatched users formation dispatched users successively;
Wherein, W is the integer greater than 1.
2. user scheduling method as claimed in claim 1 is characterized in that, when the data volume in the buffer during less than first thresholding, described associated user is among the described W user, is in all users after the described respective user.
3. user scheduling method as claimed in claim 1 is characterized in that, when the data volume in the buffer during less than first thresholding, further comprises:
Whether the user who judges described correspondence is last user among the described W user;
If then do not adjust; Otherwise, the user of described correspondence is adjusted into last user among the described W user.
4. user scheduling method as claimed in claim 1 is characterized in that, when the data volume in the buffer during greater than second thresholding, described associated user is among the described W user, is in all users before the described respective user.
5. user scheduling method as claimed in claim 1 is characterized in that, when the data volume in the buffer during greater than second thresholding, further comprises:
Whether the user who judges described correspondence is first user among the described W user;
If then do not adjust; Otherwise, the user of described correspondence is adjusted into first user among the described W user.
6. as any described user scheduling method of claim 1 to 5, it is characterized in that, further comprise:
Adjustment cycle is set;
After setting up the dispatched users formation, judge whether to arrive adjustment cycle;
If then adjust a described W user's position, by adjusted dispatched users formation dispatched users successively;
Otherwise, directly by the dispatched users formation of setting up dispatched users successively.
7. user scheduling method as claimed in claim 6 is characterized in that the speed according to variations is provided with adjustment cycle.
8. user scheduling method as claimed in claim 7 is characterized in that, by the speed of following step according to variations, adjustment cycle is set:
The signal to noise ratio snr that accounting base-station is measured in the measurement period that presets;
SNR variance in the counting statistics cycle;
Described SNR variance is big more, and adjustment cycle is provided with shortly more.
9. the user dispatching device in the Packet Service is characterized in that, comprising:
The unit is set up in formation, is used to utilize dispatching algorithm to set up the dispatched users formation;
Adjustment unit is used for preceding W user at described dispatched users formation, adjusts a described W user's position successively according to the data volume in the pairing buffer of each user; With
Scheduling unit is used for by adjusted dispatched users formation dispatched users successively;
Described adjustment unit comprises:
First comparing unit is used for successively the data volume and first thresholding of each buffer of described W user's correspondence are compared;
The back is to adjustment unit, when being used for data volume when buffer less than first thresholding, the user of correspondence adjusted backward, and the associated user is adjusted one forward, and the user of correspondence is adjusted into last user among the described W user;
Second comparing unit is used for successively the data volume and second thresholding of each buffer of described W user's correspondence are compared; With
The forward direction adjustment unit when being used for data volume when buffer greater than second thresholding, is adjusted the user of correspondence forward, and the associated user is adjusted one backward, and the user of correspondence is adjusted into first user among the described W user.
10. user dispatching device as claimed in claim 9 is characterized in that, when the data volume in the buffer during less than first thresholding, described associated user is among the described W user, is in all users after the described respective user.
11. user dispatching device as claimed in claim 9 is characterized in that, also comprises:
First judging unit, when being used for data volume at buffer less than first thresholding, whether the user who judges described correspondence is last user among the described W user;
If not, then trigger the back and adjust to adjustment unit.
12. user dispatching device as claimed in claim 9 is characterized in that, when the data volume in the buffer during greater than second thresholding, described associated user is among the described W user, is in all users before the described respective user.
13. user dispatching device as claimed in claim 9 is characterized in that, also comprises:
Second judging unit, when being used for data volume at buffer greater than second thresholding, whether the user who judges described correspondence is first user among the described W user;
If not, then trigger the forward direction adjustment unit and adjust.
14. as any described user dispatching device of claim 9 to 13, it is characterized in that, also comprise the 3rd judging unit and direct scheduling unit;
After formation was set up the unit and set up the dispatched users formation, whether the 3rd judgment unit judges arrived the adjustment cycle of setting;
If then trigger adjustment unit and carry out associative operation;
Otherwise, trigger direct scheduling unit, directly by the dispatched users formation of setting up dispatched users successively.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710121446XA CN101383991B (en) | 2007-09-06 | 2007-09-06 | Customer scheduling method and device in packet service |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710121446XA CN101383991B (en) | 2007-09-06 | 2007-09-06 | Customer scheduling method and device in packet service |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101383991A CN101383991A (en) | 2009-03-11 |
| CN101383991B true CN101383991B (en) | 2011-09-28 |
Family
ID=40463564
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200710121446XA Active CN101383991B (en) | 2007-09-06 | 2007-09-06 | Customer scheduling method and device in packet service |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101383991B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103902407A (en) * | 2012-12-31 | 2014-07-02 | 华为技术有限公司 | Virtual machine recovery method and server |
| CN105554886A (en) * | 2015-12-04 | 2016-05-04 | 京信通信技术(广州)有限公司 | Method and device for resource scheduling |
| TWI756637B (en) | 2020-02-19 | 2022-03-01 | 瑞昱半導體股份有限公司 | Method and apparatus for performing dynamic statistical period adjustment regarding rate adaption |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1339209A (en) * | 1999-10-02 | 2002-03-06 | 三星电子株式会社 | Fair flow controlling method in packet networks |
| CN1521988A (en) * | 2003-01-28 | 2004-08-18 | 华为技术有限公司 | Method for uniform distribution of physical layer data transmitting time slot in whole time domain |
-
2007
- 2007-09-06 CN CN200710121446XA patent/CN101383991B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1339209A (en) * | 1999-10-02 | 2002-03-06 | 三星电子株式会社 | Fair flow controlling method in packet networks |
| CN1521988A (en) * | 2003-01-28 | 2004-08-18 | 华为技术有限公司 | Method for uniform distribution of physical layer data transmitting time slot in whole time domain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101383991A (en) | 2009-03-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101104657B1 (en) | De-jitter buffer adjustments based on estimated delay | |
| CA2656859C (en) | Compressed delay packet transmission scheduling | |
| KR100929145B1 (en) | Low Speed MAC-E for High Speed Uplink Packet Access (HSSPA) Autonomous Transmission with Service-Specific Transmission Time Control | |
| US7710922B2 (en) | Flow control at cell change for high-speed downlink packet access | |
| JP4510826B2 (en) | Method for scheduling uplink transmission of user equipment and base station | |
| JP4481990B2 (en) | Harmonized data flow control and buffer sharing in UMTS | |
| CN100456706C (en) | Method and apparatus for dynamic backhaul resource management in a wireless communication system | |
| CN101288247A (en) | Method and apparatus for transmitting/receiving control information of user equipment for uplink data transmission | |
| JP2009517968A (en) | Flow control of low bit rate users in high speed downlink | |
| JP2012134988A (en) | Wireless communication method of selecting enhanced uplink transport format combination by setting scheduling grant payload to highest payload that can be transmitted | |
| CN101406097A (en) | Apparatus, method and computer program product providing threshold-based buffer state reports from user equipment to a wireless network | |
| KR100415115B1 (en) | Data congestion notifying method and apparatus in communication system | |
| US10057903B2 (en) | Method and apparatus for determining power offset parameters | |
| WO2010099718A1 (en) | Method and equipment for controlling data tranmission, and system thereof | |
| CN101383991B (en) | Customer scheduling method and device in packet service | |
| US7082115B2 (en) | Radio telecommunications system with improved use of timeslots | |
| CN101162969A (en) | Method and apparatus for setting field data of scheduling information in a wireless communications system | |
| JP4875060B2 (en) | Method and apparatus for increasing radio frequency efficiency of mixed voice over internet protocol and data traffic | |
| KR20040099908A (en) | Forward scheduling algorithm of hdr system | |
| CN101572905A (en) | Method and device for adjusting transmission time interval | |
| US20030139145A1 (en) | Data transmitting method and apparatus for guaranteeing quality of service in a data communication system | |
| US20030076793A1 (en) | Robust vocoder rate control in a packet network | |
| KR101242230B1 (en) | Techniques for efficient control of aggregating wireless voice communications | |
| US8014327B2 (en) | Optimizing requested downlink data by adjusting frame number by measuring actual transmission delay | |
| CN102487531A (en) | Flow control method for flow self-adaption modification of Iub port |
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 |