[go: up one dir, main page]

WO2011038529A1 - Procédé de planification et planificateur - Google Patents

Procédé de planification et planificateur Download PDF

Info

Publication number
WO2011038529A1
WO2011038529A1 PCT/CN2009/001107 CN2009001107W WO2011038529A1 WO 2011038529 A1 WO2011038529 A1 WO 2011038529A1 CN 2009001107 W CN2009001107 W CN 2009001107W WO 2011038529 A1 WO2011038529 A1 WO 2011038529A1
Authority
WO
WIPO (PCT)
Prior art keywords
scheduling
backhaul link
buffer
relay node
scheduling priority
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/CN2009/001107
Other languages
English (en)
Chinese (zh)
Inventor
刘建国
王栋耀
庞继勇
沈钢
王伟
蒋琦
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nokia Shanghai Bell Co Ltd
Alcatel Lucent SAS
Original Assignee
Alcatel Lucent Shanghai Bell Co Ltd
Alcatel Lucent SAS
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 Alcatel Lucent Shanghai Bell Co Ltd, Alcatel Lucent SAS filed Critical Alcatel Lucent Shanghai Bell Co Ltd
Priority to CN200980159866.4A priority Critical patent/CN102474748B/zh
Priority to PCT/CN2009/001107 priority patent/WO2011038529A1/fr
Publication of WO2011038529A1 publication Critical patent/WO2011038529A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/52—Allocation or scheduling criteria for wireless resources based on load
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/10—Scheduling measurement reports ; Arrangements for measurement reports
    • 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/10—Flow control between communication endpoints
    • H04W28/14—Flow control between communication endpoints using intermediate storage
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/02—Terminal devices
    • H04W88/04—Terminal devices adapted for relaying to or from another terminal or user

Definitions

  • the present invention relates to the field of mobile communications, and more particularly to a scheduling method and scheduler in a multi-hop cellular system, wherein traffic balancing on a relay node is considered to avoid buffer overflow on the relay node. Or underflow problems. Background technique
  • the relay node RN is a network node dedicated to storing and forwarding data packets from the base station eNodeB (eNB) to the user equipment UE, and, in contrast, data packets from the user equipment UE The storage is performed and forwarded to the base station e NB. Based on specific access criteria, such as maximum received power, some user equipment is associated with the relay node and is not directly served by the eNB.
  • eNB base station eNodeB
  • each node typically runs a per-hop scheduler, ie each service node only schedules its secondary link directly.
  • the general hop-by-hop scheduling scheme does not consider the relationship between the relay backhaul link and the relay access link.
  • the transmission capability of the user equipment UE-R directly served by the relay node is different on different relay hops on the available bandwidth, on the one hand, if the data packet received on the serving relay node of the UE-R is More than the number of data packets transmitted, it will cause a buffer overflow problem. On the other hand, if the buffer of the relay node corresponding to UE-R becomes empty when scheduling UE-R, it causes a problem of buffer underflow. That is to say, the mismatch of traffic between the backhaul link of UE_R and its access link may cause the system spectrum efficiency to decrease.
  • the multi-hop cellular system adopts a hop-by-hop scheduling scheme
  • Summary of the invention In the present invention, an effective relay buffer control mechanism in a multi-hop cellular system is proposed, which can overcome the above drawbacks and avoid waste of radio resources on the backhaul link and the access link, thereby improving the overall system. performance.
  • each relay node reports its buffer status corresponding to each served user equipment to its serving node (eNB) (eg, one bit feedback is used for It is checked whether the buffer size of each UE-R is greater than the buffer threshold) and the average rate on the access link.
  • eNB serving node
  • the eNB uses the feedback of the relay status corresponding to the UEJR to estimate whether the relay buffer has an overflow or underflow, and then increases or decreases the scheduling opportunity of the UE-R on the backhaul link by adjusting the scheduling priority. .
  • the eNB may schedule one UE with a higher priority for each resource partition or a relay node of the serving UE at any time.
  • the proposed method can utilize the feedback from each relay node to effectively solve the problem of traffic mismatch on the relay node, which is acceptable.
  • a scheduling method comprising the steps of: receiving, from each relay node, a channel quality indicator of a backhaul link, a buffer corresponding to each user equipment served by the relay node State information and an average rate of the access link; estimating an average rate of the backhaul link according to a channel quality indicator of the backhaul link, determining a scheduling priority of the backhaul link; determining whether the relay node exists on the buffer according to the buffer status information Overflow condition, and determining whether the relay node has buffer underflow according to the estimated average rate of the backhaul link and the average rate of the access link; adjusting the scheduling priority according to a predetermined rule, so that the buffer is determined to exist In the case of overflow, the scheduling priority of the backhaul link is lowered, and in the case where it is determined that there is a possibility of buffer underflow, the scheduling priority of the backhaul link is increased; and the backhaul link with higher priority is scheduled. .
  • the step of determining whether the relay node has buffer underflow according to the average rate of the estimated backhaul link and the average rate of the access link comprises: an average transmission traffic on the available bandwidth of the backhaul link at the base station When the average transmission traffic of the access link on the available bandwidth of the relay node is smaller, it is determined that the relay node has buffer underflow.
  • the scheduling method is performed for each resource partition.
  • the predetermined rule comprises: adjusting the scheduling priority to zero in the case that it is determined that there is a buffer overflow.
  • the predetermined rule comprises: exponentially increasing the scheduling priority in association with an average rate of the backhaul link and an average rate of the access link in the case of determining that there is a possibility of buffer underflow.
  • the predetermined rule comprises: adjusting the scheduling priority without determining that there is no buffer overflow and there is no buffer underflow.
  • the scheduling priority is determined according to a proportional fairness criterion or a polling criterion.
  • the average rate of the access link received from each relay node corresponding to each user equipment served by the relay node is a channel of the access link fed back by the relay node according to the user equipment.
  • the quality indicator is estimated.
  • a scheduler including: a scheduling information receiving module, configured to receive scheduling required information from a relay node connected thereto, including a channel quality indicator of a backhaul link, and a buffering status information corresponding to each user equipment served by the relay node and an average rate of the access link; a scheduling priority calculation module, configured to calculate a scheduling priority of the backhaul link according to a channel quality indicator of the backhaul link a relay node buffer information determining unit, configured to determine, according to the buffer status information, whether the relay node has a buffer overflow condition, and determine the medium speed according to the estimated average rate of the backhaul link and the average rate of the access link.
  • the scheduling priority adjustment module is configured to adjust the scheduling priority according to a predetermined rule, so that in the case that it is determined that there is a buffer overflow, the scheduling priority of the backhaul link is lowered, and Increase the scheduling priority of the backhaul link if there is a possibility of buffer underflow; and resource scheduling Block for the backhaul link having a higher priority scheduling.
  • the predetermined rule comprises: in the case that it is determined that there is a buffer overflow, the scheduling priority adjustment module adjusts the scheduling priority to zero.
  • the predetermined rule is: in the case that it is determined that there is a possibility of buffer underflow, the scheduling priority adjustment module associates the scheduling priority with the average rate of the backhaul link and the average rate of the access link. The index has increased.
  • the predetermined rule comprises: in the case that it is determined that there is no buffer overflow and there is no buffer underflow, the scheduling priority adjustment module does not adjust the scheduling priority.
  • the present invention discloses a scheduling method for a multi-hop cellular system, which can effectively control a relay buffer, which achieves the following beneficial effects with respect to the prior art -
  • the proposed method is widely applicable to multi-hop cellular networks, including two-hop systems and more hop systems.
  • FIG. 1 is a schematic diagram showing a relay system implementing a scheduling method according to an embodiment of the present invention
  • FIG. 2 is a block diagram showing a system for implementing a scheduling method according to an embodiment of the present invention
  • Fig. 4 is a view showing a comparison of simulation results of the scheduling method and the existing scheduling method according to the present invention. detailed description
  • each relay node runs a hop-by-hop scheduling scheme, ie the eNB schedules resources only for the direct link and the backhaul link, and each relay node schedules resources only for its access link.
  • the proportional fair scheduling scheme and the polling scheduling scheme are common algorithms for controlling packet transmission in the field of wireless communications.
  • the description is made by taking a proportional fair scheduling scheme as an example.
  • FIG. 1 is a schematic diagram showing a relay system that implements a scheduling method according to an embodiment of the present invention.
  • FIG. 1 taking the downlink transmission of the two-hop relay system using the proportional fair algorithm at the eNB as an example, it is assumed that each cell has T relay nodes with /.
  • the eNB uses the feedback CQI information to estimate the instantaneous rate of the direct link of the macro user equipment at time t, the resource partition, and the instantaneous rate of the backhaul link corresponding to the user equipment.
  • the scheduling priority is first calculated, and then resource allocation is performed. Usually user equipment with a higher eugenic level will get a scheduling opportunity.
  • the average rate of user equipment at time t For example, for a macro user device ⁇ , it is at resource time at time t
  • the scheduling priority on the area ⁇ ) is ⁇ (0 .
  • the hop-by-hop scheduling scheme is also adopted, but the relationship between the relay backhaul link and the relay access link is not considered, and there is a problem that the relay node traffic does not match, that is, Following the problem of buffer overflow and relay buffer underflow.
  • a scaling factor is added.
  • T_ave ( ⁇ represents the average rate of the user on the backhaul link at time t.
  • the backhaul link of the user equipment UEJ A is 3 ⁇ 4 >/ 3 ⁇ 4 scaling factor > ( ⁇ indicates as follows: Willow (2)
  • c ⁇ is a scheduling switch to avoid relay buffer overflow.
  • kT ik ⁇ [ ⁇ is a constant of a decimal.
  • T h ( ) is the token counter of the user equipment UEJ A at time t
  • T ik (k) is updated according to the following expression:
  • T ik (t) max
  • ⁇ (-1) indicates the average rate of access links corresponding to user equipment UE-R on one resource partition of the relay node at time t1.
  • the average rate on the relay backhaul link / 6 and the direct link /, ⁇ is estimated by the eNB, while the average rate of the relay access link is estimated by the relay node it serves. After all resources have been allocated, the average rate ⁇ of the user z' on the link at time t can be calculated by:
  • T_aver! (t) 1 .
  • Np is the number of resource partitions of its service node, and is the subframe length (unit: second). Is a scheduling indicator that is equal to 1 when the user's link/scheduled when allocating resources, and 0 otherwise.
  • the token mechanism is used in the present invention to ensure that the minimum average transmission traffic of the backhaul link corresponding to the UE-R over the available bandwidth of the eNB is not less than the availability of its access link at its serving relay node.
  • the minimum average transmission traffic over the bandwidth to avoid buffer underflow.
  • the average rate of the relay backhaul link of a certain user is less than the relay access rate thereof, it can be known from the expressions (1)-(3) that the backhaul link allocation resource will be increased, thereby avoiding the relay buffer in the There is no data transmission situation on the relay access link.
  • the utility function of the proportional fair scheduling scheme of the eNB according to the present invention is expressed as The utility function is the scheduling policy, which can be used to determine which user equipment to schedule to use the resource.
  • ro) and f( ⁇ ) are the link scheduled at time t and the scheduled user equipment or relay node, respectively.
  • R-ave ⁇ ) is the average transmission speed smoothed by a low-pass filter. After all the resources have been allocated, the average rate ⁇ ave ⁇ ( ) of the user at link t at time t can be calculated by:
  • F is the proportional fair scheduling time window size (unit: second)
  • Np is the number of resource partitions of its service node
  • 7 is the subframe length.
  • ( ) is a scheduling indicator that is equal to 1 when the resource is allocated when the user's link/scheduled, otherwise 0.
  • the backhaul link scaling factor as shown in Expression (2) ensures that no buffer overflow occurs by using a scheduling switch for buffer overflow conditions, and uses an exponential scaling factor for buffer underflow conditions. The occurrence of buffer underflow can be well avoided.
  • the expression of the selected scaling factor only needs to be such that the scheduling priority is reduced when the relay buffer size is greater than a buffering threshold (but no buffer overflow has occurred), while the average rate of the backhaul link is low.
  • the scheduling priority is increased at the average rate of access links and is suitable for the purposes of the present invention.
  • FIG. 2 is a block diagram showing a system for implementing a scheduling method in accordance with an embodiment of the present invention.
  • the relay node includes an access link average rate estimation module 201, configured to estimate an average rate of access links of each UE-R according to CQI information from the user equipment UE-R; a module 202, configured to monitor its own buffer status for each UE_R; and an information sending module 203. Used to feed back to the eNodeB its own buffer state information for each UEJR and the average rate of the estimated access link, and the CQI of its backhaul link.
  • an access link average rate estimation module 201 configured to estimate an average rate of access links of each UE-R according to CQI information from the user equipment UE-R
  • a module 202 configured to monitor its own buffer status for each UE_R
  • an information sending module 203 Used to feed back to the eNodeB its own buffer state information for each UEJR and the average rate of the estimated access link, and the CQI of its backhaul link.
  • the eNodeB includes a scheduling information receiving module 101, configured to receive, from the relay node connected thereto and the served macro user equipment, information required for scheduling, including CQI of the backhaul link and CQI of the direct link of the macro user equipment.
  • the scheduling priority calculation module 102 is configured to estimate an average rate according to the CQI of the backhaul link and the CQI of the direct link, thereby determining a scheduling priority;
  • the following node buffer information determining unit 103 is configured to determine, according to the buffer status information, whether the relay node has a buffer overflow condition, and according to the average rate of the estimated backhaul link and the average rate of the access link fed back by the relay node, Determining whether the relay node has a buffer underflow;
  • the scheduling priority adjustment module 104 is configured to adjust the scheduling priority according to a predetermined rule, and reduce the scheduling priority of the backhaul link if it is determined that there
  • the predetermined rule is the scaling factor shown by the expression (2).
  • FIG. 3 shows a flow chart of a scheduling method in accordance with an embodiment of the present invention.
  • each macro user equipment feeds back its CQI to the base station.
  • the user equipment served by the relay node feeds back the CQI to its serving relay node, and then at step S103, the relay node estimates the average rate of its access link based on the CQI fed back by the user equipment.
  • the relay node feeds back to the base station the average rate of the access link estimated for the user, and its CQI regarding the buffer status of the user, the backhaul link.
  • the base station estimates the average rate of the backhaul link of the user equipment according to the CQI of the backhaul link, and determines the scheduling priority. For macro user equipment, the base station estimates the average rate of its direct link based on its fed 'cQI' and determines its scheduling priority.
  • the base station determines, according to the buffer status information, whether the relay node has a buffer overflow condition, and according to the average rate of the estimated backhaul link and the average rate of the access link fed back by the relay node. , determine if the relay node has buffer underflow.
  • the base station adjusts the scheduling priority according to a predetermined rule, reduces the scheduling priority of the backhaul link if it is determined that there is a buffer overflow, and increases the backhaul chain if it is determined that there is a possibility of buffer underflow.
  • the scheduling priority of the road is a predetermined rule, reduces the scheduling priority of the backhaul link if it is determined that there is a buffer overflow, and increases the backhaul chain if it is determined that there is a possibility of buffer underflow.
  • the base station has a higher scheduling priority according to the last determined scheduling priority
  • the user equipment is scheduled.
  • the downlink performance of the scheduling method considering the traffic balance on the relay node according to an embodiment of the present invention can be given by system level simulation.
  • system level simulation As a comparison, an existing scheme that does not consider the traffic balance on the relay node is also given.
  • Table 1 shows the simulation parameters.
  • Table 1 System level simulation parameters
  • Fig. 4 is a view showing a comparison of simulation results of the scheduling method according to the present invention and the existing scheduling method under the simulation parameters shown in Table 1.
  • system performance is shown as a cumulative score for normalized single-user throughput.
  • Cloth function CDF Cloth function CDF. Table 2 below summarizes the results of the comparison.
  • the average cell user throughput of the scheduling scheme according to the present invention is increased by approximately 4.67% compared to the existing scheduling scheme that does not consider the traffic balance on the relay node. '
  • the scheduling method according to the present invention can be flexibly applied to an LTE-A relay network to improve system performance.
  • some embodiments also include a machine readable or computer readable program storage device (eg, a digital data storage medium) and encoding machine executable or computer executable program instructions, wherein the instructions perform some of the above methods or All steps.
  • the program storage device can be a digital memory, a magnetic storage medium (such as a disk and tape), a hardware or an optically readable digital data storage medium.
  • the implementation also includes a programming computer that performs the steps of the above method.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente invention porte sur un procédé de planification et sur un planificateur, qui peuvent tenir compte d'un équilibrage de trafic dans des nœuds de relais afin d'éviter le problème de survenue d'un dépassement de capacité de tampon ou d'un soupassement de capacité de tampon dans des nœuds de relais. Le procédé de planification comprend les étapes consistant à : à partir de chaque nœud de relais, recevoir un indicateur de qualité de canal d'une liaison de raccordement, des informations d'état de tampon correspondant à chaque équipement utilisateur desservi par le nœud de relais et un débit moyen d'une liaison d'accès ; conformément à l'indicateur de qualité de canal de la liaison de raccordement, estimer un débit moyen de la liaison de raccordement et déterminer une priorité de planification de la liaison de raccordement ; conformément aux informations d'état de tampon, déterminer si un dépassement de capacité de tampon se produit ou non dans le nœud de relais, et conformément au débit moyen estimé de la liaison de raccordement et au débit moyen de la liaison d'accès, déterminer s'il existe ou non une possibilité du soupassement de capacité de tampon dans le nœud de relais ; conformément à des règles prédéterminées, ajuster la priorité de planification de façon à dégrader la priorité de planification de la liaison de raccordement dans le cas où il est déterminé que le dépassement de capacité de tampon se produit et à augmenter la priorité de planification de la liaison de raccordement dans le cas où il est déterminé qu'il existe une possibilité de soupassement de capacité de tampon ; et planifier la liaison de raccordement avec une priorité plus élevée. L'utilisation du procédé de la présente invention peut efficacement résoudre le problème de défaut d'allocation de trafic dans des nœuds de relais, évitant ainsi efficacement un gaspillage de ressources radio de la liaison de raccordement ou de la liaison d'accès, et améliorant les performances du système global.
PCT/CN2009/001107 2009-09-29 2009-09-29 Procédé de planification et planificateur Ceased WO2011038529A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN200980159866.4A CN102474748B (zh) 2009-09-29 2009-09-29 调度方法和调度器
PCT/CN2009/001107 WO2011038529A1 (fr) 2009-09-29 2009-09-29 Procédé de planification et planificateur

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2009/001107 WO2011038529A1 (fr) 2009-09-29 2009-09-29 Procédé de planification et planificateur

Publications (1)

Publication Number Publication Date
WO2011038529A1 true WO2011038529A1 (fr) 2011-04-07

Family

ID=43825478

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2009/001107 Ceased WO2011038529A1 (fr) 2009-09-29 2009-09-29 Procédé de planification et planificateur

Country Status (2)

Country Link
CN (1) CN102474748B (fr)
WO (1) WO2011038529A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104135743A (zh) * 2014-07-11 2014-11-05 西安交通大学 一种lte-a蜂窝网络中基于缓存控制的资源分配方法
GB2516941A (en) * 2013-08-07 2015-02-11 Samsung Electronics Co Ltd Scheduling Resources at a Relay Station in a Mobile Communications Network

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1744550A (zh) * 2004-09-01 2006-03-08 株式会社Ntt都科摩 无线通信装置、无线通信系统和无线通信方法
CN1870809A (zh) * 2005-09-02 2006-11-29 华为技术有限公司 移动通信系统中高速数据传输的调度方法
CN1901689A (zh) * 2006-07-26 2007-01-24 华为技术有限公司 一种hsupa的资源调度方法
CN101137196A (zh) * 2006-08-28 2008-03-05 普天信息技术研究院 在高速下行链路分组接入网络中分组调度的方法

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4718242B2 (ja) * 2004-09-01 2011-07-06 株式会社エヌ・ティ・ティ・ドコモ 無線通信装置、無線通信システムおよび無線通信方法
CN101374020B (zh) * 2007-08-20 2012-11-14 中兴通讯股份有限公司 一种中继网络中的集中式带宽分配方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1744550A (zh) * 2004-09-01 2006-03-08 株式会社Ntt都科摩 无线通信装置、无线通信系统和无线通信方法
CN1870809A (zh) * 2005-09-02 2006-11-29 华为技术有限公司 移动通信系统中高速数据传输的调度方法
CN1901689A (zh) * 2006-07-26 2007-01-24 华为技术有限公司 一种hsupa的资源调度方法
CN101137196A (zh) * 2006-08-28 2008-03-05 普天信息技术研究院 在高速下行链路分组接入网络中分组调度的方法

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2516941A (en) * 2013-08-07 2015-02-11 Samsung Electronics Co Ltd Scheduling Resources at a Relay Station in a Mobile Communications Network
GB2516941B (en) * 2013-08-07 2016-01-13 Samsung Electronics Co Ltd Scheduling Resources at a Relay Station in a Mobile Communications Network
CN104135743A (zh) * 2014-07-11 2014-11-05 西安交通大学 一种lte-a蜂窝网络中基于缓存控制的资源分配方法

Also Published As

Publication number Publication date
CN102474748B (zh) 2014-06-04
CN102474748A (zh) 2012-05-23

Similar Documents

Publication Publication Date Title
US8355402B2 (en) Enhancement of path quality of service in multi-hop packet communication networks
CN104661260B (zh) 一种QoS感知和负载均衡的无线Mesh智能电网路由方法
CN101646259B (zh) 一种无线局域网空口限速方法和一种无线网络设备
CN109963308B (zh) 无线通信系统中的资源调度方法及装置
TW200948132A (en) Scheduling policy-based traffic management
WO2011116674A1 (fr) Procédé et dispositif pour le traitement de l'équilibrage de la charge de service inter-sous-trames et le traitement de l'interférence inter-cellulaire
CN107787458A (zh) 无线回程中的服务质量
JPWO2009081871A1 (ja) 移動局、基地局装置、通信制御方法及び移動通信システム
US20140281034A1 (en) System and Method for Compressing Data Associated with a Buffer
TW200934261A (en) Adaptive transmission of resource utilization messages
CN107409438A (zh) 用于多模式多频谱中继的系统和方法
CN1996933B (zh) 对实时组播业务进行拥塞控制的方法
CN108702336A (zh) 数据路由中的动态优化队列
WO2019054112A1 (fr) Appareil de communication, système de communication sans fil et procédé de commande de flux de données
CN112787919A (zh) 报文传输方法及设备、可读介质
Ali et al. Multiradio parallel offloading in multiaccess edge computing: Optimizing load shares, scheduling, and capacity
US12335773B2 (en) Device and method for application-requirement aware medium access control
WO2011038529A1 (fr) Procédé de planification et planificateur
Jain et al. Bandwidth allocation based on traffic load and interference in IEEE 802.16 mesh networks
KR101473559B1 (ko) 패킷 전송 스케줄링 장치 및 방법
JP2009212632A (ja) 通信装置および通信方法
da Silva Mineiro et al. CAC-OLSR: extending OLSR to provide admission control in wireless mesh networks
CN102387597B (zh) 一种对下行数据传输进行调度的方法
WO2011085514A1 (fr) Procédé et équipement pour coordination de brouillage entre cellules dans un système cellulaire assisté par relais
WO2016042686A1 (fr) Dispositif et procédé de commande de transmission de données

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 200980159866.4

Country of ref document: CN

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 09849937

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 09849937

Country of ref document: EP

Kind code of ref document: A1