CN1731727B - Packet dispatch and flux control method for share transmission channel - Google Patents

Abstract

The invention discloses a method for flow controlling and sectionalization dispatching of sharing transmission channel in wireless switch-in network which comprises the steps of: obtaining just ranks and capacity ranks for every business need to be transmitted; obtaining mixing ranks according to the just ranks and capacity ranks; selecting the minimum mixing rank to transmit. Wherein the just ranks reflect the just property of each business; the capacity ranks reflect the capacity property of each business. The inventive method has the advantages of taking regard of the fairness and capacity between each business, of improving resource usage of system and transmission rate and delay.

Description

Share the packet scheduling and the flow control methods of transmission channel

Technical field

The present invention relates to Radio Access Network, relate in particular to packet scheduling and flow control methods that Radio Access Network is shared transmission channel.

Background technology

WCDMA (Wide Band-CDMA, wideband CDMA) is as one of main flow scheme of 3G (Third Generation) Moblie (3G), and its development prospect is caught people's attention day by day, to wherein a class important service---the research of Packet data service is also more and more deep thereupon.Most non-real-time services, as common WWW browse, FTP and E-mail be typical case's representative of Packet data service.Non-real-time service has following evident characteristic:

I. grouped data shows suddenly significantly, and the data of requirement can change from 0 to hundreds of kbit/s fast;

II. the propagation delay time of grouped data permission is longer than real time business, and therefore from the angle of Radio Access Network, the controllability of Packet data service is better relatively; And

III. grouped data can be controlled that (Radio Link Control, RLC) layer retransmits, thereby allows than a little bit poorer radio link quality of real time business with than higher frame error rate by Radio Link.

In the WCDMA system, have three kinds of transmission channels can be used for the transmitting grouped data business: common signal channel, dedicated channel and shared channel, this according to data aloft on the interface transmission manner and characteristics define.When selecting these three kinds of transmission channels, must take into full account size, the public factors such as amount of capacity that can provide of professional resource requirement, transmission data with load, system interference and the different transmission channel of dedicated channel.The more important thing is that in down link, topmost resource is orthogonalization sign indicating number and transmitting power.If down physical channel bearing peak value speed height, the grouped data that the frequency of occurrences is low, the code tree resource of the single scrambler sequence in base station then is easy to exhaustion so.

For fear of the appearance of this problem, the base station can with inferior scrambler sequence as the scrambler sequence of physical channel or adopt public/shared channel carrying in short-term, high speed business.Though use time scrambler sequence to introduce new code tree resource, cost is a good orthogonality of having destroyed BTS channel; And adopt shared channel can keep the orthogonality of interchannel, reduced the consumption of down link spreading code.

Thereby, at universal mobile telecommunications system (Universal Mobile TelecommunicationSystem, UMTS) defined a kind of DSCH Downlink Shared Channel (DSCH) in the grounding wireless access network (UTRAN), be used between UTRAN network and subscriber equipment (UE), carrying out transmission of packet data.This channel is used for the grouped data of transmitting burst, and its basic thought is to share a physical channel (as orthogonal code) in time-multiplexed mode between a plurality of users.Because several users is shared a code word, thereby saved orthogonal code resource limited on the down link.And when using dedicated channel (DCH), orthogonal code will keep according to Maximum Bit Rate, thereby the service efficiency of code word reduces greatly.Because multi-user's characteristic of shared channel has determined it can not use soft hand-off, therefore, with the parallel use of the DCH of a shared channel and a low bit rate.Dedicated channel is carried physical control channel, comprises the fast power control command.

Moreover, in the major version Release 5 of 3GPP agreement, growing in order further to satisfy to the high-speed mobile data, services, the demand of mobile Internet business particularly, on the basis of UMTS standard, developed a kind of Enhanced Technology, be that high speed downlink packet inserts (High Speed Downlink Packet Access, HSDPA) technology.In HSDPA, higher and support multiple non-symmetrical service in order to make transmitted data rates, the notion of the high speed descending sharing channel (HS-DSCH) of enhancement mode has been proposed.Compare with DSCH, HS-DSCH maximum difference on the sign indicating number resource is used is, it adopts channel code mechanism and can be used simultaneously by a plurality of users simultaneously in time domain, and unlike DSCH, in a Transmission Time Interval (TTI), the channel code resource of distribution can only be used by a user.

As mentioned above, no matter for DSCH Downlink Shared Channel (DSCH) or high speed descending sharing channel (HS-DSCH) all faces a problem, promptly how a plurality of users' of sharing this channel business is carried out rational flow control.

Fig. 1 illustrates in the WCDMA system schematic diagram of shared channel on the down link.As shown in Figure 1, by the responsible logic channel of the medium access control (MAC) of UTRAN in WCDMA system layer with its suitable mutually transmission channel between correct mapping, undertaking the task of the difference on the transmission rate between level and smooth wire message way and the wireless channel.For DSCH, be from MAC-d to MAC-c/sh, to transmit data.Wherein, MAC-d is the functional entity in the MAC layer, is mainly used in Dedicated Control Channel (DCCH)/Dedicated Traffic Channel (DTCH) of finishing as logic channel and as the mapping between the dedicated channel (DCH) of transmission channel.MAC-c/sh also is the functional entity in the MAC layer, is mainly used in the mapping between completion logic channel and Common transport channel and the shared transmission channel.Therefore in MAC-d and these two kinds of functional entitys of MAC-c/sh, should there be the management and the controlling mechanism of management DSCH flow.And, in the process from MAC-d to MAC-hs, have two kinds of paths available as the HS-DSCH that supports the HSDPA technology, the path that the MAC-c/sh functional entity participates in is promptly arranged and do not have the path that the MAC-c/sh functional entity participates in (among the figure shown in the dotted line).Wherein MAC-hs is the shared medium controlled function entity in the MAC layer among the Node B of UTRAN.

Like this, owing to there is different shared transmission channels, corresponding different transmission features, thereby it is different to carry out the functional entity of traffic management and control in each channel.According to relevant agreement regulation, the function of flow control realizes in MAC-d, MAC-c/sh or MAC-hs, that is to say, at shared channel, set up an effective flow control mechanism with utilizing MAC-d, MAC-c/sh or MAC-hs functional entity in the MAC layer, management is a plurality of Business Streams of transmission wherein, thus the possibility that the utilance of raising resource, minimizing system congestion and data abandon.

IEEE 802.3 has stated some flow control methods at WLAN, as binary method of controlling switch (XON/XOFF) and back-pressure (Backpressure) control method etc.For WCDMA, in relevant 3GPP agreement, defined various parameters, control corresponding frame structure and their usage criteria of relevant MAC laminar flow amount control.

Because it is the mobile radio system of representative that the transmission environment of wireless lan (wlan) will be much better than with WCDMA, thereby the unsteadiness that the various flow control methods of mentioning among the IEEE 802.3 do not have the detailed consideration wireless channel is to having a strong impact on that data transfer throughput caused, so be unsuitable for being applied directly in the WCDMA system.

Relevant 3GPP agreement has been stipulated in the MAC layer corresponding discharge controlling mechanism that different downlink shared transmission channels is provided with.

For grouping scheduling method, the relevant agreement TS 25.922 of 3GPP has provided two kinds of criterion.First standard is fairness (Round-Robin) standard, and it has reflected the fair principle of system; Second standard is the C/I standard, and it has reflected the volumetric properties of system.In addition, about document has provided some traffic management and control methods in conjunction with grouping scheduling method, as the fairness queuing (WeightedPriority Queuing) of fairness queuing (Priority Queuing), weighting and the service guide-line (Guaranteed Bit rateServing Rule) of assurance minimum speed limit etc.All methods all try hard to seek a dynamic balance with compromise between above-mentioned two kinds of evaluation criteria.

For 3GPP, do not indicate the idiographic flow and the related mechanism of flow control in the MAC layer, only provided Control Parameter, control frame structure and relevant usage criteria, thereby a kind of approach and mode of macroscopic view are provided for the design of traffic management and control.This will make undoubtedly and obtain greater flexibility and independence in the flow control mechanism and correlation method of those skilled in the art in design MAC layer.In addition, the concrete queuing strategy of above-mentioned some that mention all is at certain concrete transmission channel, and is not the universal architecture with extensive directive significance.

A small amount of document has proposed idea that MAC layer packet scheduling and the flow control mechanism of UMTS are united consideration.Wherein, by Young-June Choi, Saewoong Bahk and kwangBok Lee propose fairness and volumetric properties are united the method for consideration in the document that is entitled as " WAF:Wireless-Adaptive Fair Scheduling forMultimedia Stream ".In the method, at first consider a specific character in fairness or the capacity characteristic.After after a while, consider another characteristic again.Though this method has been taken all factors into consideration two kinds of performances, can only consider a kind of performance earlier, adjust by system then and consider another performance, and can not consider two kinds of performances simultaneously.Like this, when considering a kind of performance, often sacrificed another kind of performance, can't accomplish to take into account.

Therefore, buffer management that prior art provides and control strategy still have a lot of problem demanding prompt solutions, and the solution military order transmission of packet data of these problems adapt to the characteristics of the MAC of WCDMA system protocol layer more.

Summary of the invention

The application is in conjunction with the characteristic of DSCH/HS-DSCH, and consider three principles that pertinent regulations in the 3GPP agreement and the grouping scheduling method that will address in the back will be followed, provide a kind of MAC layer interior corresponding packet scheduling and flow control methods at DSCH/HS-DSCH.

Traffic management and control method at shared channel according to the present invention comprises the steps:

Obtain each professional fairness order waiting for transmission;

Obtain each professional capacity order waiting for transmission;

Obtain the mixing order of each business according to fairness sum of ranks capacity order; And

The business of selecting to mix the order minimum is transmitted,

Wherein, the fairness order has reflected the fairness characteristic that each is professional, and the capacity order has reflected the capacity characteristic that each is professional.

Traffic management and control method at shared channel according to the present invention can be taken all factors into consideration fairness problem and capacity problem between each business simultaneously, thereby effectively improved the resource utilization and the efficiency of transmission of system, improved professional propagation delay time.

Description of drawings

Fig. 1 illustrates in the WCDMA system schematic diagram of shared channel on the down link;

Fig. 2 is at the packet scheduling of shared channel and the flow chart of flow control methods according to of the present invention;

Fig. 3 is the schematic diagram of each priority assignment unit interval sheet in the step 202 of Fig. 2;

Fig. 4 is the schematic diagram of DSCH " capacity allocation (CAPACITY ALLOCATION) " control frame structure;

Fig. 5 is the schematic diagram of HS-DSCH " capacity allocation " control frame structure;

Fig. 6 illustrates among Fig. 2 in a priority based on normalized data transfer rate and the normalized transmission rate ratio of having sent, selects suitable business to carry out the flow chart of transmitting step;

Fig. 7 illustrates the professional further classification in the same priority, thereby packet scheduling of the present invention and flow control methods is carried out the schematic diagram of improved principle;

The sign indicating number resource-sharing that Fig. 8 illustrates the HS-DSCH channel distributes schematic diagram;

Fig. 9 illustrates the emulation schematic diagram of the integral density estimation of the capacity of various grouping scheduling methods under the channel conditions stable condition;

Figure 10 illustrates the emulation schematic diagram of the integral density estimation of the capacity of various grouping scheduling methods under the channel conditions mal-condition;

Figure 11 illustrates the emulation schematic diagram of the capacity integral density estimation of mixed scheduling method under the different capacity controlling level;

Figure 12 illustrates the emulation schematic diagram that the power controlling level is estimated in the capacity integral density of 0.6 time three kinds of dispatching method; And

The emulation schematic diagram that the integral density of the capacity of the following three kinds of grouping scheduling methods of channel conditions stable condition was estimated when Figure 13 illustrated two priority;

The emulation schematic diagram that compares the integral density estimation of the capacity of three kinds of grouping scheduling methods under the harsh conditions when Figure 14 illustrates two priority at channel conditions; And

After adopting power control mechanism when Figure 15 illustrates two priority, the emulation schematic diagram that the integral density of the capacity of three kinds of grouping scheduling methods is estimated.

Embodiment

By the patent application (applying date: 2004 year July 28 day, application number: the general cache management and the flow control methods that 200410053211.8) in have proposed a kind of be applied to WCDMA system MAC protocol layer of same applicant to Patent Office of the People's Republic of China's being entitled as of submitting " flow control methods and device of broadband CDMA system medium input key-course ".This method is incorporated the application as a reference into.

At the grouping scheduling method of shared channel (DSCH/HS-DSCH), to consider the principle of the following aspects at least:

1. the issue of priority between the different business, different priority mainly is reflected on the different service quality (QoS);

2. under the precondition of same priority, the fairness problem of miscellaneous service, promptly system will guarantee as far as possible, in section sometime, each professional transmission capacity that obtains is identical, promptly satisfies following expression formula

$\&ForAll;i,j\&Element;B({\mathrm{<figure-callout\; id="1"\; label="t"\; filenames="S04153546X20040820E000101.png,S04153546X20040820E000131.png"\; state="\{\{state\}\}">t</figure-callout>}}_1,t_2),|\frac{W_i({\mathrm{<figure-callout\; id="1"\; label="t"\; filenames="S04153546X20040820E000101.png,S04153546X20040820E000131.png"\; state="\{\{state\}\}">t</figure-callout>}}_1,t_2)}{r_i}-\frac{W_j({\mathrm{<figure-callout\; id="1"\; label="t"\; filenames="S04153546X20040820E000101.png,S04153546X20040820E000131.png"\; state="\{\{state\}\}">t</figure-callout>}}_1,t_2)}{r_j}|\&RightArrow;\min ---\left(1\right)$

Wherein, B is the collection of services with same priority, [t ₁, t ₂] represent from t ₁To t ₂The time interval, r represents transmission rate, W _i(t ₁, t ₂) represent that i business is at the time interval [t ₁, t ₂] in the channel capacity that is allowed to.

3. system should optimize its throughput as much as possible, and this is because because transmission conditions difference separately, each user's of DSCH/HS-DSCH transmittability is different.Therefore, under the identical situation of other conditions, it is professional preferably that system should satisfy those transmission conditions as far as possible, to improve the throughput of whole system.

And the principle that the mechanism of the packet scheduling in same priority needs to consider is fair principle and capacity principle of optimality.To the eye, fair principle and capacity principle of optimality are conflicting, just can't satisfy capacity principle if promptly satisfied fair principle in the process of once selecting business, and the opposite is also true is like this.Thereby, a kind ofly take all factors into consideration above-mentioned two kinds of principles, and the dynamically fair performance in the balance sysmte and the grouping scheduling method of volumetric properties, be very important for the effective management and the control of Packet Service flow.

Packet scheduling and flow control methods at shared channel according to the present invention is a kind of packet scheduling and the flow control methods that can take into account fair performance and volumetric properties simultaneously, and its flow chart as shown in Figure 2.This flow process starts from step 201.In step 202, system will be divided into different priority from each Business Stream that MAC-d sends, and as a subclass, and be each priority assignment unit interval sheet with all business in each priority.According to relevant agreement, can be divided into 15 priority at most.Because each professional transmittability is different, therefore each business will take a buffer memory equipment, the management of this equipment is in full accord with the cache management and the controlling mechanism that provide in the aforementioned patent application document " flow control methods and the device of broadband CDMA system medium input key-course " with control, does not repeat them here.

For the unit interval sheet of each priority assignment equals a Transmission Time Interval, can be the different different unit interval sheets of priority assignment number according to the situation of priority.Priority is high more, and the unit interval sheet that occupies is many more, and promptly the service time of this priority correspondence is just long more.Define the summation of the service time that total time cycle period M occupies for all priority, as can be seen, the value same priority number of total time cycle period M is relevant.

After the step 202, flow process shown in Figure 2 enters step 203.In step 203, service time, timer was set to zero, and the calculation services time makes it to start from scratch.Afterwards, flow process enters step 204.In step 204, according to the service time of timer record service time this moment, determine this corresponding priorities as current priority service time, and the service time of definite current priority correspondence.Then, flow process enters step 205.In step 205, in the service time of current priority correspondence, in the professional subclass in the current priority of in step 204, determining, based on normalized data transfer rate and the normalized transmission rate of having sent than the mixing order that obtains, take all factors into consideration fair principle and capacity principle of optimality, the business of selecting to mix the order minimum is transmitted.

Afterwards, flow process enters step 206.In step 206, whether the service time of judging timer record service time this moment is more than or equal to total time cycle period M.When service time through judging timer record this moment during less than total time cycle period M, flow process then shown in Figure 2 is returned step 204, repeats to determine current priority and transmit the step of mixing the business of order minimum in this priority.When service time through judging timer record service time this moment during more than or equal to total time cycle period M, flow process then shown in Figure 2 enters step 207.In step 207, judge the business end of transmission whether all in each priority.When through judging business all during end of transmission, flow process ends at step 208.When the business in judging each priority not during end of transmission, then flow process is returned step 203, repeats timer zero setting step, recomputates service time, repeats above-mentioned professional transmitting step in a new time cycle period.

It should be noted that, the business of in a last time cycle period, not transmitted, will be in new time cycle period priority under should business prioritised transmission in corresponding service time, after treating its end of transmission, just the business of selecting to mix the order minimum according to step 205 in the remaining business of current priority is transmitted.

The method of the aforementioned definite current priority wheel disc method of being known as in the present invention.The method that transmission has a service with different priority levels in the prior art is after the business of having transmitted in the higher priority, begins to transmit the business in the lower priority again.The problem that this method causes is to make the business in the lower priority may wait for that long time also can not get handling, and may be dropped because of waits for too long.And according to the wheel disc method in packet scheduling of the present invention and the flow control methods, when considering each priority, also considered fairness, overcome effectively because of priority more, the defective that the traffic handling time that priority is lower obviously lags behind.

But, be to be understood that, packet scheduling of the present invention and flow control methods also can use the method for these existing definite priority, and after determining current priority according to these methods, at this current priority, carry out above-mentioned take all factors into consideration fair principle and capacity principle of optimality, the step 205 that the business of selection mixing order minimum is transmitted.

In the step 202 of Fig. 2 be each priority assignment unit interval sheet schematic diagram as shown in Figure 3.As seen from Figure 3, the unit interval sheet that takies for all priority of total time cycle period M is the summation of Transmission Time Interval.The priority difference, the unit interval sheet that takies can be different, then the service time of each priority just different, thereby the value of total time cycle period M is also just different thereupon.In the present embodiment, it is i that the timeslice number that priority i occupies is set, and the priority number is 15, and then total time cycle period M is

$M=\underset{i=1}{\overset{15}{\mathrm{\&Sigma;}}}i---\left(2\right)$

It needs to be noted in the flow control frame " capacity allocation (CAPACITY ALLOCATION) " of DSCH/HS-DSCH, two special parameters " the DSCH/HS-DSCH time interval (Interval) " and " DSCH/HS-DSCH repetition period (Repetition Period) " are arranged.The control frame structure as shown in Figure 4 for " capacity allocation (CAPACITYALLOCATION) " of DSCH.The control frame structure as shown in Figure 5 for " capacity allocation (the CAPACITY ALLOCATION) " of HS-DSCH.In the present embodiment, parameter " time interval " is the unit interval leaf length, the unit interval sheet number of the maximum that parameter " repetition period " then may be occupied for this business.

Below in conjunction with Fig. 6, how the step 205 that describes Fig. 2 in detail takes all factors into consideration fair principle and capacity principle of optimality in a priority, than the mixing order that obtains, the business of selecting to mix the order minimum is transmitted based on normalized data transfer rate and the normalized transmission rate of having sent.

Flow process shown in Figure 6 starts from step 601.In step 602, obtain each professional fairness order in the current priority.In the present embodiment, the professional number in this priority is N.Step 602 comprises that step 6021 is to step 6023.In step 6021, estimate each professional normalized data transfer rate W that sent _i:

$W_i=\frac{W_{\mathrm{hi}}}{W_{\mathrm{ti}}},i=1,...,N---\left(3\right)$

Wherein, W _iRepresent i professional normalized data transfer rate that sent in this priority, W _HiRepresent the data volume that this business has been transmitted, w _TiRepresent the data volume that this business is total, N represents total number professional in this priority.The data volume W that a business has been transmitted _HiRecord, can obtain by do mark in the exit of this professional buffer memory equipment, this is not difficult to realize for grouping busihess data.

Afterwards, step 602 enters step 6022.In step 6022, with N the W that estimates in the step 6021 _iSort from small to large, as the formula (4)

W _min(1)…≤W _m(i)…≤W _max(N) (4)

Wherein, (i) be m the professional normalized data transfer rate W that sent _mSequence number after sorted.Afterwards, step 602 enters step 6023.In step 6023, with each professional normalized data transfer rate W that sent _mSequence number after sorted is set to an order RW of this business _mBecause this order represents that a business has sent the size of data transfer rate in current priority, has reflected the fairness problem of each professional transmission situation in the current priority, therefore, claims that this order is the fairness order.In conjunction with above-mentioned formula (3) and (4) as can be seen, for a business, the data transfer rate that has sent is more little, and the fairness order that has is more little.

Afterwards, flow process shown in Figure 6 enters step 603.In step 603, use same criterion, the capacity problem of taking into account system obtains each professional capacity order in the priority.Step 603 comprises that step 6031 is to step 6033.In step 6031, estimate that each professional normalized transmission rate compares C _i:

$C_i=\frac{C_{\mathrm{ri}}}{C_{\mathrm{pi}}},i=1,...,N---\left(5\right)$

Wherein, C _iRepresent i professional normalized transmission rate ratio in this priority, C _RiBe the transmission rate of this business expectation, and C _PiBe the transmission rate that the transmission channel at professional i place can provide, N represents total number professional in this priority.

Afterwards, step 603 enters step 6032.In step 6032, with N the C that estimates in the step 6031 _iSort from small to large, as the formula (6)

C _min(1)…≤C _m(i)…≤C _max(N) (6)

Wherein, (i) be that m professional normalized transmission rate compares C _mSequence number after sorted.Afterwards, step 603 enters step 6033.In step 6033, each professional normalized transmission rate is compared C _mSequence number after sorted is set to another order RC of this business _mBecause this order is represented the size of transmittability in current priority of a business, has reflected each professional capacity problem in the current priority, therefore, claims that this order is the capacity order.In conjunction with above-mentioned formula (5) and (6) as can be seen, for a business, the transmittability of transmission channel is strong more, and its order is more little.

After the step 603, flow process enters step 604 among Fig. 6.In step 604, according to the fairness sum of ranks capacity order that step 602 and step 603 obtain respectively, professional mixing order in the definition same priority, and determine when this mixing order a hour corresponding service transmit.Step 604 comprises step 6041 and step 6042.In step 6041, according to the fairness sum of ranks capacity order that step 602 and step 603 obtain respectively, the mixing order R of m business in the definition same priority _m:

R _m＝α·RW _m+β·RC _m，m＝1，…，N (7)

Wherein, R _mBe m professional mixing order, RW _mBe fairness order, RC _mBe the capacity order.Then as can be seen, Ye Wu mixing order R by formula (7) _mBe the linear combination of this professional fairness sum of ranks capacity order.Utilize formula (7) at first to obtain the mixing order of all business in the current priority.

Afterwards, utilize following formula to determine to have the minimum order corresponding service R that mixes _j:

R _j＝min{α·RW _m+β·RC _m，m＝1，…，N} (8)

Wherein, R _jBe j professional mixing order, RW _mBe fairness order, RC _mBe the capacity order.In the present embodiment, definite business of mixing the order minimum is a j business.α, β are the weights coefficients of adjusting fairness sum of ranks capacity order, and they both can be adjusted at any time as requested, also can adjust dynamically according to the fairness and the volumetric properties of system.Such as, through the measurement in a time interval, its fairness of system discovery is constantly improving, and as cost, its volumetric properties is in continuous variation, and then β's α descends according to suitable step-length according to suitable step-length rising.Should be noted that packet scheduling and the flow control methods at shared channel according to the present invention adjust the weights coefficient in any case, all is the fairness and the volumetric properties of taking into account system simultaneously, obtains optimum thereby make these two performances integrate.

After the step 6041, the step 604 of flow process shown in Figure 6 enters step 6042.In step 6042, j business of the definite mixing order minimum of step 6041 transmitted.Flow process shown in Figure 6 ends at step 605.

The step 602 that should be appreciated that aforementioned acquisition fairness order can be exchanged with the order of the step 603 of the capacity of acquisition order.Obtaining the step 602 of fairness order and the order of the step 603 of the capacity of acquisition order is not construed as limiting the invention.

It is pointed out that as previously mentioned, when business end of transmission not, and distribute to this business place priority service time then, then this business stops transmission.After treating that a new time cycle period begins, this not the business of end of transmission the priority under it was at first transmitted in corresponding service time.Have only when in the last time cycle period not behind professional all end of transmissions of end of transmission, and current priority is when still having residue corresponding service time, just according to the flow process shown in Fig. 6, the business of selecting to mix the order minimum in the current priority is transmitted.All professional all end of transmissions in current priority, and current priority is when still having residue corresponding service time, system will arrange to transmit the business in the next priority.

By the flow process that the business of selection mixing order minimum is transmitted in a priority shown in Fig. 6 as can be seen, might produce following problem according to packet scheduling of the present invention and flow control methods, promptly because the data volume that new business has sent is smaller naturally, system may always select these new business to transmit, and this will increase professional propagation delay time.For this reason, the present invention increases an improved step in flow process shown in Figure 4.Fig. 7 illustrates the professional further classification in the same priority, thereby packet scheduling of the present invention and flow control methods is carried out the schematic diagram of improved principle.

As shown in Figure 7, system is several time thresholds of traffic set in each priority according to class of business, i.e. " current time ", " professional leading time threshold ", " the professional time threshold that lags behind " and " time threshold that business abandons ".These thresholdings are three business in the zone with all delineations of activities in this priority: the business in the business in " professional leading zone ", the business in " professional normal region " and " the professional hysteresis region ".Simultaneously, be timer of each traffic set.When professional an arrival, the timer of this business correspondence is started the clock, and be " current time " this moment.According to above-mentioned time threshold determined that this moment, business was in " professional leading zone ".When business etc. is pending,, make the business that was in originally in " professional leading zone " enter " professional normal region " along with stand-by period of timer record surpasses " professional leading time threshold ".If the professional chief time can not get handling, just might enter " professional hysteresis region " from " professional normal region ", the rest may be inferred for other situation.Final service may be because waits for too long causes above " time threshold that business abandons " to be dropped., can at first handle the business that is in " professional normal region " and " professional hysteresis region " targetedly the further classification of business through like this.The method of taking is, only with the activation of service in " professional normal region " and " professional hysteresis region " and carry out aforementioned selection transmission process, and not activating business in " professional leading zone ", the business in " professional leading zone " just is activated after entering into " professional normal region " with the continuity of stand-by period.

Further, as the mixing order R of the several business that obtain by aforementioned formula (7) _mWhen equating, can also make the business in " professional hysteresis region " that higher selecting priority is arranged, thereby preferentially be transmitted; If these mix order R _mThe business that equates coexists one when regional, just makes a choice randomly according to the fairness doctrine.Such processing helps avoiding the professional processing time that lags behind long.

Traffic management and control method at shared channel DSCH/HS-DSCH according to the present invention used the thought of " order ", thereby combines the requirement to fairness and capacity effectively.In the prior art, because the unit of two index parameters of fairness and capacity is different with dimension, therefore they can't be considered simultaneously, as directly being weighted summation.And after having carried out the processing of " mixing order " statistic of proposing as the present invention, two performance index are converted into the statistic of nonparametric type by the statistic of parameter type, just can use the expressed criterion that comes out of formula (7) to finish grouping scheduling method professional in the same priority both balances are considered.

Said method all is identical for the DSCH in the MAC layer and two kinds of channels of HS-DSCH.For the scheduling and the controlling mechanism of flow, HS-DSCH is as good as with DSCH except having on the channelization code allocation the greater flexibility.Just for DSCH, because each the unit interval sheet on the wheel disc can only have a business in transmission, therefore the orthogonalization sign indicating number of this moment can only be taken alone by it.The orthogonalization sign indicating number of this moment then can be shared by two even a plurality of business for HS-DSCH.This just makes that being embodied in the wheel disc method especially highlightedly at improving one's methods of HS-DSCH characteristic determines on the current priority.

The sign indicating number resource-sharing that Fig. 8 illustrates the HS-DSCH channel distributes schematic diagram.In the present embodiment, the spreading factor of HS-DSCH channel is 16, and the physical channel yardage that it can take is 12.Unlike the DSCH channel, take alone by certain business, but from minimum priority, select a business earlier with limit priority, allow it have minimum available transmission rate, simultaneously the business of giving that high priority with remaining sign indicating number resource.The result of this way is, actual priority number has reduced (because parallel service of high low priority), and then total cycle period of whole wheel disc reduced, and final result is the propagation delay time of having dwindled data.

The present invention in conjunction with the data dispatching method of Packet Service, has provided the scheduling and the control method of the data traffic of DSCH/HS-DSCH on the basis of patent application " flow control methods and the device of broadband CDMA system medium input key-course ".Application can obtain following effect according to packet scheduling of the present invention and flow control methods:

1. by the nonparametricization to the parametrization coefficient, reasonably fairness and the volumetric properties with grouping scheduling method combines as comprehensive Evaluation criterion.In addition, by the introducing of " activation of service ", alleviated delay time long phenomenon of transfer of data that other method may occur;

2. utilize " wheel disc method " that priority factors has been introduced among the whole group data dispatching method, replenished the deficiency of grouped data scheduling method,, established solid foundation for the traffic management of DSCH and HS-DSCH in the MAC layer and the foundation of controlling mechanism;

3. reduce the blocking rate of system, improve the resource utilization and the efficiency of transmission of system; And

4. in conjunction with the characteristics of orthogonal code resource-sharing among the HS-DSCH, reduce the cycle of wheel disc poll, reduced the time delay of transfer of data.

Fig. 9 to Figure 15 has provided fairness dispatching method (Round RobinScheduling), capacity scheduling method (C/I Scheduling) and in detail according to mixed scheduling method of the present invention simulation result under various conditions.

In the present embodiment, at first consider to have only the situation of a priority.In same priority, there are four streams professional, stream 1, stream 2, stream 3 and flow 4.On the DSCH channel, the predetermined transmission rate of each stream is 144kbit/s, and actual transmission rate 8,16,32,64,144,384,1024 and 2038kbit/s between with Gaussian statistics characteristic picked at random, the intensity of variation of transmission rate changes according to the condition of transmission channel and decides.Under the more stable situation of transmission channel conditions, fairness dispatching method, capacity scheduling method and as shown in Figure 9 according to the capacity characteristic of mixed scheduling method of the present invention.

Can clearly find out from Fig. 9,, between each stream good fairness is arranged, but its Capacity Ratio be less for fairness dispatching method; And for capacity scheduling method, it has good capacity characteristic, yet the fairness between each stream is very poor.And the mixed scheduling method that provides among the present invention all can compare favourably with above-mentioned two kinds of dispatching methods on fairness and capacity characteristic.

And poor in transmission conditions, promptly transmission rate changes under the more violent situation, and the capacity characteristic of various grouping scheduling methods as shown in figure 10.

The comparative result explanation of Fig. 9 and Figure 10, the volumetric properties of mixed scheduling method does not change with the variation of status transmission among the present invention, that is to say that its superperformance has generality preferably aspect channel condition.

In 3G (Third Generation) Moblie, for the DSCH channel, an important technology that is used to improve transmission performance be power control techniques (Power Control, PC); And, then adopt adaptive modulation and coding technology (AMC) for HS-DSCH.Be example with PC below, the capacity and the fair characteristic of the mixed scheduling method among the present invention is described.Power control is imitated with how much statistical properties.

Under different PC probability, as shown in figure 11 according to the comparative result of the volumetric properties of mixed scheduling method of the present invention and capacity scheduling method.As can be seen from Figure 11, mixed scheduling method according to the present invention is along with the continuous improvement of PC performance, and its capacity characteristic also constantly improves.This method explanation, mixed scheduling method does not change the transmission characteristic of dispatching method.And Figure 12 explanation, the adding of PC system does not change the good fair characteristic of mixed scheduling method.This presentation of results, mixed scheduling method according to the present invention is the same with additive method, can change the characteristic of its capacity by power control mechanism.

The situation of different priorities is shown below.In the present embodiment, set two priority, priority 1 and priority 2, priority 1 is lower than the priority of priority 2.Still there are 4 streams professional in each priority.According to aforementioned wheel disc method different priorities is dispatched processing in the emulation, priority 1 has a timeslice, and priority 2 has two timeslices.Other simulated conditions is identical with the same priority situation.Figure 13 is under the more stable condition of channel conditions, the capacity of various grouping scheduling methods and the comparison of fair characteristic.Therefrom we can obtain with above-mentioned same conclusion.And Figure 14 shows that in the channel conditions result under the harsh conditions relatively.

After adopting power control mechanism, the capacity characteristic of various dispatching methods as shown in figure 15.

Above-mentioned emulation has proved that this method all has good performance on capacity characteristic and fair characteristic, can successfully be applied among the engineering design of DSCH/HS-DSCH packet scheduling and flow control.

Do not depart from the scope of the present invention and conceive, can make multiple change and distortion the present invention.The invention is not restricted to previous embodiment.Scope of the present invention is limited by appended claims.

Claims (14)

1. one kind is applicable to packet scheduling and the flow control methods of sharing transmission channel in the Radio Access Network, and described packet scheduling and flow control methods comprise the steps:

Obtain each professional fairness order waiting for transmission;

Obtain described each professional capacity order waiting for transmission;

Obtain the mixing order of described each business according to the described capacity order of described fairness sum of ranks; And

Select the business of described mixing order minimum to transmit,

Wherein, advance the fairness order and reflected described each professional fairness characteristic, connect the capacity order and reflected described each professional capacity characteristic:

Wherein, described acquisition each professional fairness order step waiting for transmission comprises the steps: to estimate each professional normalized data volume that sent waiting for transmission in the described shared transmission channel; With described each professional normalized data volume ordering that sent; And sequence number that will be after sorted is respectively as described each professional fairness order,

Wherein, described each the professional capacity order step waiting for transmission of described acquisition comprises the steps: to estimate each professional normalized transmission rate waiting for transmission in the described shared transmission channel; With the normalized transmission rate ordering of described each business, and sequence number that will be after sorted is respectively as described each professional capacity order,

Wherein, described mixing order is the linear combination of the described capacity order of described fairness sum of ranks.

2. according to described packet scheduling and the flow control methods of sharing transmission channel in the Radio Access Network that be applicable to of claim, wherein, described each professional normalized data volume that sent is:

$W_i=\frac{W_{\mathrm{hi}}}{W_{\mathrm{ti}}},i=1,...,N$

Wherein, W _iRepresent i professional normalized data volume that sent in described each business, W _HiRepresent the data volume that this business has been transmitted, W _TiRepresent the data volume that this business is total, N represents the total number of described business waiting for transmission.

3. packet scheduling and the flow control methods of sharing transmission channel in the Radio Access Network that be applicable to according to claim 1, wherein, described each professional normalized transmission rate is:

$C_i=\frac{C_{\mathrm{ri}}}{C_{\mathrm{pi}}},i=1,...,N$

Wherein, C _iRepresent i professional normalized transmission rate in described each business, C _RiBe the transmission rate of this business expectation, and C _PiBe the transmission rate that the transmission channel at professional i place can provide, N represents the total number of described business waiting for transmission.

4. packet scheduling and the flow control methods of sharing transmission channel in the Radio Access Network that be applicable to according to claim 3, wherein, described mixing order is the linear combination of the described capacity order of described fairness sum of ranks:

R _m＝α·RW _m+β·RC _m，m＝1，…，N

Wherein, R _mBe m professional mixing order, RW _mBe fairness order, RC _mBe the capacity order, N represents the total number of described business waiting for transmission, and α, β are the weights coefficients of adjusting fairness sum of ranks capacity order.

5. packet scheduling and the flow control methods of sharing transmission channel in the Radio Access Network that be applicable to according to claim 4, wherein, the weights coefficient of the described capacity order of described fairness sum of ranks is adjusted or is adjusted dynamically according to the fairness and the volumetric properties of system according to system requirements.

6. according to each described packet scheduling and flow control methods of sharing transmission channel in the Radio Access Network that be applicable to of claim 1 or 5, also comprise the steps:

Each delineation of activities waiting for transmission is different priority in the transmission channel with sharing, and is each priority assignment service time;

Determine that current service time corresponding priorities is as current priority;

It is characterized in that, each business in the current priority as described each business waiting for transmission, is selected wherein to mix the business of order minimum, in the described service time of distributing to current priority, transmit.

7. packet scheduling and the flow control methods of sharing transmission channel in the Radio Access Network that be applicable to according to claim 6, wherein, described be each priority assignment step service time with a Transmission Time Interval as a unit interval sheet, be each priority assignment unit interval sheet according to the height of the preferential utmost point.

8. packet scheduling and the flow control methods of sharing transmission channel in the Radio Access Network that be applicable to according to claim 7, wherein, being linked as each priority assignment step service time also distributes to total sum service time of each preferential utmost point and is set to a total time cycle period.

9. packet scheduling and the flow control methods of sharing transmission channel in the Radio Access Network that be applicable to according to claim 8, wherein, described definite wherein professional priority to be transmitted comprises the steps: for the current priority step

Start timer; And

According to company timer record time and describedly be to determine wherein professional current priority to be transmitted the service time of each priority assignment.

10. packet scheduling and the flow control methods of sharing transmission channel in the Radio Access Network that be applicable to according to claim 9, wherein, in the described service time of distributing to this priority not the business of end of transmission will be in the total time cycle period of the next one at first transmission in service time of priority correspondence under should business.

11. packet scheduling and the flow control methods of sharing transmission channel in the Radio Access Network that be applicable to according to claim 10, wherein, when a professional end of transmission, and when the service time of the current priority correspondence under should business residue being arranged, carry out and in described current priority, select the step of mixing the professional of order minimum and transmitting.

12. packet scheduling and the flow control methods of sharing transmission channel in the Radio Access Network that be applicable to according to claim 11, wherein, the professional all end of transmissions of in described current priority all, and when the service time of described current priority correspondence residue being arranged,, carry out and in described current priority, select to mix the business of order minimum and the step of transmitting as each business waiting for transmission with each business in next priority.

13. packet scheduling and the flow control methods of sharing transmission channel in the Radio Access Network that be applicable to according to claim 6, also comprise the steps: each business in the described current priority is waited for that according to this business arrival back the length in processing time further is divided into different processing ranks, make long business of stand-by period preferentially be selected and transmission process by priority activation.

14. packet scheduling and the flow control methods of sharing transmission channel in the Radio Access Network that be applicable to according to claim 13, wherein, from minimum priority, select a business earlier at the high speed descending sharing channel in the described shared transmission channel, allow it have minimum available transmission rate, simultaneously the business of giving higher priority with remaining sign indicating number resource.

Images