...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >The Impact of Queue Length Information on Buffer Overflow in Parallel Queues
【24h】

The Impact of Queue Length Information on Buffer Overflow in Parallel Queues

机译：队列长度信息对并行队列中缓冲区溢出的影响

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We consider a system consisting of $N$ parallel queues, served by one server. Time is slotted, and the server serves one of the queues in each time slot, according to some scheduling policy. We first characterize the exponent of the buffer overflow probability and the most likely overflow trajectories under the Longest Queue First (LQF) scheduling policy. Under statistically identical arrivals to each queue, we show that the buffer overflow exponents can be simply expressed in terms of the total system occupancy exponent of $m$ parallel queues, for some $mleq N$. We next turn our attention to the rate of queue length information needed to operate a scheduling policy, and its relationship to the buffer overflow exponents. It is known that queue length blind policies such as processor sharing and random scheduling perform worse than the queue aware LQF policy, when it comes to buffer overflow probability. However, we show that the overflow exponent of the LQF policy can be preserved with arbitrarily infrequent queue length updates.
机译：我们考虑一个由一个服务器服务的 $ N $ 并行队列组成的系统。根据某种调度策略，对时间进行时隙分配，并且服务器在每个时隙中为其中一个队列服务。我们首先根据最长队列优先（LQF）调度策略来表征缓冲区溢出概率和最可能的溢出轨迹的指数。在统计上到达每个队列的次数相同的情况下，我们表明缓冲区溢出指数可以简单表示为 $ m $ 并行队列，对于某些 $ mleq N $ 。接下来，我们将注意力转移到操作调度策略所需的队列长度信息的速率及其与缓冲区溢出指数的关系上。众所周知，在缓冲区溢出概率方面，诸如处理器共享和随机调度之类的队列长度盲策略的性能要比队列感知LQF策略差。但是，我们表明可以通过任意不频繁的队列长度更新来保留LQF策略的溢出指数。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号