CN101582843B - Admission control and resource allocation in communication system supporting quality of service - Google Patents

Abstract

A method and apparatus for admission control in a communication system. An Access Network (AN) element determines available resources. When available resources are sufficient to support the requirements of a requested application flow, the AN admits the application flow. The AN periodically, and on trigger events, updates a measure of available resources. The admission control may operate in coordination with a scheduler applying a compensation factor to each flow type, and a compensation factor for aggregate flows of a given user.

Description

Allowing in the communication system of support service quality enters to be controlled and resource distribution

The application is to be application number the dividing an application for the Chinese patent application of " support allowing enter in the communication system of service quality control and resource distribution " that be No. 200480010998.8 denomination of invention on March 17th, 2004 applying date.

According to the priority request of 35U.S.C. § 119

Present patent application requires to transfer assignee of the present invention's the temporary patent application the 60/455th that is entitled as " System for Allocating Resources in a Communication System " of submitting on March 17th, 2003, the priority of No. 906, and be therefore incorporated to for referencial use here.

Background

1. invention field:

The present invention relates to communication system.Especially, these embodiment are for allocate communications resource between a plurality of users of a communication system.

2. relevant technologies:

Provide some schemes and solved the problem that the limited communication resource that between a plurality of users, the individual node in communication system provided distributes.A target of this type systematic is to provide enough resources at each Nodes, with meet all users demand and simultaneously by cost minimization.Thus, normally with between each user effectively the target of Resources allocation design this type systematic.

Various systems have realized frequency division multiple access (FDMA) scheme, this scheme by resource concurrence distribute to each user.Communication node in this type systematic is conventionally put at any time to each user in network and is sent information or be limited from the bandwidth that each user receives information.This scheme is usually directed to the different piece of total bandwidth to distribute to unique user.Although require there is interference-free system of communicating by letter with communication node for user, this scheme may be effectively, when this type of continue, interference-free communication is when also nonessential, to total bandwidth, better utilization can realize.

Other distributes the scheme of the communication resource of single communication node to comprise time division multiple access (TDMA) scheme between a plurality of users.In the situation that user requires with single communication node, do not have lasting, interference-free communication, these TDMA schemes are effective especially when distributing the finite bandwidth resource of single communication node between a plurality of users.TDMA scheme, conventionally by the time interval of appointment, makes whole bandwidth of single communication node specialize in each user's use.In the wireless communication system of employing code division multiple access (CDMA) scheme, this can, by time division multiplexing basis, distribute to each user by the time interval of appointment by all Code Channel and realize.Communication node is realized the unique carrier frequency or the channel code that are associated with user and is carried out proprietary communication with permission with this user.TDMA scheme also can be used the exchange of physical contact relaying or packet switching to realize in land line systems.

Tdma system is distributed to each user by the equal time interval conventionally in a looping fashion.This may cause the insufficient utilization of certain user to some time interval.Similarly, other user may have the demand to the communication resource that surpasses the time interval distribute, and these users can not be met.Systems Operator can select the cost of burden increase node bandwidth to guarantee not having user to be not being met, or allows the user who is not being met to continue the state that maintenance is not being met.

Thus, need to provide a kind of according to a kind of between user the network strategy of allocate communications resource, the system and method for allocate communications resource effectively and liberally between the user of communication network.Be unanimously with it, the number of users that system need to be served maximizes, and includes, but are not limited to, provide the various specific requirements in response to system, restriction and/or target, on the basis of every flow process and/or the mechanism of carrying out resource distribution on the basis adding up to.Need in addition allowing to enter and control and preemption method resource allocation optimization.

Accompanying drawing summary

Fig. 1 illustrates a kind of communication network according to an embodiment of the invention.

Fig. 2 A illustrates the base station controller of configuration according to one embodiment of present invention and the block diagram of base station equipment.

Fig. 2 B illustrates the block diagram of the remote station apparatus of configuration according to one embodiment of present invention.

Fig. 3 is illustrated in the flow chart of carrying out a kind of dispatching algorithm in the embodiment of the channel scheduler shown in Fig. 2 A.

Fig. 4 is a kind of communication system of supporting multimedia application, and wherein each interapplication communications is represented by an application flows.

Fig. 5 is an application flows queue.

Fig. 6 is a sequential chart, describes the signal timing of a part for an application flows.

Fig. 7 A is a sequential chart, describes the jitter measurement to an application flows.

Fig. 7 B is a sequential chart, is described as processing an application flows, sends continuous IP grouping during some time slots.

Fig. 8 is a flow chart, is described in a kind of communication system some application flows are dispatched.

Fig. 9 is a flow chart, describes some application flows with different service quality (QoS) requirement are dispatched.

Figure 10 be one according to the system assumption diagram of an embodiment, the definition of each application flows that application flows is consistent with a kind of dispatching algorithm is shown.

Figure 11 is according to the table of the type of an embodiment discriminator.

Figure 12 A describes according to a part for a kind of dispatching algorithm of an embodiment, comprises the initialization of application programs flow process.

Figure 12 B describes according to a part for a kind of dispatching algorithm of an embodiment, comprises according to the processing of the type application programs flow process of class.

Figure 12 C describes according to a part for a kind of dispatching algorithm of an embodiment, comprises to the processing of the application flows of pattern I, to the processing of the application flows of pattern II and the processing to the application flows of pattern III.

Figure 12 D describes according to a part for a kind of dispatching algorithm of an embodiment, comprises the processing to the application flows of pattern I.

Figure 12 E describes according to a part for a kind of dispatching algorithm of an embodiment, comprises adaptive weighted and take it as basic scheduling.

Figure 13 illustrates a kind of base transceiver systems (BTS), carrys out the algorithm of scheduling application flow process for realize the adaptive weighted algorithm of a kind of use at wireless communication system.

Figure 14 is a sequential chart, and mapping is such as data transfer rate (L _mAX), the maximum resource such as reservation of resource (Res (t)) and available resources (Avail (t)) is as the function of time.

Figure 15 is a sequential chart, and the request of data that the user of mapping from High Rate Packet Data type system receives and the computational estimation competence L (t) that will retain at time t are as the function of time.

Figure 16 is an information flow chart, describes and to be used for supporting a plurality of schedulers with the High Rate Packet Data type system of the application flows that service quality (QoS) requires, and wherein these flow processs are that the compensation of every flow process of application is dispatched.

Figure 17 is an information flow chart, describes and to be used for supporting a plurality of schedulers with the High Rate Packet Data type system of the application flows that service quality (QoS) requires, and wherein these flow processs application add up to compensation to dispatch.

Figure 18 A illustrates a kind of algorithm that allows to enter control in supporting a plurality of High Rate Packet Data type systems with the application flows that service quality (QoS) requires to 18E.

Figure 19 illustrates and is a kind ofly supporting a plurality of algorithms that carry out preemption in having the High Rate Packet Data type system of the application flows that service quality (QoS) requires.

Figure 20 is the block diagram of supporting a kind of access network (AN) in a plurality of High Rate Packet Data type systems with the application flows that service quality (QoS) requires.

Specifically describe

Each embodiment of the present invention is directed to system and the equipment of Resources allocation between a kind of a plurality of users that served by single communication node in communication network.At independent discrete transmission intercal, or claim " service intervals ", take to all other users of unique user repulsion the limited resources of communication node.Weights based on being associated with unique user or score, unique user is selected to take this limited resources.Preferably to the change of the weights that are associated with unique user, be, can consume the momentary rate of these limited resources based on this unique user.

With reference to accompanying drawing, Fig. 1 represents a kind of communication system of exemplary variable bit rate.This type systematic is transferring the U.S. Patent application the 08/963rd that is entitled as " Method and Apparatusfor High Rate Packet Data Transmission " (method and apparatus of high-speed transmission block data) of submitting on November 3rd, 1997 of Qualcomm Co., Ltd, in No. 386 the United States Patent (USP) of on June 3rd, 2003 bulletin (are now No. 6574211), describe, and be incorporated herein by reference here.Variable rate communication system comprises a plurality of unit 2A-2G.Each unit 2 is by 4 services of a corresponding base station.Each distant station distributes and spreads all over this communication system.In this exemplary embodiment, each distant station 6 is communicated by letter with a base station 4 at the most on the forward link with transfer of data interval arbitrarily.For example, at time slot n on the forward link, base station 4A is exclusively to distant station 6A transmission data, and base station 4B is exclusively to distant station 6B transmission data, and base station 4C sends data to distant station 6C exclusively.As shown in Figure 1, preferably each base station 4 is transmitted data at any given time to a distant station 6.In other embodiments, can communicate by letter with more than one distant station 6 at particular data transmission interval in base station 4, repels all other distant stations 6 that are associated with base station 4 simultaneously.In addition, data transfer rate is variable, and in one embodiment, data transfer rate is to depend on the measured Carrier interference ratio in receiving remote station 6 (C/I), and the energy per bit noise ratio (E requiring _b/ N ₀).For simplicity, in Fig. 1 not shown from distant station 6 to base station 4 backward link.According to an embodiment, distant station 6 is the mobile units with the wireless transceiver being operated by wireless data service user.

A kind of block diagram of basic subsystem of exemplary variable rate communication system is shown shown in Fig. 2 A-2B.Base station controller 10 joins with all base stations 4 (for simplicity, a base station 4 being only shown in Fig. 2) in packet network interface 24, PSTN (PSTN) 30 and communication system.Distant station 6 in base station controller 10 coordinating communication networks be connected to communicating by letter between other user of packet network interface 24 and PSTN30.PSTN30 joins with user by standard telephone network (not shown in Fig. 2).

Base station controller 10 comprises many selector elements 14, although for simplicity, only illustrates one in Fig. 2 A.Each selector element 14 is assigned to control the communication between one or more base stations 4 and a distant station 6.If selector element 14 is not assigned to distant station 6, notification call control processor 16 has the needs of paging distant station 6.Call control processor 16 assigns base station 4 to carry out paging distant station 6 immediately.

Data source 20 comprises the mass data that will be transferred to distant station 6.Data source 20 offers packet network interface 24 by data.Packet network interface 24 receives data, and data are sent to selector element 14.Selector element 14 transfers data to each base station 4 of communicating by letter with distant station 6.In this exemplary embodiment, Yi Ge data queue 40 is safeguarded in each base station 4, and its storage will be transferred to the data of distant station 6.

Data are that the form with packet is transferred to element in channel 42 from data queue 40.In this exemplary embodiment, on the forward link, " packet " refers to a certain amount of data, and it is at most 1024, and will within one " time slot " (such as 1.667 milliseconds of ≈), be transferred to target remote station 6.For each packet, element in channel 42 is inserted essential control field.In this exemplary embodiment, element in channel 42 is carried out CRC coding by packet and control field, and inserts one group of code tail bits.Packet, control field, CRC parity check bit and code tail bits form the grouping of format.In this exemplary embodiment, element in channel 42 is encoded to formatted grouping immediately, and by the intersymbol error in the grouping of having encoded (or rearrangement).In this exemplary embodiment, with the staggered processing of Walsh code coverage, divide into groups, also with short PNI and PNQ code, the grouping of the staggered processing of warp expanded.The data of having expanded are provided for RF unit 44, and it carries out quadrature modulation, filtration and amplification to signal.Forward link signal is to transmit in air by the antenna 46 on forward link 50.

At distant station 6, forward link signal is received and is sent to the receiver of front end 62 inside by antenna 60.Receiver to signal filter, amplification, quadrature demodulation and quantification.Digitized signal is provided for demodulator (DEMOD) 64, at this place, with short PNI and PNQ code, goes expansion, and goes to cover with Walsh code.Demodulated data are provided for decoder 66, and it carries out the reversing function of the signal processing function that 4 places are done in base station, specifically deinterleave, decoding and CRC check function.Decoded data are provided for data receiver 68.

Hardware supports as already pointed out is communicated by letter with other and is carried out the transmission of variable bit rate data, message communicating, voice, video on the forward link.The speed of the data of transmitting from data queue 40 changes to adapt to the signal strength signal intensity of distant station 6 and the variation of noisy environment.Preferably, each distant station 6 transmits a bit-rate control (DRC) signals at each time slot to the base station 4 being associated.DRC refers to a kind of controlling mechanism, and distant station is that forward link is determined desirable data transfer rate by this mechanism,, receives the data transfer rate of data at distant station place that is.Distant station, via DRC message, sends the desired data rate as data rate request or instruction to base station.Drc signal 4 provides information to base station, comprises the identity of distant station 6, and this distant station data queue that will be associated from it receives the speed of data.Thus, the circuit measuring signal strength signal intensity at distant station 6 places is also estimated the noisy environment at distant station 6 places, to determine the rate information that will transmit in drc signal.

The drc signal that each distant station 6 transmits is advanced along backward link channel 52, and 4 places are received by antenna 46 and RF unit 44 in base station.In this exemplary embodiment, DRC information is demodulated in element in channel 42, and is provided for the channel scheduler 12A that is arranged in base station controller 10, or offers the channel scheduler 12B that is arranged in base station 4.In the first exemplary embodiment, channel scheduler 12B is arranged in base station 4.In alternative embodiment, channel scheduler 12A is arranged in base station controller 10, and is connected to all selector elements 14 of these base station controller 10 inside.

In one embodiment, channel scheduler 12BCong data queue 40 receives the information that is designated as the data volume (also claiming queue size) that each distant station queues up.The queue size of each distant station that channel scheduler 12B serves based on DRC information and base station 4 is immediately dispatched.If the dispatching algorithm request queue of using in alternative embodiment is big or small, channel scheduler 12A can be from the information of selector element 14 receiving queue sizes.

Each embodiment of the present invention is applicable to support other hardware architecture of variable rate transmission.Can expand at an easy rate the present invention to cover the variable rate transmission on backward link.For example, base station 4 is not based on determining that from the drc signal of distant station 64 places, base station receive the speed of data, but the intensity of the signal that measurement receives from distant station 6 estimated noise environment are to determine the speed that receives data from distant station 6.6 transmission of distant station that base station 4 is associated to each immediately will from distant station 6s to the speed of the data of transmitting in link.Base station 4 immediately can be similar herein with regard to the described mode of forward link, and the data transfer rate based on different on backward link is dispatched the transmission on backward link.

Equally, the base station 4 CDMA scheme of embodiment discussed above, transmits to selected one or several distant station, repels all the other distant stations that are associated with this base station 4 simultaneously.At any special time, base station 4 is by using a kind of code of distributing to this reception base station 4, and selected one or several distant station 6 are transmitted.But the present invention is also applicable to other system, these systems provide data select some base stations 4 and repel other base station 4 simultaneously by different TDMA methods, so that transfer resource is carried out to optimized distribution.

On 12 pairs of forward links of channel scheduler, the transmission of variable bit rate is dispatched.Channel scheduler 12 receives indication will be to the queue size of the data volume of distant station 6 transmission, and from the message of distant station 6.Preferably, channel scheduler 12 logarithms are reportedly input into row scheduling, to realize the aims of systems that data throughout is maximized and observed fairness constraint simultaneously.

As shown in fig. 1, distant station 6 distributes and spreads all over communication system, and can communicate by letter with zero or a base station 4 on the forward link.In this exemplary embodiment, the forward link data transmission that channel scheduler 12 is coordinated in whole communication system.The United States Patent (USP) the 6th that a kind of dispatching method for high speed data transfer and equipment were authorized on January 1st, 2002, specifically describes in 335, No. 922, and this patent has transferred assignee of the present invention, and is incorporated herein by reference here.

According to an embodiment, channel scheduler 12 realizes in computer system, and this system comprises processor, random access memory (RAM) and for storing the program storage (not shown) of the instruction that will be carried out by processor.Processor, RAM and program storage can be taken by each function of channel scheduler 12.In other embodiments, processor, RAM and program storage can be for carrying out the part of shared computation resource for other function at base station controller 10 places.

Fig. 3 illustrates a kind of embodiment of dispatching algorithm, and 12 pairs of this algorithm control channel schedulers 4 are dispatched to the transmission of distant station 6 from base station.As discussed above, Yi Ge data queue 40 is associated with each distant station 6.Channel scheduler 12 makes each data queue 40 be associated with " weights " in the valuation of step 110 place, for the particular remote station 6 of selecting to be associated with base station 4, from receive data in service intervals subsequently.Channel scheduler 12 is selected single distant station 6, to receive transfer of data in discrete service intervals.In step 102, channel scheduler is each queue initialization weights that are associated with base station 4.

Channel scheduler 12 circulates from step 104 to 112 by transmission intercal or service intervals.In step 104, channel scheduler 12 determines whether due to being associated between another distant station 6 detecting in previous service intervals and base station 4, and has any other queue to add.Channel scheduler 12 is also carried out initialization to the weights that are associated with new queue in step 104.As discussed above, base station 4, by the interval such as rules such as time slots, receives drc signal from each distant station 6 associated with it.

This drc signal also provide information for channel scheduler in step 106, think that the distant station being associated with each queue determines the momentary rate of consumption information (or receive transmit data).According to an embodiment, from the drc signal of any distant station 6 transmission, indicate this distant station 6 to receive data with any one a plurality of effective data rates.

Based on being associated of distant station 6, receive the momentary rate (as indicated in the drc signal receiving recently) of data, channel scheduler 12 is determined the length of service intervals in step 108, during this service intervals, data are sent to any specific distant station 6.According to an embodiment, in step 106, receive the momentary rate R of data _idetermine the service intervals length L being associated with particular data queue _i.

Channel scheduler 12 selects particular data queue to transmit in step 110.The associated data amount sending is retrieved from data queue 40 immediately, and is provided for element in channel 42, the distant station 6 being associated for being transferred to Yu Gai data queue 40.As discussed below, channel scheduler 12 is selected for the queue of data is provided in step 110, this queue in ensuing service intervals with comprising that the information of each weights being associated with each queue transmits.The weights that are associated with transmitted queue are upgraded in step 112 immediately.

It will be understood by those skilled in the art that channel scheduler 12 can in all sorts of ways to realize, and can not depart from the present invention.For example, channel scheduler 12 can be with comprising processor, random access memory (RAM) and realizing for storing the computer system of the program storage (not shown) of the instruction that will be carried out by processor.In other embodiments, each function of channel scheduler 12 can be incorporated to shared computational resource, and this shared computational resource is also for carrying out other function at base station 4 or base station controller 10 places.In addition, for carrying out the processor of channel scheduler function, can be general purpose microprocessor, digital signal processor (DSP), programmable logic device, application-specific integrated circuit (ASIC) (ASIC), maybe can carry out the miscellaneous equipment of various algorithms described herein, and can not depart from the present invention.

As shown in the embodiment of Fig. 1, distant station 6 is mobile, and can change the association between different base station 4.For example, originally distant station 6F receives transfer of data from base station 4F.Distant station 6F may shift out subsequently the unit of base station 4F and move into the unit of base station 4G.Distant station 6F warns base station 4G with starting to transmit drc signal, rather than base station 4F.By no longer receiving drc signal from distant station 6F, the logical deduction distant station 6F at 4F place, base station has departed from and has not prepared to receive transfer of data again.The data queue being associated with distant station 6F is with being transferred to base station 4G via land line or RF communication link.

weighted scheduling algorithm

In addition, when transmitting multimedia service in wireless communication system or other have the service of various transmission requirements, have a problem, the multimedia service transmission that is wherein called " flow process " causes the paroxysmal traffic.The feature of the paroxysmal traffic, by some variable descriptions, comprises paroxysmal measuring and average data rate.In addition, need to meet the service quality of each (QoS) requirement in each flow process in system.Such as the general tolerance based on the ratio of throughput (being designated as " T ") being provided by requested data transfer rate (being called bit-rate control request of data or " DRC ") of the current dispatching method such as equitable proportion (PF) algorithm, select the flow process that will serve.This type of calculates and possibly cannot guarantee the QoS that all users are required.Therefore, pure PF algorithm may not provide enough complexities to meet the user's of access multimedia or other application program qos requirement.Need a kind of schedulers that can meet these different requirements.

The following cdma2000 of considering that support is served as the High Rate Packet Data (HRPD) described in IS-856 of discussing of attention.This system is to use as example.The present invention is applicable to select according to dispatching algorithm other system of the user that will serve.

In HRPD system, air interface can be supported nearly 4 parallel application flow.First stream carries signaling information, and other three streams can be used for carrying application program or other application program with different service quality (QoS) requirement.

For the purpose of the embodiment that clear understanding below presented, provide following vocabulary.Following vocabulary is not attempted exhaustive.Following vocabulary does not attempt the present invention to be limited to this, but provides for being aware and understand of the embodiment with regard to a kind of communication system of supporting weighted scheduling algorithm.

vocabulary

Access network (AN)-the provide network equipment of cellular network and packet switched data network (being often referred to internet) and AT data connectivity between any two.AN in HRPD system is equivalent to the base station in cellular communication system.

The equipment of user's data connectivity accesses terminal (AT)-is provided to.AT in HRPD system is corresponding to the mobile radio station in cellular communication system.AT can be connected to such as computing equipments such as laptop personal computer, or it can be such as self-contained data equipments such as personal digital assistants (PDA).

Application flows-be the specified transmission path from source to AT of given application flow.Each application flows is identified by source, object, traffic overview and service quality overview.

Application flow-corresponding to the data communication of an application program.Most of application flow have the quality of service requirement of appointment.

The generation of automatic repeat request (ARQ)-transmitter based on an event or do not occur and mechanism that initialization data transmits again.

Available resources (t): on forward link in the unconfined bandwidth of time t.

The average input data transfer rate of average data rate (r)-given application flows a period of time.

The average retardation bearing on a plurality of groupings of average retardation (AvgD)-from AN to AT or bit.

Sudden or the density of the packet in sudden (σ)-application programs flow process and the tolerance of time relationship.

The mechanism of the data transfer rate that bit-rate control (DRC)-AT asks to AN transmission.

Dificiency grouping (defpkts)-defined by flow process k in the beginning of time slot n.Dificiency grouping is the also not grouping of transmission on stream, and defpkts specific definition is for example, number over the grouping (, controlling the intermediate treatment groupings such as (MAC) grouping such as media interviews) of the equal sizes of the delay threshold value of flow process k in the BTS time of staying.

Dificiency position (defbits)-corresponding to the figure place of dificiency grouping.

Delay boundary conditions-fixed time that packet allows of transmission from AN to AT.

The function that postpones threshold value-Delay boundary conditions or shake border, for calculating defpkts.

The compensating factor of delay compensation factors (Ф)-violate for compensating delay.

The compensating factor that the request of data that DRC compensating factor (β)-take into account is associated with the user of application flows requires.For application programs, appropriately recover.

Enhancing dithering threshold (dv)-for calculating strengthening jitter compensation function when two that flow process detected the shake between IP grouping is violated in succession.

Each is used the initial weight of the application flows of weighted scheduling algorithm flow process weights (w)-be applicable to.Adaptive weight (aw) is the adaptation value of weights.

The transmission airlink of forward link (FL)-from AN to AT.

First grouping in file leader (HOL) grouping-queue.

High Rate Packet Data (HRPD)-with the data, services of high data rate transfers block data communication.Also referred to as High Data Rate (HDR), in the IS-856 standard that is entitled as " cdma2000 High Rate Packet Data Air InterfaceSpecification " (cdma2000 High Rate Packet Data air-interface standard), describe in detail.

Shake-received continuous grouping time between any two changes.

The border on shake border (j)-in the shake of given application flows.

Strengthen the jitter compensation factor (δ)-be the compensating factor of flow process compensate for jitter violation.

L _max-BTS can transmit the maximum rate (being for example, 2.4 mbit in cdma2000 1xEV-DO type network) of data on the forward link.

The estimation of statistic that the QoS of L (t)-based on previous the violates statistic relevant with network load to the forward link capacity retaining at time t.

The normalization dificiency grouping of the rate calculations of normalization dificiency grouping (ndefpkts)-ask by dificiency grouping and this flow process.

Normalization dificiency position (ndefbits)-corresponding to the normalization dificiency position of normalization dificiency grouping.

The agreement of Motion Picture Experts Group (MPEG)-transmitting multimedia material.

Unsettled grouping-pend _{k, j}the unsettled byte number of the IP of flow process k grouping j in BTS and BSC in [n]-time slot n.

The dispatching algorithm that the selection factor pair data communication that equitable proportion (PF) algorithm-basis is calculated for each AT the ratio of throughput by asked data transfer rate is dispatched.

Service quality (QoS)-relate to the requirement of block data communication transmission, includes but not limited to, delay, request rate and shake.

QoS and network building out function (Ф, γ, α, β, δ)-as the penalty function using in weighted scheduling algorithm.

Service quality group (QSG)-the have Application Type group of similar qos requirement.

The rate compensation factor (α)-violate the compensating factor calculate for compensate for rate.

Service speed (R) or the speed that speed (required_rate)-flow process is asked of asking.

Res (t): the bandwidth retaining at time t on forward link.

Resend the queue that resends of application flows that queue (Rx)-be stored as resends and dispatch.

The transmission airlink of backward link (RL)-from AT to AN.

Select to measure (Y)-for dispatching, determine to compare application flows tolerance used.

Sudden and tolerance data transfer rate of volume of traffic overview (σ, r)-relate to.

Transmit queue (Tx)-be the transmit queue of given BTS storage application flows.

The tolerance of the stand-by period of the inner file leader IP grouping of stand-by period parameter (γ)-AN.

adaptive weight is applied to proportional fair scheduling

For the forward link of cdma2000 1xEV-DO network has been described equitable proportion (PF) dispatching algorithm, it selects based on tolerance DRC/T the flow process that will serve.PF algorithm is designed to provide to each user the transmission time slot of about same number.For strengthening this dispatching algorithm, described herein is a kind of adaptive weighted DRC/T algorithm, and it is expanded and optimizes DRC/T algorithm to meet the different QoS requirement of dissimilar application program.Each multimedia application has respectively concrete separately qos requirement.The target of dispatching algorithm comprises and meets various qos requirements.Given adaptive algorithm (also referred to as self adaptation w*DRC/T algorithm), for application flows wherein comprises the forward link of the cdma2000 1xEV-DO network of multimedia application service, provides the performance advantage of the various DRC/T of being better than algorithms herein.Use adaptive algorithm, meet the delay and jitter border requirement of delay and jitter sensitive applications on cdma2000 1xEV-DO network forward link.In addition the average retardation that, adaptive scheduling algorithm guarantees to meet rate requirement and reduces multimedia application.Although provide multimedia application that adaptive scheduling algorithm's realization is described as example, method and apparatus described herein has the application program of qos requirement or associated with it quantized requirement applicable to other.

For have the application program that speed and stand-by period require such as network browsing and game etc., adaptive scheduling algorithm provides speed to guarantee and reduces average retardation.For other, only there is the application program of rate requirement, can meet speed with weighted scheduling algorithm and guarantee.When providing these QoS to guarantee, weighted scheduling algorithm also acts on total throughout is maintained to rationally high grade, and realizes the total throughout reaching close to when using pure PF dispatching algorithm.Pure PF dispatching algorithm refers to the algorithm that uses DRC/T to calculate.In the flow process extra resource that has QoS to violate, weighted scheduling algorithm distributes available resources in fair mode.The various compensation mechanism consistent with it are provided herein.

Fig. 4 illustrates the system 800 of supporting multimedia application.Again note, the present invention is applicable to have other system of qos requirement.System 800 comprises the multimedia sources 802 that is coupled to packet data serving node (PDSN) 806.PDSN806 is also coupled to base station controller (BSC) 804, and base station controller 804 can comprise a plurality of BSC.BSC804 communicates by letter with each AT 812,814,816,818 etc. via base transceiver systems (BTS) 808,810.System 800 can comprise than the more BTS of diagram and AT.Illustrate three flow processs: article one flow process is from multimedia sources 802 via PDSN806, BSC804 and BTS808, to AT812; Second flow process is from multimedia sources 802 via PDSN806, BSC804 and BTS810, to AT816; Article three, flow process is from multimedia sources 802 via PDSN806, BSC804 and BTS810, to AT818.Note an object that AT can be many flow processs.In one example, the transmission of Motion Picture Experts Group (MPEG) types of applications is divided into independent flow process by Voice & Video.

Each application flows that will transmit in system 800 has: the source address being associated; Destination address; And qos requirement.Just the transmission application programs flow process from source to object is dispatched immediately.Application flows is through being similar to the path shown in Fig. 4.

Each BTS 808,810 is applicable to safeguard flow process queue as shown in Figure 5.Note, each BTS safeguards corresponding to one of each application flows on its forward link (FL) and forms a team to be listed as.An application flows is directed to an AT.But, notice that many flow processs can be directed to an AT.Every flow process all has a service quality group associated therewith (QSG) type.Each QSG is defined by one group of qos parameter.Every flow process of a certain given QSG has concrete value corresponding to each parameter in group.For example, a QSG can be defined by the group that comprises delay and jitter.There is which flow process of this QSG by the requirement of specifying for delay and jitter.For every flow process in queue, BTS safeguards the group that comprises following three independent queues: (1) original transmitted queue (Tx); (2) transmit queue (Rx) again; (3) automatic repeat request queue (ARQ).In one embodiment, ARQ queue can be corresponding to the queue that such as previous decision-making ARQ etc. is the repeat mechanism Stored Procedure of any type performed between BTS and AT.Multimedia application can comprise the application program to delay-sensitive such as video conference etc. with Delay boundary conditions requirement.Delay boundary conditions is from AN, to be transferred to AT to receive the fixed time allowing.The average retardation that the IP grouping that adaptive weighted algorithm is devoted to meet Delay boundary conditions requirement and reduce this type of application program stands.For the application program simultaneously with speed and average retardation requirement, adaptive weighted algorithm is devoted to meet rate requirement and is reduced average retardation.

For another of the application program such as some types such as multimedia video application programs, consider that item is " shake " standing between grouping continuous in multimedia transmission.Shake refers to that the received grouping time between any two changes.When continuous wave is a little earlier or slightly late while reaching receiver, shake.In radio communication, this type of waveform transmits logical one or 0 conventionally, and they are decoded at receiver place immediately.The time that is defined as shake changes the visual effect generation distortion that makes received transmission.Weighted scheduling algorithm reduces the delay variation of worst case, and the delay variation between grouping in succession to the application program of delay-sensitive.

When meeting each user's qos requirement, adaptive algorithm is also designed to when " unanimously ", meet the rate requirement of those flow processs when some application flows.If application flows sends data according to preassigned traffic overview, be called " consistent ".If it is inconsistent to have the flow process of rate requirement, that is, the data that they send are preassigned more than institute in its traffic overview, and this algorithm has higher priority the flow process of lower data rate.Although describe adaptive weighted algorithm herein in the context of cdma2000 1xEV-DO, these concept and methodologies are also applicable to the wireless network of other type.

With regard to multimedia application flow process, every flow process is defined by the following: (1) traffic overview; (2) QoS overview; (3) Internet Protocol (IP) source address; (4) IP destination address.Flow process also can comprise: (5) L4 protocol type; (6) L4 port numbers; (7) L4 destination slogan, wherein L4 refers to transmission control protocol (TCP)/User Datagram Protoco (UDP) (UDP) layer in protocol stack.For example, the mpeg audio corresponding to a MPEG application program and MPEG video can be considered as to two independent flow processs.

Every flow process is all specified by traffic overview, and come under observation or shaping consistent with this traffic overview to guarantee it.Traffic overview is by the variable that is designated as the paroxysmal tolerance of expression of σ, and is designated as the flow process average data rate definition of r.Therefore, every flow process is described by traffic overview (σ, r).QoS overview at least one definition in following parameter: (1) is designated as the Delay boundary conditions of " D ", the time that its definition IP grouping allows from being transferred to reception.For multimedia application flow process, system can specified delay border.For such as some other application flows such as network browsings, system can specify average retardation (AvgD) to replace or complementary delay border; (2) be designated as the shake border of " j ", it is defined in the grouping maximum admissible time variation between any two that AT place receives; (3) be designated as the service speed (request rate) of " R " or " req_rate ".

For definition Delay boundary conditions D, with reference to figure 6, it is the sequential chart that comprises each AN element and an AT.Multimedia flow process is transferred to AT from multimedia sources (not shown) via PDSN, BSC and BTS.An IP is grouped in time t ₀from PDSN, send, and at time t ₃at AT place, receive.Parameter D definition is from time t ₀to time t ₃maximum can allow the time, that is, D specifies t ₃-t ₀restriction.

For definition shake border j, with reference to figure 7A, it is the sequential chart that comprises some AN elements and an AT.First is grouped in time t ₁from PDSN, send, and at time t ₁' at AT place, receive.Second is grouped in time t ₂from PDSN, send, and at time t ₂' at AT place, receive.Shake border j definition grouping maximum admissible variation between any two continuously, wherein changes and is given as (t ₂'-t ₁')-(t ₂-t ₁).Fig. 7 B is described in further detail some continuous IP packets of transmitting on some time slots.

In one embodiment, QoS overview is in groups classified, is called QoS dispatch group (QSG).Table 1 has been listed these classifications.

Table 1

Index	Delay boundary conditions (D)	Shake border (j)	Service speed (R)	Average retardation (AvgD)	Application program example
						1	X	X	X	-	MPEG meeting, VoIP, video flowing
2	-	-	X	X	Network browsing
						3	-	-	X	-	FTP
4	-	-	-	-	Best effort type

Fig. 8 illustrates the processing to flow process according to weighted scheduling algorithm.Flow process 900,902,904 and 906 is processed by the scheduling unit 908 that is labeled as " S ".A kind of weighted scheduling algorithm of scheduling unit 908 application is wherein that every flow process is used QSG overview.The identification of QSG overview is for calculating as detailed below the variable of adaptive weight.Scheduling unit 908 outputs to selected AT with being about to scheduled transmission 910.

Description is called the PF dispatching algorithm of DRC/T algorithm, and wherein each grouping is classified into m queue, for example Q1, Q2 ..., Qm.Make DRC[k, n] be the DRC by mobile radio station request, corresponding to the flow process k of time slot n.Scheduler selects to have the flow process of the highest selectance value, wherein:

$Y[k,n+1]=\mathrm{DRC}[k,n+1]/T_k[n+1],\∀k,\∀n.---\left(1\right)$

Y[k, n+1] be the selection tolerance of queue Qk in time slot (n+1), and

$T_k[n+1]=(1-\frac{1}{t_c})T_k\left[n\right]+\frac{1}{t_c}R[k,n],---\left(2\right)$

$\frac{1}{t_c}\≤1$ , and

0<1/t _c (3)

As used herein, t _cit is calculating mean value time constant used.

self adaptation w*DRC/T algorithm

In one embodiment, be called the weighted scheduling algorithm of " self adaptation w*DRC/T " algorithm, to every flow process, distribute an initial weight.Suppose that the initial weight of distributing to flow process k is designated as w _k, the DRC corresponding to time slot n flow process k being asked by AT is DRC[k, n].Self adaptation w*DRC/T algorithm is tolerance below every flow process k calculates at each time slot n:

Y _k[n]＝aw _k[n]*DRC _k[n]/T _k[n] (4)

Herein, the throughput T of flow process k and time slot n _k[n] be as in PF algorithm for DRC/T defined.As used in weighted scheduling algorithm, aw _k[n] is that flow process k is at the adaptive weight of time slot n.Self adaptation w*DRC/T dispatching algorithm is with several modes work, and wherein pattern is defined by QSG.Flow process k is at the adaptive weight aw of time slot n _k[n] is scheduler pattern and one group of selected strategy or machine-processed calculating the based on as described below.Attention will be every flow process calculation equation (4), wherein will calculate adaptive weighting according to the formula that is specific to every flow process.In other words, this dispatching algorithm is considered the QoS overview of given flow process, and constructs the calculating to the adaptive weight of this flow process by this QoS overview.In this way, there are the different flow processs that different QoS requires and can there is the adaptive weight differently calculating.Next this dispatching algorithm selects to have maximum Y _kthe flow process of [n] value to serve in time slot n.

Self adaptation w*DRC/T scheduler is with following work pattern:

Pattern I[aw*DRC/T] (r, d, j): for delay and jitter sensitive applications designs, delay and jitter border is had and is strict with and requires certain minimum-rate.

Pattern II[aw*DRC/T] (r, d): for thering is the application program of average retardation and rate requirement.

Pattern III[aw*DRC/T] (r): for the application program that only assigned rate requires.

Pattern IV[DRC/T]: for not specifying any QoS plan but by the flow process of DRC/T algorithm service.

Based on qos requirement, can use to given flow process the self adaptation w*DRC/T algorithm of AD HOC.Also can to increase scheduler, give to flow process application model II the throughput of this flow process.For example, pattern II can be used for FTP application program, to increase potentially the throughput of corresponding application flows.

Below provide grouping application program (that is, example QSG):

Group I: Delay boundary conditions and delay variation are had to the application program that strict demand is similar to IP phone (VoIP).Notice that this type of application program also usually has rate requirement.Use scheduler pattern I.

Group II: multimedia conferencing application program Delay boundary conditions and delay variation to strict demand.Some in instant these application programs are adaptive, guarantee that service speed remains desirable for the purpose of consistent high-quality.Use scheduler pattern I.

Group III: the video stream application program for Delay boundary conditions, speed and delay variation with requirement.Use scheduler pattern I.

Group IV: there is speed and (on average) and postpone the network browsing application program requiring---use scheduler pattern II.

Group V: the FTP application program with rate requirement---use scheduler pattern III.Or, use the scheduler pattern II with undemanding delay restriction.

Group VI: best effort type application program---use without adaptive weighted PF algorithm, that is, and DRC/T algorithm.

Note, db transaction, game and other application program also can be categorized in suitable group according to qos requirement respectively.

Fig. 9 illustrates the weighted scheduling device with a plurality of grades, and a plurality of grades include, but not limited to grade I and grade II.Grade I scheduler have a plurality of scheduler S1, S2, S3 ..., Sm, wherein m refer to group sum.A certain operational modes of each the grade I scheduler operation self adaptation w*DRC/T dispatching algorithm in Fig. 9, and from this group, select a flow process.First, grade I scheduler calculates the part of Y, specifically throughput T, and rate compensation factor-alpha.Next, grade II scheduler is considered each flow process, and provides enough inputs to grade I scheduler, to be completed by grade I scheduler selecting the calculating of tolerance Y.Once complete the calculating to Y for all unsettled flow processs, grade I scheduler carries out valuation to Y value, and selects to have the flow process of high Y value.Each grade I scheduler carries out valuation to one group of flow process with similar qos requirement.The selected flow process of each grade I scheduler is provided for grade II scheduler immediately, for comparing with the flow process from other group.Grade II scheduler is considered every group of selected flow process, and selects to have the flow process of maximum metric (aw*DRC/T) or Y value.When scheduler need to select a flow process to serve, for each time slot repeats this process.Alternative embodiment can be used the scheduler of single grade, maybe can use than more grade shown in Fig. 9.Alternative embodiment can comprise the grade I scheduler of different numbers, and its middle grade I scheduler is corresponding to process organization.

Generally speaking, by the calculating of adaptive weight, be the function that is given as some parameters, and be given as:

a＝f(Ф，γ，α，β，δ)。(5)

Delay compensation function is designated as Ф.Stand-by period constant is designated as γ.Rate compensation function is designated as α.DRC penalty function is designated as β.Strengthen the jitter compensation factor and be designated as δ.Note it not being all to there is actual value for all parameters of all multimedia services.For example, when only the qos requirement of given flow process is the data transfer rate of appointment, variable α is designated so, and (rate parameter will have actual value) and all other constants will be set as and equal 1.In this case, adaptive weight will only comprise rate parameter in calculating.In one embodiment, adaptive weighting is calculated as follows:

a＝Ф*γ*α*β*δ (6)

Wherein operator is multiplication sign.The details that the various compensation term that can comprise in adaptive weight calculating are provided is below discussed.

For the application program of pattern I, QoS overview is specified indicated all parameters in equation (6).Adaptive weight calculates the delay compensation that consideration produces due to delay threshold-violating, the delay compensation producing due to stand-by period threshold-violating, because speed is violated the rate compensation producing, and violate owing to strengthening dithering threshold the reinforcement jitter compensation producing.This concept improves the weights of violating the flow process of specifying qos requirement.Once be breached qos requirement, trigger, this type of flow process is given to trust divides.Trust minute is to realize by the weights of flow process being multiplied by the suitable value of delay compensation function.This result also will be multiplied by rate compensation and strengthen jitter compensation.

On the contrary, when flow process shows as the service exceeding the quata in reception, this flow process can be punished.Any flow process of punishing in can ining all sorts of ways.According to a kind of method, can directly punish flow process by reducing flow process weights.According to another kind of method, the weights that can also simultaneously increase by maintaining these flow process weights other (that is, those do not reach the flow process of desired QoS) user who falls behind are punished flow process indirectly.

There are various computing relays to compensate to consider to violate the mechanism that postpones threshold value.The delay threshold value of supposing flow process k is designated as dth_ Ф _k, flow process k is designated as Ф owing to postponing the delay compensation that threshold-violating produces in time slot n _k[n].For computing relay compensation Ф _k[n], considers the grouping in every all three queues of flow process (that is, Tx, RTx and ARQ).

For every flow process, also Ф is specified to minimum and maximum threshold value, to guarantee a flow process can not consume several time slots in succession, make the deficient time slot of other flow process.Design also guarantees that the flow process delay compensation item producing due to delay threshold-violating is at least the same with minimum threshold good like this.Make Ф _{thres, min, k}and Ф _{thres, max, k}minimum and the max-thresholds for every flow process k appointment.This (for all k and all n) causes:

${\mathrm{\&phi;}}_{\mathrm{thres},\min ,k}\&le;{\mathrm{\&phi;}}_k\left[n\right]\&le;{\mathrm{\&phi;}}_{\mathrm{thres},\max ,k},\&ForAll;k,\&ForAll;n.---\left(7\right)$

By the calculating of using to give a definition to derive to delay compensation:

D[n]: the set of process of threshold-violating (that is, each this type of flow process has a grouping that surpasses this flow process delay threshold value at least in the beginning of time slot n) is stood to postpone in the beginning that is defined in time slot n.

Defpkts _k[n]: be defined in " dificiency " grouping of the beginning flow process k of time slot n.Dificiency grouping is the also not grouping of transmission on stream, and defpkts specific definition is the number that (MAC) of the equal size of the delay threshold value that the time of staying surpasses flow process k in BTS divides into groups.

Required_rate _k: the request rate of definitim flow k.

Ndefpkts _k: the normalization dificiency grouping number of definitim flow k, specific definition is:

${\mathrm{ndefpkts}}_k=\frac{{\mathrm{defpkts}}_k}{\mathrm{required}\_{\mathrm{rate}}_k}---\left(8\right)$

Notice that the grouping in BTS, BSC and PDSN may be unequal size, therefore, the number of calculating dificiency position rather than grouping is here good.

If the HOL of flow process is grouped in the time period stopping in BTS queue and is greater than preassigned threshold value, available following mechanism compensates this flow process.The stand-by period threshold value of using for this purpose should be more than or equal to the threshold value of using for calculating Ф.For flow process k, stand-by period threshold value is designated as dth_ γ _k, wherein stand-by period threshold value is subject to dth_ γ _k>=dth_ φ _k, constraint.In order to select the HOL grouping of flow process, first consider Tx, RTx from flow process and the HOL grouping of ARQ queue, and the stand-by period based on BTS place select one of them, that is, be chosen in that waited for maximum duration in BTS.Make γ _k[n] is at the compensation of the stand-by period of time slot n beginning flow process k, S _k[n] time for stopping in the HOL of the flow process k of time slot n place is grouped in BTS queue.For every flow process k, also specify minimum threshold S _{thres, min, k}with max-thresholds S _{thres, max, k}, meet S _{thres, min, k}≤ S _k[n]≤S _{thresh, max, k},

According to an embodiment, when flow process stands to postpone threshold-violating or stand-by period application delay compensation during threshold-violating.This mechanism is applied to adaptive weight by DRC data rate request.Make β _k[n] is that the DRC of flow process k in time slot n adjusts function.For every flow process k specifies minimum threshold β _{min, thres, k}with max-thresholds β _{max, thres, k}, meet β _{min, thres, k}≤ β _k[n]≤β _{max, thres, k}.

Although for such as some application programs such as video/audio meetings, above-mentioned compensation mechanism helps to reduce the delay variation in flow process, comprise more effectively that delay variation (shake) is controlled and further minimizing delay variation may be desirable.The delay variation that following mechanism is divided into groups between any two in succession by reducing flow process, provides effective delay variation to control.From then on the flow process with larger IP packet size benefits in compensation mechanism more.

Suppose the time of advent of the IP grouping j that at (k, j) is BSC porch flow process k.Make dt (k, the j) time that IP grouping is left from BTS for this reason, that is, till all segmentations of this IP grouping of this time are all transmitted by the forward link schedulers at BTS place.Make pend _{k, j}[n] is the byte total length of the IP grouping j of BTS and the flow process k of BSC place.Suppose dv _{k, target}for flow process k IP grouping target delay variation (shake) between any two in succession, dv _{k, thres}the predefined enhancing dithering threshold of flow process for this reason, and make dv _{k, thres}<dv _{k, target}.In one embodiment, when the delay variation that IP divides into groups between any two in succession surpasses dv _{k, thres}time, this algorithm is flow process k and triggers enhancing delay variation compensation mechanism.

Figure 10 provides the system assumption diagram corresponding to an embodiment.Each application flows is described by traffic overview, QoS overview and DRC request (that is, requested data rate).Each traffic overview comprises paroxysmal tolerance and average data rate.Each QoS overview comprises class type and bound of parameter.Class type can be a kind of in pattern I, pattern II, pattern III or pattern IV.The border of border specified delay, shake and the data transfer rate of asking.Such as some application programs such as network browsings, can specify average retardation rather than Delay boundary conditions.The delay threshold value of preference pattern I is less than shake border; For pattern II, select to postpone threshold value and be less than average retardation.Selective enhancement dithering threshold is less than shake border.Alternative embodiment can be applied to each application flows by more or less information, and wherein qos requirement can be specific to network and configuration.

Figure 11 specifies the table of qos requirement and qos parameter for each class type.As shown in the figure, pattern I is corresponding to the strictest requirement, and pattern IV is corresponding to the best effort type of not specifying any qos requirement.Alternative embodiment can comprise other qos requirement, qos parameter and/or pattern.

Figure 12 A is the part as effective application flows to 12E, and processing and the scheduling to this application flows of application programs flow process are shown.Shown in Figure 12 A, be single application flows to be carried out to the flow chart of initialization and setting.This process starts to select the mechanism for each compensating parameter in step 1100.Compensating parameter includes, but are not limited to: postpone (Ф); The unsettled time (γ); DRC (β), shake (δ) and speed (α).In step 1102, be that applicable compensating parameter is selected threshold value.Notice that compensating parameter can comprise any parameter for AN with the application flows of importance.In step 1104, select the algorithm for weights in the middle of calculating, wherein middle weights are for calculating the adaptive weight that dispatching office is used.At step 1106 Set scale parameter (C) and priority factor (Z), the two is all for calculating adaptive weight.Step 1108 for this reason application flows initial weight is set.Qos requirement in step 1110 pair this application flows is carried out valuation.If there is no the qos requirement of appointment except the speed that DRC requires to identify, applicable implied terms.Implied terms is " best effort type " as above.In this case, default treatment is made as all compensating factors for this application flows to equal 1.For the present embodiment, in this case, to the applicable multiplication operator of the calculating of equation (6), therefore each factor is made as to 1 ignores those factors effectively, that is, those factors do not affect weighting.Notice that alternative embodiment can realize other mechanism and function, and therefore applicable other mechanism is ignored concrete or all compensating factors.

Best effort type is processed in step 1112 and 1116 and is continued.The scheduling factor of gained is calculated and is calculated consistent with equitable proportion.If application flows has qos requirement, process and advance to step 1114.Step 1114 and 1116 indications are processed and are continued in ensuing accompanying drawing.

Figure 12 B continues the processing of Figure 12 A from step 1114.Processing in step 1120 pair current time slots starts.In step 1122, judge the class type of application flows.At step 1128 tupe I, at step 1126 tupe II, at step 1124 tupe III.Qos parameter at step 1128 monitoring mode I; Qos parameter at step 1124 monitoring mode III.At step 1130,1140 and 1150 places, QoS is violated and checked immediately, this is described in further detail in Figure 12 C and 12D.

For the application program of pattern I, II or III, the processing of application flows continues in the step 1130 of Figure 12 C.In step 1132, this algorithm periodically monitors speed violation.Note periodically carrying out rate compensation calculating, and use in a plurality of time slots thereafter.If speed detected in step 1134, violate, process and advance to step 1138 with computation rate compensating factor (α).Otherwise, in step 1136, the rate compensation factor (α) is made as and equals 1.Process and advance to immediately step 1160, this will be described in further detail in Figure 12 E.

For the application program of pattern I or II, the processing of application flows continues in the step 1140 of Figure 12 C.In step 1142 the method, at each time slot, delay and jitter is violated and monitored.If detect and postpone and/or shake is violated in step 1144, process and advance to 1148 with according at the selected machine-processed computing relay compensating factor of initialization (Ф).For the flow process of pattern I with the enhancing jitter compensation of request, so also calculate and strengthen the jitter compensation factor (δ).For do not have request enhancing jitter compensation pattern I flow process and for the flow process of pattern II, δ is made as 1.Otherwise, in step 1146, delay compensation factors (Ф) is made as and equals 1, and δ is made as and equals 1.Process and advance to immediately step 1160, this is described in further detail in Figure 12 E.Attention is for the application flows of pattern I or pattern II, can be in tandem or violate concurrently inspection.In other words, can carry out continuously or concurrently in time speed violation and delay/shake and violate inspection.

For the application program of pattern I, the processing of application flows continues in the step 1150 of Figure 12 D.In step 1152 the method, for the stand-by period, violate and monitor.If stand-by period violation detected in step 1154, process and advance to step 1158 to calculate stand-by period compensating factor (γ) according to the mechanism of selecting in initialization.Otherwise, in step 1156, stand-by period compensating factor (γ) is made as and equals 1.Process and advance to immediately step 1160, this is described in further detail in Figure 12 E.Attention is for the application flows of pattern I, can be one in front and one in back or violate concurrently inspection.In other words, can carry out continuously or concurrently in time the inspection of speed violation, delay/shake violation and stand-by period violation, as shown in step 1170 and 1172.

Figure 12 E illustrates the processing turning from step 1160 and 1116.In step 1162, according to qos parameter and compensating factor, for application flows, calculate adaptive weight, be given as:

aw＝f(Ф，γ，α，β，δ) (9)

In step 1164, be calculated as follows the scheduling factor or scheduling tolerance:

The scheduling factor=aw* (DRC)/T (10)

In step 1166, this dispatching algorithm is immediately according to being the scheduling factor that each effective application flows is calculated gained, and application programs flow process is dispatched.

Figure 13 illustrates the BTS1200 that is applicable to application schedules algorithm according to an embodiment.BTS1200 comprises scheduling unit 1202, application flows processor unit 1206, qos parameter valuation 1204, adaptive weight computing unit 1212 and CPU1208, above each be coupled to communication bus 1210.Scheduling unit 1202 is by preparing the scheduling factor, selecting to dispatch between each effective application flows according to these scheduling factors subsequently for each application flows.Be incorporated in dispatching algorithm to strategy and the target of fixed system.1204 couples of QoS of qos parameter valuation violate and monitor, and provide information to scheduling unit 1202 and weight calculation unit 1212.Application flows processing execution is processed, and includes, but not limited to grouping to be directed to target AT, from target AT, receives QoS information for dispatching, and this information is offered to qos parameter valuation 1204.BTS1200 also comprises memory 1214, for storing average information, and safeguards the data for calculating mean value, flow process queue etc.Violating inspection carries out at BTS place.The byte number that embodiment continues sending for every flow process is counted, and the inspection that this information is violated for speed.When each grouping arrives BSC place, it is all stamped timestamp.As long as grouping still rests on AN, BSC or BTS, the time just continues cumulative.BTS by this time for detection of threshold-violating, and immediately according to flow process computing relay, stand-by period or strengthen jitter compensation function.

allow to enter control

Allow to enter to control and refer to allow the user of the request msg service decision process in entering.When new user request is when having the data, services such as application program of qos requirement, AN has determined whether that available resources support this use.Allow the process that enters to consider the application program of asking, current use and QoS and network statistics.If AN determines, can support this new user, so corresponding application flows is allowed to.Otherwise, if current, there is no available resources, application flows is rejected or is placed in queue the change with wait state.Notice that in fact new user can be the current effective application flows with request extra-service, that is, and additional application flow process.

Except allowing to enter control, and as its part, can realize a kind ofly for stopping the preemption processes of effective application flows, wherein current operation situation is carried out to the decision-making that preemption is made in valuation.In this case, with regard to QoS violation and data transfer rate, each current flow process is carried out to valuation.

What this section provided a kind of adaptive each sector allows to enter control algolithm.This allows to enter control algolithm and determine whether to allow (or preemption) flow process in given Wireless Multimedia Networks.Therefore admissible in given network (each class) flow process quantity may can be determined.The given some embodiment that allow to enter control algolithm comprise and carry out between user simultaneously and monitor and this information is applied to allow to enter and/or the mechanism of preemption decision-making with being about to indoor QoS herein.These embodiment are designed to guarantee that every flow process and each user's qos requirement is met for the flow process and the user that enter of allow.These mechanism contribute to coordinate to allow to enter control algolithm and hierarchy dispatching algorithm.

Dispatching and allow to enter and controlling is a part for forward link in wireless network (FL) QoS management, and wherein this type of management is a complicated problem.QoS management is an important Consideration in the design of communication network and operation.Application flows is according to classifying as defined criterion of system etc.In one embodiment, classification is according to qos requirement.First, allow to enter to control and determine and in current operation situation, can allow the flow process quantity that enters.This flow process quantity is divided into the flow process quantity of each class immediately.System operates to meet each qos requirement that allows the flow process that enters immediately.Notice that the quantity of flow process can be in time and dynamically change with the type of application program.For example, in the very first time, access network (AN) can support every class application program to permit the first situation of concrete quantity flow process.In the second time, AN can support at least one class in types of applications program to allow the second situation of varying number flow process.

Scheduler (that is, dispatching algorithm) is realized a kind of fairness policy in allowed flow process.The flow process that scheduler is also attempted there being QoS to violate is appropriately recovered.Operator's income and interests are the validity that depends on dispatching algorithm used.Algorithm more effective and feature rich provides the chance that increases these interests.

With regard to allowing to enter and controlling, an embodiment realizes a kind of method based on the factor of reservation.The method of attention based on subscribing be usually used in cable network allow enter in control algolithm.In wireless network, each user's channel situation continues to change, and therefore forward link capacity as being seen in BTS scheduler also continues to change.Algorithm based on wired reservation factor is supposed fixing link capacity, and therefore can not be directly applied for wireless network.

For wireless network, embodiment allows to enter control algolithm, wherein a plurality of application flows with qos requirement of network support for what FL management provided a kind of adaptive reservation factor base (ASF).ASF in wireless network allows to enter and controls by monitoring qos statistic amount and network statistics, dynamically upgrades reservation factor.Can carry out renewal function by various mechanism.Therefore can utilize adaptive reservation because usually taking the action of correction property.In addition, ASF is also for realizing preemption method.

At each time t, calculate ASF, AS (t).This process is that AS (t) determines minimum threshold AS _{min_prespecified}, and max-thresholds AS _{max_prespecified}, so that 1≤AS _{min_prespecified}≤ AS (t)≤AS _{max_prespecified}< ∞, .When initial, to ASF apportioning cost S _initial, so that AS (0)=S _initial.

Figure 14 is a sequential chart, surveys and draws out maximum data rate, reserved bandwidth and available bandwidth as the function of time.BTS can transmit the maximum rate (L of data on the forward link _max) upper bound that provides resource to distribute.Effective application flows is carried out to valuation to determine reserved bandwidth Res (t).Use QoS to violate the statistic relevant with offered load, carry out the calculating of adaptive reservation factor and the forward link capacity L (t) that wishes at time t to retain is estimated.Notice that L (t)≤Res (t) is possible.For example, suppose that allowed flow process experiences extraordinary channel situation when they are allowed to enter.Now, the channel situation variation of some flow processs and some flow processs do not reach the QoS assurance being associated.In this case, system may wish allowing more in multipaths, to become more conservative, and establishes Avail (t)=0.On the other hand, if L (t) >Res (t), system can be established Avail (t)=L (t)-Res (t).The QoS that value L (t) is based on previous violates the statistic relevant with network load, the estimation to the forward link capacity of wishing at time t to retain, and according to L _maxcalculate with ASF, as follows:

$L\left(t\right)=\frac{L_{\max }}{\mathrm{AS}\left(t\right)},\&ForAll;t,---\left(11\right)$

It is constrained to:

$L\left(t\right)\&le;\frac{L_{\max }}{{\mathrm{AS}}_{\min \_\mathrm{prespecified}}}<L_{\max }$ And (12)

$L\left(t\right)\&GreaterEqual;\frac{L_{\max }}{{\mathrm{AS}}_{\max \_\mathrm{prespecified}}}>0.---\left(13\right)$

Available bandwidth Avail (t) is calculated as follows:

Avail(t)＝maximum(L(t)-Res(t)，0) (14)

The tolerance of various resources is as shown in Figure 14 to be determined by the bit-rate control receiving from user (DRC) request of data.Each user sends DRC request of data rear on link.In the system of cdma2000 1xEV-DO or other HRPD type, user sends DRC request of data on the time slot of each RL transmission.As shown in figure 15, from user 1 request of data (DRC1) with from user 2 request of data (DRC2), change in time.These request of data and desired QoS determine reserved bandwidth (Res).Notice that it is as example that the relation between this DRC value and Res is provided.Alternative embodiment and situation may cause different relations.

Each application flows has the designated communication amount overview of Mean Speed and sudden aspect, wherein flow process f _ktraffic overview by (σ _k, r _k) given.Herein, r _kflow process f _kaverage request speed, σ _kbe paroxysmal tolerance, wherein institute's request rate of flow process fk is given as req_rate (f _k)=r _k.

According to an embodiment, allow to enter control and just allow to enter flow process f _kcarry out valuation.Allow to enter control first for user's application is corresponding to flow process f _kthe DRC observing, u (f _k) speed of being asked to meet, the DRC that wherein observed is less than or equal to this user's average DRC data demand, as follows:

req_rate(f _k)≤Avg(DRC(u(f _k)))。(15)

Carry out immediately the calculating AS (t) of ASF, and use it for and be calculated as follows Avail (t):

$\mathrm{Avail}\left(t\right)=\max \mathrm{imum}(\frac{L_{\max }}{\mathrm{AS}\left(t\right)}-\mathrm{Res}\left(t\right),0)---\left(16\right)$

Finally, for flow process f _kallow enter decision-making and consider at time t:

req_rate(f _k)≤Avail(t)。(17)

If flow process f _kbe allowed to enter, resource measurement is as shown in Figure 14 pressed following formula and is upgraded:

Res(t)＝Res(t)+req_rate(f _k) 18)

Avail(t)＝Avail(t)-req_rate(f _k) (19)

AN continues as all flow processs that enter that allow and monitors qos statistic amount, and the relevant statistic of monitoring network.Supervision provides feedback for adapting to reservation factor.

the adaptive approach of AS (t): the QoS of each sector and network statistics

Figure 18 A provides a kind of flow chart of method 300 that allows to enter control of the system of supporting a plurality of application flows with qos requirement to 18E.In Figure 18 A, when when judging that diamond 302AN receives the request to new technological process, in step 304 application, allow to enter control program.Otherwise this process is waited for new flow process request.During between noting at this moment, AN continues to monitor current operational circumstances, carries out the qos statistic amount of current effective flow process and the network statistics of flow process.Allow to enter control program and determined whether that resource can be in order to support this new technological process.All resource measurements are as shown in Figure 14 upgraded in step 305.If judging diamond 306, new flow process is allowed to enter, and processes and advances to 307 with application self-adapting scheduling process.

The allowing of step 304 enters control program and is described in further detail in Figure 18 B.Judging diamond 308, if flow process f _krequest rate be greater than flow process f _kaverage DRC data demand, process and advance to step 312 with refusal flow process f _kenter.Otherwise, process to return and judge that diamond 312 is to determine flow process f _krequest rate whether be greater than the available resources Avail at time t.If the speed of asking is less than Avail, in this flow process of step 314, be allowed to enter so, otherwise in this flow process of step 312 refusal.

Being updated in Figure 18 C of step 305 pair resource measurement is described in further detail.In step 320, resource measurement Avail and Res are upgraded.In step 322QoS statistic, upgraded and monitored.In step 324, the result of ASF based on step 320 and 322 upgraded.In step 326, the hierarchical resource L of estimation is recalculated.If have new flow process requested in step 328, process and return to process in the step 304 of Figure 18 A.If do not have new flow process requested in step 328, in step 330, determine the existence of user in this sector for each user so.In step 332, determine that sampling continues the cycle.

Continuing Figure 18 D is discussed, is every process selecting QSG parameter in step 340.Consider two parallel processing paths, wherein the first path step 342 speed on the sampling interval processing speed violate.Notice that this speed sampling interval is greater than the sampling duration of calculating gained in step 332.The processing of each effective flow process is specialized in the second path.For given flow process, this process is determined the ratio that has the IP grouping that postpones violation at sampling duration in step 344.In step 346, for considered flow process calculating sampling duration has the ratio of shaking the IP grouping of violating.In step 348, calculate the mark at sampling duration flow process time slot used immediately.In this process of step 350, determine the mark of time slot at sampling duration with the flow process of qos requirement.In step 352, this process is violated and is checked with regard to QoS, and determines QoS packet ID in step 354.

Processing advances to Figure 18 E, and step 360 is the quantity of each QoS grouping calculation process.In this process of step 362, calculate immediately the mark corresponding to the QoS flow process of each qos statistic amount.Immediately in step 364 by the result of step 360 and 362 and predetermined threshold.Notice that threshold value can be dynamically updated during operation.In step 366, adjust accordingly ASF.

Figure 18 A provides an embodiment who allows entry control method to 18E.Other details that allows entry control method is below being discussed.Such as AN elements such as BTS, be the statistic that every flow process is collected each sector, and by this information allowing to enter and control and preemption algorithm for each sector.Only the user corresponding to flow process in this subregion during collect the statistic of each sector.BTS periodically collects the QoS statistic relevant with network.Make T collect these information that time cycle before, wherein Z is sample index, t=Z*T.

Consider the flow process f in the s of sector _k, u (f wherein _k) be corresponding to flow process f _kuser.This user is at time t _enterenter sector s.Inner at sector s, at duration [t _reserve(f _k, s), t _free(f _k, s)] in flow process reservation of resource for this reason, wherein resource is at time t _reserveretained.When user's request applications is served, resource is retained.User u (f _k) within the above duration, at t _{enter, j}(f _k, s) enter sector s for the j time, and at t _{leave, j}(f _k, s) leave for the j time.Therefore, t _reserve(f _k, s)≤t _{enter, first}(f _k, s) and t _free(f _k, s)>=t _{leave, last}(f _k, s).Note, for estimating that this user may move on to this sector at certain following time point, via qos signaling agreement AN, can be apprised of to be possible for flow process reservation of resource.Herein, t _{enter, first}(f _k, s) be user u (f _k) enter for the first time time of this sector s, and t _{leave, last}(f _k, be s) at flow process f _klifetime during this user leave for the last time time of sector s.

Only, when below time t, three conditions are all met, this algorithm is included the QoS performance statistics relevant with network in consideration at time t:

t _reserve(f _k，s)≤t≤t _free(f _k，s) (20)

T _{enter_latest}(f _k, s)+δ (f _k)≤t≤t _{leave_latest}(f _k, s), and (21)

IN_IP_PKTS(f _k，t，s)>θ(f _k) (22)

Wherein, δ (f _k) and θ (f _k) be to be flow process f _kpreassigned, IN_IP_PKTS (f _k, t, s) and be at time period (max (t-T, t in the s of sector _{enter_latest}(f _k, s)), t) during by BTS forward link schedulers scheduling the flow process f for transmission _kthe number of input IP grouping.If last position of IP grouping is transmitted in the s of sector, this is counted the IN_IP_PKTS of this sector.Variable δ (f _k) refer to that appearance in this sector is regarded as the time before important.In other words, once user has stopped δ second in the s of sector, this process starts resource to carry out valuation.Note, once be allowed, user need not require again to allow at once to leave and reenter this sector.

Qos and network statistics are used to allow for the flow process of each request applications service the valuation of entry criteria immediately.At time period (max (t-T, t _{enter_latest}(f _k, s)), t) during in the s of sector corresponding to flow process f _kdelay IP grouping be calculated as follows:

$\mathrm{Frac}\_\mathrm{delayed}\_\mathrm{IP}\_\mathrm{Pkts}(f_k,t,s)$

$=\frac{\mathrm{DELAYED}\_\mathrm{IP}\_\mathrm{PKTS}(f_k,t,s)}{\mathrm{IN}\_\mathrm{IP}\_\mathrm{PKTS}(f_k,t,s)}---\left(23\right)$

DELAYED_IP_PKTS (f wherein _k, t, s) correspond to and at the BTS place of sector s, postponed to surpass flow process f till time t _kthe number of the IP grouping of corresponding Delay boundary conditions.Once the delay of IP grouping be detected in the s of sector, violate, cumulative this sector postpones the counting of violating.Till time t flow process f _khave the IP right mark that divides into groups of shake boundary violation to be calculated as follows:

$\mathrm{Frac}\_\mathrm{jitter}\_\mathrm{viol}(f_k,t,s)=\frac{\mathrm{JTR}\_\mathrm{VIOL}\_\mathrm{PKT}\_\mathrm{PAIRS}(f_k,t,s)}{\mathrm{IN}\_\mathrm{IP}\_\mathrm{PKTS}(f_k,t,s)-1},---\left(24\right)$

JTR_VIOL_PKT_PAIRS (f wherein _k, t, s) and correspond to flow process f till time slot t _kthe quantity that (IP divides into groups in succession), it is right that IP divides into groups that has shake boundary violation.When two of a flow process in succession IP be grouped in while transmitting on a sector, for carrying out this counting in this sector.

At time period (t _{enter_latest}(f _k, s), t) during flow process f _kspeed violate,

$\mathrm{Rate}\_\mathrm{viol}(f_k,t,s)=\frac{\mathrm{req}\_\mathrm{rate}\left(f_k\right)-\mathrm{served}\_\mathrm{rate}(f_k,t,s)}{\mathrm{req}\_\mathrm{rate}\left(f_k\right)}---\left(25\right)$

Req_rate (f wherein _k) >served_rate (f _k, t, s).Otherwise as flow process f _kwhen time t does not have speed to violate, calculate at (t _{enter_latest}(f _k, s), t) flow process f in the s of time durations sector _kserved_rate (f _k, t, s).

Note, for speed, violate, this process is by time period (t _{enter_latest}(f _k, s), t) as the application of sampling duration, but to violate for delay and jitter, this process is by time period (max (t-T, t _{enter_latest}(f _k, s)), t) as the application of sampling duration.

At time period (max (t-T, t _{enter_latest}(f _k, s)), t) during flow process f _kthe time slot mark using is calculated as follows:

$\mathrm{Frac}\_\mathrm{slots}\_\mathrm{flow}(f_k,t,s)=\frac{\mathrm{SERVED}\_\mathrm{SLOTS}(f_k,t,s)}{\mathrm{IN}\_\mathrm{SECTOR}(f_k,t,s)}---\left(26\right)$

SERVED_SLOTS (f wherein _k, t, s) and be by (max (t-T, t _{enter_latest}(f _k, s)), t) flow process f during the time period of definition _kthe quantity of the time slot of being served, IN_SECTOR (f _k, t, s) and be (max (t-T, t _{enter_latest}(f _k, s)), t) during the sum of time slot.The mark of time slot that gives to have in the s of sector the flow process of qos requirement during the time period (t-T, t) is provided by following formula:

dynamic flow classification

For every flow process f _k, below four threshold values be preassigned, and for carrying out the QoS inspection relevant with channel situation of every flow process:

Frac_delayed_IP_pkts_thres (f _k), (fractional delay IP packet threshold (f _k))

Frac_jitter_viol_IP_pkts_thres (f _k), (IP packet threshold (f is violated in mark shake _k))

Rate_viol_thres (f _k), (speed is violated threshold value (f _k)) and

Frac_slots_viol_thes (f _k), (mark time slot is violated threshold value (f _k)).

System periodically adapts to ASF after each time T, and wherein T is preassigned value.In preset time, t ought the Z time (that is,, while t=Z*T) carrying out self adaptation inspection, this process considers have some resources to obtain those flow processs that retain in the s of sector,, meets t that is _reverse(f _k, s)≤t≤t _free(f _k, flow process s).For each the flow process f that organizes since then flow process _k, check that following " the threshold value inspection of every flow process " carried out to valuation:

Frac_delayed_IP_Pkts(f _k，t，s)>Frac_delayed_IP_pkts_thres(f _k) (28)

(fractional delay IP (the f that divides into groups _k, t, s) and > fractional delay IP packet threshold (f _k))

Frac_jitter_viol_IP_pkts(f _k)>Frac_jitter_viol_IP_pkts_thres(f _k，t，s) (29)

(IP grouping (f is violated in mark shake _k) > mark shake violation IP packet threshold (f _k, t, s))

Rate_viol(f _k，t，s)>rate_viol_thres(f _k) (30)

(speed is violated (f _k, t, s) and > speed violation threshold value (f _k))

Frac_slots_flow(f _k，t，s)>Frac_slots_viol_thes(f _k) (31)

(mark time slot flow process (f _k, t, s) and > mark time slot violation threshold value (f _k))

If meet following two conditions, to flow process f _kcarry out above four inspections:

T _{enter_latest}(f _k, s)+δ (f _k)≤t≤t _{leave_latest}(f _k, s), and (32)

IN_IP_PKTS(f _k，t，s)>θ((f _k)) (33)

When for a flow process, at least one in condition (32), (33) do not meet, but t _reserve(f _k, s)≤t≤t _free(f _k, s) be true time, for this flow process is NA by the result queue of the threshold value inspection of every flow process.

This process computation is at sampling duration, for thering is the mark of the time slot that the flow process of qos requirement used, also calculate the threshold value of this fractional value, wherein Frac_slot_thres_qos_flows (s) is the upper threshold value of mark of distributing to the time slot of the flow process with qos requirement in the s of sector in time period T.The value of Frac_slot_thres_qos_flows (s) is used for checking whether following formula is set up:

frac_slots_qos_flows(t，s)>Frac_slots_thres_qos_flows(s)。(34)

This process is categorized into one of following QoS dispatch group (QSG) by current flow process:

QSG I or Q_DJR: there is the flow process of delay, shake and rate requirement,

QSG II or Q_RavgD: there is the flow process of speed and average retardation requirement,

QSG III or Q_R: the flow process with rate requirement.

Consider one group of flow process that belongs to Q_DJR class.If given flow process f _kfor NA classification, be underproof, and or meet:

Frac_delayed_IP_Pkts(f _k，t，s)>Frac_delayed_IP_pkts_thres(f _k)， (35)

Or meet

Frac_jitter_viol_IP_pkts(f _k，t，s)>Frac_jitter_viol_IP_pkts_thres(f _k)，(36)

This flow process has been designated as delay_or_jitter_viol (f _k, t, s) and ((f is violated in delay or shake to=Y _k, t, s)=be).Otherwise this process for this reason flow process is established delay_or_jitter_viol (f _k, t, s) and ((f is violated in delay or shake to=N _k, t, s)=no).On the other hand, if be qualified in NA classification, delay_or_jitter_viol (f so _k, t, s) and=NA.

Table 2

QoS state group ID (QS_GID)	QoS class	delay_or_jitter_viol(f k，t，s)	rate_viol(f k，t，s)>rate_viol_thres(f k)
				1	For Q_DJR flow process	Be	Be
2	For Q_DJR flow process	Be	No
				3	For Q_DJR, Q_RavgD, Q_R flow process	No	Be
4	For Q_DJR, Q_RavgD, Q_R flow process	No (or NA)	No (or NA)

At each time t, when carrying out the self adaptation inspection of AS (t), this process is as shown in table 2 classifies to QoS flow process (that is the flow process, with qos requirement).Every flow process is all assigned with a QoS state group ID (QS_GID).

QS_GID=1: the flow process that has the Q_DJR class of speed and delay (or shake) violation.

QS_GID=2: have delay (or shake) to violate and there is no a flow process of the Q_DJR class that speed violates.

QS_GID=3: do not have delay and jitter to violate but have the flow process of the Q_DJR class that speed violates.

For self adaptation application program, may produce this situation.And the flow process corresponding to Q_R and Q_RavgD class that has speed to violate is assigned in this group.

QS_GID=4: the flow process that does not have QoS (speed, delay and jitter) to violate.Flow process in NA classification as described above is also placed in this group.

the self adaptation of reservation factor

Make N _k(t, s) is the flow process number corresponding to QSG k at time t, the flow process sum that N (t, s) retains for there are some resources to obtain in the s of sector at time t.

$N(t,s)=\underset{k}{\mathrm{\&Sigma;}}{N}_k(t,s)---\left(37\right)$

Make M represent QoS state group ID (QS_GID), result is:

$N_{Q\_\mathrm{DJR}}\left(t\right)=\underset{M=1}{\overset{4}{\mathrm{\&Sigma;}}}{N}_{Q\_\mathrm{DJR}}(t,M)---\left(38\right)$

$N_{Q\_\mathrm{RAvgD}}\left(t\right)=\underset{M=3}{\overset{4}{\mathrm{\&Sigma;}}}{N}_{Q\_\mathrm{RAvgD}}(t,M)---\left(39\right)$

$N_{Q\_R}\left(t\right)=\underset{M=3}{\overset{4}{\mathrm{\&Sigma;}}}{N}_{Q\_R}(t,M)---\left(40\right)$

At time t (in the s of sector), in QoS state group M, corresponding to the mark of the flow process of the QSG k of flow process k, by following formula, provided:

$F_k(t,M,s)=\frac{N_k(t,M,s)}{N_k(t,s)}---\left(41\right)$

At time t, have the mark of the flow process of delay (or shake) and speed violation to be provided by following formula:

Frac_flows_DJR_viol(t，s)＝F _{Q_DJR}(t，M＝1，s) (42)

At time t, there is delay (or shake) to violate, but do not have the mark of the flow process of speed violation to be provided by following formula:

Frac_flows_DJ_viol(t，s)＝F _{Q_DJR}(t，M＝2，s) (43)

At time t, only have the mark of the flow process of speed violation to be provided by following formula:

Frac_flows_R_only_viol(t，s)＝

$\frac{N_{Q\_\mathrm{DJR}}(t,M=3,s)+N_{Q\_\mathrm{RAvgD}}(t,M=3,s)+N_{Q\_R}(t,M=3,s)}{N_{Q\_\mathrm{DJR}}(t,s)+N_{Q\_\mathrm{RAvgD}}(t,s)+N_{Q\_R}(t,s)}---\left(44\right)$

Not having QoS to violate (or in NA classification) flow process mark is provided by following formula:

$\mathrm{Frac}\_\mathrm{flows}\_\mathrm{no}\_\mathrm{na}\_\mathrm{viol}(t,s)=$

$\frac{N_{Q\_\mathrm{DJR}}(t,M=4,s)+N_{Q\_\mathrm{RAvgD}}(t,M=4,s)+N_{Q\_R}(t,M=4,s)}{N_{Q\_\mathrm{DJR}}(t,s)+N_{Q\_\mathrm{RAvgD}}(t,s)+N_{Q\_R}(t,s)}---\left(45\right)$

The self adaptation of S (t) is periodically carried out after each time period T, and T is preassigned.For adaptive object, can consider as follows above each group.

Table 3

QSG	The mark of the flow process of QS_GID=1	The mark of QID=2	The mark of QID=3	The mark of QID=4
					QSG_DJR	Frac_flows_DJR_viol(t，s)	Frac_flowsDJ_viol(t，s)	With Frac_flows_R_only_viol (t, s) combination	With Frac_flows_no_na_viol (t, s) combination
QSG_RavgD	Inapplicable	Do not use	With Frac_flows_R_only_viol (t, s) combination	With Frac_flows_no_na_viol (t, s) combination
					QSG_R	Inapplicable	Inapplicable	With Frac_flows_R_only_viol (t, s) combination	With Frac_flows_no_na_viol (t, s) combination

With lower threshold value, be preassigned, and use in adaptive approach shown below.

Frac_flows_thres_DJR: have the threshold value on the mark of flow process of delay (or shake) and speed violation

Frac_flows_thres_DJ: have the threshold value on the mark of the flow process that delay (or shake) violates and violate without speed

Frac_flows_thres_R: have speed to violate the threshold value on the mark of flow process of (and without postpone or shake is violated)

Frac_flows_thres_ok_qos: the threshold value on the mark of the flow process of violating without QoS

After carrying out self adaptation inspection for AS (t), this process continues to carry out immediately in the following order:

Step 1: if Frac_flows_DJR_viol (t, s) >=Frac_flows_thres_DJR:

AS (t ⁺)=f _qos* AS (t)+x _qosthereby, AS (t ⁺)>=AS (t).Herein, f _qosand x _qospreassigned.Otherwise,

Step 2: if Frac_flows_DJ_viol (t, s) >=Frac_flows_thres_DJ:

AS (t ⁺)=f _{delay_jitter}* AS (t)+x _{delay_jitter}thereby, AS (t ⁺)>=AS (t).Herein, f _{delay_jitter}and x _{delay_jitter}preassigned.Otherwise,

Step 3: if Frac_flows_R_only_viol (t, s) >=Frac_flows_thres_R:

AS (t ⁺)=f _rate* AS (t)+x _ratethereby, AS (t ⁺)>=AS (t).Herein, f _rateand x _ratepreassigned.Otherwise,

Step 4: if Frac_flows_no_na_viol (t, s) >=Frac_flows_thres_ok_qos:

AS (t ⁺)=f _{all_qos_flows}* AS (t)+x _{all_qos_flows}thereby, AS (t ⁺)>=AS (t).Herein, f _{all_qos_flows}and x _{all_qos_flows}preassigned.Otherwise,

Step 5: if Frac_flows_no_na_viol (t, s) >=Frac_flows_thres_ok_qos, and if Frac_slots_qos_flows (t, s) is <Frac_thres_slots_qos_flows:

AS (t ⁺)=f _ok* AS (t)+x _okthereby, AS (t ⁺)≤AS (t).Herein, f _okand x _okpreassigned.Otherwise,

Step 6: if Frac_flows_no_na_viol (t, s) >=Frac_flows_thres_ok_qos, and if Frac_slots_qos_flows (t, s) >=Frac_thres_slots_qos_flows:

AS (t ⁺)=AS (t).

preemption scheme

Figure 19 illustrates a kind of preemption method 400 according to an embodiment.Method 400 is by judging whether the definite ASF of diamond 402 is increased and start.When the increase of ASF being detected, process and advance to step 404 to define the flow process of flank speed violation number of times.In other words, when ASF increases, preemption method 400 starts those flow processs that sign is wanted preemption.In the present embodiment, there is the optimal candidate that flow process that speed violates is represented as preemption.Alternative embodiment can give other flow process priority, and can dynamically change priority scheme.

If judging that diamond 406 reaches the maximum P of preemption _mAX(describing in detail below), processes and advances to step 408 first to occupy the flow process of most high-latency violation number of times.Otherwise process to return and judge diamond 402.When after flow process of step 408 preemption, process to advance to and judge that diamond 410 is to determine whether a plurality of flow processs that most high-latency is violated number of times that have.For many flow processs, processing advances to step 412 and with preemption, uses the flow process of maximum time slots.Conventionally, this flow process will have very low data transfer rate, and therefore in preset time, during section, consumes maximum time slots.Process to return immediately and judge diamond 402.

In one embodiment, apply this preemption method 400, wherein P_max puts to allow preoccupied maximum flow process number at any given time.Consideration meets the flow process subset of the condition of two preemption groups shown in table 3.Particularly, preemption group 1 comprises the flow process that belongs to QSG_R or QSG_RavgD, and has

Rate_viol (f _k, t, s) and >rate_viol_thres ((f _k), and (46)

Frac_slot_flow(f _k，t，s)>frac_thres_slots_flow(f _k)。(47)

Preemption group 2 comprises the flow process that belongs to Q_DJR QSG, and described flow process contains

Frac_delayed_IP_Pkts (f _k, t, s) and >Frac_delayed_IP_pkts_thres (f _k) and (48)

Frac_slots_flow(f _k，t，s)>frac_thres_slots_flow(f _k)。(49)

Table 4

Preemption group ID	QSG	QoS violates	Time slot threshold-violating
				1	Q_R，Q_RavgD	rate_viol(f k，t，s)>rate_viol_thres((f k)	Frac_slot_flow(f k，t，s)>frac_thres_slots_flow(f k)
2	Q_DJR	Frac_delayed_IP_Pkts(f k，t，s)>Frac_delayed_IP_pkts_thres(f k)	Frac_slots_flow(f k，t，s)>frac_thres_slots_flow(f k)

Step 1: if at certain time point, AS (t) is increased (in the adaptive approach at AS (t)), to look into and see if there is one or several flow processs are qualified preemptions to this process.Note, when AS (t) does not obtain increasing, there is no flow process by preemption.

Step 2: consider the flow process subset corresponding to preemption group 1.From these flow processs, select to have the P_max bar flow process of maximum rate_viol value.If there is draw, preemption has the flow process of larger Frac_slots_flow value.If P_max bar flow process is by preemption, so no longer for speed is violated the more flow process of preemption.

Step 3: consider the flow process subset corresponding to preemption group 2.These flow processs have delay and jitter requirement, and have Frac_delayed_IP_Pkts (f _k, t, s) and >Frac_delayed_IP_pkts_thres (f _k) and Frac_slots_flow (f _k, t, s) and >frac_thres_slots_flow (f _k).From these flow processs, select P_max to deduct the flow process number with maximum Frac_delayed_IP_Pkts of preemption in step 2.If there is draw, preemption has the flow process of larger Frac_slots_flow value.

with the QoS between indoor and user

A mobile subscriber may have many flow processs simultaneously, that is, and and a plurality of application programs.As given herein, user can specify the following:

Every flow process about its whether indication to delay and jitter sensitivity.If it is responsive to delay and jitter, want specified delay and shake border.

Each user's general objective speed (ATR).This is the targeted rate that the scheduler of forward link hierarchy is intended to give this user.

allow to enter control

Give the individual user of R (t) who fixes on time t, be designated as U ₁, U ₂..., U _{r (t)}, by num_flows (U _j, t) see the U time t user as _jflow process number.Suppose, at time t user U _jthere is (k-1) bar flow process to be allowed to enter, i.e. num_flows (U _j, t)=k-1.For determining to allow user U at time t _ja new technological process f _{k, j}enter this process user U _jthe DRC observing check below:

$\underset{c=1}{\overset{k}{\mathrm{\&Sigma;}}}\mathrm{req}\_\mathrm{rate}\left(f_{k,j}\right)\&le;\mathrm{Avg}\left(\mathrm{DRC}\left(U_j\right)\right).---\left(50\right)$

When carrying out the self adaptation of foregoing ASF, the timeslot number that flow process is got and its corresponding DRC are also included into consideration.This process is calculated as follows AS (t) and Avail (t):

$\mathrm{Avail}\left(t\right)=\max \mathrm{imum}(\frac{L_{\max }}{\mathrm{AS}\left(t\right)}-\mathrm{Res}\left(t\right),0)---\left(51\right)$

If following formula is set up, this process allows flow process f at time t _{k, j}enter:

req_rate(f _k，j)≤Avail(t) (52)

If this flow process is allowed to enter, do following renewal:

Res(t)＝Res(t)+req_rate(f _k，j)， (53)

Avail(t)＝Avail(t)-req_rate(f _k，j)， (54)

ATR(U _j，t)＝ATR(U _j，t)+req_rate(f _k，j)， (55)

This process continues as all flow processs that are allowed to enter and user monitors qos statistic amount, and the relevant statistic of monitoring network.By these information, continue to adapt to reservation factor.Calculate immediately and apply ASF AS (t).

the scheduler of hierarchy

Every flow process and each user's compensation:

The flow process of each delay and jitter sensitivity is assigned with a dithering threshold.For user U _keach flow process fx to delay and jitter sensitivity, the delay and jitter compensation Ф that this process computation is corresponding.If flow process in a queue without any the grouping that surpass to postpone threshold value, so

φ(fx(U _k))＝1。(56)

Otherwise, calculate

$\mathrm{\&phi;}\left(\mathrm{fx}\left(U_k\right)\right)=C_{\mathrm{delay}}\left(\mathrm{fx}\left(U_k\right)\right)*\frac{\mathrm{ndefpkts}\left(\mathrm{fx}(U_k,n)\right)}{{\mathrm{ndefpkts}}_{\min }\left(n\right)}---\left(57\right)$

Herein,

$\mathrm{ndefpkts}(\mathrm{fx}(U_k,n)=\frac{\mathrm{defpkts}\left(\mathrm{fx}(U_k,n)\right)}{\mathrm{req}\_\mathrm{rate}\left(\mathrm{fx}\left(U_k\right)\right)}---\left(58\right)$

For user U _kevery flow process fx,

Ndefpkts _min(n) minimum value of=ndefpkts (59)

Consideration is in (all users') all flow processs of time slot n,

Defpkts (fx (U _k, n)=at time slot n user U _kflow process fx violate the number that it postpones unsettled MAC grouping of threshold value.(60)

For the user U at time slot n _krate compensation, definition,

$\mathrm{\&alpha;}(U_k,n)=\frac{\mathrm{ATR}\left(U_k\right)}{\mathrm{ASR}(U_k,n_{\mathrm{prev}}\left(n\right))}---\left(61\right)$

Herein,

ASR (U _k, n _prev(n))=time slot n _prevmiddle user U _ktotal service speed, and (62)

n _prev≤n。(63)

Timeslot number n _previt is n last time slot above or before when the object for dispatching algorithm monitors speed.

This process is user U _kbe defined in the total delay compensation of any time slot n.Consider that this user has all flow processs that postpone requirement, and check file leader (HOL) the MAC grouping of the flow process of each these delay-sensitive.If without any one in system the time of staying surpass it and postpone threshold value:

agg_delay_comp(U _k，n)＝1。(64)

Otherwise user considers to have HOL to be grouped in the time of staying in system to be longer than the flow process subset that postpones threshold value for this reason.For this user, for there being HOL MAC to be grouped in the user U that lingering period in system surpasses the delay threshold value of these flow processs _kall flow process fx, calculate:

$\mathrm{agg}\_\mathrm{delay}\_\mathrm{comp}(U_k,n)=\underset{x}{\mathrm{\&Sigma;}}w\left(\mathrm{fx}\left(U_k\right)\right)*\mathrm{\&phi;}(\mathrm{fx}\left(U_k\right),n),---\left(65\right)$

Herein, w (fx (U _k)) be to distribute to user U _kthe initial weight of flow process fx.

adaptive weight calculates

For user for this reason calculates adaptive weight, this process postpones the inspection of threshold-violating at each time slot for each has each flow process of the user of a delay-sensitive flow process at least.This process is each such user U _kcalculate:

agg_delay_comp(U _k，n) (66)

If agg_delay_comp is (U _k, n) >1, this process the following is user U _kcalculate adaptive weight:

aw ^t(U _k，n)＝agg_delay_comp(U _k，n)*aw ^t(U _k，n-1) (67)

On the other hand, if agg_delay_comp is (U _k, n)=1, this process computation:

aw ^t(U _k，n)＝α(U _k，n _prev(n))*w(U _k) (68)

Herein, n _{prev, k}(n) be as ASR (U _k, n _prev(n) (and so α (U) comes under observation _k, n _prev(n)) calculated) time on n or before last time slot.This process continue by following formula for this reason user calculate final adaptive weight:

aw(U _k，n)＝Z(U _k，n)*aw ^t(U _k，n) (69)

Herein, if user is U _kin the RTx of any delay-sensitive flow process or DARQ queue without any grouping, Z (U _k, n)=1.Otherwise, Z (U _k, n)=C (U _k).Herein, C (U _k) be preassigned constant.

user and process selecting method

This process is calculated the tolerance in following time slot n for each has the user of a grouping at least in its queue,

Y(U _k，n)＝aw(U _k，n)*DRC(U _k，n)/T(U _k，n) (70)

Herein, $T(U_k,n)=\underset{\mathrm{fz}}{\mathrm{\&Sigma;}}T(\mathrm{fz}(U_k,n)$ User U _kaverage service rate (that is the flow process that, comprises all correspondences).This process choosing has maximum Y (U _k, the n) user of value.Once select a user with this scheduler, this process is this user and selects a stream, according to each following scheme, serves.

Consider to assign to the flow process in following group:

Postpone _ shake of group 1:QSG_.VoIP flow process.

Postpone _ shake of group 2:QSG_.Video conference flow process.

Postpone _ shake of group 3:QSG_.The flow process of video flowing.

Group 4:QSG_ speed _ average _ postpone.The flow process with speed and average retardation requirement.

Group 5:QSG_ speed.The flow process only with rate requirement.

In carrying out dispatching algorithm described herein, can follow following steps.

Step 1: the flow process of considering all standby of selected user in this time slot.

Step 2: consider that this user is corresponding to the flow process of group 1 and 2.Select HOL grouping to violate the flow process that it postpones threshold value and approaches this flow process Delay boundary conditions most.If find flow process, serve this flow process.Otherwise, advance to step 3.

Step 3: consider corresponding to group 3 and wherein HOL grouping surpassed the flow process that postpones threshold value, and select wherein HOL grouping to approach the flow process of Delay boundary conditions most.If find flow process, serve this flow process.Otherwise, advance to next step.

Step 4: consider corresponding to group 4 and wherein HOL grouping surpassed the flow process that postpones threshold value, and select wherein HOL grouping to approach the flow process of Delay boundary conditions most.If find flow process, serve this flow process.Otherwise, advance to next step.

Step 5: select a standby flow process 1 to 4 and serve from organizing.There is the flow process of minimum group number with priority.If selected flow process, serve it.Otherwise, advance to next step.

Step 6: consider that this user is corresponding to the standby flow process of group 5.Selection has that of maximum institute request rate/service speed value.Serve this flow process.If without any one selected, advance to next step.

Step 7: the best effort type flow process of serving this user.If had more than one, selection has that of minimum service rate value.

Figure 16 illustrates a kind of two-level scheduler device of applying every flow process and each user's compensation.Scheduler shown in Figure 16 and Figure 17 is for as described herein between user and with the scheduler of the hierarchy of indoor QoS compensation.As shown in Figure 16, the first order that is expressed as grade 1 comprise a plurality of scheduling elements or node S1, S2 ..., SM, wherein different QSG of each node processing.In this example, M is QSG packet count to be processed.For example, the application flows of scheduling node S1 process IP phone (VoIP) type.Although provide IP phone as example, the application flows of any QSG1 of being categorized into will be processed at S1 place.These flow processs have the delay and jitter border of specifying for assessment of qos requirement.The flow process of a plurality of application program IP phone types is processed at scheduling element S1 place.Similarly, each scheduling element is the QSG handling process of an appointment.Note, alternative embodiment can provide to a scheduling element application flows of a plurality of QSG.Note, process same QSG group and can use a plurality of scheduling elements.

The grade I of the scheduler shown in Figure 16 calculates a part for the compensation of every flow process.A plurality of application flows of each user are shown in Figure 16.Grade II scheduling element completes the calculating of the compensation of every flow process.

Figure 17 illustrates has scheduling node s1, s2..., szscheduler.In this step, z is user's number.Note, user's number is dynamic, so the number capable of dynamic of current scheduling node changes.Each scheduling node s1, s2..., szall be applicable to receive many flow processs from a given user.Scheduling node s1for user 1 (U1) receives flow process F1 to Fk.Here k is the sum of the current application flows for user's 1 processing.The compensation of every flow process that the grade I of use in Figure 16 and grade II scheduler calculate, for each user calculates, total user compensates the grade II scheduler in Figure 17.Grade II scheduler is immediately according to being chosen in the user that will serve in time slot with regard to the described adaptive weighted DRC/T algorithm of user choosing method above.Grade II scheduler is selected subsequently between the weighted value receiving from grade I scheduler.As indicated, W (Uk) is the initial weight of distributing to user Uk, and ATR (Uk) is the general objective speed of user Uk.Once selected user, corresponding to this user's grade I scheduler according to above-mentioned process selecting method, for this user selects the flow process that will serve in this time slot.

The price that a kind of forward link schedulers can allow each user to bear for the flow process appointment that will serve at given DRC value place in a time slot.Once specify price, adaptive frame structure scheduler moves to meet the qos requirement of dissimilar application program.Corresponding scheduling mechanism allows service supplier to find good balance increasing interests and meet between the qos requirement target of application program.This scheduling mechanism also provides terminal use's Dynamic Cost Control, and can be used for having the application program of speed and/or average retardation requirement or for streaming application, etc.An embodiment provides a kind of price to select, wherein the price of every flow process appointment each time slot when it is serviced.This price depends on the DRC value that user asks for this flow process in this time slot.Flow process j (that is, the user of browsing process j) is ready that at time slot m the price paying is designated as c[j, m, DRC[j, m]].DRC[j herein, m] be illustrated in the speed of serving this user in time slot m.User is designated price statically, such as being each DRC value designated price in advance.Or user is designated price dynamically, such as change price during the lifetime of application program.This allows user to have control to a certain degree to price, with the channel situation in response to changing and reach the QoS of expectation.Operator can use such a scheduler together with between user and with the given scheduler of indoor QoS.This allows operator to specify the pricing scheme of at least two types.For between user and with indoor QoS scheduler, operator can specify static pricing scheme (based on services level protocol), and allows at the same time the Dynamic Pricing scheme of the scheduler based on adaptive frame structure.User can select different flow processs to use different schemes.

An embodiment will be divided into several frames the time, and violate statistic and the specified price of each user for the decision-making that works as dispatcher of each time slot according to DRC value, qos requirement, QoS.Frame structure provides the order of the Subscriber Queue that should serve in taking turns substantially.Network determines will to take turns which bar flow process/user of service to reach desired target for this at given time slot in taking turns scheduling every.Frame structure, takes turns the order of service procedure at each, continue to change, and be called as the algorithm based on AFS.

To give a definition, some symbols that use in computational process are made an explanation.A given N queue (queue of every flow process), supposes if with speed r[j] service procedure j, its qos requirement is met.Be also every flow process j preassignment initial weight w[j] and time scale ts[j].This process is intended to guarantee for flow process j provides speed, and flow process j comes under observation at the time slot of the integral multiple of each time scale (that is, at each m*ts[j] time slot, wherein m is integer).

Make start[j] for start to be at first subject to the time slot that consideration will be serviced in takes turns as flow process j.While finishing to time slot z, system wishes to serve S[j, z]=r[j] * (z-start[j]) individual bit, wherein for certain integer m, have z=m*ts[j].Use a kind of scheduling mechanism, this system can desired timeslot number and the desired bit number for this stream service of distributing to a given flow process of balance.

In addition, other parameter for AFS scheduler is as follows:

Slots_alloc[j, n]: the timeslot number of distributing to queue (flow process) j at n wheel.

Slot_served[j, n]: when the timeslot number of queue (flow process) j when n wheel obtains serving.

S_r[j, n]: till n takes turns while finishing, to be the bit number of flow process j service.

Round_len[n]: n wheel timeslot number length.

Round_len_thres a: length of taking turns be take this threshold value as the upper bound.

B[n]: the list of pool queue when the beginning of time slot n.

R _{out_round}[j, n]: by scheduler, at n wheel, be the bit number of queue j service.

R _out[j, n, g]: the bit number of serving for queue j during the time interval [n, g], wherein g>=n.Use the above description providing, the dificiency bit that starts queue j at n wheel is provided by following formula:

$\mathrm{def}\_\mathrm{bits}\_r[j,n]=\max (S\_r[j,n-1]-\underset{k=1}{\overset{n-1}{\mathrm{\&Sigma;}}}{R}_{\mathrm{out}\_\mathrm{round}}[j,k],0),\&ForAll;n,\&ForAll;j---\left(71\right)$

When dificiency bit is timing, corresponding flow process falls behind in service, and will be compensated.On the other hand, the suffered extra-service of flow process does not explicitly catch a packet, but indirectly catchs a packet, and because flow process for this reason can not be compensated, and other flow process falling behind in service will be compensated.

In addition the normalization dificiency bit of the beginning flow process j taking turns at n, is provided by following formula:

$\mathrm{ndef}\_\mathrm{bits}\_r[j,n]=\frac{\mathrm{def}\_\mathrm{bits}\_r[j,n]}{S\_r[j,n-1]},\&ForAll;j,\&ForAll;n.---\left(72\right)$

The dificiency time slot of the beginning queue j taking turns at n is provided by following formula:

$\mathrm{def}\_\mathrm{slots}\_r[j,n]=\max (\underset{k=1}{\overset{n-1}{\mathrm{\&Sigma;}}}\mathrm{slots}\_\mathrm{alloc}[j,k]-\underset{k=1}{\overset{n-1}{\mathrm{\&Sigma;}}}\mathrm{slots}\_\mathrm{served}[j,k],0),\&ForAll;n,\&ForAll;j---\left(73\right)$

This procedure definition is as follows at the normalization dificiency time slot of the beginning queue j of n wheel:

$\mathrm{ndef}\_\mathrm{slots}\_r\left[j,n\right]=\frac{\mathrm{def}\_\mathrm{slots}\_r[j,n]}{\underset{k=0}{\overset{n-1}{\mathrm{\&Sigma;}}}\mathrm{slots}\_\mathrm{alloc}\left[j,k\right]},\&ForAll;j,\&ForAll;n.---\left(74\right)$

Make lslot[n] be last time slot of n wheel, fslot[n] be first time slot of n wheel.Suppose aw[j, n] represent that n takes turns (self adaptation) weights of distributing to flow process j.These weights determine to distribute at n wheel the timeslot number of flow process j.

The DRC value that user is asked sorts.Particularly, if DRC ₁[B, S] is better than DRC ₂[B, S], so (B/S) ₁> (B/S) ₂.Here B is the bit number of each grouping, and S is timeslot number.

For AFS scheduler every, take turns scheduling, this process is all that each is taken turns and calculates the above state variable providing, and starting of taking turns at each subsequently calculated weights for every flow process, to take turns the time slot that distributes certain quantity to this flow process at this.For this purpose, this process is used a kind of adaptive weight computing mechanism, and by a kind of each service rule of taking turns for each takes turns calculating frame structure.

adaptive weight computing mechanism

Make ndef_bits_r _{thres, min}threshold value for preassigned ndef_bits_r.This process starts to define an array ndefbits_set[n n wheel] as follows:

ndefbits_set[n]＝{k：ndef_bits_r _k≥ndef_bits_r _thres，min}。(75)

Make S_I[n] be the flow process number in this array that starts at n wheel.Similarly, ndef_slots_r _{thres, min}it is the threshold value of predefined ndef_slots_r.This procedure definition is at the ndefslots_set[n of the beginning of n wheel] as follows:

ndefslot_set[n]＝{k：ndef_slots_r _k≥ndef_slots_r _thres，min}。(76)

Make S_II[n] be the flow process number in this array of beginning at n wheel.

For flow process j arbitrarily, the beginning at n wheel, defines corresponding time slot penalty function as follows:

If ndef_bits_r _j>=ndef_bits_r _{thres, min}

Slot_comp[j, n]=slot_comp_I[j, n] * slot_comp_II[j, n], (77)

If ndef_bits_r _j<ndef_bits_r _{thres, min},

, slot_comp[j, n]=1.(78)

Herein,

If ndef_bits_r _j>=ndef_bits_r _{thres, min},

$\mathrm{slot}\_\mathrm{comp}\_I[j,n]=\frac{\mathrm{ndef}\_\mathrm{bits}\_r_j}{\mathrm{ndef}\_\mathrm{bits}\_r_{\mathrm{avg}}\left[n\right]},---\left(79\right)$

For all k:k ∈ ndefbits_set[n], $\mathrm{ndef}\_\mathrm{bits}\_r_{\mathrm{avg}}\left[n\right]=\frac{\underset{k}{\mathrm{\&Sigma;}}\mathrm{ndef}\_\mathrm{bits}\_r_j}{S\_I\left[n\right]}---\left(80\right)$

If ndef_bits_r _j<ndef_bits_r _{thres, min},

Slot_comp_I[j, n]=1.(81)

For every flow process j, define two threshold values, slot_comp_I _{thres, min}[j] and slot_comp_I _{thres, max}[j], so that:

$\mathrm{slot}\_\mathrm{comp}\_I_{\mathrm{thres},\min }\left[j\right]\&le;\mathrm{slot}\_\mathrm{comp}\_I[j,n]\&le;\mathrm{slot}\_\mathrm{comp}\_I_{\mathrm{thres},\max }\left[j\right],\&ForAll;j,\&ForAll;n---\left(82\right)$

Use these Threshold-connecteds adaptive weight computing mechanism pair described herein, can prevent any flow process in one takes turns, to consume partially a large amount of time slots, and to surpassing, to this flow process of definite limitation, do not punish simultaneously.

If ndef_slots_r _j>=ndef_slots_r _{thres, min},

$\mathrm{slot}\_\mathrm{comp}\_\mathrm{II}[j,n]=\frac{\mathrm{ndef}\_\mathrm{slots}\_r_j}{\mathrm{ndef}\_\mathrm{slots}\_r_{\mathrm{avg}}\left[n\right]}---\left(83\right)$

If ndef_slots_r _j<ndef_slots_r _{thres, min},

Slot_comp_II[j, n]=1.(84)

For every flow process j, define two threshold values, slot_comp_II _{thres, min}[j] and slot_comp_II _{thres, max}[j], so that:

$\mathrm{slot}\_\mathrm{comp}\_{\mathrm{II}}_{\mathrm{thres},\min }\left[j\right]\&le;\mathrm{slot}\_\mathrm{comp}\_\mathrm{II}[j,n]\&le;\mathrm{slot}\_\mathrm{comp}\_{\mathrm{II}}_{\mathrm{thres},\max }\left[j\right],\&ForAll;j,\&ForAll;n---\left(85\right)$

The beginning of taking turns at each, flow process is divided into as in table 5 given four groups.

Table 5

Group	ndef_bits_r flow≥ndef_bits_r thres，min	ndef_slots_r flow≥ndef_slots_r thres，min
			Group I	Be	No
Group II	No	Be
			Group III	Be	Be
Group IV	No	No

Any one, take turns the beginning of n, for each, belong to the flow process j of group II or IV, use slot_comp[j, n]=1.Beginning at n wheel, belongs to for each the flow process j that organizes I, application following formula:

slot_comp[j，n]＝slot_comp_I[j，n]。(86)

If belong to group III at the beginning flow process j of n wheel, apply following formula:

slot_comp[j，n]＝slot_comp_I[j，n]*slot_comp_II[j，n] (87)

This process is the adaptive weight of calculation process j immediately, wherein as follows at the adaptive weight of n wheel non-empty queue:

$\mathrm{aw}[j,n]=\mathrm{slot}\_\mathrm{comp}[j,n]*w\left[j\right]*\frac{r\left[j\right]}{r_{\min ,n}},\&ForAll;j\&Element;B\left[n\right]---\left(88\right)$

Herein, r _{min, n}=min{r[k]; K:k ∈ B[n] }.For every flow process j, definition threshold value aw _{thres, max}[j] also guarantees by this threshold value:

$\mathrm{aw}[j,n]\&le;{\mathrm{aw}}_{\mathrm{thres},\max }\left[j\right],\&ForAll;j,\&ForAll;n.---\left(89\right)$

Next, these adaptive weights are applied to calculating and will distribute to timeslot number and every length of taking turns of every flow process, so that:

$\mathrm{sloc}\_\mathrm{alloc}[j,n]\&Proportional;\mathrm{aw}[j,n],\&ForAll;j,j:j\&Element;B\left[n\right]---\left(90\right)$

$\underset{j:j\&Element;B\left[n\right]}{\mathrm{\&Sigma;}}\mathrm{slot}\_\mathrm{alloc}[j,n]\&le;\mathrm{round}\_\mathrm{len}\left[n\right]\&le;\mathrm{round}\_\mathrm{len}\_\mathrm{thres},\&ForAll;n.---\left(91\right)$

every scheduling rule of taking turns

Once distribute every flow process, calculated some time slots and this length of taking turns in taking turns.Next step is to be chosen in the flow process that will serve in any given time slot.In any given time slot m of n wheel, if still served in the selected grouping of one of previous time slot, without the new technological process of selecting to serve.On the other hand, if in this time slot m of n wheel, without any grouping, served, selected as follows the flow process that will serve.For scheduler, need to select each time slot m of the new technological process that will serve, and for each flow process j, calculate the selection tolerance of time slot m of the n wheel of following flow process j,

$\mathrm{YY}[j,n,m]=c[j,m,\mathrm{DRC}[j,m]]*\mathrm{wait}\_\mathrm{comp}[j,n,m]*\mathrm{DRC}[j,m],\&ForAll;n,---\left(92\right)$

So that j ∈ B[n] and slots_served[j, n] < θ (j) * slots_alloc[j, n], herein, θ (j) be for every flow process j preassigned, wait_comp be give flow process with improve its Delay boundary conditions etc. to be compensated.Make wait[j, n, m] be the stand-by period in file leader's grouping of the beginning flow process j of the time slot m of n wheel.

$\mathrm{wait}\_\mathrm{comp}[j,n,m]=\frac{\mathrm{wait}\left[j,n,m\right]}{\mathrm{wait}\_\mathrm{avg}[n,m]},\&ForAll;j,j:j\&Element;B_j---\left(93\right)$

And the beginning of the time slot m taking turns at n, flow process j has at least a grouping unsettled.Next, for flow process k calculates:

$\mathrm{wait}\_\mathrm{avg}[n,m]=\frac{\underset{k}{\mathrm{\&Sigma;}}\mathrm{wait}[k,n,m]}{\mathrm{wait}\_\mathrm{num}[n,m]},---\left(94\right)$

So that k ∈ B[n], and the number of these flow processs is wait_num[n, m].For every flow process j, to wait_comp _{thres, min}[j] and wait_comp _{thres, max}[j] these two threshold values are carried out assignment, and for guaranteeing

$\mathrm{wait}\_{\mathrm{comp}}_{\mathrm{thres},\min }\left[j\right]\&le;\mathrm{wait}\_\mathrm{comp}[j,n,m]\&le;\mathrm{wait}\_{\mathrm{comp}}_{\mathrm{thres},\max }\left[j\right],\&ForAll;m,\&ForAll;n,\&ForAll;j.---\left(95\right)$

Have and select the selected AFS scheduler thus of peaked flow process of tolerance YY to serve in any given time slot.

Shown in Figure 20 according to the AN element of an embodiment.AN element 500 receives application flows data and processes these data to feed to user's transmission.500 pairs of a plurality of application flows of AN element are dispatched, and wherein every flow process all has qos requirement.Note, as described above, application flows can comprise best effort type flow process.AN element 500 comprises flow process taxon 502, is applicable to identify be associated traffic overview and QoS overview with flow process and flow process is mapped to class (or QSG) flow process.Flow process grader unit 502 is coupled to scheduler 504, allows to enter control unit 510 and QoS monitor 506.Scheduler 504 can be realized any in various dispatching algorithms, includes, but not limited to equitable proportion (PF) algorithm and adaptive weighted PF algorithm.Allowing to enter control unit 510 allows to enter control program and is applied to the received application flows of AN500 a kind of.Allow to enter control unit 510 based on QoS and network statistics, each asked new technological process is carried out to valuation, and determined whether that enough resources can be in order to support this new technological process.Adaptive unit is coupled to and allows to enter control unit, and ASF is upgraded there.Adaptive unit 512 is applicable to current effective application flows to carry out preemption decision-making.The performance of a certain given flow process relevant data rate, time slot used and other QoS and network statistics flow process is considered in preemption.QoS monitor is applicable to monitor the qos requirement of the application flows receiving.Note, AN element 500 receives many flow processs conventionally, and between them, selects to feed to user's transmission.Scheduler 504 receives from allowing to enter control unit 510 information whether being allowed to enter about new technological process.Scheduler 504 receives qos statistic amount and out of Memory from QoS monitor 506, and wherein scheduler 504 these QoS information of application are selected the flow process of transmission.

Given is herein for the method and apparatus that allows to enter control, preemption and scheduling of application flows in wireless communication system.Allow to enter and control the data transfer rate of considering that new technological process is asked, and this is compared with available resources.Once be allowed to enter, flow process is provided for scheduler, and scheduler is applicable to carry out every flow process and each user's analysis, is chosen in the user of transmitting in the time period of each time slot or appointment.

Those skilled in the art can understand, and information and signal can represent by various method and technology.For example, running through the citable data of above description, instruction, order, information, signal, bit, symbol and chip can be represented by voltage, electric current, electromagnetic wave, magnetic field or magnetic particle, light field or light particle or its combination in any.

In addition, those skilled in the art also will understand, and in conjunction with the described various illustrative logical blocks of each embodiment of explaining, module, circuit and algorithm steps, can be implemented as electronic hardware, computer software or both combinations herein.For this interchangeability of hardware and software is clearly described, above with regard to its function general description various example components, frame, module, circuit and step.This type of function is embodied as hardware or software is the design restriction of depending on specific application program and restriction whole system.Those skilled in the art can be the described function of each specific application program accomplished in various ways, but this type of realization determines should not be construed as causing to depart from scope of the present invention.

In conjunction with the described various illustrative logical blocks of each embodiment disclosed herein, module and circuit, can realize or carry out with any combination that general processor, digital signal processor (DSP), application-specific integrated circuit (ASIC) (ASIC), field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components or its are designed to carry out various functions described herein.General processor can be microprocessor, and still, alternatively, processor can be any conventional processors, controller, microcontroller or state machine.Processor can be embodied as the combination of some computing equipments, for example DSP and microprocessor, multi-microprocessor, in conjunction with the combination of one or more microprocessors of DSP core, or any other this type of configuration.

In conjunction with the step of the described method of each embodiment disclosed herein or algorithm, can be embodied directly in hardware, in the software module that processor carries out or in the two combination and specialize.Software module can reside in the storage medium of RAM memory, flash memory, ROM memory, eprom memory, eeprom memory, register, hard disk, moveable magnetic disc, CD-ROM or any other form well known in the prior art.Exemplary storage medium is coupled to processor, so that processor can be from this read information, and information is write in this storage medium.Or storage medium can be integrated in processor.Processor and storage medium can reside in ASIC.ASIC can reside in user terminal.Or processor and storage medium can be used as discrete assembly and reside in user terminal.

Any technical staff provides the above description of disclosed embodiment, so that can manufacture or use the present invention in this area.To those skilled in the art, to the various modifications of these embodiment, will be apparent, and universal principle as defined herein be applicable to other embodiment, and can not depart from the spirit and scope of the present invention.Therefore, the embodiment shown in not attempting to limit the invention to herein, but to make it meet the most wide in range scope consistent with principle disclosed herein and novel characteristics.

Claims (5)

1. one kind for the equipment supporting the communication system Resources allocation of Internet Protocol (IP) application program, described communication system comprises an access network (AN) and a plurality of accessing terminal (AT), each in described AT sends a requested data rate to described AN, described communication system support has the application flows of qos requirement to described AT, described equipment comprises:

The flow process taxon that the service quality (QoS) that is applicable to receive application flows and determine described application flows requires;

The scheduler that be coupled to described flow process taxon, is applicable to packet data transmission to dispatch;

What be coupled to described flow process taxon and scheduler allows to enter control unit, describedly allows to enter control unit and is applicable to allow application flows to enter when available resources are supported a requested data rate;

Be coupled to described flow process taxon, scheduler and allow to enter the QoS monitor of control unit, described QoS monitor is applicable to determine that the QoS of described application flows violates and safeguard qos statistic amount; And

Be coupled to the described adaptive unit that allows to enter control unit, described adaptive unit is applicable to upgrade by following operation the tolerance of available resources:

Upgrade available resources and reservation of resource;

Upgrade and monitor described qos statistic amount;

According to the available resources of having upgraded and reservation of resource and the qos statistic amount upgraded, upgrade adaptive reservation factor;

Recalculate the hierarchical resource of estimation;

Determine whether that new flow process is requested;

If do not have new flow process requested,

Determine the existence of user in the sector of described communication system;

Determine that the sampling for described application flows continues the cycle;

For described application flows is selected QoS dispatch group (QSG) parameter;

For described application flows, determine the ratio that has the IP grouping that postpones violation during described sampling continues the cycle;

For described application flows is calculated the ratio that has the IP grouping of shake violation during described sampling continues the cycle;

The first mark of calculating described application flow time slot used during described sampling continues the cycle;

Determine the second mark of the time slot of the described application flows during described sampling continues the cycle with qos requirement;

Check that QoS violates and determines QoS packet ID;

Quantity for each QoS grouping calculation process;

Calculating is corresponding to the 3rd mark of the QoS flow process of each qos statistic amount;

By flow process quantity and described the 3rd mark and predetermined threshold for each QoS grouping; And

According to described, relatively adjust described adaptive reservation factor.

2. equipment as claimed in claim 1, is characterized in that, described scheduler is applicable to dispatch in response to requested data rate application programs flow process.

3. equipment as claimed in claim 1, is characterized in that, described scheduler is applicable to dispatch in response to qos statistic amount application programs flow process.

4. equipment as claimed in claim 1, is characterized in that, described scheduler is applicable to dispatch in response to qos requirement application programs flow process.

5. equipment as claimed in claim 1, is characterized in that, described scheduler is applicable to dispatch based on subscription information application programs flow process.