WO2006111047A1 - Procede d'allocation dynamique et adaptative de canal - Google Patents

Procede d'allocation dynamique et adaptative de canal Download PDF

Info

Publication number
WO2006111047A1
WO2006111047A1 PCT/CN2005/000561 CN2005000561W WO2006111047A1 WO 2006111047 A1 WO2006111047 A1 WO 2006111047A1 CN 2005000561 W CN2005000561 W CN 2005000561W WO 2006111047 A1 WO2006111047 A1 WO 2006111047A1
Authority
WO
WIPO (PCT)
Prior art keywords
traffic
real
time
threshold
channel allocation
Prior art date
Application number
PCT/CN2005/000561
Other languages
English (en)
French (fr)
Inventor
Jianwu Dou
Original Assignee
Zte Corporation
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 Zte Corporation filed Critical Zte Corporation
Priority to CN2005800495465A priority Critical patent/CN101167376B/zh
Priority to PCT/CN2005/000561 priority patent/WO2006111047A1/zh
Publication of WO2006111047A1 publication Critical patent/WO2006111047A1/zh

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/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/18—Negotiating wireless communication parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource

Definitions

  • the present invention relates to an adaptive dynamic channel allocation method, and more particularly to an adaptive dynamic channel allocation method for a mobile communication system. Background technique
  • the dynamic allocation of traffic bandwidth is very important for mobile communication systems. Since packet data services are bursty, fixed bandwidth allocation is not suitable, so it is necessary to allocate bandwidth according to the real-time demand of services.
  • the measurement of the real-time rate of the service is generally estimated by occupying the buffer. When the buffer occupancy exceeds a certain threshold within a certain period of time, the service allocation bandwidth needs to be increased, and when the buffer occupancy is in a period of time. When the internal threshold is below a certain threshold, the service allocation bandwidth needs to be reduced. So how to determine the decision threshold is the key to dynamic channel adjustment. For the discrete bandwidth allocation method, it is not appropriate to use a fixed decision threshold for bandwidth allocation, which easily leads to ping-pong adjustment of the bandwidth and periodic packet loss.
  • the present invention provides an adaptive dynamic channel allocation method comprising the following steps:
  • Step 1 Determine initial configuration parameters of dynamic channel allocation
  • Step 2 Perform adaptive dynamic channel allocation according to the above configuration parameters.
  • the step 1 is specifically as follows:
  • Step 101 Determine the bandwidth rate adjustment file number M and the bandwidth rate of each file, and the bandwidth rate of each file is a sorted maximum bit rate (MaxBitRatePreArray) array of each file from small to large, wherein
  • MaxBi tRatePreArray [A 0 , A!, A 2 , ... , A M ] , A 0 , Ai, A 2 ,..., A M represents the maximum bandwidth rate of each file;
  • Step 103 Determine an initial maximum bandwidth rate (MaxBitRateini) and a current real-time service bandwidth rate (MaxBitRateNow), where
  • the step 2 is specifically:
  • Step 201 determining whether there is an event report of the traffic report, if yes, executing step 202, otherwise performing step 213;
  • Step 202 determining whether the traffic is real-time demand increase event reporting, if yes, executing step 203, otherwise performing step 206;
  • Step 203 Determine whether j+1 is greater than or equal to M, and if yes, perform step 2 (M, otherwise perform step 211;
  • Step 206 report the real-time demand reduction event of the traffic, and then perform step 20 7 ;
  • Step 207 Determine whether j-1 is less than or equal to 0. If yes, go to step 208, otherwise go to step 209;
  • the trigger condition of the step 2 is that when the real-time monitored traffic exceeds the real-time demand of the traffic
  • the threshold is increased, and the threshold is exceeded after the traffic trigger threshold time is increased, the real-time demand increase event of the traffic is triggered, and the real-time demand for the reported traffic increases, and the increased traffic after each report is suspended within the time.
  • the real-time monitored traffic is lower than the real-time demand reduction threshold of the traffic, and is still lower than the threshold after reducing the traffic trigger threshold time, the real-time demand reduction event of the traffic is triggered, and the real-time demand for reporting the traffic is reduced, After the second report, the reduced traffic will not be reported within the time limit.
  • the adaptive dynamic channel allocation method of the present invention improves the robustness of control by dynamically adjusting the bandwidth decision criteria. It can avoid bandwidth control oscillation, effectively utilize the wireless resources of the system, reduce signaling overhead, and suppress the peak-to-average ratio of signal power.
  • FIG. 1 is a flow chart of a method for adaptive dynamic channel allocation according to the present invention.
  • FIG. 2 is a diagram showing changes in service source rate over time in the adaptive dynamic channel allocation method of the present invention.
  • FIG. 3 is a schematic diagram of a situation in which the adaptive dynamic channel allocation method of the present invention loses packets when the buffer is full.
  • 4 is a schematic diagram of a dynamic channel of an output of an adaptive dynamic channel allocation method according to the present invention.
  • FIG. 5 is a schematic diagram of a periodic packet loss occurring in the prior art method for reducing the threshold of a real-time demand for a fixed traffic.
  • FIG. 6 is a schematic diagram of the results of the prior art method for reducing thresholds by using real-time demand for fixed traffic. detailed description
  • the idea of the invention is to utilize an adaptive dynamic channel allocation method by dynamically adjusting the band Wide decision criteria to improve control robustness.
  • Step 1 Determine initial configuration parameters of dynamic channel allocation
  • Step 100 start;
  • Step 101 Determine the bandwidth rate adjustment file number M is 9, and the bandwidth rate of each file is an array.
  • MaxBitRatePreArray [0 1 2 4 6 8 9 12 16 24] *336bits/10ms
  • the real-time monitored traffic exceeds the traffic real-time demand increase threshold, and the threshold is exceeded after the traffic trigger threshold time is increased, the real-time demand increase event of the traffic is triggered, and the real-time demand for the reported traffic increases, after each report.
  • the increased traffic is not reported within the time limit.
  • the real-time monitored traffic is lower than the real-time demand reduction threshold, and the traffic threshold threshold is reduced, the real-time demand is reduced. The event is triggered, and the real-time demand for the reported traffic is reduced.
  • the reduced traffic after each report is suspended within the time limit.
  • the traffic threshold is 40ms, the traffic is suspended to 100ms, the traffic threshold is reduced to 800ms, and the traffic is suspended to 800ms.
  • the data buffer E Buffer 0, and the service source rate is constant.
  • the increase of traffic trigger threshold time can be between 10ms and 20000ms; the increase of traffic suspension time can be between 10ms and 30000ms; the reduction of traffic threshold threshold time can be between 400ms and 20000ms; Between 500ms and 30000ms.
  • Step 2 Perform adaptive dynamic channel allocation according to the parameters configured above.
  • Step 201 it is determined whether there is an event report of the traffic report, if yes, step 2 0 2 is performed, otherwise step 213 is performed;
  • Step 202 determining whether the traffic real-time demand increase (4A) event reporting, if yes, executing step 203, otherwise performing step 206;
  • Step 203 it is determined whether j+1 is greater than or equal to M, if yes, step 204 is performed, otherwise step 211 is performed;
  • Step 205 update traffic real-time demand reduction B) event threshold ThcWb AM then perform step 213;
  • Steps 206 and 4B are reported, and then step 2 0 7 is performed ;
  • Step 207 it is judged whether j'-1 is less than or equal to 0, if yes, step 2 08 is performed, otherwise step 209 is performed;
  • Step 21 Wait.
  • FIG. 2 is a graph showing the change of the service source rate with time, and the value of the ordinate in the figure represents each The number of packets from the data source during the sampling interval, and the number of packets multiplied by 336 represents the actual received bits.
  • Figure 3 when the buffer is full and the packet is lost, it can be seen that there is basically no packet loss after the control is stable.
  • Figure 4 shows the results of the dynamic channel allocation of the output.
  • Figure 6 shows the results of the real-time demand reduction threshold method for the fixed traffic. It can be seen that the method is very stable and can truly reflect the service source rate.
  • the comparison method is very jittery.
  • the adaptive dynamic channel allocation method of the present invention improves the robustness of control by dynamically adjusting the bandwidth decision criteria.
  • the method can avoid channel allocation control oscillation, can effectively utilize the wireless resources of the system, reduce signaling overhead, and suppress the peak-to-average ratio of signal power.

Description

自适应动态信道分配方法 技术领域
本发明涉及一种自适应动态信道分配方法， 尤其是一种移动通信系统的 自适应动态信道分配方法。 背景技术
因为频谱资源是十分有限的， 因此业务带宽的动态分配对于移动通信系 统而言非常重要。 由于分组数据业务具有突发性， 所以固定带宽分配是不合 适的， 因此根据业务的实时需求来分配带宽是非常必要的。 对业务实时速率 的测量一般是通过对緩沖区的占用情况来估计， 当緩冲区占用情况在一段时 间内超过某一门限时， 需要增加业务分配带宽， 而当緩冲区占用情况在一段 时间内低于某一门限时， 则需要减少业务分配带宽。 所以如何确定判决门限 是进行信道动态调整的关键。 对于离散带宽分配方法而言， 采用固定判决门 限进行带宽分配是不合适的， 很容易导致带宽的乒乓调整和周期性丢包情况 的发生。
美国专利 《无线通信系统中对诸如速率和功率进行反向链路资源调度 的分布式优化方法和设备 ( Method and apparatus for di s tr ibuted opt ima l reverse 1 ink schedul ing of resources, such as rate and power, in a wi re les s communicat ion sys tem ) » [专利申请号: 20030193907]提出了一 种信道带宽的分配方法， 但是仅仅考虑了功率的限制， 而中国专利 "一种基 于源速率估计的动态信道配置方法" [专利申请号： 01132746. 4]也公开了一 种信道带宽的分配方法， 但是仅仅考虑了业务量需求， 也无法解决不恰当的 带宽分配方法可能导致的带宽的乒乓调整和周期性丟包的问题。 发明内容
本发明的目的是提供一种自适应动态信道分配方法，能够在不同业务量 需求的情况下具有较好的鲁棒性。
为实现上述目的， 本发明提供了一种自适应动态信道分配方法， 包括以 下步骤：
步骤 1、 确定动态信道分配的初始配置参数；
步骤 2、 根据上述配置参数进行自适应动态信道分配。
所述步骤 1具体为：
步骤 101、确定带宽速率调整档数 M和各档的带宽速率， 各档的带宽速率 为各档预配最大比特速率 (MaxBitRatePreArray)数组由小至大排序， 其中
MaxBi tRatePreArray= [A0, A!， A2， ... , AM] ， A0， Ai, A2，…， AM代表每一 档的带宽最大速率；
步骤 102、 确定数据緩冲区的最大值 BOmax, B0max>N*AM, N>=2;
步骤 103、 确定初始最大带宽速率（MaxBitRateini )和当前时刻实时业 务带宽速率 (MaxBitRateNow) ， 其中
Figure imgf000004_0001
MaxBitRateNow=MaxBitRateini
j表示初始带宽速率所对应的档号， 可以取 0至 M之间的任意一档； 步骤 104、 将业务量实时需求增加门限配置为 Thc a, 且 Thd4a<=B0max; 步骤 105、 将业务量实时需求减少门限配置为 Thd4b， 且 Thd4b<Thd4a。 所述步骤 2具体为：
步骤 201、 判断是否有业务量报告的事件上报， 如果有则执行步骤 202， 否则执行步骤 213;
步骤 202、判断是否为业务量实时需求增加事件上报，如果是则执行步骤 203, 否则执行步骤 206;
步骤 203、 判断 j+1是否大于或等于 M, 如果是则执行步骤 2(M, 否则执 行步骤 211; 、
步骤 204、 当前时刻实时业务带宽速率 MaxBitRateNow=AM，然后执行步骤
205;
步骤 205、更新业务量实时需求减少门限 Thd4b = Α^),然后执行步骤 213; 步骤 206、 业务量实时需求减少事件上报， 然后执行步骤 207； 步骤 207、 判断 j - 1是否小于或等于 0, 如果是则执行步骤 208， 否则执 行步骤 209;
步骤 208、 当前时刻实时业务带宽速率 MaxBitRateNow=A。， 然后执行步 骤 213;
步骤 209、 当前时刻实时业务带宽速率 MaxBitRateNow=A l;
步骤 210、更新业务量实时需求减少门限 Thd4b = A(j-2) ,然后执行步骤 3; 步骤 211、 当前时刻实时业务带宽速率 MaxBitRateNow=Aj+1， 然后执行步 骤 212;
步骤 212、更新业务量实时需求减少门限 Thd4b = Aj， 然后执行步骤 213; 步骤 213、 等待。
所述步骤 2的触发条件是， 当实时监测到的业务量超过业务量实时需求 增加门限时， 并且在增加业务量触发门限时间之后仍然超过该门限， 业务量 实时需求增加事件触发， 并上报业务量实时需求增加， 每次上报之后的增加 业务量悬至时间之内不再上报， 当实时监测到的业务量低于业务量实时需求 减少门限时， 并且在减少业务量触发门限时间之后仍然低于该门限， 业务量 实时需求减少事件触发， 并上报业务量实时需求减少， 每次上报之后的减少 业务量悬至时间之内不再上报。
因此， 本发明自适应动态信道分配方法， 通过动态调整带宽判决标准提 高了控制的鲁棒性。 可以避免带宽控制震荡， 能够有效利用系统的无线资源， 减少信令开销， 抑制信号功率的峰均比。
下面结合附图和实施例， 对本发明的技术方案做进一步的详细描述。 附图说明
图 1为本发明自适应动态信道分配方法的方法流程图。
图 2为本发明自适应动态信道分配方法的业务源速率随时间的变化图。 图 3为本发明自适应动态信道分配方法当緩冲区满而丢包的情况示意图。 图 4为本发明自适应动态信道分配方法的输出的动态信道^ 果示意图。 图 5为现有技术釆用固定业务量实时需求减少门限的方法时发生周期性 丢包的示意图。
图 6为现有技术采用固定业务量实时需求减少门限方法时的结果示意图。 具体实施方式
本发明的思想是利用一种自适应动态信道分配的方法， 通过动态调整带 宽判决标准而提高控制的鲁棒性。
如图 1所示， 为本发明自适应动态信道分配方法的流程图， 步骤如下： 步骤 1、 确定动态信道分配的初始配置参数；
步骤 100、 开始；
步驟 101、 确定带宽速率调整档数 M 为 9， 各档的带宽速率为数组
MaxBitRatePreArray中的各个元素，
其中 MaxBitRatePreArray=[0 1 2 4 6 8 9 12 16 24] *336bits/10ms;
步骤 102、 确定数据緩冲区的最大值 BOmax, B0max= 72*336bits;
步骤 103、 确定初始最大带宽速率 MaxBitRateini =4*336 bits 0ms=A3， 当前时刻实时业务带宽速率 MaxBitRateNow =MaxBitRateini;
步骤 104、 业务量实时需求增加门限配置为 Thd4a= 54*336 bits, Thd4a 不可以大于 BOmax;
步骤 105、 业务量实时需求减少门限配置为 Thd4b= 2*336 bits, Thd4b 必须小于 Thd4a。
当实时监测到的业务量超过业务量实时需求增加门限时， 并且在增加业 务量触发门限时间之后仍然超过该门限， 业务量实时需求增加事件触发， 并 上报业务量实时需求增加， 每次上报之后的增加业务量悬至时间之内不再上 报， 当实时监测到的业务量低于业务量实时需求减少门限时， 并且在减少业 务量触发门限时间之后仍然低于该门限， 业务量实时需求减少事件触发， 并 上报业务量实时需求减少， 每次上报之后的减少业务量悬至时间之内不再上 报。 其中， 增加业务量触发门限时间为 40ms， 增加业务量悬至时间为 100ms, 减少业务量触发门限时间为 800ms， 减少业务量悬至时间为 800ms; 数据緩沖 E Buffer = 0, 业务源速率为恒定速率，切 R=5*336bits/10ms， 判决的采样时 间间隔为 10ms。 增加业务量触发门限时间可以为 10ms至 20000ms之间； 增 加业务量悬至时间可以为 10ms至 30000ms之间； 减少业务量出发门限时间可 以为 400ms至 20000ms之间； 减少业务量悬至时间可以为 500ms至 30000ms 之间。
步骤 2、 才艮据上述配置好的参数进行自适应动态信道分配。
步骤 201、 判断是否有业务量报告的事件上报， 如果有则执行步骤 202， 否则执行步骤 213;
步骤 202、 判断是否为业务量实时需求增加（4A)事件上报， 如果是则执 行步骤 203， 否则执行步骤 206;
步骤 203、 判断 j+1是否大于或等于 M, 如果是则执行步骤 204， 否则执 行步骤 211;
步骤 204、 当前时刻实时业务带宽速率 MaxBitRateNow=AM,然后执行步骤
205;
步骤 205、 更新业务量实时需求减少 B)事件门限 ThcWb AM 然后执 行步骤 213;
步骤 206、 4B事件上报， 然后执行步骤 207；
步骤 207、 判断 j'-l是否小于或等于 0， 如果是则执行步骤 208, 否则执 行步骤 209;
步骤 208、 当前时刻实时业^ 率 MaxBitRateNow=Ao， 然 ^ ^ 骤213； 步骤 209、 当前时刻实时业务带宽速率 MaxBi tRa teNow=A ; 步骤 210、 更新 4Β事件门限 Thd4b = Aj-2， 然后执行步骤 21 3;
步骤 211、 当前时刻实时业务带宽速率 MaxBitRateNow=A ，然:^抛 ί 骤 212; 步骤 212、 更新 4Β事件门限 Thd4b = Aj ， 然后执行步骤 21 3;
步骤 21 3、 等待。
对每一个采样时间点进行上述步骤 201 - 211的判决， 得到的结果和对比 结果如图 2至图 6所示， 图 2为业务源速率随时间的变化图，图中纵坐标的值 代表每个采样时间间隔内从数据源来数据包数目， 数据包数目乘以 336代表 实际的接收比特。 图 3因为緩冲区满而丢包的情况， 可以看出本方法控制稳 定后基本没有丢包现象， 与之相对应， 当采用固定业务量实时需求减少门限 的方法时， 会有周期性丟包现象发生， 如图 5所示。 图 4为输出的动态信道 分配结果， 图 6为固定业务量实时需求减少门限方法时的结果， 可以看出本 方法非常稳定， 可以真实反映业务源速率的情况， 而对比方法抖动很厉害。
因此本发明自适应的动态信道分配方法， 通过动态调整带宽判决标准提 高了控制的鲁棒性。 本方法可以避免信道分配控制震荡， 能够有效利用系统 的无线资源， 减少信令开销， 抑制信号功率的峰均比。
最后所应说明的是， 以上实施例仅用以说明本发明的技术方案而非限制， 尽管参照较佳实施例对本发明进行了详细说明， 本领域的普通技术人员应当 理解， 可以对本发明的技术方案进行修改或者等同替换， 而不脱离本发明技 术方案的精神和范围， 其均应涵盖在本发明的权利要求范围当中。

Claims

权 利 要 求
1、 一种自适应动态信道分配方法， 其特征在于包括以下步骤： 步骤 1、 确定动态信道分配的初始配置参数；
步骤 2、 根据上述配置参数进行自适应动态信道分配。
2、 根据权利要求 1所述的自适应动态信道分配方法，其特征在于所述步 骤 1具体为：
步骤 101、确定带宽速率调整档数 M和各档的带宽速率，各档的带宽速率 为各档预配最大比特速率 MaxBi tRatePreArray数组由小至大排序， 其中 MaxBi tRatePreArray= [A0, Al 5 A2，… , AM] , A0， A15 A2,…， AM代表每一 档的带宽最大速率；
步骤 102、 确定数据緩冲区的最大值 B0max， B0max>N*AM, N>=2;
步骤 103、确定初始最大带宽速率 MaxBi tRate ini和当前时刻实时业务带 宽速率 MaxBi tRa teNow, 其中
MaxBi tRa te
Figure imgf000010_0001
( 0<=j<=M )
MaxBi tRateNow=MaxBi tRa teini
j表示初始带宽速率所对应的档号， 可以取 0至 M之间的任意一档； 步骤 104、 将业务量实时需求增加门限配置为 Thd4a， 且 Thd4a<=B0max; 步骤 105、 将业务量实时需求减少门限配置为 Thd4b, 且 Thd4b<Thd4a。
3、 根据权利要求 2所述的自适应动态信道分配方法，其特征在于所述步 骤 2具体为：
步骤 201、 判断是否有业务量报告的事件上报， 如果有则执行步骤 202， 否则执行步骤 213;
步骤 202、判断是否为业务量实时需求增加事件上报，如果是则执行步骤 203, 否则执行步骤 206;
步骤 203、 判断 j+1是否大于或等于 M, 如果是则执行步骤 204， 否则执 行步骤 211;
步骤 204、 当前时刻实时业务带宽速率 MaxBitRateNo =A„， 然后执^ 骤205； 步骤 205、更新业务量实时需求减少门限 Thd4b = A(M— ,然后执行步驟 213； 步骤 206、 业务量实时需求减少事件上报， 然后执行步骤 207； 步骤 207、判断 j - 1是否小于或等于 0， 如果是则执行步骤 208, 否则执 行步骤 209;
步骤 208、 当前时刻实时业务带宽速率 MaxBitRateNow=A。， 然后执行步 骤 213;
步驟 209、 当前时刻实时业务带宽速率 MaxBitRateNow=A r，
步骤 210、更新业务量实时需求减少门限 Thd4b = A(j.2)，然后执行步骤 213; 步骤 211、 当前时刻实时业务带宽速率 MaxBitRateNow=Aj+1， 然后执行步 骤 212;
步骤 212、更新业务量实时需求减少门限 Thd4b = Aj， 然后执行步骤 2 ; 步骤 213、 等待。
4、 根据权利要求 1、 2或 3所述的自适应动态信道分配方法， 其特征在 于： 所述步骤 2 的触发条件是， 当实时监测到的业务量超过业务量实时需求 增加门限时， 并且在增加业务量触发门限时间之后仍然超过该门限， 业务量 实时需求增加事件触发， 并上报业务量实时需求增加， 每次上报之后的增加 业务量悬至时间之内不再上报， 当实时监测到的业务量低于业务量实时需求 減少门限时， 并且在减少业务量触发门限时间之后仍然低于该门限， 业务量 实时需求减少事件触发， 并上报业务量实时需求减少， 每次上报之后的减少 业务量悬至时间之内不再上报。
5、 4艮据权利要求 4所述的自适应动态信道分配方法，其特征在于： 所述 增加业务量触发门限时间为 10ms至 20000ms。
6、 根据权利要求 4所述的自适应动态信道分配方法，其特征在于： 所述 增加业务量悬至时间为 10ms至 30000 ms。
7、 根据权利要求 4所述的自适应动态信道分配方法，其特征在于： 所述 减少业务量出发门限时间为 400ms至 20000ms。
根据权利要求 4所述的自适应动态信道分配方法， 其特征在于： 所述减 少业务量悬至时间为 500ms至 30000ms。
PCT/CN2005/000561 2005-04-22 2005-04-22 Procede d'allocation dynamique et adaptative de canal WO2006111047A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN2005800495465A CN101167376B (zh) 2005-04-22 2005-04-22 自适应动态信道分配方法
PCT/CN2005/000561 WO2006111047A1 (fr) 2005-04-22 2005-04-22 Procede d'allocation dynamique et adaptative de canal

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2005/000561 WO2006111047A1 (fr) 2005-04-22 2005-04-22 Procede d'allocation dynamique et adaptative de canal

Publications (1)

Publication Number Publication Date
WO2006111047A1 true WO2006111047A1 (fr) 2006-10-26

Family

ID=37114696

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2005/000561 WO2006111047A1 (fr) 2005-04-22 2005-04-22 Procede d'allocation dynamique et adaptative de canal

Country Status (2)

Country Link
CN (1) CN101167376B (zh)
WO (1) WO2006111047A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016107142A1 (zh) * 2014-12-29 2016-07-07 中兴通讯股份有限公司 一种资源分配调控的方法和装置

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1369979A (zh) * 2001-02-15 2002-09-18 华为技术有限公司 一种用于码分多址蜂窝移动通信系统的动态信道配置方法
US6483820B1 (en) * 1999-03-22 2002-11-19 Ericsson Inc. System and method for dynamic radio resource allocation for non-transparent high-speed circuit-switched data services

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6597705B1 (en) * 1998-09-10 2003-07-22 Qualcomm Incorporated Method and apparatus for distributed optimal reverse link scheduling of resources, such as a rate and power in a wireless communication system
CN1163005C (zh) * 2001-09-03 2004-08-18 华为技术有限公司 一种基于源速率估计的动态信道配置方法

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6483820B1 (en) * 1999-03-22 2002-11-19 Ericsson Inc. System and method for dynamic radio resource allocation for non-transparent high-speed circuit-switched data services
CN1369979A (zh) * 2001-02-15 2002-09-18 华为技术有限公司 一种用于码分多址蜂窝移动通信系统的动态信道配置方法

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016107142A1 (zh) * 2014-12-29 2016-07-07 中兴通讯股份有限公司 一种资源分配调控的方法和装置

Also Published As

Publication number Publication date
CN101167376B (zh) 2011-02-02
CN101167376A (zh) 2008-04-23

Similar Documents

Publication Publication Date Title
KR100984982B1 (ko) 서비스 품질을 지원하는 통신 시스템에서의 승인 제어 및 자원 할당
JP5116845B2 (ja) リアルタイム通信システムにおけるジッタベースのメディアレイヤアダプテーション
US8259566B2 (en) Adaptive quality of service policy for dynamic networks
EP1796332A1 (en) Token bucket dynamic bandwidth allocation
AU2010200486A1 (en) Flow admission control for wireless systems
CN1761356A (zh) 一种码分多址系统中公共信道向专用信道的类型转换方法
WO2007073271A1 (en) Method and apparatus for solving data packet traffic congestion.
WO2006102739A1 (en) Method and system of managing wireless resources
EP1692829A1 (en) Quality of service scheduler for a wireless network
KR20090090405A (ko) 통신 네트워크에서의 트래픽 로드 제어
CN101114988A (zh) 基于非连续发射预测自适应多速率业务的流控算法
EP1331767A1 (en) Method and apparatus for random access packet transmission by performing load control functionality
KR100788891B1 (ko) 통합 트래픽을 위한 패킷 레벨 자원 할당 방법 및 장치
JP4348367B2 (ja) 通信システム、通信ユニット、およびその内部における能力温存方法
KR101671254B1 (ko) 이동통신 시스템에서 음성 구간 검출 방법 및 장치
WO2006111047A1 (fr) Procede d&#39;allocation dynamique et adaptative de canal
KR100726809B1 (ko) 대역폭 할당 장치 및 방법
CN1761355A (zh) 一种码分多址系统中专用信道向公共信道的类型转换方法
Jayasuriya et al. Packet value based scheduling for wireless local area networks
Kassev et al. Performance Analysis of Call Admission Control for Streaming Traffic with Activity Detection Function

Legal Events

Date Code Title Description
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: 200580049546.5

Country of ref document: CN

NENP Non-entry into the national phase

Ref country code: DE

WWW Wipo information: withdrawn in national office

Country of ref document: DE

NENP Non-entry into the national phase

Ref country code: RU

WWW Wipo information: withdrawn in national office

Country of ref document: RU

122 Ep: pct application non-entry in european phase

Ref document number: 05743589

Country of ref document: EP

Kind code of ref document: A1

WWW Wipo information: withdrawn in national office

Ref document number: 5743589

Country of ref document: EP