[go: up one dir, main page]

WO2003071740A1 - Procede de controle de priorite dans des communications de donnees par paquets sans fil - Google Patents

Procede de controle de priorite dans des communications de donnees par paquets sans fil Download PDF

Info

Publication number
WO2003071740A1
WO2003071740A1 PCT/CN2002/000107 CN0200107W WO03071740A1 WO 2003071740 A1 WO2003071740 A1 WO 2003071740A1 CN 0200107 W CN0200107 W CN 0200107W WO 03071740 A1 WO03071740 A1 WO 03071740A1
Authority
WO
WIPO (PCT)
Prior art keywords
queue
weight
packet
queues
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.)
Ceased
Application number
PCT/CN2002/000107
Other languages
English (en)
Inventor
Xiaohua Liu
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.)
Linkair Communications Inc
Original Assignee
Linkair Communications 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 Linkair Communications Inc filed Critical Linkair Communications Inc
Priority to AU2002237171A priority Critical patent/AU2002237171A1/en
Priority to PCT/CN2002/000107 priority patent/WO2003071740A1/fr
Priority to CNA02828139XA priority patent/CN1620782A/zh
Publication of WO2003071740A1 publication Critical patent/WO2003071740A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867—Arrangements specially adapted for the transmitter end
    • H04L1/1887—Scheduling and prioritising arrangements
    • 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
    • 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/2441—Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
    • 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/2458—Modification of priorities while in transit
    • 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/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/52—Queue scheduling by attributing bandwidth to queues
    • H04L47/522—Dynamic queue service slot or variable bandwidth allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/56—Queue scheduling implementing delay-aware scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/622—Queue service order
    • H04L47/623—Weighted service order
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
    • H04L47/6255—Queue scheduling characterised by scheduling criteria for service slots or service orders queue load conditions, e.g. longest queue first
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
    • H04L47/626—Queue scheduling characterised by scheduling criteria for service slots or service orders channel conditions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
    • H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
    • H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
    • H04L69/324—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the data link layer [OSI layer 2], e.g. HDLC
    • 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
    • H04W28/0231—Traffic management, e.g. flow control or congestion control based on communication conditions
    • H04W28/0236—Traffic management, e.g. flow control or congestion control based on communication conditions radio quality, e.g. interference, losses or delay
    • 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
    • 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

Definitions

  • the present invention relates to the field of telecommunications, and more particularly to a method of priority control in wireless packet data communications.
  • Wireless access is expected to be one of the key access technologies for providing seamlessly end-to-end data services to the people.
  • the wireless network has its own unique set of complex characteristics as it has to deal with bandwidth variability and frequent packet errors due to multi-path fading and shadowing, etc. Thus, providing suitable wireless service is a great challenge.
  • the system will need capabilities to manage the access demands of different users and different service classes. This can be achieved by using priority schemes, which can be used to prioritize the requests from different services.
  • QoS control belongs to resource management, which relates to channel allocation, power control, handoff, etc.
  • Packet scheduling is a part of QoS control mechanism. According to the characteristics of wireless network, it is difficult to provide both delay-guarantees and fairness simultaneously. Recently several proposals of packet data transfer in wireless environment were given, such as Qualcomm's HDR (High Data Rate) and Motorola's 1XTREME, etc.
  • lxHDR is aimed at packet data services, for which all users do not generally demand equal service. Some applications require higher data rates, while others have much lower data rate requirements.
  • the user's channel condition (C/I) is also a primary factor, in determining the data rate that a given subscriber can attain.
  • the lxHDR system takes advantage of the wireless channel variability, which results in variations of the requested rate over a period of time.
  • the scheduler will serve users that are near their peaks in terms of the requested rates. Occasionally, the users may not be served for periods of time when their requested rates are lower. Allowing the scheduler to not serve disadvantaged users for periods of time will maximize the overall throughput.
  • C/I scheduler In lXTREME, two simple scheduling algorithms can be used: C/I scheduler or Round Robin scheduler.
  • the former provides maximum system capacity at the expense ,of fairness, because all frames can be devoted to a single user with best channel condition; the latter provides fair, token-ring alike way at the expense of system capacity.
  • HDFQ Hybrid Dynamic Fairness Queuing
  • the object of present invention is to provide a method of priority control in wireless packet data communications that performed in data link layer to solve the problems remains in prior art, including error control scheme, weight calculation of packet and multi-queue traffic adjustment. >
  • Fair queue adjustment to balance the queues of scheduler by computing the flow factor; Fair queue classification by adjusting the classifier criteria.
  • said lower layer of the protocol prioritizes the re-transmitted data in MAC by increasing the weight.
  • said lower layer of the protocol stacks prioritizes the re-transmitted data in RLC by increasing the weight.
  • said calculate the packet weight according to the QoS requirement, channel quality, estimated service time include:
  • Said weight can be decided by bounded delay, BER, number of re-transmission times, throughput. I.e.
  • W f (Delay, BER, N rt , CQ) wherein said weight can be decided by the following formula:
  • said Place the packets into multi-queues according to the weight decided by classifier further including: Classifier that responsible for weight calculation and put weighted data to the right queue for transmission;
  • Packet scheduler that manages the queues and sends the packet to lower layer.
  • weight of packet is calculated by synthesis the factors such as QoS requirement, channel quality, estimated service time, etc.
  • a floating index of data buffer can be a pointer buffer point to the data buffer, where the data weight is sorted.
  • said fair queue adjustment to balance the queues of scheduler by computing the flow factor further including:
  • the status of a queue can be decided
  • the queue status can be mapped into a data queue load constraint:
  • a T denotes the average packet arriving interval
  • the criteria to judge whether the load is balanced or not is: ⁇ is out of range; P is out of range;
  • the queue can be judged if balanced or not.
  • said Fair queue measurement by adjusting the classifier criteria further including: In step 602, the method ascertains whether the queues in scheduler are empty or not, If yes, the method sends primitives to upper layer for data;
  • this method checks the queue balance by computing the synthesis effect of weight and factor P in step 605;
  • Frame 605 contains the queue balance adjustment method; If the queues are not balanced, first the method changes the arrival rate and service rate by altering the classifier's threshold and Round Robin proportion in step 608;
  • step 609 to check the average weight of the queues, so as to see whether it is appropriate to shift the packet from one queue to another in step 610;
  • the method check if the neighboring queue with the right weight band is able to accommodate the packets by computing the factor ⁇ and P ;
  • the packet may be inserted to the tail of the target queue instead of insertion;
  • the packets may be shift to upper queue or down to the dustbin, that is, discarded;
  • the real time service will be discarded when the bounded delay reached;
  • step 612 the method check if it is time to modify the scheduler balance
  • step 612 the method calculate the factors ⁇ and P of all the queues to determine if it is right alter the polling time;
  • the polling time should be reduced;
  • the maximum queue polling time must assure the minimum service QoS demand.
  • the method coordinates the transmissions of all users so that the common channel is efficiently utilized and the QoS requirement of each user is satisfied.
  • the aim of present invention is to solve the problems remains in prior art, including error control scheme, weight calculation of packet and multi-queue adjustment.
  • the present invention is designed to synthesis the parameters, while simultaneously giving fair opportunity to every user.
  • the principle of scheduler is to get maximum system resource utilization with regard to required QoS, fair service and implementation complexity.
  • the QoS objectives are satisfied without requiring complex algorithm and accurate predictions of the users' future behaviors.
  • Algorithm concerning QoS should be adopted with best efficiency and maximum traffic throughput principle.
  • FIG.1 shows a scheduling mechanism in data link layer according to the prior art.
  • FIG.2 is a schematic diagram illustrating the grouped data buffer structure in RLC layer according to present invention.
  • FIG.3 illustrates a method of implementing the grouped buffer structure by using indexed pointer stack according to present invention.
  • FIG.4 is a plan view illustrating the packet scheduling in MAC of UTRAN according to present invention.
  • FIG.5 shows the mechanism of priority control.
  • FIG.6 is a flow chart illustrating the priority management according to present invention. Detail of the invention
  • the lower layer of the protocol stacks comprises: PHY or LI (Physical layer, Layer 1) MAC (Medium Access Control sub-layer, lower part of Layer 2)
  • RLC Radio Link Control sub-layer, upper part of Layer 2
  • RRC Radio Resource Control, Layer 3
  • PHY offers data transfer service over the radio link for the upper layers.
  • MAC provides data transfer service for RLC and reallocates radio resources. On request, MAC also provides the traffic volume and quality indication to the higher layers.
  • ARQ Automatic Repeat Request
  • This retransmission protocol ensures that the optimum utilization of the available radio resources is achieved without incurring excessively long delays.
  • RRC allocates radio resources on a 'slow' basis. It decides and assigns transport format for service bearer possibly in a service life cycle to meet individual user's QoS requirement.
  • MAC controls radio resource on a 'fast' basis, in the sense that, given the transport format combination set assigned by RRC. MAC selects the appropriate transport format within an assigned transport format set for each active transport channel depending on source rate and total interference threshold level.
  • the protocol structure of data link layer is shown in FIG. 1.
  • QoS requirement is met through a 2-level control: at a call arrival time scale (admission control) and at a frame duration scale (flow control).
  • admission control assures the initial connection could satisfy the QoS requirement; in short term, the resource may not meet the basic requirement of user, and then it is needed to decide how to downgrade the service.
  • admission control guarantees that the QoS requirement can be met for all users admitted in the cell.
  • admission control the system load is balanced so that real time services are given certain priority, while some bounded delay specification is met for delay tolerant applications.
  • the design of admission control has interactions with power control etc, and has direct impact on QoS guarantees for voice and data.
  • flow control for low QoS packets, overflow may occur and they may be discarded when channel capacity does not meet the requirement.
  • the QoS guarantees are implemented through flow control mechanism, which schedule the system resources among users and their applications. Flow control ensures that a flow's bandwidth does not exceed the end-to-end bottleneck of the connection and the sending rate for a flow does not exceed the rate at which the flow can be received.
  • Packet scheduler's upper bound on bandwidth allocation for a flow is calculated as the minimum of the limit and the bandwidth requirements of the flow. When the channel quality deteriorates, the QoS may not be satisfied any more.
  • ARQ is performed in RLC layer lying upon the scheduler.
  • HARQ Hybrid ARQ
  • Packets transmitted in error are explicitly rescheduled after the ARQ feedback.
  • Two ways may be used to deal with the re-transmission for error control: either RLC or MAC serves the data with high priority.
  • RLC Radio Link Control
  • MAC-controlled mechanism the re-transmitted data's weight will be increased; for RLC-controlled mechanism, we can prioritize the re-transmitted data, which can be implement it as follows:
  • Each group stores the corresponding retransmission data, as shown in FIG. 2.
  • Each group stores the corresponding data that has been transmitted for certain times, e.g. group 0 stores the initial data and group 1 stores the data that has been transmitted once.
  • Confirm message (ACK) will eliminate the packet, while negative confirm (NACK or time-out) will make it step down to next group. After three times' transmission, the packet will be discarded.
  • the output sequence should be group 2 first, group 1 second and group 0 last.
  • the simplest form of the buffer is equal size for all the groups. This may leads to memory efficiency problems.
  • One problem is that the size of buffer is increasing. As FER (Frame Error Rate) is often very low, it is obviously that the group size reduces greatly with the re-transmission time.
  • FER Fre Error Rate
  • To reduce the overall size of the buffer one way is to make the lower group thinner than upper one; a better way is to use a variable depth buffer. As shown in FIG. 3, we use a pointer stack. The data queued in the buffer in First In First
  • the pointer is modified when a NACK or timeout signal comes, e.g. a NACK for a data that has been transmitted twice will lead to the pointer in group C to point at it while remove the pointer in group B.
  • the packets are kept transmitting until it is correctly received, or on the contrary, the time deadline is reached or maximum re-transmission time is reached. Then packet is deleted to make room for the coming packet data.
  • a packet scheduler is a module in MAC layer that controls the allocation of radio resource to outgoing network traffic flows. By deciding which packet to be sent next, the packet scheduler not only determines how the resource is shared among flows, but also plays a key role in determining the rate and timing behavior of individual flow. The resource is shared proportionally between users' applications, ensuring the specified traffic a guaranteed portion of available resources. In order to utilize the spectrum resource efficiently for bursty transfer, a dynamic scheduling function may be applied.
  • the service classification is accomplished by providing both bounded delay and guaranteed bandwidth.
  • the queues represent different service classes. Each queue has its parameters such as queue size, classification, sorting schemes, etc. Each queue is scheduled according to a different policy depending on the traffic requirement. Packets from the low priority queue may only be transmitted after the high-priority queue is empty. However, in order not to starve the low priority queue, the queues are time duplex transmitted using WRR (Weighted Round Robin) periodically, i.e. the high priority queue will get more resource while the low priority queue will get less resource in the polling round. The proportion of service to each queue should be dynamically adjusted.
  • WRR Weighted Round Robin
  • the queues in the scheduler can be mapped by different service classes, such as: Guaranteed services: provide a firm bound to bandwidth, delay and losses. Controlled load services: minimize packet losses with assurance of the guaranteed services.
  • the classifier computes the packet weight and put the weighted data to the right queue for transmission. When a new packet comes with a certain priority, it will be put to the appropriate queue, and it could also be inserted to the appropriate order in the queue, which need extra operation time.
  • weight calculation is to indicate the importance of a packet, so as to: Serve the packet with appropriate class. Degrading the quality of service, if necessary, e.g. discarding the packet in the event of problems.
  • the main factor is the QoS parameters such as maximum delay, bit error rate and data rate.
  • QoS parameters such as maximum delay, bit error rate and data rate.
  • weight grows with QoS, reduces with expect transmission time. Packets expected to be having less service time may have high priority to reduce the overall waiting time. Data re- transmitted has heavier weight than normal transmission. (E.g. HARQ) Control/signaling
  • the service mapping will not just simply map each QoS class to a fixed queue.
  • the weight is decided by bounded delay, BER, number of re-transmission times, throughput:
  • W f (Delay, BER, N «, CQ) (1)
  • l W denotes weight of priority level;
  • W rt ' denotes number of re/transmission times;
  • GoS denotes grade of service, mainly affected by two factors: bounded delay and BER.
  • GoSc denotes the comparative GoS:
  • T s denotes the estimated service time, normally decided by channel condition, packet size and modulation scheme, e.g. T s - CQ /SoP, SoP stands for Size of Packet.
  • 'Tq denotes the packet queuing time. We use it to sort packet in queue. There is a time stamp for each packet. Depending on the scheduler used, the time stamp can be deadline, virtual finishing time or other value.
  • the classifier With the weight of packets computed, the classifier then groups the packets to different queues according to the 'weight band'.
  • Each queue is associated with a range of weight value.
  • the classifier calculates the weight with a series of threshold to decide to which queue the packet should be placed.
  • queue P is associated with the weight in the range [min(P)+ (P-l) A, min(P)+ P A], where A denotes the steps of neighboring queues' weight difference. So the total range of weight s with P queues is given by [min(P), 7nin(P)+P A].
  • Each packet that arrives to the scheduler is weighted.
  • a newly arrived packet is inserted to queue P if its weight is in [(P-l) A, P A].
  • the classifiers in UE and UTRAN are different.
  • the classifier maps the packet of different QoS to different service classes.
  • a mobile can set up multiple applications simultaneously, each having its own service characteristics (e.g. offering different error correction capability).
  • Each application can be used for information transfer of one radio bearer for layer 2 and higher layer signaling messages.
  • the multiplexing of these applications onto the same or different physical channels is carried out by layer 1.
  • the TFCI (Transport Format Combination Indication) field uniquely identifies the transport format used by each transport channel.
  • UTRAN has to resolve contention between mobiles accessing the same physical resources and has to manage the packet access procedure. So the channel quality and priority of each UE should be taken into account and the weight be dynamically adjusted.
  • Packet streams 401 come from data link layer enter Classifier 402, then go to the queues 403 inside scheduler 404. There are multiple queues 403 in the scheduler 404. The packets are put to the queues 403 according to their weight, e.g. top priority packets are put to the queue 403(a), and so on. The packets come from the queues 403 then go to packet dispatcher 406.
  • Priority control in UTRAN is shown in FIG. 4(b).
  • Packet stream from either wire-lined terminal 409 or wireless terminals UEs 410 are scheduled respectively, and then enter UTRAN scheduler 413.
  • the output .packets then go to the queues 414 inside scheduler 413.
  • the packets are put to the queues 414 according to their weight.
  • the packets also can be schedules between queues through channel 415, just like in UE.
  • Packet data streams from different application and users have various QoS requirement.
  • 3 GPP defined 4 distinct QoS classes (or traffic classes) for UMTS (Universal Mobile Telecommunications System): Conversational, Streaming, Interactive and Background.
  • Each has its requirement of QoS: BER (Bit Error Rate), delay/jitter, etc.
  • the main distinguishing factor of the QoS class is how delay sensitive the traffic is.
  • the QoS mapping block peeks into packet header to determine the flow characteristics and the class of service associated with it (if available, otherwise it is treated as best effort class by default). Packets are served based on their service label.
  • the classifier is responsible for weight calculation and put the weighted data to the right queue for transmission. Then the packet scheduler manages the queues and sends the packet to lower layer.
  • the status of queues is dynamically varying due to the packet arrival rate and service rate of each queue. Another factor is that the weight of packets is not fixed, e.g. weight grows with queuing time, the queue need to be sorted periodically. If the weight is out of the band of current queue, the packet may transfer from one queue to another.
  • the scheduler is also in charge of sorting the queues. Here we use different sorting policies for each queue. For high priority queues, e.g. guaranteed services queue, it is dynamically sorted at high frequency; for medium priority queue, the sort interval is longer; for low QoS requirement, it is just FIFO and no sorting at all.
  • Input data rate (average), affected by the overall packet arrival rate and the packet classification portion Qj divided by the classifier
  • Output data rate (average), affected by the service rate, WRR service portion Pi, overflow and discard scheme
  • the queue status can be mapped into a data queue load constraint:
  • a f denotes the average packet arriving interval.
  • the measures could be either adjusting the arrival or service rate or sharing the load to other queues.
  • There are various methods to dispose the balance problem such as RPQ
  • RPQ+ Priority queue schedulers with approximate sorting in output-buffered switches, IEEE Journal on selected areas in communications, VOL. 17, NO. June 1999.
  • the key idea of RPQ is rotating the queues. Here we monitor the queue status periodically to check the status and periodically move the low priority packet up to high priority queue, when the weight of the packet exceeds the current band caused the queuing time growing.
  • scheduler balance including:
  • the arrive/service rate balance of each queue The queue load balance between queues If necessary, adjust (e.g. downgrade) the service.
  • FIG.6 illustrates in detail of the balance adjustment, hi step 602, the method ascertains whether the queues in scheduler are empty or not. If yes, the method sends primitives to upper layer for data. If the queues are not empty and it is time to check the queue balance, this method checks the queue balance by computing the synthesis effect of weight and factor P in step 605. Frame 605 contains the queue balance adjustment method. If the queues are not balanced, first the method changes the arrival rate and service rate by altering the classifier's threshold and Round Robin proportion in step 608. For instance, if the queue is starving and the weight w (w is the average weight of the packets) is high, then the incoming classifier threshold should be lowered to expand the range of the weight.
  • step 609 to check the average weight of the queues, so as to see whether it is appropriate to shift the packet from one queue to another in step 610. If the weight is out of current band, then the method check if the neighboring queue with the right weight band is able to accommodate the packets by computing the factor ⁇ and P . In order to reduce the complexity, the packet may be inserted to the tail of the target queue instead of insertion. For the bottom level queue, if the weight is varying the packets may be shift to upper queue or down to the dustbin, that is, discarded. The real time service will be discarded when the bounded delay reached.
  • step 612 the method check if it is time to modify the scheduler balance. If not, it will wait for a certain time and return to step 612.
  • the method calculate the factors ⁇ and P of all the queues to determine if it is right to alter the polling time.
  • the polling time should be reduced.
  • the maximum queue polling time must assure the minimum service QoS demand. Together with the weight calculation, this could be called 'Hybrid Dynamic Fairness Queuing.' Three points are taken into account: 'priority schedule', 'resource utility' and 'equal opportunity'.
  • the method coordinates the transmissions of all users so that the common channel is efficiently utilized and the QoS requirement of each user is satisfied. This method also applies for shared channels such as DSCH (Downlink Shared Channel), and applies to both TDD and FDD communications.
  • DSCH Downlink Shared Channel
  • the aim of present invention is to solve the problems remains in prior art, including error control scheme, weight calculation of packet and multi-queue adjustment.
  • the present invention is designed to synthesis the parameters, while simultaneously giving fair opportunity to every user.
  • the principle of scheduler is to get maximum system resource utilization with regard to required QoS, fair service and implementation complexity.
  • the QoS objectives are satisfied without requiring complex algorithm and accurate predictions of the users' future behaviors.
  • Algorithm concerning QoS should be adopted with best efficiency and maximum traffic throughput principle.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Small-Scale Networks (AREA)

Abstract

La présente invention a trait à un procédé de gestion de transmission de données par paquets sans fil exécuté dans une couche de lien de données (comprenant des sous-couches de contrôle de liaison radio et de contrôle d'accès au support ). Le procédé prend en compte l'effet de synthèse des exigences de qualité de service des utilisateurs et l'utilisation des ressources de système par la retransmission groupée dans la sous-couche de contrôle de liaison radio et le contrôle de programmation dans la sous-couche de contrôle d'accès au support, comportant un module de classification de paquets, un procédé et une formule de calcul de pondération, et une programmation à files multiples et un ajustement d'équilibre, entre autres.
PCT/CN2002/000107 2002-02-22 2002-02-22 Procede de controle de priorite dans des communications de donnees par paquets sans fil Ceased WO2003071740A1 (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
AU2002237171A AU2002237171A1 (en) 2002-02-22 2002-02-22 A method of priority control in wireless packet data communications
PCT/CN2002/000107 WO2003071740A1 (fr) 2002-02-22 2002-02-22 Procede de controle de priorite dans des communications de donnees par paquets sans fil
CNA02828139XA CN1620782A (zh) 2002-02-22 2002-02-22 一种在无线分组数据通信中的优先级控制方法

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2002/000107 WO2003071740A1 (fr) 2002-02-22 2002-02-22 Procede de controle de priorite dans des communications de donnees par paquets sans fil

Publications (1)

Publication Number Publication Date
WO2003071740A1 true WO2003071740A1 (fr) 2003-08-28

Family

ID=27740073

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2002/000107 Ceased WO2003071740A1 (fr) 2002-02-22 2002-02-22 Procede de controle de priorite dans des communications de donnees par paquets sans fil

Country Status (3)

Country Link
CN (1) CN1620782A (fr)
AU (1) AU2002237171A1 (fr)
WO (1) WO2003071740A1 (fr)

Cited By (40)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005122497A1 (fr) * 2004-06-08 2005-12-22 Matsushita Electric Industrial Co., Ltd. Mappage de canaux physiques partages dependant de la classe de qualite de service
DE102004044965A1 (de) * 2004-09-16 2006-03-30 Infineon Technologies Ag Mobilfunkeinrichtung, Mobilfunknetzwerk-Kontrolleinheit und Verfahren zum Auslesen von Daten aus einer Mehrzahl von Datensicherungsschicht-Protokoll-Pufferspeichern
WO2006069534A1 (fr) * 2004-12-28 2006-07-06 Huawei Technologies Co., Ltd. Procede pour regler la taille du tampon de transmission d'une sous-couche rlc
WO2006109131A3 (fr) * 2005-04-11 2006-11-23 Nokia Corp Procede et dispositif pour faciliter l'ordonnancement de paquets en temps reel dans un systeme de communication sans fil
EP1702430A4 (fr) * 2004-01-08 2007-03-14 Interdigital Tech Corp Planification de paquets dans un reseau local sans fil
WO2007085159A1 (fr) * 2006-01-26 2007-08-02 Huawei Technologies Co., Ltd. Procédé et système de contrôle de la qos
CN100336365C (zh) * 2003-11-25 2007-09-05 中兴通讯股份有限公司 一种基于业务分类的端口速率控制方法
WO2007113517A1 (fr) * 2006-03-30 2007-10-11 Vodafone Group Plc Prioritisation de transmission de données
CN100358306C (zh) * 2004-03-19 2007-12-26 华为技术有限公司 一种规划无线通信网络的方法
CN100392627C (zh) * 2003-12-22 2008-06-04 威盛电子股份有限公司 存储器存取要求优先序列仲裁装置及方法
CN100393066C (zh) * 2003-09-04 2008-06-04 株式会社Ntt都科摩 分组优先级控制装置及方法
CN100411474C (zh) * 2004-06-17 2008-08-13 大唐移动通信设备有限公司 适用于移动通信系统的下行分组数据调度方法
CN100421425C (zh) * 2005-11-03 2008-09-24 华为技术有限公司 减少高速下行共享信道服务小区更新过程数据包丢失方法
CN100440855C (zh) * 2004-08-29 2008-12-03 华为技术有限公司 无线链路协议模块多实例数据业务的优先级服务方法
CN100454892C (zh) * 2005-03-17 2009-01-21 中兴通讯股份有限公司 分组系统的调度方法
WO2009039777A1 (fr) * 2007-09-21 2009-04-02 Huawei Technologies Co., Ltd. Procédé, système et appareil destinés à organiser des données
CN100502388C (zh) * 2004-06-30 2009-06-17 华为技术有限公司 边界网关协议模块路由处理方法
US7694040B2 (en) 2003-12-12 2010-04-06 Via Technologies, Inc. Method and apparatus of arranging priority queue and arbitrating for memory access requests
US7782886B2 (en) 2004-08-19 2010-08-24 Nec Corporation Method for improving quality of service in a wireless network
US7839892B2 (en) 2004-09-29 2010-11-23 Infineon Technologies Ag Data link layer protocol unit
EP2070364A4 (fr) * 2006-08-31 2011-03-02 Nokia Corp Procédé et appareil permettant l'affectation de ressources en utilisant une optimisation inter-couches basée sur l'utilité
CN101079811B (zh) * 2007-04-28 2011-03-30 北京航空航天大学 飞机与地面系统数据传输方法及系统
WO2012002890A1 (fr) * 2010-07-02 2012-01-05 Telefonaktiebolaget L M Ericsson (Publ) Priorisation de paquets de données
EP2279576A4 (fr) * 2008-04-24 2012-02-01 Ericsson Telefon Ab L M Gestion du taux d erreurs
CN102420645A (zh) * 2010-09-28 2012-04-18 中兴通讯股份有限公司 一种多用户多输入多输出系统的分组调度方法及装置
GB2485349A (en) * 2010-11-08 2012-05-16 Wireless Tech Solutions Llc Controlling communication from and/or to a mobile communications device in accordance with a relative priority indicated by the type of data packets
US8874809B2 (en) 2009-12-04 2014-10-28 Napatech A/S Assembly and a method of receiving and storing data while saving bandwidth by controlling updating of fill levels of queues
US8934341B2 (en) 2009-12-04 2015-01-13 Napatech A/S Apparatus and a method of receiving and storing data packets controlled by a central controller
WO2015134983A1 (fr) * 2014-03-07 2015-09-11 Futurewei Technologies, Inc. Point de transmission sans coupure et procédé d'association d'équipement d'utilisateur pour la virtualisation d'un accès radio
EP2818018A4 (fr) * 2012-02-22 2015-09-30 Ericsson Telefon Ab L M Adaptation de la qualité de service sur la base d'une mesure
EP3200410A1 (fr) * 2016-01-28 2017-08-02 Alcatel Lucent Procédé et système de mise en file d'attente de paquets dans des réseaux de communication
US20200100143A1 (en) * 2018-09-20 2020-03-26 Cisco Technology, Inc. Traffic shaping methods and apparatus for providing wireless contention reduction and airtime fairness for multimedia traffic flows in a wireless network
CN111132235A (zh) * 2019-12-27 2020-05-08 东北大学秦皇岛分校 基于改进hrrn算法和多属性决策的移动卸载迁移算法
CN111835654A (zh) * 2019-04-19 2020-10-27 海能达通信股份有限公司 感知速率的提升方法及装置、存储介质及电子设备
CN113106574A (zh) * 2021-04-07 2021-07-13 北京智棉科技有限公司 一种自动分组挑包配棉的方法、系统和存储介质
CN114615645A (zh) * 2022-03-16 2022-06-10 南通大学 一种基于分组类型识别的任务卸载公平性传输方法
CN114698008A (zh) * 2020-12-28 2022-07-01 大唐移动通信设备有限公司 一种确定排队优先级的方法、通信设备、装置及存储介质
CN117873662A (zh) * 2023-12-14 2024-04-12 天翼云科技有限公司 一种动态io调度方法及系统
CN118900431A (zh) * 2024-10-08 2024-11-05 威胜集团有限公司 一种Wi-SUN通信紧急去重动态加权QoS管理方法、介质及终端
CN120090983A (zh) * 2025-04-30 2025-06-03 北京理工大学出版社有限责任公司 一种基于标记语言的数据交换方法及系统

Families Citing this family (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8634422B2 (en) * 2005-08-17 2014-01-21 Qualcomm Incorporated Prioritization techniques for quality of service packet transmission over a network lacking quality of service support at the media access control layer
CN100433920C (zh) * 2005-09-29 2008-11-12 华为技术有限公司 通信系统中的无线资源控制消息的发送方法
CN1750517B (zh) * 2005-11-07 2011-04-20 中兴通讯股份有限公司 一种实现业务带宽保证的方法
CN100385863C (zh) * 2005-12-29 2008-04-30 华为技术有限公司 一种媒体资源分配方法
CN101075963B (zh) * 2007-07-02 2012-05-23 中兴通讯股份有限公司 一种基于网络QoS的动态控制装置及其方法
CN101489267B (zh) * 2008-01-16 2010-07-28 大唐移动通信设备有限公司 一种接纳控制方法及装置
CN101499888B (zh) * 2008-01-30 2011-12-07 电信科学技术研究院 一种接纳判决时新增资源的估计方法和装置
CN101594374B (zh) * 2008-05-29 2013-07-10 上海贝尔股份有限公司 无线通信系统中的新的l2结构及相应的通信方法和系统
US8170575B2 (en) * 2008-08-12 2012-05-01 Telefonaktiebolaget Lm Ericsson (Publ) Method and a device in a wireless communication system
US7843826B2 (en) * 2008-11-07 2010-11-30 Avaya Inc. Automatic detection and re-configuration of priority status in telecommunications networks
CN101895461B (zh) * 2009-05-20 2012-10-17 华为技术有限公司 确定调度包优先级的方法和装置
CN101877749B (zh) * 2010-06-30 2014-03-19 中兴通讯股份有限公司 一种语音业务调度优先级的调整方法及装置
CN101964758A (zh) * 2010-11-05 2011-02-02 南京邮电大学 一种基于区分服务的队列调度方法
US8358590B2 (en) * 2010-12-29 2013-01-22 General Electric Company System and method for dynamic data management in a wireless network
CN102711188B (zh) * 2012-05-21 2018-06-15 中兴通讯股份有限公司 用户资源处理方法及装置
CN104010376B (zh) * 2013-02-26 2018-04-27 联想(北京)有限公司 一种无线连接调度方法及节点设备
CN104125161B (zh) * 2014-08-14 2017-09-01 三星电子（中国）研发中心 区分数据优先级的多播传输方法、系统及装置
CN105471763B (zh) * 2014-09-04 2020-09-15 中兴通讯股份有限公司 控制报文传输方法及装置
CN104836649B (zh) * 2015-04-24 2018-09-25 熊猫电子集团有限公司 卫星移动通信中对多业务数据状态报告的轮询方法
CN106302231B (zh) * 2015-05-12 2019-06-28 深圳市中兴微电子技术有限公司 数据流队列整形的方法及装置
CN104917692B (zh) * 2015-06-26 2018-05-11 新华三技术有限公司 一种分发令牌的方法和装置
CN109429248B (zh) * 2017-09-04 2022-06-03 中国移动通信有限公司研究院 一种业务数据的处理方法、基站及移动通信终端
CN110545536B (zh) * 2018-05-29 2021-10-01 中兴通讯股份有限公司 一种d2d通信资源池数据传输的方法及装置

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1245618A (zh) * 1996-12-17 2000-02-23 艾利森电话股份有限公司 收发信机跳跃
JP2000183969A (ja) * 1998-12-17 2000-06-30 Nec Corp パケット交換型移動体通信システムとその通信制御方法
JP2000253017A (ja) * 1999-03-02 2000-09-14 Nippon Telegr & Teleph Corp <Ntt> 無線パケット制御局
JP2001053745A (ja) * 1999-08-11 2001-02-23 Nippon Telegr & Teleph Corp <Ntt> 無線パケット通信システム
WO2001047144A1 (fr) * 1999-12-22 2001-06-28 Telefonaktiebolaget Lm Ericsson (Publ) Reglage de puissance base sur une file d'attente
JP2001237839A (ja) * 2000-02-21 2001-08-31 Nippon Telegr & Teleph Corp <Ntt> 無線パケット優先制御方法

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1245618A (zh) * 1996-12-17 2000-02-23 艾利森电话股份有限公司 收发信机跳跃
JP2000183969A (ja) * 1998-12-17 2000-06-30 Nec Corp パケット交換型移動体通信システムとその通信制御方法
JP2000253017A (ja) * 1999-03-02 2000-09-14 Nippon Telegr & Teleph Corp <Ntt> 無線パケット制御局
JP2001053745A (ja) * 1999-08-11 2001-02-23 Nippon Telegr & Teleph Corp <Ntt> 無線パケット通信システム
WO2001047144A1 (fr) * 1999-12-22 2001-06-28 Telefonaktiebolaget Lm Ericsson (Publ) Reglage de puissance base sur une file d'attente
JP2001237839A (ja) * 2000-02-21 2001-08-31 Nippon Telegr & Teleph Corp <Ntt> 無線パケット優先制御方法

Cited By (53)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100393066C (zh) * 2003-09-04 2008-06-04 株式会社Ntt都科摩 分组优先级控制装置及方法
CN100336365C (zh) * 2003-11-25 2007-09-05 中兴通讯股份有限公司 一种基于业务分类的端口速率控制方法
US7694040B2 (en) 2003-12-12 2010-04-06 Via Technologies, Inc. Method and apparatus of arranging priority queue and arbitrating for memory access requests
CN100392627C (zh) * 2003-12-22 2008-06-04 威盛电子股份有限公司 存储器存取要求优先序列仲裁装置及方法
TWI420860B (zh) * 2004-01-08 2013-12-21 Interdigital Tech Corp 無線區域網路中封包排程
JP2012100326A (ja) * 2004-01-08 2012-05-24 Interdigital Technology Corp 無線ｌａｎにおけるパケットスケジューリング
EP1702430A4 (fr) * 2004-01-08 2007-03-14 Interdigital Tech Corp Planification de paquets dans un reseau local sans fil
CN100358306C (zh) * 2004-03-19 2007-12-26 华为技术有限公司 一种规划无线通信网络的方法
WO2005122497A1 (fr) * 2004-06-08 2005-12-22 Matsushita Electric Industrial Co., Ltd. Mappage de canaux physiques partages dependant de la classe de qualite de service
CN100411474C (zh) * 2004-06-17 2008-08-13 大唐移动通信设备有限公司 适用于移动通信系统的下行分组数据调度方法
CN100502388C (zh) * 2004-06-30 2009-06-17 华为技术有限公司 边界网关协议模块路由处理方法
US7782886B2 (en) 2004-08-19 2010-08-24 Nec Corporation Method for improving quality of service in a wireless network
CN100440855C (zh) * 2004-08-29 2008-12-03 华为技术有限公司 无线链路协议模块多实例数据业务的优先级服务方法
DE102004044965A1 (de) * 2004-09-16 2006-03-30 Infineon Technologies Ag Mobilfunkeinrichtung, Mobilfunknetzwerk-Kontrolleinheit und Verfahren zum Auslesen von Daten aus einer Mehrzahl von Datensicherungsschicht-Protokoll-Pufferspeichern
CN102740503B (zh) * 2004-09-29 2015-01-28 英飞凌科技德尔塔有限公司 数据链路层协议单元以及相关装置和方法
CN102740503A (zh) * 2004-09-29 2012-10-17 英飞凌科技德尔塔有限公司 数据链路层协议单元以及相关装置和方法
US7839892B2 (en) 2004-09-29 2010-11-23 Infineon Technologies Ag Data link layer protocol unit
WO2006069534A1 (fr) * 2004-12-28 2006-07-06 Huawei Technologies Co., Ltd. Procede pour regler la taille du tampon de transmission d'une sous-couche rlc
CN100454892C (zh) * 2005-03-17 2009-01-21 中兴通讯股份有限公司 分组系统的调度方法
US7965726B2 (en) 2005-04-11 2011-06-21 Nokia Corporation Method and apparatus to facilitate real-time packet scheduling in a wireless communications system
WO2006109131A3 (fr) * 2005-04-11 2006-11-23 Nokia Corp Procede et dispositif pour faciliter l'ordonnancement de paquets en temps reel dans un systeme de communication sans fil
CN100421425C (zh) * 2005-11-03 2008-09-24 华为技术有限公司 减少高速下行共享信道服务小区更新过程数据包丢失方法
WO2007085159A1 (fr) * 2006-01-26 2007-08-02 Huawei Technologies Co., Ltd. Procédé et système de contrôle de la qos
CN101009637B (zh) * 2006-01-26 2011-09-21 华为技术有限公司 服务质量控制方法、系统及逻辑链路管理功能设备
WO2007113517A1 (fr) * 2006-03-30 2007-10-11 Vodafone Group Plc Prioritisation de transmission de données
US8649389B2 (en) 2006-03-30 2014-02-11 Vodafone Group Services Limited Prioritising data transmission
EP2070364A4 (fr) * 2006-08-31 2011-03-02 Nokia Corp Procédé et appareil permettant l'affectation de ressources en utilisant une optimisation inter-couches basée sur l'utilité
CN101079811B (zh) * 2007-04-28 2011-03-30 北京航空航天大学 飞机与地面系统数据传输方法及系统
WO2009039777A1 (fr) * 2007-09-21 2009-04-02 Huawei Technologies Co., Ltd. Procédé, système et appareil destinés à organiser des données
EP2279576A4 (fr) * 2008-04-24 2012-02-01 Ericsson Telefon Ab L M Gestion du taux d erreurs
US8644217B2 (en) 2008-04-24 2014-02-04 Telefonaktiebolaget Lm Ericsson (Publ) Error rate management
US8874809B2 (en) 2009-12-04 2014-10-28 Napatech A/S Assembly and a method of receiving and storing data while saving bandwidth by controlling updating of fill levels of queues
US8934341B2 (en) 2009-12-04 2015-01-13 Napatech A/S Apparatus and a method of receiving and storing data packets controlled by a central controller
WO2012002890A1 (fr) * 2010-07-02 2012-01-05 Telefonaktiebolaget L M Ericsson (Publ) Priorisation de paquets de données
US9107100B2 (en) 2010-07-02 2015-08-11 Telefonaktiebolaget L M Ericsson (Publ) Prioritization of data packets
CN102420645A (zh) * 2010-09-28 2012-04-18 中兴通讯股份有限公司 一种多用户多输入多输出系统的分组调度方法及装置
GB2485349A (en) * 2010-11-08 2012-05-16 Wireless Tech Solutions Llc Controlling communication from and/or to a mobile communications device in accordance with a relative priority indicated by the type of data packets
EP2818018A4 (fr) * 2012-02-22 2015-09-30 Ericsson Telefon Ab L M Adaptation de la qualité de service sur la base d'une mesure
US9867069B2 (en) 2012-02-22 2018-01-09 Telefonaktiebolaget Lm Ericsson (Publ) Measurement based QoS adaptation
WO2015134983A1 (fr) * 2014-03-07 2015-09-11 Futurewei Technologies, Inc. Point de transmission sans coupure et procédé d'association d'équipement d'utilisateur pour la virtualisation d'un accès radio
US10277285B2 (en) 2014-03-07 2019-04-30 Huawei Technologies Co., Ltd. Soft transmit point and user equipment association method for radio access virtualization
EP3200410A1 (fr) * 2016-01-28 2017-08-02 Alcatel Lucent Procédé et système de mise en file d'attente de paquets dans des réseaux de communication
US20200100143A1 (en) * 2018-09-20 2020-03-26 Cisco Technology, Inc. Traffic shaping methods and apparatus for providing wireless contention reduction and airtime fairness for multimedia traffic flows in a wireless network
CN111835654A (zh) * 2019-04-19 2020-10-27 海能达通信股份有限公司 感知速率的提升方法及装置、存储介质及电子设备
CN111835654B (zh) * 2019-04-19 2023-08-11 海能达通信股份有限公司 感知速率的提升方法及装置、存储介质及电子设备
CN111132235A (zh) * 2019-12-27 2020-05-08 东北大学秦皇岛分校 基于改进hrrn算法和多属性决策的移动卸载迁移算法
CN111132235B (zh) * 2019-12-27 2023-04-07 东北大学秦皇岛分校 基于改进hrrn算法和多属性决策的移动卸载迁移算法
CN114698008A (zh) * 2020-12-28 2022-07-01 大唐移动通信设备有限公司 一种确定排队优先级的方法、通信设备、装置及存储介质
CN113106574A (zh) * 2021-04-07 2021-07-13 北京智棉科技有限公司 一种自动分组挑包配棉的方法、系统和存储介质
CN114615645A (zh) * 2022-03-16 2022-06-10 南通大学 一种基于分组类型识别的任务卸载公平性传输方法
CN117873662A (zh) * 2023-12-14 2024-04-12 天翼云科技有限公司 一种动态io调度方法及系统
CN118900431A (zh) * 2024-10-08 2024-11-05 威胜集团有限公司 一种Wi-SUN通信紧急去重动态加权QoS管理方法、介质及终端
CN120090983A (zh) * 2025-04-30 2025-06-03 北京理工大学出版社有限责任公司 一种基于标记语言的数据交换方法及系统

Also Published As

Publication number Publication date
AU2002237171A1 (en) 2003-09-09
CN1620782A (zh) 2005-05-25

Similar Documents

Publication Publication Date Title
WO2003071740A1 (fr) Procede de controle de priorite dans des communications de donnees par paquets sans fil
EP2041928B1 (fr) Ordonnancement comprimé de transmission de paquets à retard
US6879561B1 (en) Method and system for wireless packet scheduling with per packet QoS support and link adaptation
CN1853385B (zh) 通过基站确定服务质量指标来调度来自用户设备的上行链路传输的方法，以及相应的基站、用户设备和通信系统
JP4397928B2 (ja) ワイヤレス通信ネットワークの資源を、ネットワークのチャネルを介してユーザ機器に送信すべきトラヒックに割り当てる方法
AU2004307505B2 (en) Coordinated data flow control and buffer sharing in UMTS
CA2503761C (fr) Procede, systeme et programme informatique destines a gerer la transmission de paquets d&#39;informations dans un reseau de telecommunication
CN100393066C (zh) 分组优先级控制装置及方法
EP1443719A1 (fr) Procede d&#39;ordonnancement de transmission par paquets et dispositif de station de base
US20020089952A1 (en) Method and system for UMTS packet transmission scheduling on shared downlink channels
WO2003051007A1 (fr) Planificateur de priorite
EP1209936A1 (fr) Procédé et système pour l&#39;ordonnancement de la transmission de paquets UMTS dans des canaux descendants
WO2004075569A2 (fr) Ordonnancement de paquets
KR20040090440A (ko) 통신 시스템들에서의 전송 스케쥴링 방법
CN100431362C (zh) 移动通信系统中分组业务调度的方法
JP2006229588A (ja) マルチアンテナ伝送システム
Hosein et al. QoS support for the reverse packet data channel in third generation (3G) wireless networks
Wijting et al. Scheduling structure to achieve inter-layer optimisation in wireless IP networks

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 CO CR CU CZ DE DK DM DZ EC 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 OM PH PL PT RO RU SD SE SG SI SK SL TJ TM TN TR TT TZ UA UG US UZ VN YU ZA ZM 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 ZM 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 GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 2002828139X

Country of ref document: CN

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP