γi⁢Wi⁡(t)ci⁡(t), ]]>;wherein Wi(t) is a packet delay, a queue length, or an increasing function of packet delay or queue length for the i'th queue, ci(t) is a weight coefficient descriptive of channel conditions for the i'th user, and &ggr;i is a fixed constant that can be chosen arbitrarily. We have found that if any scheduling discipline can yield stable queues for a given traffic pattern of arriving packets, then M-LWDF can, even under changing channel conditions. Moreover, we have found that M-LWDF can provide favorable QoS in terms of delay bounds."/> Method of packet scheduling, with improved delay performance, for wireless networks
首页> 外国专利> Method of packet scheduling, with improved delay performance, for wireless networks

Method of packet scheduling, with improved delay performance, for wireless networks

机译:用于无线网络的具有改进的延迟性能的分组调度方法

摘要

A new scheduling discipline is disclosed for the forward link of a wireless network such as a CDMA network. The new discipline, which we denominate Modified LWDF (M-LWDF), resembles the known LWDF discipline in that only one queue is served at a time, and the queue to be served is that having the largest weighted delay. According to M-LWDF, the weighted delay of the i'th queue is defined as <math><mrow><mfrac><mrow><msub><mi>&amp;gamma;</mi><mi>i</mi></msub><mo>&amp;it;</mo><mrow><msub><mi>W</mi><mi>i</mi></msub><mo>&amp;af;</mo><mrow><mo>(</mo><mi>t</mi><mo>)</mo></mrow></mrow></mrow><mrow><msub><mi>c</mi><mi>i</mi></msub><mo>&amp;af;</mo><mrow><mo>(</mo><mi>t</mi><mo>)</mo></mrow></mrow></mfrac><mo>,</mo></mrow></math> ;wherein Wi(t) is a packet delay, a queue length, or an increasing function of packet delay or queue length for the i'th queue, ci(t) is a weight coefficient descriptive of channel conditions for the i'th user, and &ggr;i is a fixed constant that can be chosen arbitrarily. We have found that if any scheduling discipline can yield stable queues for a given traffic pattern of arriving packets, then M-LWDF can, even under changing channel conditions. Moreover, we have found that M-LWDF can provide favorable QoS in terms of delay bounds.
机译:公开了用于诸如CDMA网络的无线网络的前向链路的新的调度规则。我们将新的学科称为“修改的LWDF(M-LWDF)”,它类似于已知的LWDF学科,因为一次仅服务一个队列,并且要服务的队列是最大加权延迟的队列。根据M-LWDF,第i个队列的加权延迟定义为 <![CDATA [ &gamma; i &it; W i &af; t c i &af; < mrow> t ]]> ;其中W i (t)是数据包延迟,队列长度,或者是该数据包延迟或队列长度的递增函数第i个队列,c i (t)是描述第i个用户的信道条件的权重系数,&ggr; i 是一个固定常数,可以为任意选择。我们已经发现,如果任何调度规则都可以为到达的数据包的给定流量模式产生稳定的队列,那么M-LWDF可以,即使在变化的信道条件下也可以。此外,我们发现,就延迟范围而言,M-LWDF可以提供良好的QoS。

著录项

  • 公开/公告号US6590890B1

    专利类型

  • 公开/公告日2003-07-08

    原文格式PDF

  • 申请/专利权人 LUCENT TECHNOLOGIES INC.;

    申请/专利号US20000517659

  • 发明设计人 RAJIV VIJAYAKUMAR;ALEKSANDR STOLYAR;

    申请日2000-03-03

  • 分类号H04J32/40;H04B72/16;H04L122/80;

  • 国家 US

  • 入库时间 2022-08-22 00:04:18

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号