WO2001063855A1 - Ordonnancement de paquets dans un systeme de communication umts au moyen de plusieurs vitesses de transfert calculees - Google Patents

Ordonnancement de paquets dans un systeme de communication umts au moyen de plusieurs vitesses de transfert calculees Download PDF

Info

Publication number
WO2001063855A1
WO2001063855A1 PCT/SE2001/000406 SE0100406W WO0163855A1 WO 2001063855 A1 WO2001063855 A1 WO 2001063855A1 SE 0100406 W SE0100406 W SE 0100406W WO 0163855 A1 WO0163855 A1 WO 0163855A1
Authority
WO
WIPO (PCT)
Prior art keywords
rate
score
bandwidth
flows
channel
Prior art date
Application number
PCT/SE2001/000406
Other languages
English (en)
Inventor
Göran SCHULTZ
Janne Peisa
Toomas Wigell
Reijo Matinmikko
Original Assignee
Telefonaktiebolaget Lm Ericsson (Publ)
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
Priority claimed from US09/698,785 external-priority patent/US6850540B1/en
Application filed by Telefonaktiebolaget Lm Ericsson (Publ) filed Critical Telefonaktiebolaget Lm Ericsson (Publ)
Priority to AU2001236302A priority Critical patent/AU2001236302A1/en
Priority to EP01908560A priority patent/EP1264445A1/fr
Publication of WO2001063855A1 publication Critical patent/WO2001063855A1/fr
Priority to FI20070077U priority patent/FI7776U1/fi

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/90—Buffering arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478—Provisions for broadband connections
    • 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
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5629—Admission control
    • H04L2012/5631—Resource management and allocation
    • H04L2012/5632—Bandwidth allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5638—Services, e.g. multimedia, GOS, QOS
    • H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
    • H04L2012/5652—Cell construction, e.g. including header, packetisation, depacketisation, assembly, reassembly
    • H04L2012/5653—Cell construction, e.g. including header, packetisation, depacketisation, assembly, reassembly using the ATM adaptation layer [AAL]
    • H04L2012/5656—Cell construction, e.g. including header, packetisation, depacketisation, assembly, reassembly using the ATM adaptation layer [AAL] using the AAL2

Definitions

  • the present invention relates in general to the field of communications systems, and in particular, by way of example but not limitation, to scheduling packets of data/informational flows having differing priority levels in a communications system.
  • wireless networks Access to and use of wireless networks is becoming increasingly important and popular for business, social, and recreational purposes. Users of wireless networks now rely on them for both voice and data communications. Furthermore, an ever increasing number of users demand both an increasing array of services and capabilities as well as greater bandwidth for activities such as Internet surfing. To address and meet the demands for new services and greater bandwidth, the wireless communications industry constantly strives to improve the number of services and the throughput of their wireless networks. Expanding and improving the infrastructure necessary to provide additional services and higher bandwidth is an expensive and manpower-intensive undertaking. Moreover, high-bandwidth data streams will eventually be demanded by consumers to support features such as real-time audiovisual downloads and live audio-visual communication between two or more people.
  • next generation wireless system(s) instead of attempting to upgrade existing system(s).
  • the wireless communications industry intends to continue to improve the capabilities of the technology upon which it relies and that it makes available to its customers by deploying next generation system(s).
  • Protocols for a next-generation standard that is designed to meet the developing needs of wireless customers is being standardized by the 3 rd Generation Partnership Project (3GPP).
  • 3GPP 3 rd Generation Partnership Project
  • the set of protocols is known collectively as the Universal Mobile Telecommunications
  • the network 100 includes a core network 120 and a UMTS Terrestrial Radio Access Network (UTRAN) 130.
  • the UTRAN 130 is composed of, at least partially, a number of Radio Network Controllers (RNCs) 140, each of which may be coupled to one or more neighboring Node Bs 150.
  • RNCs Radio Network Controllers
  • Each Node B 150 is responsible for a given geographical cell and the controlling RNC 140 is responsible for routing user and signaling data between that Node B 150 and the core network 120. All of the RNCs 140 may be directly or indirectly coupled to one another.
  • the UMTS network 100 also includes multiple user equipments (UEs) 110.
  • UE may include, for example, mobile stations, mobile terminals, laptops/personal digital assistants (PDAs) with wireless links, etc.
  • PDAs personal digital assistants
  • data transmissions and/or access requests compete for bandwidth based on first come, first served and/or random paradigms.
  • Each mobile station, and its associated transmissions typically acquire access to a network using some type of request (e.g., a message) prior to establishing a connection.
  • the mobile station receives a predetermined transmission bandwidth that is usually mandated by the air interface requirements of the relevant system.
  • transmission bandwidth is variable, more flexible, and somewhat separated from the physical channel maximum mandated by the air interface requirements of UMTS.
  • QoS quality of service
  • a Medium Access Control (MAC) layer schedules packet transmission of various data flows to meet stipulated criteria, including permitted transport format combinations (TFCs) from a TFC set (TFCS).
  • TFCs transport format combinations
  • TFCS TFC set
  • WFQ weighted fair queuing
  • QoS class transport block set size
  • TBSS transport block set size
  • QoS transport format combinations
  • second embodiment(s) memory requirements are reduced by selecting a TFC based on guaranteed rate transmission rates, QoS class, TBSS, and queue fill levels, without accommodating backlogs corresponding to previously unsatisfied requirements.
  • a scheduling method for providing bandwidth to entities in a communications system includes the steps of: calculating a first transfer rate for multiple flows; calculating a second transfer rate for the multiple flows; ascertaining a quality of service (QoS) for each flow of the multiple flows; and assigning bandwidth to each flow of the multiple flows responsive to the first transfer rate, the second transfer rate, and the QoS for each flow of the multiple flows.
  • the first transfer rate may correspond to a guaranteed rate transfer rate
  • the second transfer rate may correspond to a weighted fair queuing (WFQ) transfer rate.
  • WFQ weighted fair queuing
  • the first and second transfer rates may correspond to aggregated transfer rates over the multiple flows.
  • a scheduling method for providing bandwidth to entities in a communications system includes the steps of: ascertaining a quality of service (QoS) class that is associated with each channel of multiple channels; ascertaining a guaranteed rate transmission rate for each channel; ascertaining a queue fill level of a queue that corresponds to each channel; calculating a first score for each channel responsive to the QoS class, the guaranteed rate transmission rate, and the queue fill level.
  • QoS quality of service
  • an additional step of calculating a second score for each channel responsive to the guaranteed rate transmission rate and the queue fill level is included.
  • FIG. 1 illustrates an exemplary wireless communications system with which the present invention may be advantageously employed
  • FIG. 2 illustrates a protocol model for an exemplary next-generation system with which the present invention may be advantageously employed
  • FIG. 3 illustrates a view of an exemplary second layer architecture of an exemplary next-generation system in accordance with the present invention
  • FIG. 4 illustrates an exemplary method in flowchart form for allocating bandwidth resources to data flow streams between entities in the exemplary second layer architecture of FIG. 3;
  • FIG. 5 illustrates an exemplary environment for scheduling data flows in accordance with the present invention
  • FIG. 6 illustrates an exemplary method in flowchart form for scheduling data flows in accordance with the present invention
  • FIG. 7 illustrates another view of the exemplary second layer architecture of an exemplary next-generation system in accordance with the present invention
  • FIG. 8 illustrates another exemplary method in flowchart form for scheduling data flows in accordance with the present invention.
  • FIGS . 1-8 of the drawings like numerals being used for like and corresponding parts of the various drawings.
  • Aspects of the UMTS are used to describe a preferred embodiment of the present invention.
  • the principles of the present invention are applicable to other wireless communication standards (or systems), especially those in which communication is packet-based.
  • FIG. 2 a protocol model for an exemplary next-generation system with which the present invention may be advantageously employed is illustrated generally at 200.
  • the "Uu” indicates the interface between UTRAN 130 and the UE 110
  • “Iub” indicates the interface between the RNC 140 and a Node B 150 (where "Node B” is a generalization of, for example, a Base
  • RABs Radio Access Bearers
  • a UE 110 is allocated one or more RABs, each of which is capable of carrying a flow of user or signaling data.
  • RABs are mapped onto respective logical channels.
  • MAC Media Access Control
  • a set of logical channels is mapped in turn onto a transport channel, of which there are two types: a "common” transport channel which is shared by different UEs 110 and a “dedicated” transport channel which is allocated to a single UE 110 (thus leading to the terms “MAC-c" and "MAC-d”).
  • FACH One type of common channel is the FACH.
  • a basic characteristic of a FACH is that it is possible to send one or more fixed size packets per transmission time interval (e.g., 10, 20, 40, or 80 ms).
  • Several transport channels e.g., FACHs
  • S-CCPCH Secondary Common Control Physical CHannel
  • a UE 110 registers with an RNC 140 via a Node B 150, that RNC 140 acts at least initially as both the serving and the controlling RNC 140 for the UE 110.
  • the serving RNC 140 may subsequently differ from the controlling RNC 140 in a UMTS network 100, but the presence or absence of this condition is not particularly relevant here.
  • the RNC 140 both controls the air interface radio resources and terminates the layer 3 intelligence (e.g., the Radio Resource Control (RRC) protocol), thus routing data associated with the UE 110 directly to and from the core network
  • RRC Radio Resource Control
  • the MAC-c entity in the RNC 140 transfers MAC- c Packet Data Units (PDUs) to the peer MAC-c entity at the UE 110 using the services of the FACH Frame Protocol (FACH FP) entity between the RNC 140 and the Node B 150.
  • the FACH FP entity adds header information to the MAC-c PDUs to form
  • FACH FP PDUs which are transported to the Node B 150 over an AAL2 (or other transport mechanism) connection.
  • An interworking function at the Node B 150 interworks the FACH frame received by the FACH FP entity into the PHY entity.
  • an important task of the MAC-c entity is the scheduling of packets (MAC PDUs) for transmission over the air interface. If it were the case that all packets received by the MAC-c entity were of equal priority (and of the same size), then scheduling would be a simple matter of queuing the received packets and sending them on a first come first served basis (e.g., first-in, first-out (FIFO)).
  • FIFO first-in, first-out
  • UMTS defines a framework in which different Quality of Services (QoSs) maybe assigned to different RABs.
  • Packets corresponding to a RAB that has been allocated a high QoS should be transmitted over the air interface at a high priority whilst packets corresponding to a RAB that has been allocated a low QoS should be transmitted over the air interface at a lower priority.
  • Priorities maybe determined at the MAC entity (e.g., MAC-c or MAC-d) on the basis of RAB parameters.
  • UMTS deals with the question of priority by providing at the controlling RNC 140 a set of queues for each FACH.
  • the queues may be associated with respective priority levels.
  • An algorithm which is defined for selecting packets from the queues in such a way that packets in the higher priority queues are (on average) dealt with more quickly than packets in the lower priority queues, is implemented. The nature of this algorithm is complicated by the fact that the FACHs that are sent on the same physical channel are not independent of one another. More particularly, a set of Transport Format Combinations (TFCs) is defined for each S-CCPCH, where each TFC includes a transmission time interval, a packet size, and a total transmission size (indicating the number of packets in the transmission) for each FACH. The algorithm should select for the FACHs a TFC which matches one of those present in the TFC set in accordance with UMTS protocols.
  • TFCs Transport Format Combinations
  • a packet received at the controlling RNC 140 is placed in a queue (for transmission on a FACH), where the queue corresponds to the priority level attached to the packet as well as to the size of the packet.
  • the FACH is mapped onto a S-CCPCH at a Node B 150 or other corresponding node of the UTRAN 130.
  • the packets for transmission on the FACH are associated with either a Dedicated Control CHannel (DCCH) or to a Dedicated Traffic CHannel (DTCH).
  • DCCH Dedicated Control CHannel
  • DTCH Dedicated Traffic CHannel
  • each FACH is arranged to carry only one size of packets. However, this is not necessary, and it may be that the packet size that can be carried by a given FACH varies from one transmission time interval to another.
  • the UE 110 may communicate with the core network 120 of the UMTS system 100 via separate serving and controlling (or drift)
  • RNCs 140 within the UTRAN 130 e.g., when the UE 110 moves from an area covered by the original serving RNC 140 into a new area covered by a controlling/drift RNC 140 (not specifically shown). Signaling and user data packets destined for the
  • the UE 110 are received at the MAC-d entity of the serving RNC 140 from the core network 120 and are "mapped" onto logical channels, namely a Dedicated Control CHannel (DCCH) and a Dedicated traffic CHannel (DTCH), for example.
  • the MAC- d entity constructs MAC Service Data Units (SDUs), which include a payload section containing logical channel data and a MAC header containing, inter alia, a logical channel identifier.
  • SDUs MAC Service Data Units
  • the MAC-d entity passes the MAC SDUs to the FACH FP entity.
  • This FACH FP entity adds a further FACH FP header to each MAC SDU, where the FACH FP header includes a priority level that has been allocated to the MAC SDU by an RRC entity.
  • the RRC is notified of available priority levels, together with an identification of one or more accepted packet sizes for each priority level, following the entry of a UE 110 into the coverage area of the drift RNC 140.
  • the FACH FP packets are sent to a peer FACH FP entity at the drift RNC 140 over an AAL2 (or other) connection.
  • the peer FACH FP entity decapsulates the MAC-d SDU and identifies the priority contained in the FRAME FP header.
  • the SDU and associated priority are passed to the MAC-c entity at the controlling RNC 140.
  • the MAC-c layer is responsible for scheduling SDUs for transmission on the
  • each SDU is placed in a queue corresponding to its priority and size. For example, if there are 16 priority levels, there will be 16 queue sets for each FACH, with the number of queues in each of the 16 queue sets depending upon the number of packet sizes accepted for the associated priority. As described hereinabove, SDUs are selected from the queues for a given FACH in accordance with some predefined algorithm (e.g., so as to satisfy the TFC requirements of the physical channel).
  • the scheme described hereinbelow with reference to FIGS. 3 and 4 relates to data transmission in a telecommunications network and in particular, though not necessarily, to data transmission in a UMTS.
  • the 3 GPP is currently in the process of standardizing a new set of protocols for mobile telecommunications systems.
  • the set of protocols is known collectively as the UMTS.
  • FIG. 3 a view of an exemplary second layer architecture of an exemplary next-generation system in accordance with the present invention is illustrated generally at 300.
  • the exemplary second layer architecture 300 illustrates a simplified UMTS layer 2 protocol structure which is involved in the communication between mobile stations (e.g. mobile telephones), or more broadly UEs 110, and Radio Network Controllers (RNCs) 140 of a UMTS network 100.
  • the RNCs 140 are analogous to the Base Station Controllers (BSCs) of existing GSM mobile telecommunications networks, communicating with the mobile stations via Node Bs 150.
  • BSCs Base Station Controllers
  • the layer 2 structure of the exemplary second layer architecture 300 includes a set of Radio Access Bearers (RABs) 305 that make available radio resources (and services) to user applications.
  • RABs Radio Access Bearers
  • Data flows (e.g., in the form of segments) from the RABs 305 are passed to respective Radio Link Control (RLC) entities 310, which amongst other tasks buffer the received data segments.
  • RLC Radio Link Control
  • RABs 305 are mapped onto respective logical channels 315.
  • a Medium Access Control (MAC) entity 320 receives data transmitted in the logical channels 315 and further maps the data from the logical channels 315 onto a set of transport channels 325.
  • MAC Medium Access Control
  • the transport channels 325 are finally mapped to a single physical transport channel 330, which has a total bandwidth (e.g., of ⁇ 2Mbits/sec) allocated to it by the network.
  • a physical channel is used exclusively by one mobile station or is shared between many mobile stations, it is referred to as either a "dedicated physical channel” or a "common channel”.
  • a MAC entity connected to a dedicated physical channel is known as MAC-d; there is preferably one MAC-d entity for each mobile station.
  • a MAC entity connected to a common channel is known as MAC-c; there is preferably one MAC-c entity for each cell.
  • the bandwidth of a transport channel 325 is not directly restricted by the capabilities of the physical layer 330, but is rather configured by a Radio Resource Controller (RRC) entity 335 using Transport Formats (TFs).
  • RRC Radio Resource Controller
  • TFs Transport Formats
  • the RRC entity 335 defines one or several Transport Block (TB) sizes.
  • TB Transport Block Size
  • PDU MAC Protocol Data Unit
  • PDU MAC Protocol Data Unit
  • TBS Transport Block Set
  • MAC entity can transmit to the physical layer in a single transmission time interval (TTI).
  • TTI transmission time interval
  • TFC Transport Format Combination
  • ⁇ TF1 (80, 80)
  • the MAC entity 320 has to decide how much data to transmit on each transport channel 325 connected to it. These transport channels 325 are not independent of one another, and are later multiplexed onto a single physical channel 330 at the physical layer 330 (as discussed hereinabove).
  • the RRC entity 335 has to ensure that the total transmission capability on all transport channels 325 does not exceed the transmission capability of the underlying physical channel 330. This is accomplished by giving the MAC entity 320 a Transport Format Combination Set (TFCS), which contains the allowed Transport Format Combinations for all transport channels.
  • TFCS Transport Format Combination Set
  • TFCS Transport Format Combination Set
  • the RRC entity 335 has to restrict the total transmission rate by not allowing all combinations of the TFs.
  • An example of this would be a TFCS as follows [ ⁇ (80, 0), (80, 0) ⁇ , ⁇ (80, 0), (80, 80) ⁇ , ⁇ (80, 0),
  • TFCI Transport Format Combination indicator
  • the TFCI ⁇ would correspond to the second TFC, which is ⁇ (80, 0), (80, 80) ⁇ , meaning that nothing is transmitted from the first transport channel and a single packet of 80 bits is transmitted from the second transport channel.
  • TCP Transmission Control Protocol
  • IP Internet Protocol
  • ATM Asynchronous Transfer Mode
  • GPS Generalized Processor Sharing
  • WFQ Weighted Fair Queuing
  • ratej. weight_i/(sum_of_all_active__weights) * maximum _r ate.
  • GPS could be applied to the MAC entity in UMTS, with the weighting for each input flow being determined (by the RRC entity) on the basis of certain RAB parameters, which are allocated to the corresponding RAB by the network.
  • RAB parameter may equate to a Quality of Service (QoS) or Guaranteed rate allocated to a user for a particular network service.
  • TFC Transport Format Combination
  • TFCS TFC Set
  • Embodiments of this scheme allow the TFC selection process for a subsequent frame to take into account any backlogs which exists for the input flows. The tendency is to adjust the selected TFC to reduce the backlogs. Such a backlog may exist due to the finite number of data transmission possibilities provided for by the TFCS.
  • Nodes at which the method of this scheme maybe employed include mobile stations (such as mobile telephones and communicator type devices) (or more generally UEs) and Radio Network Controllers (RNCs).
  • the input flows to the MAC entity are provided by respective Radio Network Controllers
  • each RLC entity provides buffering for the associated data flow.
  • the step of computing a fair share of resources for an input flow is carried out by a Radio Network Controller (RNC) entity.
  • RNC Radio Network Controller
  • the step of computing a fair share of resources for an input flow includes the step of determining the weighting given to that flow as a fraction of the sum of the weights given to all of the input flows. The fair share may then be determined by multiplying the total output bandwidth by the determined fraction. Also preferably, this step may involve using the Generalised Processor Sharing (GPS) mechanism.
  • GPS Generalised Processor Sharing
  • the weighting for a data flow may be defined by one or more Radio Access Bearer (RAB) parameters allocated to a RAB by the UMTS network, where the RAB is associated with each MAC input flow.
  • RAB Radio Access Bearer
  • the method further includes the step of adding the value of the backlog counter to the computed fair share for that flow and selecting a TFC on the basis of the resulting sums for all of the input flows.
  • the difference maybe subtracted from the backlog counter for the input flow.
  • UMTS Media Access Control
  • MAC Media Access Control
  • TFCS TFC Set
  • second processor means for adding to a backlog counter associated with each input flow the difference between the data transmission rate for the flow resulting from the selected TFC and the determined fair share, if the data transmission rate is less than the determined fair share, where the first processor means is arranged to take into account the value of the backlog counters when selecting a TFC for the subsequent frame of the output data flow.
  • the first and second processor means are provided by a Radio Network Controller (RNC) entity.
  • RNC Radio Network Controller
  • a simplified UMTS layer 2 includes one Radio Resource Control (RRC) entity, a Medium Access Control (MAC) entity for each mobile station, and a Radio Link Control (RLC) entity for each Radio
  • RRC Radio Resource Control
  • MAC Medium Access Control
  • RLC Radio Link Control
  • the MAC entity performs scheduling of outgoing data packets, while the RLC entities provide buffers for respective input flows .
  • the RRC entity sets a limit on the maximum amount of data that can be transmitted from each flow by assigning a set of allowed Transport Format Combinations (TFC) to each MAC (referred to as a TFC Set or TFCS), but each MAC must independently decide how much data is transmitted from each flow by choosing the best available Transport Format Combination (TFC) from the TFCS .
  • TFC Transport Format Combinations
  • the flowchart 400 is a flow diagram of a method of allocating bandwidth resources to, for example, the input flow streams ofa MAC entity of the layer 2 of FIG 3.
  • an exemplary method in accordance with the flowchart 400 may follow the following steps. First, input flows are received at RLCs and the data is buffered (step 405). Information on buffer fill levels is passed to the MAC entity (step 410). After the information on buffer fill levels is passed, the fair MAC bandwidth share for each input flow is computed (step 415).
  • the computed fair share of each is then adjusted by adding the contents of an associated backlog counter to the respective computed fair share (step 420).
  • a TFC is selected from the TFC set to most closely match the adjusted fair shares (step 425).
  • the RLC is next instructed to deliver packets to the MAC entity according to the selected TFC (step 420).
  • the MAC entity may also schedule packets in accordance with the selected TFC (step 435). After packet scheduling, the traffic channels may be transported on the physical channel(s) (step 440). Once packet traffic has been transported, the backlog counters should be updated (step 445). The process may continue (via arrow 450) when new input flows are received at the RLCs, which buffer the data (at step 405).
  • MAC entity on a per Transmission Time Interval (TTI) basis, the optimal distribution of available bandwidth using the Generalised Processor Sharing (GPS) approach ⁇ See, e.g., the article by A. K. Parekh et al. referenced hereinabove.) and by keeping track of how far behind each flow is from the optimal bandwidth allocation using respective backlog counters.
  • GPS Generalised Processor Sharing
  • the available bandwidth is distributed to flows by using the standard GPS weights, which may be calculated by the RRC using the RAB parameters.
  • the method may first calculate the GPS distribution for the input flows and add to the GPS values the current respective backlogs. This is performed once for each 10ms TTI and results in a fair transmission rate for each flow. However, this rate may not be optimal as it may happen that there is not enough data to be sent in all buffers. In order to achieve optimal throughput as well as fairness, the fair GPS distribution is reduced so as to not exceed the current buffer fill level or the maximum allowed rate for any logical channel. A two step rating process is then carried out.
  • TFCs Transport Format Combinations
  • each TFC being scored according to how close it comes to sending out the optimal rate. In practice this is done by simply counting how much of the fair configuration a TFC fails to send (if a given TFC can send all packets at the fair rate, it is given a score of zero) and then considering only the TFCs which have the lowest scores. The closest match is chosen and used to determine the amount of packets sent from each queue. TFCs having an equal score are given a bonus score according to how many extra bits they can send (this can be further weighted by a Quality of Service rating in order to ensure that the excess capacity goes to the bearer with the highest quality class).
  • TFCs having an equal score are given a bonus score according to how many extra bits they can send (this can be further weighted by a Quality of Service rating in order to ensure that the excess capacity goes to the bearer with the highest quality class).
  • the final selection is based on a two-level scoring: the TFC with the lowest score is taken. If there are several TFCs with an equal score, the one with the highest bonus score is chosen. This ensures that the rate for each TTI is maximized. Fairness is achieved by checking that if the chosen TFC does not give all flows at least their determined fair rate, the missing bits are added to a backlog counter of the corresponding flow and the selection is repeated for the next TTI. If any of the flows has nothing to transmit, the backlog is set to zero.
  • This algorithm can be shown to provide bandwidth (and, under certain assumptions, delay bounds) that is close to that of GPS. However, it remains fair and maintains isolation between all flows. It is also computationally simpler than Weighted Fair Queuing algorithms because it utilizes the fact that the MAC layer ran transmit on several transport channels at the same time. This results in optimal or close to optimal utilization of the radio interface in the UMTS radio link.
  • the following pseudo-code is an outline of an exemplary algorithm for implementing the scheme described hereinabove with reference to FIGS. 3 and 4:
  • a model of a MAC-c entity 500 is illustrated as being in communication with common RLC entities, MAC-d entities, and common transport channels (e.g., RACH/FACH).
  • RLC entities e.g., MAC-c entities
  • MAC-d entities e.g., MAC-d entities
  • common transport channels e.g., RACH/FACH.
  • MAC-c scheduler 505 schedules the forwarding of packets (or more generally segments) from QoS buffers 510, which receive MAC PDUs from MAC-d entities.
  • the MAC layer of UMTS schedules packets in a manner such that the total QoS provided to the end user fulfills the guarantees given when the corresponding RAB was established.
  • On aspect of this scheduling is the requirement that each flow receive the agreed-upon QoS. Because it is possible to multiplex several input flows (e.g., logical channels) on to one output channel (e.g., a transport channel), previously-known scheduling algorithms for the UMTS MAC-layer are not directly applicable.
  • a two-level scheduling algorithm is applied, which enables the implementation of fair scheduling in environments in which the MAC needs to perform multiplexing.
  • the two-level scheduling enables the provision of an arbitrary QoS to all flows that are multiplexed onto a single output channel.
  • the MAC-c entity 500 may be incorporated in, and thus the principles of the present invention may be applied with, the UMTS MAC layer in an RNC, a UE, etc.
  • relevant parameters for each logical channel are first received as input.
  • a backlog counter (value) for each logical channel is maintained. In order to apply a fair queuing mechanism, these parameters are converted to GPS weights.
  • weights for each transport channel are calculated by adding the weights for each logical channel to be multiplexed onto each corresponding transport channel.
  • scheduling is performed by choosing the best TFC according to, for example, the original GPS- based scheduling method.
  • the TBSS given to a transport channel is distributed to corresponding logical channels by using, for example, essentially a similar process as in step 3 for choosing the TFC. It should be noted that this is now simpler because there are no longer any restrictions on the available TFCs.
  • the backlog (value) is updated for each logical channel. This guarantees that each logical channel will get its respective fair share of the total bandwidth, regardless of multiplexing.
  • tfcs [trch] [tfci] A two-dimensional array containing the TFCS . Each element of the array is a vector containing two integers, the TBS and the TBSS. It is assumed that the TFCS is stored in such a way that the most significant index is the Transport Channel Identifier.
  • max _r ate The maximum rate that can be transmitted on all transport channels. Note that this is not typically the same as the sum of the maximum rates on each transport channel, as the transport capability on FACH or DCH channels is limited by the transport capability of the physical common channel. This is preferably calculated directly from the TFCS every time the TFCS is modified and/or limited.
  • trch_max_rate [trch] An array that contains the maximum rate for each transport channel. This parameter, while actually optional, is used to ensure that if the guaranteed rate is higher than the maximum transport rate, then the backlog for the respective flow is not accumulated and the excess data rate can be given to other flow(s). This parameter is preferably calculated directly from the TFCS every time the
  • TFCS is modified and/or limited.
  • lch_qos_class [lch] An array containing the QoS class for each input flow ("logical channel"). This array is preferably re-computed when new input flows are added or old flows are removed.
  • lch_guarjate[lch] An array containing the guaranteed rate for each input flow ("logical channel”). This array is preferably re-computed when new input flows are added or old flows are removed.
  • lchjrchjnap An array containing the transport channel indicator for each input flow ("logical channel"). This array defines how the input flows are multiplexed to fransport channels, and thus provides a mapping from logical channel to corresponding transport channel. This parameter is preferably re-computed when new input flows are added or old flows are removed.
  • lch_queuejill [lch] An array containing the number of packets in the input buffer for each incoming flow. This is the maximum number of packets that can be transmitted from this incoming flow ("logical channel") in this TTI. If more than this number is requested, then the RLC can provide padding, but for packets in QoS buffers (e.g., QoS buffers 510) this is not possible. This parameter is preferably updated before each scheduling decision.
  • lch_pu_size [lch] An array containing the size of the packets in the input buffers for each incoming flow. This parameter may be updated only when the size of the packets/PDUs change, or when new channels are added.
  • trch_qos_class An array containing the maximum QoS class of all input flows ("logical channels") multiplexed to a given transport channel. This array is preferably re-computed whenever lch_qos_class or lchjrchjnap is changed.
  • trch_guar_rate An array containing the sum of guaranteed rate of all input flows ("logical channels”) multiplexed to a given transport channel. This array is preferably re-computed whenever lch guar_rate is changed.
  • trch_queuejill An array containing the total number of bits that can be transmitted from any transport channel. This array is preferably updated for every scheduling decision.
  • This exemplary version of the exemplary scheduling algorithm preferably employs two (2) "external" arrays, which may be stored at memory in between the scheduling decisions. Both of these arrays are updated once per scheduling decision: 1. lch_grJ>acklog[lch]: An array containing the current guaranteed rate backlog (i.e., how far behind the guaranteed rate this flow is) for each logical channel. This backlog may be specified in bits.
  • lch_wfq_backlog An array containing the current fair queuing backlog (i.e., how for behind the WFQ scheduling this flow is) for each logical channel. This backlog may be specified in bits.
  • two (2) more backlog arrays are preferably calculated for each scheduling decision:
  • trch_gr_backlog An array containing the sum of all current guaranteed rate backlogs of the logical channels multiplexed to a given transport channel.
  • trch_wfq An array containing the sum of all current fair queuing backlogs of the logical channels multiplexed to a given fransport channel.
  • the flowchart 600 indicates in some detail an exemplary method for employing a two-step scheduling algorithm.
  • the two-step scheduling algorithm operates responsive to both the guaranteed rates and the fair queuing amounts of each flow.
  • the two-step scheduling algorithm (i) selects a TFCI based on three variables and (ii) allocates the resulting TBSS in an order responsive to each flows QoS.
  • the exemplary method works by first updating the trch_grJ>acklog and trch_wfqJ)acklog counters and the trc _queue ill memory.
  • tfc_gr guarjate [trch] + trch_grJ>acklog [trch]
  • the tfcjgr is a transport format combination that would transmit enough bits from all incoming flows in order to give each their respective guaranteed rate.
  • the backlog value ensures that if any flow cannot transmit its guaranteed rate, then its share of the bandwidth is increased.
  • two special cases should be noted. First, if the tfcjgr indicates a transmission rate that is larger than the maximum rate for any transport channel (e.g., if tfc_gr [trch] > trjnaxjate [trch]), then the tfcjgr value is preferably reduced to the value of trjnaxjate.
  • the tfcjgr value is preferably reduced to the trch_queuejill value. This ensures that no unnecessary padding is requested. (It also ensures that if any flow has nothing to send, then nothing will be requested.)
  • the tfcjwfq variable is similar to the TFC that gives a fair queuing result according to the QoS classes. However, the calculation of the tfcjwfq variable is slightly more complicated than for the tfcjgr variable.
  • the tfcjwfq [trch] is preferably further modified to ensure that the WFQ scheduling does not request more bandwidth than that defined by the maxjrchjate value and/or the trch _queue Jill value (e.g., in bits).
  • the TFCS is scanned through and every TFC is given three scores according to (i) how close the TFC is to tfcjgr, (ii) how close the TFC is to tfcjwfq, and (iii) how much of the excess bandwidth the TFC allocates to flows with different QoS classes. (Step 615.)
  • the scores are determined as follows:
  • these three scores are ranked in a defined priority.
  • the TFCI that maximizes the grjcore is selected.
  • the TFCI that maximizes the wfqjcore is selected.
  • the TFCI with the maximum bonus jcore is chosen. This three-tiered selection process ensures that all the guaranteed rates are served first. If this is not possible, then the flows with the highest quality of service class are scheduled because the score is multiplied by "qosjlass".
  • transport channels are analyzed only one at time, the situation is analogous to those of an IP/ ATM router, where several flows of different QoS classes share a single output channel. This suggests that a well-tested method like WFQ may be employed for multiplexing several logical channels to single transport channel.
  • two backlog counters are already present. These two backlog counters can ensure a guaranteed rate and a fair allocation on average for each logical channel, so a simpler alternative is available.
  • the TBSS is divided between logical channels by a three-stage process. (Step 620.) First, check if the TBSS is smaller than the trch_guarjate.
  • Step 625 This may be accomplished by checking if any logical channel has transmitted less than lchjpuarjate and by adding the difference to grjbacklog. A similar procedure may be applied to and for wfqjacklog.
  • FIG. 7 another view of the exemplary second layer architecture of an exemplary next-generation system in accordance with the present invention is illustrated generally at 700.
  • the exemplary second layer architecture 700 includes additional details regarding elements of, and interrelationships between, various aspects of the second layer architecture of, for example, the Universal Mobile Telecommunications System (UMTS).
  • UMTS Universal Mobile Telecommunications System
  • RRC element 705 is connected to one or more Radio Link Controllers (RLCs) 710.
  • RLCs 710 includes at least one RLC Packet Data Unit (PDU) Buffer 715.
  • the RLCs 710 are connected to respective common channel Medium Access Control (MAC-c) element(s)/layer 720 or dedicated channel Medium Access Control (MAC-d) element(s)/layer 725.
  • MAC-c Medium Access Control
  • MAC-d Medium Access Control
  • the MAC-c, MAC-d, and RLC layers of UMTS may be located, for example, in a Radio Network Controller (RNC) 140 (of FIG. 1) of the UTRAN 130, a User Equipment (UE) 110, etc.
  • RNC Radio Network Controller
  • the MAC layer of UMTS preferably schedules packets so that the total Quality of Service (QoS) provided to the end user fulfills the guarantees given when the Radio Access Bearer (RAB) 730 was established.
  • QoS Quality of Service
  • RAB Radio Access Bearer
  • One resulting issue is guaranteeing (e.g., different) guaranteed bit rates to services having different QoS classes. It is preferable to guarantee that, if possible, all flows are given their guaranteed bit rate regardless of their QoS class. If this is not possible (e.g., due to high demand), then the flows with the higher (or highest) QoS classes are preferably given their respective guaranteed rates.
  • Certain embodiment(s) of the present invention approach this problem of providing all flows a guaranteed bit rate by following a two-step scheduling process in a scheduler 735 located in the MAC layer.
  • This two-level scheduling process guarantees that, if at all possible, all flows receive their guaranteed bit rates and also ensures that the guaranteed bit rates of the higher (and highest) priority flows are maintained as long as possible.
  • these embodiment(s) may be implemented in the RNC node, the UE (node), etc.
  • the MAC entity In each TTI, the MAC entity has to decide how much data to transmit on each transport channel connected to it. These transport channels are not independent of one another, and are later multiplexed onto a single physical channel at the physical layer
  • the RRC 705 entity has to ensure that the total fransmission capability on all transport channels does not exceed the transmission capability of the underlying physical channel. This is done by giving the MAC entity a TFCS, which contains the allowed TFCs for all transport channels.
  • FIG. 8 another exemplary method in flowchart form for scheduling data flows in accordance with the present invention is illustrated generally at 800.
  • the scheduling process in the MAC layer includes the selection of a TFC from a TFCS using a two-step scoring process. This selection may be performed once for each TTI. Initially, several parameters are obtained for each logical channel.
  • the QoS Class for each logical channel may be obtained from the corresponding RAB parameter.
  • the QoS Class value may be obtained directly from the RAB parameter called "QoS Class", or it may alternatively be calculated from one or more RAB parameters using any suitable formula.
  • the Guaranteed Rate for each logical channel may also be obtained from the corresponding RAB parameter.
  • the Guaranteed Rate value may be obtained directly from the "Guaranteed Rate” RAB parameter, calculated from preassigned fair queuing weights using the GPS formula (as presented in "A Generalised Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case", A. K. Parekh, R. G. Gallager, published in IEEE/ ACM Transactions On Networking, Vol. 1, No. 3, June
  • the Queue Fill Level corresponds to a number of
  • the TFC that has the greatest Score is selected to determine the bandwidth distribution. If two or more TFCs have equal Scores, the TFC with the highest Bonus jcore is selected therefrom. (Step 820.)
  • This exemplary procedure from flowchart 800 ensures that if there is a TFC that transmits at least the guaranteed rate for each flow, then that TFC is chosen. This exemplary procedure also attempts to maximize the amount of data being transmitted from the highest QoS class(es). (It should be noted that it is assumed that the TFCs are ordered within the TFCS such that the TBSS for each logical channel increases with increasing TFCI.)
  • int maxTrch tfcs;Length( ); int tfc, tfci, qf, gr, rate, trch, trchGl; int tfcToUse;
  • bits_to_send min(tbss, qf); /* Give score according to real bits that can be sent, but not
  • these embodiment(s) are not fair, they still provide the guaranteed rate transfer rate to all service classes. Specifically, these embodiment(s) are optimized to provide best quality of service to flows having the highest QoS class(es), while still providing a minimum level of service to all flows. Furthermore, because no backlog memory need be updated each TTI, they can be faster to execute, even though they cannot guarantee fairness over the long run.

Landscapes

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

Abstract

L'invention porte sur des procédés, systèmes et agencements permettant l'ordonnancement de paquets en fonction des contraintes de qualité de service (QoS) relatives à des flux de données. Dans un environnement de réseau 100) d'un système de télécommunications mobile universel (UMTS), par exemple, une couche (320) de commande d'accès au support (MAC) ordonnance la transmission de paquets de plusieurs flux de données de façon à satisfaire les critères stipulés, notamment des combinaisons de formats de transport (TFC) autorisées, à partir d'un ensemble de telles combinaisons. Dans un (des) premier(s) mode(s) de réalisation (600), la combinaison TFC est choisie d'après des vitesses de transmission garanties, des vitesses de transmission (610, 805) de files d'attente pondérées (WFQ), une classe de QoS, une taille d'ensemble de blocs de transport (TBSS) (615) et éventuellement des niveaux de remplissage de files d'attente. Ces premières réalisations permettent également d'affiner le processus de sélection au moyen de mémoire d'arriérés correspondant à des vitesses de transmission garanties et/ou acceptables non encore atteintes précédemment. Dans un (des) second(s) mode(s) de réalisation (800), les besoins en mémoire sont réduits par sélection d'une combinaison de formats de transport en fonction des vitesses de transmission garanties, de la classe de QoS, de la taille d'ensembles de blocs de transport, et des niveaux de remplissages de files d'attente, sans traitement d'arriérés.
PCT/SE2001/000406 2000-02-25 2001-02-23 Ordonnancement de paquets dans un systeme de communication umts au moyen de plusieurs vitesses de transfert calculees WO2001063855A1 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
AU2001236302A AU2001236302A1 (en) 2000-02-25 2001-02-23 Packet scheduling in umts using several calculated transfer rates
EP01908560A EP1264445A1 (fr) 2000-02-25 2001-02-23 Ordonnancement de paquets dans un systeme de communication umts au moyen de plusieurs vitesses de transfert calculees
FI20070077U FI7776U1 (fi) 2000-02-25 2007-02-26 Pakettiskedulointi UMTS:ssä käyttämällä useita laskettuja siirtonopeuksia

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US18500500P 2000-02-25 2000-02-25
US60/185,005 2000-02-25
US09/698,785 2000-10-27
US09/698,785 US6850540B1 (en) 1999-10-28 2000-10-27 Packet scheduling in a communications system

Publications (1)

Publication Number Publication Date
WO2001063855A1 true WO2001063855A1 (fr) 2001-08-30

Family

ID=26880688

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/SE2001/000406 WO2001063855A1 (fr) 2000-02-25 2001-02-23 Ordonnancement de paquets dans un systeme de communication umts au moyen de plusieurs vitesses de transfert calculees

Country Status (4)

Country Link
EP (1) EP1264445A1 (fr)
AU (1) AU2001236302A1 (fr)
FI (1) FI7776U1 (fr)
WO (1) WO2001063855A1 (fr)

Cited By (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002054685A1 (fr) * 2000-12-29 2002-07-11 Nokia Corporation Determination du debit binaire
WO2002091757A1 (fr) * 2001-05-08 2002-11-14 Huawei Technologies Co., Ltd. Procede de repartition permettant d'assurer une qualite de service de routeur dans un service integre
GB2381996A (en) * 2001-10-30 2003-05-14 Hewlett Packard Co Network bandwidth optimization method and system
WO2003085903A1 (fr) * 2002-04-09 2003-10-16 Nokia Corporation Ordonnancement des paquets pour paquets de donnees en temps reel
WO2003098881A1 (fr) * 2002-05-15 2003-11-27 Nokia Corporation Procede d'etablissement d'un canal l2cap dedie a la transmission de flux de donnees dans un reseau bluetooth
GB2390779A (en) * 2002-07-12 2004-01-14 Fujitsu Ltd Packet scheduling
WO2004038976A2 (fr) 2002-10-24 2004-05-06 Motorola, Inc. Procede et appareil de communication sans fil de flux d'informations differents
SG108277A1 (en) * 2000-09-28 2005-01-28 Ntt Docomo Inc Wireless communication apparatus and wireless channel assignment method
EP1551202A2 (fr) * 2003-12-31 2005-07-06 STMicroelectronics Asia Pacific Pte Ltd Système et procédé pour le sélection d'une combinaison optimale de format de transport par réduction progressive du groupe de candidats
EP1643690A1 (fr) * 2004-10-01 2006-04-05 Matsushita Electric Industrial Co., Ltd. Ordonnancement tenant en compte la qualité de service pour liaisons montantes sur canales dediées
EP1672941A1 (fr) * 2004-12-15 2006-06-21 Matsushita Electric Industrial Co., Ltd. Support du traffic à débit binaire garanti pour les transmissions de la liaison montante
EP1677463A1 (fr) * 2004-12-30 2006-07-05 Research In Motion Limited Procédé et appareil pour sélectionner une combinaison de format de transport
WO2007002723A2 (fr) * 2005-06-27 2007-01-04 Qualcomm Incorporated Affectation, basee sur des blocs, de valeurs de preseance de qualite de service
CN100369502C (zh) * 2004-11-19 2008-02-13 大唐移动通信设备有限公司 基站选择服务终端的正比公平调度方法
CN100373837C (zh) * 2003-05-21 2008-03-05 华为技术有限公司 用于码分多址通信系统的传输格式组合集配置方法
WO2008011604A3 (fr) * 2006-07-21 2008-05-22 Qualcomm Inc Affectation efficace de valeurs de priorité à des filtres qos nouveaux et existants
US7630316B2 (en) 2004-12-30 2009-12-08 Research In Motion Limited Method and apparatus for selecting a transport format combination
WO2010107348A1 (fr) * 2009-03-19 2010-09-23 Telefonaktiebolaget L M Ericsson (Publ) Profilage de qos basée aimd à débit binaire relatif hspa
WO2012030271A1 (fr) * 2010-09-03 2012-03-08 Telefonaktiebolaget L M Ericsson (Publ) Planification de multiples utilisateurs sur un canal de communication partagé dans un système de communication sans fil
TWI392256B (zh) * 2004-01-09 2013-04-01 Intel Corp 無線傳輸＼接收單元中傳送格式組合選擇
CN110958503A (zh) * 2019-12-03 2020-04-03 锐捷网络股份有限公司 一种带宽分配装置及方法
US10779288B2 (en) 2002-07-15 2020-09-15 Wi-Lan Inc. Apparatus, system and method for the transmission of data with different QoS attributes
FR3106710A1 (fr) * 2020-01-28 2021-07-30 Naval Group Module de gestion d'echanges de flux de donnees dans une architecture d'echanges pour une formation d'engins mobiles

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0859492A2 (fr) * 1997-02-07 1998-08-19 Lucent Technologies Inc. Système de files d'attente équitable et pondérée avec reallocation de bande passante excessive
US5914950A (en) * 1997-04-08 1999-06-22 Qualcomm Incorporated Method and apparatus for reverse link rate scheduling
EP1030484A2 (fr) * 1999-01-29 2000-08-23 Nortel Networks Corporation Qualité de service de la couche liaison de données pour le réseau UMTS

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0859492A2 (fr) * 1997-02-07 1998-08-19 Lucent Technologies Inc. Système de files d'attente équitable et pondérée avec reallocation de bande passante excessive
US5914950A (en) * 1997-04-08 1999-06-22 Qualcomm Incorporated Method and apparatus for reverse link rate scheduling
EP1030484A2 (fr) * 1999-01-29 2000-08-23 Nortel Networks Corporation Qualité de service de la couche liaison de données pour le réseau UMTS

Cited By (48)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
SG108277A1 (en) * 2000-09-28 2005-01-28 Ntt Docomo Inc Wireless communication apparatus and wireless channel assignment method
US7130636B2 (en) 2000-09-28 2006-10-31 Ntt Docomo, Inc. Wireless communication apparatus and wireless channel assignment method
US7872980B2 (en) 2000-12-29 2011-01-18 Nokia Corporation Determination of a bit rate
WO2002054685A1 (fr) * 2000-12-29 2002-07-11 Nokia Corporation Determination du debit binaire
US7355972B2 (en) 2001-05-08 2008-04-08 Huawei Technologies Co., Ltd. Scheduling method of realizing the quality of service of router in integrated service
WO2002091757A1 (fr) * 2001-05-08 2002-11-14 Huawei Technologies Co., Ltd. Procede de repartition permettant d'assurer une qualite de service de routeur dans un service integre
GB2381996B (en) * 2001-10-30 2004-10-06 Hewlett Packard Co Network bandwidth optimization method and system
GB2381996A (en) * 2001-10-30 2003-05-14 Hewlett Packard Co Network bandwidth optimization method and system
WO2003085903A1 (fr) * 2002-04-09 2003-10-16 Nokia Corporation Ordonnancement des paquets pour paquets de donnees en temps reel
WO2003098881A1 (fr) * 2002-05-15 2003-11-27 Nokia Corporation Procede d'etablissement d'un canal l2cap dedie a la transmission de flux de donnees dans un reseau bluetooth
GB2390779B (en) * 2002-07-12 2006-02-22 Fujitsu Ltd Packet scheduling
GB2390779A (en) * 2002-07-12 2004-01-14 Fujitsu Ltd Packet scheduling
US11229032B2 (en) 2002-07-15 2022-01-18 Wi-Lan Inc. Apparatus, system and method for the transmission of data with different QoS attributes
US10779288B2 (en) 2002-07-15 2020-09-15 Wi-Lan Inc. Apparatus, system and method for the transmission of data with different QoS attributes
EP1554820A2 (fr) * 2002-10-24 2005-07-20 Motorola, Inc. Procede et appareil de communication sans fil de flux d'informations differents
WO2004038976A2 (fr) 2002-10-24 2004-05-06 Motorola, Inc. Procede et appareil de communication sans fil de flux d'informations differents
EP1554820B1 (fr) * 2002-10-24 2013-11-27 Motorola Mobility LLC Procede et appareil de communication sans fil de flux d'informations differents
CN100373837C (zh) * 2003-05-21 2008-03-05 华为技术有限公司 用于码分多址通信系统的传输格式组合集配置方法
EP1551202A3 (fr) * 2003-12-31 2006-06-14 STMicroelectronics Asia Pacific Pte Ltd Système et procédé pour le sélection d'une combinaison optimale de format de transport par réduction progressive du groupe de candidats
EP1551202A2 (fr) * 2003-12-31 2005-07-06 STMicroelectronics Asia Pacific Pte Ltd Système et procédé pour le sélection d'une combinaison optimale de format de transport par réduction progressive du groupe de candidats
US7525925B2 (en) 2003-12-31 2009-04-28 Stmicroelectronics Asia Pacific Pte. Ltd. System and method for selecting an optimal transport format combination using progressive set reduction
US9942878B2 (en) 2004-01-09 2018-04-10 Intel Corporation Transport format combination selection in a wireless transmit/receive unit
TWI392256B (zh) * 2004-01-09 2013-04-01 Intel Corp 無線傳輸＼接收單元中傳送格式組合選擇
WO2006037492A1 (fr) * 2004-10-01 2006-04-13 Matsushita Electric Industrial Co. Ltd. Ordonnancement sensible a la qualite de service dans des transmissions en liaison montante sur des canaux reserves
EP1643690A1 (fr) * 2004-10-01 2006-04-05 Matsushita Electric Industrial Co., Ltd. Ordonnancement tenant en compte la qualité de service pour liaisons montantes sur canales dediées
EP1892901A3 (fr) * 2004-10-01 2011-07-13 Panasonic Corporation Programmation sensible à la qualité de service (qos) pour la transmission montante par canaux dédiés
US7948936B2 (en) 2004-10-01 2011-05-24 Panasonic Corporation Quality-of-service (QoS)-aware scheduling for uplink transmission on dedicated channels
CN100369502C (zh) * 2004-11-19 2008-02-13 大唐移动通信设备有限公司 基站选择服务终端的正比公平调度方法
US7362726B2 (en) 2004-12-15 2008-04-22 Matsushita Electric Industrial Co., Ltd. Support of guaranteed bit-rate traffic for uplink transmissions
US7899011B2 (en) 2004-12-15 2011-03-01 Panasonic Corporation Support of guaranteed bit-rate traffic for uplink transmissions
EP1672941A1 (fr) * 2004-12-15 2006-06-21 Matsushita Electric Industrial Co., Ltd. Support du traffic à débit binaire garanti pour les transmissions de la liaison montante
WO2006063642A1 (fr) * 2004-12-15 2006-06-22 Matsushita Electric Industrial Co., Ltd. Support de trafic a debit binaire garanti pour transmissions montantes
EP1677463A1 (fr) * 2004-12-30 2006-07-05 Research In Motion Limited Procédé et appareil pour sélectionner une combinaison de format de transport
US7630316B2 (en) 2004-12-30 2009-12-08 Research In Motion Limited Method and apparatus for selecting a transport format combination
JP2012075094A (ja) * 2005-06-27 2012-04-12 Qualcomm Inc サービス品質の優先値のブロックベースの割当
WO2007002723A3 (fr) * 2005-06-27 2007-05-10 Qualcomm Inc Affectation, basee sur des blocs, de valeurs de preseance de qualite de service
WO2007002723A2 (fr) * 2005-06-27 2007-01-04 Qualcomm Incorporated Affectation, basee sur des blocs, de valeurs de preseance de qualite de service
US7826418B2 (en) 2005-06-27 2010-11-02 Qualcomm Incorporated Block-based assignment of quality of service precedence values
WO2008011604A3 (fr) * 2006-07-21 2008-05-22 Qualcomm Inc Affectation efficace de valeurs de priorité à des filtres qos nouveaux et existants
US7870231B2 (en) 2006-07-21 2011-01-11 Qualcomm Incorporated Efficiently assigning precedence values to new and existing QoS filters
WO2010107348A1 (fr) * 2009-03-19 2010-09-23 Telefonaktiebolaget L M Ericsson (Publ) Profilage de qos basée aimd à débit binaire relatif hspa
US8964551B2 (en) 2009-03-19 2015-02-24 Telefonaktiebolaget L M Ericsson (Publ) HSPA relative bit-rate AIMD-based QoS profiling
US8687576B2 (en) 2010-09-03 2014-04-01 Telefonaktiebolaget Lm Ericsson (Publ) Dynamic bandwidth allocation control in a multi-access radio communication system
WO2012030271A1 (fr) * 2010-09-03 2012-03-08 Telefonaktiebolaget L M Ericsson (Publ) Planification de multiples utilisateurs sur un canal de communication partagé dans un système de communication sans fil
CN110958503A (zh) * 2019-12-03 2020-04-03 锐捷网络股份有限公司 一种带宽分配装置及方法
CN110958503B (zh) * 2019-12-03 2022-03-18 锐捷网络股份有限公司 一种带宽分配装置及方法
FR3106710A1 (fr) * 2020-01-28 2021-07-30 Naval Group Module de gestion d'echanges de flux de donnees dans une architecture d'echanges pour une formation d'engins mobiles
WO2021151994A1 (fr) * 2020-01-28 2021-08-05 Naval Group Module de gestion d'échanges de flux de données dans une architecture d'échanges pour une formation d'engins mobiles

Also Published As

Publication number Publication date
FIU20070077U0 (fi) 2007-02-26
EP1264445A1 (fr) 2002-12-11
FI7776U1 (fi) 2008-02-29
AU2001236302A1 (en) 2001-09-03

Similar Documents

Publication Publication Date Title
US6850540B1 (en) Packet scheduling in a communications system
US6826193B1 (en) Data transmission in a telecommunications network
EP1264445A1 (fr) Ordonnancement de paquets dans un systeme de communication umts au moyen de plusieurs vitesses de transfert calculees
WO2001063856A1 (fr) Controle de flux entre des entites d'emission et de reception dans un systeme de communication
US7031254B2 (en) Rate control system and method for a link within a wireless communications system
KR101012683B1 (ko) 가변 지연 및 대역폭 조건 하에서 무선 링크를 통한 비디오 패킷
EP2227885B1 (fr) Rapports d'état de tampon compressé dans un système à accès par paquets ofdm haut débit (lte)
US8837285B2 (en) Method and apparatus for initializing, preserving, and reconfiguring token buckets
US6459687B1 (en) Method and apparatus for implementing a MAC coprocessor in a communication system
US6879561B1 (en) Method and system for wireless packet scheduling with per packet QoS support and link adaptation
US7039013B2 (en) Packet flow control method and device
JP4549599B2 (ja) 無線通信システムにおいてデータを同期し、伝送する方法および装置
JP3866963B2 (ja) Ｃｄｍａシステムにおいてクオリティオブサービスを調整するために複数のデータフローをスケジューリングする方法とシステム
JP2007507934A (ja) Ｕｍｔｓにおける調和したデータフロー制御とバッファ共用
US9642156B2 (en) Transmitting radio node and method therein for scheduling service data flows
US20090059929A1 (en) Scheduling method and apparatus for high speed video stream service in communication system
EP1209940A1 (fr) Procédé et système pour l'ordonnancement de la transmission de paquets UMTS dans des canaux montants
US6961589B2 (en) Method of transmitting between a base station in an access network and an access network controller of a telecommunications system
US20110047271A1 (en) Method and system for allocating resources
WO2001063857A1 (fr) Traitement de surcharges dans un systeme de communications
US20240155664A1 (en) Method of logical channel prioritization and device thereof
WO2008066345A1 (fr) Ordonnanceur de paquets et procédé d'ordonnancement de paquets

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
WWE Wipo information: entry into national phase

Ref document number: 2001908560

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 2001908560

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

NENP Non-entry into the national phase

Ref country code: JP

WWE Wipo information: entry into national phase

Ref document number: U20070077

Country of ref document: FI

WWW Wipo information: withdrawn in national office

Ref document number: 2001908560

Country of ref document: EP