CN1330153C - Scheduler for a shared channel - Google Patents

Scheduler for a shared channel Download PDF

Info

Publication number
CN1330153C
CN1330153C CNB038195674A CN03819567A CN1330153C CN 1330153 C CN1330153 C CN 1330153C CN B038195674 A CNB038195674 A CN B038195674A CN 03819567 A CN03819567 A CN 03819567A CN 1330153 C CN1330153 C CN 1330153C
Authority
CN
China
Prior art keywords
subscriber
service
base station
subscriber station
data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CNB038195674A
Other languages
Chinese (zh)
Other versions
CN1692663A (en
Inventor
费萨尔·沙德
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Soma Networks Inc
Original Assignee
Soma Networks Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Soma Networks Inc filed Critical Soma Networks Inc
Publication of CN1692663A publication Critical patent/CN1692663A/en
Application granted granted Critical
Publication of CN1330153C publication Critical patent/CN1330153C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2416—Real-time traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2425—Traffic characterised by specific attributes, e.g. priority or QoS for supporting services specification, e.g. SLA
    • H04L47/2433—Allocation of priorities to traffic types
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/535—Allocation or scheduling criteria for wireless resources based on resource usage policies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/04—Large scale networks; Deep hierarchical networks
    • H04W84/08—Trunked mobile radio systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/18—Negotiating wireless communication parameters
    • H04W28/22—Negotiating communication rate
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/52—Allocation or scheduling criteria for wireless resources based on load
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/543—Allocation or scheduling criteria for wireless resources based on quality criteria based on requested quality, e.g. QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
    • H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

A method, system and apparatus for scheduling data to subscriber stations from a base station over a shared channel. Data destined for each subscriber station is placed into queues at the base station. The base station allocates a portion of the shared channel to each particular queue based upon that queue's priority value. The priority value for each queue is determined by an adjusted QoS value and an adjusted throughput value. The QoS value indicates whether a subscriber station has been receiving data according to an agreed-upon QoS level. The throughput value indicates the data rate that can be achieved by transmitting to that subscriber station. These two values are examined by a scheduling policy at the base station. Scheduling policies can include scheduling data to emphasize fairness between subscriber stations, scheduling data to improve overall throughput, and scheduling data to achieve a balance between fairness and throughput.

Description

The scheduler that is used for shared channel
Background of invention
The present invention relates to a kind of system, method and apparatus that in network, is used for data dispatching.More specifically, the present invention relates to a kind of system, method and apparatus that is used for data dispatching business on shared channel.
Background of invention
In comprising the network of shared channel (this shared channel is used for to the data service of a plurality of receiving stations transmission from single cell site), the cell site must determine how to distribute its downlink capacity between receiving station.The example of this network comprises based on the data network of CATV and wireless network, such as the AMOSPHERE by assignee of the present invention sold TMSystem, or the like.In the latter's network, base station transceiver will be served a plurality of subscriber stations by air interface, and this air interface provides that share and down link special use (base station is to subscriber station) channel.Because the transmission capacity of this system is restricted (typically being subjected to the restriction of available bandwidth), therefore difficulty is, distributes available capacity guaranteeing the effective use to transmission capacity between the user, and the acceptable grade of service is provided.Therefore, this system can benefit from the suitable transmitting and scheduling on (a plurality of) shared link.
The simplest a kind of dispatching method is circulation (round-robin) scheduling.Round-robin scheduling provides the transmission time of equivalent for each subscriber station on shared channel.Although this is an advantageous method, in many networks,,, make not to be that all subscriber stations have identical Data Receiving speed owing to factor such as different signal to noise ratio (snr)s such as the network of those uses based on radio link in some environment.Therefore, in fact circulation is shared can not provide equal data passes for each subscriber station on shared down link.This is unequal can to cause unsatisfied user, particularly is in the user of the subscriber station at service area edge for those uses, and this user has lower basically mean data rate than having the user who is positioned near the subscriber station of base station.And this unequal service provider of requirement guards when the performance capability that is provided by this system is provided.
Another known dispatching method is fair in proportion share (proportionally fairsharing), it provides the amount of adjustable channel capacity for each subscriber station on shared link, wherein each subscriber station receives the Channel Sharing of being regulated by their Data Receiving speed, and each subscriber station receives approximately uniform average amount thus.Although fair in proportion sharing can provide impartial preferably degree between subscriber station, but because the subscriber station that the base station must be used to a large amount of channel capacity inputs to serve the poor SNR of having of fraction, so it can also cause the integral body of total system's throughput to descend.
Than above-mentioned two kinds of methods, it will be concentrated on to subscriber station provides equal service, and some other method will be concentrated on, and be cost with the fairness between the subscriber station, realize crossing over the optimized throughput of whole system.People such as Bender are at their document " CDMA/HDR:A Bandwidth-Efficient High-Speed Wireless Data Servicefor Nomadic Users " (IEEE Communication Magazine, July 2000, pp.70-78) explained in how the unequal stand-by period that has between the subscriber station of different Data Receiving abilities (being different SNR) can increase the total throughput on the down link in the network.By on shared link for having the channel capacity that the subscriber station of instantaneous SNR preferably provides major part, the base station can be launched more generally professional.The method has increased the total throughput of system, has removed the performance that overstocks and improved overall network potentially, but for the subscriber station with relatively poor average SNR, has also produced stand-by period and lower data rate.In order to guarantee that all subscriber stations have tolerable independent data rate at least, this system has limited maximum permission latency value at the subscriber station with relatively poor SNR.
People such as Liu are at their document " Opportunistic Transmission Scheduling withResource-Sharing Constraints in Wireless Networks " (IEEE Journal onSelected Areas in Communication, Vol.19, No.10, October 2001, the potentiality of improving radio resource efficiency by the otherness of utilizing channel condition have been discussed pp.2053-2064), have still been kept the level of fairness between the subscriber station simultaneously.In their model, each subscriber station is assigned the transmission time of fraction.Similar with above-described method, be stored in the service queue about the packet of each subscriber station, occur until their scheduled transmission time.Yet the base station is measured the link-quality (it can change in time) at each subscriber station place continuously, and is launching to most probable subscriber station when each subscriber station provides required mean data rate.Although opportunistic transmitting and scheduling can provide total throughput and the increase of throughput separately, it does not still have its defective.A defective is, suitable time of base station waits with when subscriber station is launched, the stand-by period of opportunistic scheduling may increasing subscriber station.Another defective is that the data level that this method hypothesis is constant etc. are to be launched, such as the WAP session on the cell phone.This opportunistic method had not both been considered the artificial difference that the user handles, and such as the difference that is provided by different service quality (QoS), did not consider the difference in the processing of dissimilar media datas yet.For example, the subscriber station with different priorities can be served in the base station, use the user of ip voice (VoIP) service that can't stand the stand-by period to receive guaranteed service thus, and another just will only provide best effort by the base station the user of Web surfing.
People such as Andrew are at their document " Providing Quality of Service over aShared Wireless Link " (IEEE Communications Magazine Feb 2001, pp.50-54) having described a kind of new dispatching algorithm in is Modified Largest Weighted DelayFirst (M-LWDF), and it has improved some above-mentioned defective.The similarity of M-LWDF and opportunistic scheduling is that its scheduled transmission is in order to utilize the SNR fluctuation.Yet,, specific Business Stream (propagating into their subscriber stations separately on down link) has been provided the priority treatment than other Business Streams according to the QoS grade of Business Stream.For each time slot (t), the value of each service queue is calculated in the base station, and this value comprises that packetization delay multiply by the product that the channel capacity that is used for this subscriber station multiply by arbitrary value.Service queue with the highest derivation value is dispatched.On mathematics, each time slot (t) is served function gamma jW (t) r j(t) Zui Da wait packet queue (j).W j(t) be the current stand-by period that is stored in the grouping among the formation j, r j(t) be channel capacity or the data rate of data flow j, and γ jIt is arbitrary value.If γ is identical for each packet queue, then all subscriber stations have identical QoS grade.Like this, the packet queue with higher γ value has the higher grade of service than the packet queue with lower γ value.If γ (t) is identical for each packet queue, then all subscriber stations have identical data rate.Like this, the packet queue with higher γ (t) value can be launched with higher mean data rate than the other packet queue with identical γ value.Although M-LWDF provides some advantage with respect to prior art, it still has its limitation.The defective of a key is that M-LWDF is not provided for providing the method for the strategy of fairness between the subscriber station with different channel qualities.Another defective is that M-LWDF only can dispatch the business at unique user station in each time slot.This user for grouping to be passed such as every other has produced significant stand-by period amount (x number of time slot).And because each time slot carrying is used for the data service at unique user station, so some capacity of this time slot might be wasted owing to inner division.
Therefore, a kind of data transmission scheduling device need be provided, its provide for the service provider realize being designed to provide the strategic competence of improving sector throughput scheduling in, for subscriber station provides QoS the service of differentiation, fairness between the user, perhaps this both some combination.And required is, realizes a kind of data transmission scheduling device, and it is opportunistic, and can utilize the otherness in the Data Receiving characteristic of the subscriber station of being served by transmitter.At last, this scheduling mechanism should be enough flexibly, in order to be suitable for the multiple computing capability at place, base station.
Summary of the invention
The object of the present invention is to provide a kind of data transmission scheduling device of novelty, its elimination or alleviated the defective of some prior art mentioned above at least.
According to a first aspect of the invention, provide a kind of scheduling to be used on shared channel from method from the base station to the data of a plurality of subscriber stations transmission, described method comprises:
From the scope of possible fairness factor, determine fairness factor, the data dispatching strategy that the first terminal expression of wherein said scope has the maximum fairness between described a plurality of subscriber stations, and the second terminal expression of described scope is at the data dispatching strategy of the maximum data business on described shared channel;
Have each subscriber station in described a plurality of subscriber stations of the data of its transmission for described base station:
Determine quality of service precedence values, described quality of service precedence values is represented the priority of described subscriber station with respect to other subscriber stations in described a plurality of subscriber stations;
Determine that if data are scheduled to described subscriber station, described throughput value representation waits to move to the data volume of described subscriber station by value;
Determine total priority value, described total priority value be the described service quality priority regulated according to described fairness factor with according to the reverse adjusting of described fairness factor described by value and; And
From having the subscriber station of high total priority value, with at least one to described a plurality of subscriber stations of the data dispatch on the described shared channel part.
According to a further aspect in the invention, provide a kind of system that is used to transmit data, having comprised:
A plurality of subscriber stations, this each subscriber station has processor, modulator-demodulator, radio device and antenna, and each subscriber station can be operated the request that is used to launch for from the dedicated data channel of base station; With
The base station, it has processor, modulator-demodulator, radio device and antenna, and can operate the described request that is used to receive from described subscriber station to dedicated data channel, and be used for dispatching the data that are used on shared channel, being transferred to described a plurality of subscriber stations according to scheduling strategy, this scheduling strategy change is dispatched about the fairness between the subscriber station and is dispatched about the priority between the throughput of the extremely improvement of described a plurality of subscriber stations.
The invention provides a kind of being used to dispatch on shared channel from the base station to the mthods, systems and devices of the data of a plurality of subscriber stations.With each subscriber station is that the data of target are placed in the independent formation at place, base station.This base station distributes a part of shared channel in order to launch the data in each particular queue based on its priority value of distributing to this formation.The priority value of each formation determines that by qos value with by value wherein each in these two values is regulated by fairness factor.Qos value represents that whether subscriber station is according to the data of the QoS grade reception of reaching an agreement on from the base station.The throughput value representation is to the obtainable data rate in the base station that this subscriber station is launched.Fairness factor is represented the scheduling strategy at place, base station.Scheduling strategy can comprise, data dispatching is with the fairness between the subscriber station of emphasizing to be in the specific QoS grade, and data dispatching is so that the throughput maximum on the shared channel, and data dispatching is to obtain the balance between fairness and the maximum throughput.
The accompanying drawing summary
Now,, will only embodiments of the invention be described by means of example by with reference to the accompanying drawings, in the accompanying drawings:
Fig. 1 is the schematic diagram of wireless network according to an embodiment of the invention;
Fig. 2 is the diagram of communication link as shown in Figure 1, and it comprises a plurality of channels;
Fig. 3 is the schematic diagram of base station shown in Figure 1;
Fig. 4 is the schematic diagram of a subscriber station shown in Figure 1;
Fig. 5 is the schematic diagram of the scheduler that is used for shared channel that moves on base station shown in Figure 3;
Fig. 6 shows broadcast downlink channel scheduler shown in Figure 5 and how to manage to the flow chart of the scheduling of the overstocked Business Stream of shared channel.
Detailed Description Of The Invention
With reference now to Fig. 1,, the wireless network that is used to transmit data is marked on 20 places usually.Network 20 comprises radio base station 24 and a plurality of subscriber station 28a, 28b...28n.In current preferred embodiment, radio base station 24 is by suitable gateway and one or more backhaul (not shown), such as T1, T3, E1, E3, OC3 or other suitable land line links, perhaps satellite or other radio or microwave channel link, perhaps as those skilled in the art expected any other be suitable as the link that backhaul is operated, be connected at least one data telecommunications network
(not shown) is such as based on land line data switching networks, packet network etc.
Base station 24 communicates with subscriber station 28, and this subscriber station 28 can be a permanent plant, equipment or mobile device move about.Subscriber station number " n " by base station 24 services can change according to the setting and the requirement of available radio bandwidth amount and/or subscriber station 28.
As illustrated in fig. 1, subscriber station 28 needs not be symmetry with respect to the geographical distribution of base station 24, and because multiple factor, signal to noise ratio (snr) in subscriber station 28 places experience changes, therefore physically the approximating subscriber station in position needn't experience identical or similar Data Receiving speed, and these factors comprise: geographical environment (exist or lack and can reflect or the building of shielded signal), radio environment (exist or lack radio noise source) etc.Therefore, in most of situation, the subscriber station 28 of being served by base station 24 can have significantly different SNR, and these SNR will change in time.
As the skilled personnel to understand, subscriber station 28 can be divided into different sector 36 geographically, and its directional antenna by 24 places, base station forms, can be from the number of the subscriber station 28 of single base station location service in order to increase.In this case, each sector 36 is basically as different base stations, and base station 24 can manage the Internet resources in each sector 36, and separate with other sectors 36.
Although Fig. 1 only shows a base station 24, but those skilled in the art will further recognize, network 20 can comprise the base station 24 that distributes on a plurality of geography, it has the overlapping sector 36 that covers subscriber station 28, and each subscriber station 28 in the overlay area of wherein overlapping sector 36 can be selected which base station to provide service for it by.
In each sector 36, by setting up communication link 32 between radio device each subscriber station 28 in base station 24 and sector 36.Communication link 32a is transmitted in information transmitted between base station 24 and the subscriber station 28b, and communication link 32b is transmitted in information transmitted between base station 24 and subscriber station 28c and the 28d, or the like.Can use multiple multiple access techniques to realize communication link 32, it comprises TDMA, FDMA, CDMA or such as the hybrid system of GSM etc.In the present embodiment, the data of emission use CDMA to launch as multiple access techniques on communication link 32, and data have the form of grouping, launch in a minute crack time frame (slotted time frame), and its details will obtain more detailed discussion hereinafter.
As use herein, term " grouping ", " being grouped " and " grouping " refer to the whole configuration of packet data transmission, are used for the reception in predetermined this grouped data of target receiver place.The grouping of data can comprise, but be not limited to, use forward error correction (FEC) sign indicating number (never being encoded to higher level code and/or different coding methods) of different brackets, use the code element of multiple grade to repeat, use different modulation scheme (4-QAM, 16-QAM, 64-QAM etc.) and any other the technology and the method that are used for the configuration data transmission, it selects the probability of required radio (perhaps other physical layers) stock number, data rate and the error of transmission of suitable this transmission.For example, data can through-rate 1/4 FEC coding (each data bit transmits in 4 bit informations) and 16-QAM modulate and divide into groups, in order to be transferred to first intended receiver, and through-rate 1/2 FEC coding and 64-QAM modulation are divided into groups, in order to be transferred to second intended receiver, it has than the better quality of reception of first intended receiver.
Communication link 32 is at up link (from subscriber station 28 to the base station 24) and down link (24 to subscriber station 28 from the base station) the enterprising line operate of direction.Provide the method for up link and down link direction not have specific restriction, in the present embodiment, communication link 32 is operated by Frequency Division Duplexing (FDD) (FDD).Yet other provide the method for up link and down link direction, such as time division duplex (TDD) and hybrid plan also within the scope of the invention.
With reference now to Fig. 2,, in current embodiment, communication link 32 comprises a plurality of channels, and it is to realize by the orthogonal coding of link 32 in current CDMA implementation.In the down link direction, base station 24 uses the shared channel that is called as broadcast data channel (BBCH) 38 to transmit the professional and burst service (mainly comprising signaling and Internet service) of the variable bit rate of crossing over sector 36.BDCH 38 utilizes adaptive FEC and modulation to make the downlink capacity maximum, and comprises a plurality of groupings, perhaps more commonly, comprises the segmentation of the packet that is used for multiple subscriber station 28, and it is all become single frame by time division multiplexing together.In the present embodiment, BDCH 38 can be set to: have spreading factor 4, wherein can send 8 data blocks in a frame of 10 milliseconds; Have spreading factor 8, wherein in a frame, can send 4 data blocks; Perhaps have spreading factor 16, wherein in a frame, can send 2 data blocks.And in the present embodiment, can support one or more BDCH 38 for each sector 36 in base station 24 constantly at any one.
At uplink direction, use dedicated data channel (DDCH) 44 that data service is sent to base station 24 from subscriber station 28.Set up discrete DDCH 44 between base station 24 and each subscriber station 28, it has the communication link 32 of activation.Typically in frequency band, use DDCH44 that signaling traffic is sent to base station 24 from subscriber station 28.Subscriber station 28 is measured their reception SNR or is received other modules from the ability of the data of base station 24 about their, and uses the top signaling agreement regularly to give base station 24 with this report information on their DDCH 44.Subscriber station 28 with high SNR needs less chnnel coding than the subscriber station with lower SNR, and can use the modulation of higher-order, and therefore, each piece that transmits on BDCH 38 uses the different block type grouping of different FEC type, FEC speed, modulation (be etc.).Fig. 3 shows the example of base station 24 in further detail.For the sake of clarity, base station 24 shows the example of the base station of single sector.Yet the base station 24 of many sectors also within the scope of the invention.Base station 24 comprises antenna 50, and perhaps a plurality of antennas are used for receiving on communication link 32 and communicate by letter with transmitting radio.Next, antenna 50 is connected to radio device 52 and modulator-demodulator 54.Modulator-demodulator 50 is connected to microprocessor-router component 56, such as the IntelCorporation Pentium processor system that uses such as traditional (SuSE) Linux OS.Microprocessor-router component 56 is responsible for all subscriber stations 28 in its sector 36 are carried out service dispatching, and carries out provided for radio resources management.Should be appreciated that assembly 56 can comprise a plurality of microprocessors as required, if desired, and/or router can be provided as discrete unit when needed.Router in microprocessor-router component 56 is connected to backhaul 58 in any suitable manner, and next it be connected to the data network (not shown) with base station 24.
With reference now to Fig. 4,, shows the example of subscriber station 28 in further detail.Subscriber station 28 comprises antenna 60, and perhaps a plurality of antennas are used for receiving on communication link 32 and communicate by letter with transmitting radio.Next antenna 60 is connected to radio device 64 and modulator-demodulator 68, and next it be connected to microprocessor assembly 72.
Microprocessor assembly 72 can comprise, for example, by the StrongARM processor that Intel Corporation makes, it carries out multiple function, comprises realizing A/D-D/A conversion, filter, encoder, decoder, data compressor, decompressor and/or packet decomposition.Microprocessor assembly 72 also comprises buffer 74, and the queuing data business that is transferred on the communication link 32 is waited in its storage.
As shown in Figure 4, microprocessor assembly 72 makes modulator-demodulator 68 with FPDP 76 interconnection, is used for subscriber station 28 is connected to the data client device (not shown), such as PC, personal digital assistant or the like, it can be operated and be used to use the data that receive on communication link 32.Therefore, microprocessor assembly 72 can be operated the data that are used between deal with data port 76 and the modulator-demodulator 68.Microprocessor assembly 72 also is interconnected at least one telephony port 80, is used for subscriber station 28 is connected to telephone plant (not shown) such as phone.In some cases, particularly in the situation of mobile subscriber station 28, data client device can be integrated in the subscriber station 28.
With reference now to Fig. 5,, shows the logical construction of shared channel (such as the BDCH scheduler) usually at 100 places.Scheduler 100 is responsible for will planning to be transmitted into from base station 24 the queuing data packet allocation of subscriber station 28 to the bit stream of BDCH 38, keep QoS item simultaneously about any agreement of each subscriber station 28, and realize scheduling strategy, so that provide the variation grades of the priority ordering of total throughput on fairness between the subscriber station 28 and the BDCH 38 based on the fairness factor that provides by Virtual network operator (going through hereinafter).Be used for the method that scheduler 100 is realized scheduling strategy and scheduling queue grouping by having further described hereinafter with reference to figure 6.In current embodiment, scheduler 100 is the software programs that move on microprocessor assembly 56 in base station 24.Yet, other implementation, such as hardware and firmware implementation also among scope of the present invention.
The data 102 of going to each subscriber station 28 were ranked in service queue 104 before being transmitted into multiple subscriber station 28 by following current on the BDCH 38.Each data flow 102 can comprise the data of number of different types, such as the web page, FTP data, Streaming Media, ip voice data or other data types that those skilled in the art expected.At being known for base station 24 and being connected to the service queue 104 that each subscriber station 28 of base station 24 is set up about subscriber station 28 by communication link 32.The example of Fig. 5 shows the situation with 4 service queues, and each formation is served corresponding to the stream of subscriber station 28 (for example service queue 104a remains with the business of going to subscriber station 28a, etc.).In the example shown in the figure, service queue 104a has 5 queued packets, and 104b does not have queued packets, and service queue 104c has 3 queued packets, and service queue 104d has 4 queued packets.Therefore, service queue 104a, 104c and 104d have the stream of overstocking (for example, the formation of non-zero length), and service queue 104b does not have the stream of overstocking.
Except remaining with service queue 104 n, scheduler 100 storages have the excited users station 28 of Business Stream about each nLink quality parameter 108 n, negotiate service shares parameter 112 nShare parameter 116 with the service of measurement nAnd, scheduler 100 storage fairness factor 120.As hereinafter describing in detail more, there is the example of at least one fairness factor 120 in each sector 36.
Link quality parameter 108 nRemain with in the base station 28 nSuitable measurement result (the α of the quality of reception of place's experience Subscriberstation28n).In the present embodiment, the value of link quality parameter 108 is estimated value α of the signal to noise ratio (snr) of at least one suitable channel Subscriberstation28n=E c/ N t, E wherein cBe illustrated in the BDCH channel signal energy of each chip at the antenna place of subscriber station 28, and N tBe illustrated in the overall noise that antenna 60 places of subscriber station 28 receive, this overall noise equal average noise density, from the interference of other interfered cells and sector, add that multipath disturbs and.In the present embodiment, each subscriber station 28 nBy on such as the uplink channel of DDCH 44, launching its reception SNR, be updated periodically its value about link quality parameter 108.
Negotiate service is shared parameter 112 nStorage is about subscriber station 28 nThe value (Φ of agreement service quality rating Neg).In the present embodiment, the negotiate service share parameter is shown assurance data rate (bits/s); Yet, other definition that negotiate service is shared, the maximum delay such as before the emission wait grouping perhaps guarantees the combination of data rate and maximum delay, also within the scope of the invention.Subscriber station 28 with value of the shared parameter 112 of higher negotiate service will be shared the subscriber station 28 reception better service of parameter 112 than having low negotiate service.In the present embodiment, it is when subscriber station 28 is connected to base station 24 that negotiate service is shared parameter 112, holds consultation between base station 24 and each subscriber station 28.Yet, determine that the method for the shared parameter 112 of negotiate service does not have specific restriction.For example, by based on the medium type to subscriber station 28 to be launched, monthly order the service that agreement, service fee or the like provide, can determine that negotiate service shares parameter 112 about subscriber station 28.Those skilled in the art will expect the method for other the shared parameter 112 of definite negotiate service.
Parameter 116 is shared in the service of measurement nStorage is about subscriber station 28 nThe value (Φ that shares of the service of measurement Meas).It is that the transmission of BDCH 38 is gone to this specific user and stood 28 that the service of this measurement is shared nThe part of grouping.Therefore, parameter 116 is shared in the service of measuring nHigher value represent to pass to this subscriber station 28 nHigher average data rate.At specific subscriber station 28 n, can make the service of measurement share parameter 116 nEqual the mean bit rate on the Fixed Time Interval.
At last, fairness factor 120 is adjustable parameters (F) of expression scheduling strategy, and the fairness that this parameter control is flowed separately is with respect to the balance between the total throughput on the communication link 32.There is an example of fairness factor 120 in each sector 36, and it can be by the Virtual network operator setting, and perhaps, there is an example of fairness factor 120 in (wherein in the situation that each sector 36 exists more than a BDCH 38) each BDCH 38.In current embodiment, F is carried out normalization, and its scope is from 0 to 1.The such strategy of 0 expression is set, promptly by with data dispatch to subscriber station 28 with optimum SNR, do not consider to provide the fairness between the subscriber station 28, priority ordering is carried out in the scheduling of data flow 102, in order to the throughput on the down link is carried out priority ordering.The such strategy of 1 expression is set, i.e. priority ordering is carried out in the scheduling of convection current 102, and in order to the fairness between the subscriber station 28 to be provided, all subscriber stations 28 that are in identical QoS grade thus will receive identical data rate, and does not consider their SNR separately.
In case the grouping in the service queue 104 is dispatched by scheduler 100, then they will move in the piece 128 of frame 124 of BDCH 38.Usually, the spreading factor of BDCH 38 is predetermined by Virtual network operator, and fixes for the subscriber station 28 of specific BDCH 38 services for each.In current embodiment, spreading factor 4 is preferred (like this, providing 8 pieces 128 for each frame 124).
As the skilled personnel to understand, the structure of piece 128 can change according to the difference that modulation order, code element repeat etc.The information bit number that transmits in each piece 128 can change according to employed block structure.In current embodiment, each piece 128 can transmit 320～9,744 information bits.Usually, the piece 128 with less information pay(useful) load uses the modulation of lower-orders and higher code element to repeat, the noise that is experienced in order to the subscriber station 28 that is provided for having low SNR and the communication link 32 of other difference.Can use the block structure that transmits more information bit with communicating by letter of the subscriber station 28 with SNR preferably.In current embodiment, in identical frame 124, can transmit and have different block structured pieces 128.
With reference now to Fig. 6,, show the flow chart of the method that is used to dispatch the transfer of data that is used for BDCH 38, it starts from 200.In current embodiment, method described below is moved once for the frame 124 of each scheduling.Yet the frequency of this method does not have specific restriction, and when needed, it can be than describe more continually or not operation continually more herein.
In step 200, the value (between 0 and 1) of the fairness factor 120 by sector 36 is set is determined scheduling strategy.As indicated above, the scheduling strategy that 0 value representation is such, wherein 100 pairs of sector throughputs of scheduler are carried out priority ordering and are crossed fairness between the subscriber station 28, and the such scheduling strategy of 1 value representation, wherein scheduler 100 with maximum fairness to subscriber station 28 emission queued packets.
Be contemplated that the fairness factor 120 that the somewhere between two borders (0 and 1) of this scope is provided with will be preferred in the great majority configuration.For example, 0.5 the strategy that will provide such is set, promptly it provides rational fairness degree to most of subscriber station 28, still utilizes the otherness of SNR simultaneously and makes down link throughput maximum.It should be noted that, even be set to 1 o'clock (representing maximum fairness) in fairness factor 120, because the fairness during fairness factor 120 is determined to dispatch and only relevant with different SNR, the subscriber station 28 that therefore has different QoS grades 112 will differently be dispatched according to their QoS grade.For the service that equates generally is provided, QoS grade 112 should be identical for all subscriber stations 28.
In step 204, scheduler 100 receives each and has link quality parameter 108 (that is its corresponding business formation 104, of overstocking professional subscriber station 28 nIn have the Any user station 28 of at least one grouping n).Link quality parameter 108 can be upgraded by this method when each iteration, perhaps can longly upgrade at interval with suitable.In step 208, scheduler 100 calculates the priority (q based on QoS of each service queue 104 f) value, this service queue 104 has at least one grouping in the formation of this frame.q fBe the positive number between 0 and 1, have the higher priority of this formation 104 of higher value representation.Q greater than 0.5 fData in the value representation formation 104 are (that is, the service of measurement are shared the negotiate service that parameter 116 shares in the parameter 112 less than negotiate service and shared) that lag behind, and less than 0.5 q fThis specific formation 104 of value representation leading in service (that is, measuring the shared parameter 116 of service shares greater than the negotiate service in the shared parameter 112 of negotiate service).Higher q fValue means the data needs service early in the formation 104.
By at first sharing Φ from the service of measuring FmeasIn deduct required service and share Φ Freq, this difference adds 0.5 then divided by 2, has obtained q fValue:
q f = Φ freg - Φ fmeas 2 + 0.5
Φ FreqAnd Φ Fmeas(further describing hereinafter) all is defined within the scope between 0 and 1, thus q fThe number between 0 and 1 always.
(Φ is shared in required service Freq) represent that sharing parameter 112 required services about the negotiate service that will satisfy shares amount.For each frame of backlog queue 104, required service is shared to be increased.In current embodiment, following calculating Φ Freq:
Φ freq = | w - f | Φ f Σ n ∈ wr - ∈ B ( n ) Σ Φ r
Wherein molecule be in frame slip at interval about flowing the number (w of 102 overstocked frame f) negotiate service of consulting when being provided with shares parameter 112 (Φ f) long-pending.Absolute value sign is used to represent the length of vector, and B (n) is the index of the stream that overstocks in the process of frame n.Denominator be that the negotiate service of all backlog queue 104 in identical frame slip is at interval shared and.
By obtaining all bits of emission on BDCH 38 in the sliding window interval about selected queue 104, and make its all bits, determine the shared (Φ of the service of measuring about each formation 104 divided by emission on BDCH 38 in identical sliding window interval Fmeas).In current embodiment, following calculating Φ Fmeas:
Φ fmeas = Σ n ∈ w - b f ( n ) Σ n ∈ wr - ∈ B ( n ) Σ b r ( n )
B wherein f(n) be the bit number of gravity flow f emission in the process of frame n.
In step 212, scheduler 100 calculates the throughput priority (t of each backlog queue 104 of this frame f).t fThe normalization that is the SNR of specific stream 102 (f) is represented, has produced the value between 0 and 1, and wherein 0 represents minimum SNR ratio, and the maximum possible SNR of 1 expression.On mathematics:
t f = b ( α ss ( f ) ) - b ( α min ) b ( α max ) - b ( α min )
Wherein b (x) is the bit number of piece 128 under SNRx, and is determined as block structure.
In step 216, by calculating with QoS priority (q f, as determined in the step 208) and by value (t f, as determined in the step 212) and value that addition drew, total pri function (p that scheduler 100 calculates about each backlog queue 104 f), wherein each priority multiply by the inverse of fairness factor 120 or fairness factor 120 respectively.
In current embodiment, following calculating q f:
p f＝Fq f+t f(1-F)，f∈B
Wherein B is the set of all backlog queue 104.
In following formula, F is a fairness factor 120.When fairness factor 120 is 0, F and q fLong-pending be 0, and as the item by value (α ' Ss (f)Be maximum (1-F)).When fairness factor is 1, q fBe maximum, and obtain zero amassing by the multiplication of value.
In step 220,, sort out all backlog queue 104 with descending, { p ' } by total pri function (p ') of in step 212, determining | p P ' (i)〉=p P ' (j), i＜j.
In step 224, from having the formation 104 of the highest total priority value p ' (1), scheduler 100 based on this formation 104 with respect to whole total priority values of whole backlog queue and priority, by calculating for its percentage of available 128, calculating will be distributed to the maximum number of the piece 128 of this formation 104, and it is called as (m ' (i)) herein.More specifically, scheduler 100 makes the number of the piece 128 in the frame 124 (M) and the pri function (p of this formation 104 f) (as determined in the step 212) multiply each other, make then the result divided by all pri functions of all backlog queue and (also in step 212, determining).In current embodiment, the maximum number m ' of following definite piece 128 (i)
m ' ( i ) = round ( Mp ' ( i ) Σ f ∈ B p ′ ( f ) )
It is (i) approximate to nearest integer that wherein round () operator makes the number m ' of Scheduling Block.
In step 228, from the formation 104 (p ' (1)) with limit priority, scheduler 100 distributes the nearly individual piece 128 of m ' (1).If for formation 104 (p ' (1)), the bit number that can be used for dispatching need be less than the individual piece 128 of m ' (1), then distributes less piece 128.For all backlog queue 104 (p ' (2)), (p ' (3)) etc., repeating step 220 until removing all backlog queue 104, has perhaps been dispatched all pieces 128 in the frame 124.In case step 220 is finished, then this method is returned step 204 with scheduling next frame 124.As long as the data to be scheduled that are used to transmit occur, this method will continue.
Although embodiment discussed herein is at specific implementation scheme of the present invention, the combination, subclass and the variation scheme that should be appreciated that this embodiment are also within the scope of the invention.For example, in current embodiment, only dispatched single formation for each business module 128.Yet, in business module 128, can dispatch a plurality of formations, and it is also within the scope of the invention.If a plurality of subscriber stations 28 are dispatched in identical piece, then block structure must be suitable for satisfying the SNR requirement of all subscriber stations 28 that are scheduled.A kind of method of this requirement that guarantees is, for example, only distributes such user, and promptly it has the SNR greater than first user who distributes to this piece.
Can expect that when the total business volume in all formations 104 was lower than certain threshold value (data business volume of the low amount of expression), scheduler 100 can seldom move, so that reduce the stand-by period of microprocessor-router component 36.Replacedly, when total business volume was lower than certain threshold value, scheduler 100 can determine to end its dispatching method (as described about Fig. 6), and as an alternative, other dispatching method (such as FIFO) comes dispatching services according to some, so that reduce the stand-by period of each formation 104.
Further expectedly be, scheduler 100 can move more continually, and greater than each frame 124 once, wherein scheduling frequency is the piece integral multiple of 128 duration.If when being higher when carrier frequency or have a large amount of pedestrian's motions or near other business of subscriber station or base station, this will allow scheduler execution preferably in these situations, promptly wherein be lower the coherence time of channel.
And, purpose do not lie in the present invention be limited to be used for mentioned above specific based on wireless system or common based on wireless system, and can believe that the present invention can be advantageously used in any data dispatching that is used for to carry out one or more the system from single node to a plurality of other nodes on the common share communication link.It also is expected being used for the common share communication link with other light, wired.
Embodiments of the invention mentioned above are examples of the present invention, and under the prerequisite that does not depart from unique scope of the present invention that limits by appended claims, and those skilled in the art can change and revises it.

Claims (18)

1. a scheduling is used on shared channel from the base station method to the data of a plurality of subscriber stations transmission, and described method comprises:
From the scope of possible fairness factor, determine fairness factor, the data dispatching strategy that the first terminal expression of wherein said scope has the maximum fairness between described a plurality of subscriber stations, and the second terminal expression of described scope is at the data dispatching strategy of the maximum data business on described shared channel;
Have each subscriber station in described a plurality of subscriber stations of the data of its transmission for described base station:
Determine quality of service precedence values, described quality of service precedence values is represented the priority of described subscriber station with respect to other subscriber stations in described a plurality of subscriber stations;
Determine that if data are scheduled to described subscriber station, described throughput value representation waits to move to the data volume of described each subscriber station by value;
Determine total priority value, described total priority value be the described service quality priority regulated according to described fairness factor with according to the reverse adjusting of described fairness factor described by value and; And
From having the subscriber station of high total priority value, with at least one to described a plurality of subscriber stations of the data dispatch on the described shared channel part,
Wherein compare by negotiate service being shared with the service of measuring is shared, determine described quality of service precedence values, wherein share when sharing when described negotiate service greater than described measurement service, described service quality priority is higher, and share when sharing greater than described negotiate service when described measurement service, described quality of service precedence values is low.
2. the process of claim 1 wherein by determining that the receivable largest block form in described each subscriber station place in described a plurality of subscriber stations calculates the described value that passes through.
3. the block format of described definite described each receivable maximum in subscriber station place wherein by determining the signal to noise ratio in described each subscriber station place reception of described a plurality of subscriber stations, takes place in the method for claim 2.
4. the method for claim 3, it is proportional with the described total priority value about described at least one subscriber station that wherein the described part of described shared channel of described at least one subscriber station of described a plurality of subscriber stations is given in scheduling.
5. the method for claim 4, wherein said method each frame on described shared channel takes place at least once.
6. system that is used to transmit data comprises:
A plurality of subscriber stations, this each subscriber station has processor, modulator-demodulator, radio device and antenna, and each subscriber station can be operated the data service that is used to receive from the base station; With
At least one base station, described at least one base station has processor, modulator-demodulator, radio device and antenna, can operate to be used for dispatching on the shared channel to the data service of each of described a plurality of subscriber stations according to the method for claim 1.
7. the system of claim 6, each subscriber station of wherein said a plurality of subscriber stations can be operated the negotiate service of described shared channel that is used for being used to go to described at least one base station negotiate the data service of described each subscriber station and share.
8. the system of claim 7, wherein said base station compares by sharing with sharing about the measurement service of described each subscriber station about the negotiate service of described each subscriber station, determines the quality of service precedence values about each subscriber station in described a plurality of subscriber stations.
9. the system of claim 8, the value that passes through about described each subscriber station in described a plurality of subscriber stations is determined by determining the block format of described each the receivable maximum in subscriber station place in described a plurality of subscriber stations in wherein said base station.
10. the system of claim 9, wherein the block format that described each receivable maximum in subscriber station place is determined in described base station takes place in the signal to noise ratio by determining to receive at described each subscriber station place of described a plurality of subscriber stations.
11. the system of claim 10, described each subscriber station of wherein said a plurality of subscriber stations is to the indication of described its signal to noise ratio of base station.
12. the system of claim 11, wherein when the total amount of data service reaches at least predetermined threshold value, each the data service to described a plurality of subscriber stations on the shared channel is dispatched according to the method for claim 1 in described base station, and when the total amount of data service is lower than described predetermined threshold value, be dispatched to each data service of described a plurality of subscriber stations according to other method.
13. a base station, it has microprocessor, modulator-demodulator, radio device and antenna, can operate the data service that is used for dispatching according to the method for claim 1 a plurality of subscriber stations on the shared channel.
14. the base station of claim 13, wherein said base station compares by sharing with sharing about the measurement service of each subscriber station about the negotiate service of described each subscriber station, determines the quality of service precedence values about each subscriber station in described a plurality of subscriber stations.
15. the base station of claim 14, the value that passes through about described each subscriber station in described a plurality of subscriber stations is determined by determining the block format of described each the receivable maximum in subscriber station place in described a plurality of subscriber stations in wherein said base station.
16. the base station of claim 15, wherein the block format that described each receivable maximum in subscriber station place is determined in described base station takes place in the signal to noise ratio by determining to receive at described each subscriber station place of described a plurality of subscriber stations.
17. the base station of claim 16, described each subscriber station of wherein said a plurality of subscriber stations is to the indication of described its signal to noise ratio of base station.
18. the base station of claim 17, wherein when the total amount of data service reaches at least predetermined threshold value, each the data service to described a plurality of subscriber stations on the shared channel is dispatched according to the method for claim 1 in described base station, and when the total amount of data service is lower than described predetermined threshold value, be dispatched to each data service of described a plurality of subscriber stations according to other method.
CNB038195674A 2002-08-19 2003-08-14 Scheduler for a shared channel Expired - Fee Related CN1330153C (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CA002398755A CA2398755A1 (en) 2002-08-19 2002-08-19 Scheduler for a shared channel
CA2,398,755 2002-08-19

Publications (2)

Publication Number Publication Date
CN1692663A CN1692663A (en) 2005-11-02
CN1330153C true CN1330153C (en) 2007-08-01

Family

ID=31722361

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB038195674A Expired - Fee Related CN1330153C (en) 2002-08-19 2003-08-14 Scheduler for a shared channel

Country Status (6)

Country Link
JP (1) JP2005536129A (en)
CN (1) CN1330153C (en)
AU (1) AU2003257341A1 (en)
CA (1) CA2398755A1 (en)
MX (1) MXPA05002000A (en)
WO (1) WO2004017650A2 (en)

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005084066A1 (en) * 2004-02-27 2005-09-09 Mitsubishi Denki Kabushiki Kaisha Scheduler, base station, and scheduling method
CA2564983A1 (en) 2004-05-05 2005-11-17 Qualcomm Incorporated Method and apparatus for adaptive delay management in a wireless communication system
US8331377B2 (en) 2004-05-05 2012-12-11 Qualcomm Incorporated Distributed forward link schedulers for multi-carrier communication systems
US7715341B2 (en) 2005-01-28 2010-05-11 Nortel Networks Limited Optimized scheduling method for delay-sensitive traffic on high speed shared packet data channels
CN100401847C (en) * 2005-08-01 2008-07-09 华为技术有限公司 Different service realizing method
FI20055703A0 (en) * 2005-12-28 2005-12-28 Nokia Corp Package controller in radio system
US8228920B2 (en) * 2006-05-01 2012-07-24 Agere Systems Inc. High-throughput scheduler with guaranteed fairness for wireless networks and other applications
KR100911304B1 (en) * 2007-06-18 2009-08-11 엘지전자 주식회사 Method for transmitting data of radio bearer having priority in wirelss communication system
CN103188165B (en) * 2013-03-12 2016-06-01 神州数码网络(北京)有限公司 A kind of router multipath exports method and the router of intelligent load equilibrium
CN103152284B (en) * 2013-03-18 2016-06-01 神州数码网络(北京)有限公司 A kind of router multipath exports method and the router of intelligent load equilibrium
CN103780532B (en) * 2014-01-16 2018-01-05 广东省电信规划设计院有限公司 Upgoing O FDM system subcarriers and power distribution method and system
CN105939280A (en) * 2015-08-27 2016-09-14 杭州迪普科技有限公司 Flow scheduling method and device

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001063856A1 (en) * 2000-02-25 2001-08-30 Telefonaktiebolaget Lm Ericsson (Publ) Flow control between transmitter and receiver entities in a communications system
WO2001078420A1 (en) * 2000-04-10 2001-10-18 Switchcore Ab Method and apparatus for distribution of bandwidth in a switch
CN1347253A (en) * 2001-11-23 2002-05-01 杨大成 Algorithm for scheduling and distributing packet data service resources in mobile environment
WO2002045362A2 (en) * 2000-11-30 2002-06-06 Qualcomm Incorporated Method and apparatus for scheduling packet data transmissions in a wireless communication system
CN1360444A (en) * 2000-12-22 2002-07-24 西门子信息通讯网络公司 Procedure for dispatching packet data sending permit on mobile station shared radio telecommunication channel

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030135632A1 (en) * 2001-12-13 2003-07-17 Sophie Vrzic Priority scheduler

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2001063856A1 (en) * 2000-02-25 2001-08-30 Telefonaktiebolaget Lm Ericsson (Publ) Flow control between transmitter and receiver entities in a communications system
WO2001078420A1 (en) * 2000-04-10 2001-10-18 Switchcore Ab Method and apparatus for distribution of bandwidth in a switch
WO2002045362A2 (en) * 2000-11-30 2002-06-06 Qualcomm Incorporated Method and apparatus for scheduling packet data transmissions in a wireless communication system
CN1360444A (en) * 2000-12-22 2002-07-24 西门子信息通讯网络公司 Procedure for dispatching packet data sending permit on mobile station shared radio telecommunication channel
CN1347253A (en) * 2001-11-23 2002-05-01 杨大成 Algorithm for scheduling and distributing packet data service resources in mobile environment

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
IEEE Communications Magazine Andrew et al,150.154,Providing Quality of Service over a Shared Wireless Link 2001 *
IEEE Communications Magazine Bender EL AL,70.78,CDMA/HDR:A Bandwidth.Efficient High.Speed WirelessData Service for Nomadic Users 2000 *

Also Published As

Publication number Publication date
CA2398755A1 (en) 2004-02-19
AU2003257341A1 (en) 2004-03-03
MXPA05002000A (en) 2005-05-27
CN1692663A (en) 2005-11-02
WO2004017650A2 (en) 2004-02-26
WO2004017650A3 (en) 2004-05-06
JP2005536129A (en) 2005-11-24

Similar Documents

Publication Publication Date Title
US8194556B2 (en) Latency-aware adaptive bandwidth request mechanism for real-time communication in WiMAX
US6850540B1 (en) Packet scheduling in a communications system
CN1853385B (en) Method for scheduling uplink transmissions from user equipments by a base station determining a measure of a quality of service, and corresponding base station, user equipment and communication system
US8744339B2 (en) Wireless telecommunication system including a base station, relay node and method for global fair scheduling
CN101133588B (en) Systems and methods for optimizing the resource allocation in a wireless communication system
US7450602B2 (en) Method and a device for scheduling and sending data packets from a common sender to a plurality of users sharing a common transmission channel
CN101828361B (en) Method and arrangement for scheduling data packets in a communication network system
Katoozian et al. Utility-based adaptive radio resource allocation in OFDM wireless networks with traffic prioritization
US7924698B2 (en) Proportional fair scheduler for OFDMA wireless systems
JP4280275B2 (en) Scheduler for controlling transmitter / receiver, transmitter / receiver for mobile communication network, and method and computer program for operating them
US20070047553A1 (en) Uplink scheduling in wireless networks
CN1330153C (en) Scheduler for a shared channel
US20080205275A1 (en) Communication Resource Scheduling
US8289852B2 (en) Setting token bucket parameters for scheduling of air-interface resources
CN103228011A (en) Traffic management employing interference management messages
US8379520B2 (en) Group based packet scheduling algorithm
Zhu et al. QoS-guaranteed scheduling and resource allocation algorithm for IEEE 802.16 OFDMA system
Ferreira et al. Power and delay optimization based uplink resource allocation for wireless networks with device-to-device communications
CN100593349C (en) Method, apparatus, and system for data transmission and processing in a wireless communication environment
Krasilov et al. Efficient multiplexing of downlink eMBB and URLLC traffic with massive MU-MIMO
US8028287B2 (en) Method and scheduler for performing a scheduling algorithm with minimum resource parameter
Wu et al. Overview of WiMAX Standards and Applications
Huang et al. BitQoS-aware resource allocation for multi-user mixed-traffic OFDM systems
Sharma et al. Providing QoS to real and interactive data applications in WiMAX mesh networks
Schoenen et al. A closed loop control model separating resource and packet scheduling in multihop cellular networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
C17 Cessation of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20070801

Termination date: 20110814