• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >A queueing theoretic approach to the delay analysis for the FCFS 0.487 conflict resolution algorithm
【24h】

A queueing theoretic approach to the delay analysis for the FCFS 0.487 conflict resolution algorithm

机译：FCFS 0.487冲突解决算法的延迟分析排队理论方法

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

摘要

The authors apply their queuing-theoretic delay analysis methodology to several variations of the FCFS 0.487 conflict resolution algorithm. In this approach, the main component of the packet delay is viewed as a queuing problem in which each window selected by the channel access algorithm is a customer requiring conflict resolution as its service. The authors' methodology is extended to handle all the features of the full FCFS 0.487 algorithm, including variable-size windows, arrival-time addressing (and hence true FCFS scheduling), and biased interval splitting. Some of these extensions involve approximations, but they make it possible to obtain the Laplace transform and moments of the packet delay. The authors also present an exact analysis for the three-cell algorithm, which is the 0.487 algorithm with a few modifications to satisfy the separability condition that reduces its capacity to 0.48. Comparisons made with other analyses (which provide bounds on the mean delay) and with extensive simulations show that the present results for both the mean and the variance of the packet delay are extremely accurate.
机译：作者将他们的排队理论延迟分析方法应用于FCFS 0.487冲突解决算法的几种变体。在这种方法中，数据包延迟的主要组成部分被视为一个排队问题，在该问题中，通道访问算法选择的每个窗口都是需要冲突解决作为其服务的客户。作者的方法已扩展为可处理完整FCFS 0.487算法的所有功能，包括可变大小的窗口，到达时间寻址（因此是真正的FCFS调度）和有偏差的间隔分割。这些扩展中的一些扩展涉及近似值，但是它们使获得拉普拉斯变换和数据包延迟的时刻成为可能。作者还提出了对三元算法的精确分析，该算法是0.487算法，并作了一些修改以满足可分离性条件，从而将其容量降低到0.48。与其他分析（提供了平均延迟的界限）和广泛的仿真结果进行的比较表明，当前的数据包延迟平均值和方差的结果非常准确。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号