首页> 外文会议>IEEE InfoCOM >FPQ: a Fair and Efficient Polling Algorithm with QoS Support for Bluetooth Piconet
【24h】

FPQ: a Fair and Efficient Polling Algorithm with QoS Support for Bluetooth Piconet

机译:FPQ:具有QoS支持蓝牙微微网的公平有效的轮询算法

获取原文
获取外文期刊封面目录资料

摘要

Bluetooth is an emerging standard for short range, low cost, low power wireless access technology. The Bluetooth technology is just starting to appear on the market and there is an urgent need to enable new applications with real time constraints to run on top of Bluetooth devices. The Bluetooth Specification proposes a Round Robin scheduler as possible solution for scheduling the transmissions in a Bluetooth Piconet. However, this basic scheme performs badly under asymmetric traffic conditions. Recently, several polling schemes have been proposed to improve performance on asymmetric transmissions and to support bandwidth guarantee. However, there is no solution available to support both delay and bandwidth guarantees required by real time applications. In this paper, we present FPQ, a new polling algorithm for Bluetooth Piconet that supports both delay and bandwidth guarantees and aims to remain fair and efficient with asymmetric flow rates. We present an extensive set of simulations and provide performance comparisons with other polling algorithms. Our performance study indicates that FPQ, while supporting flow rate and maximum delay QoS requests, outperforms Deficit Round Robin [5] in term of delays by at least 10% in all cases, sometimes by more than 30% to 50%. Moreover, FPQ was designed to take the specifics of Bluetooth into consideration, in particular the low complexity required for cheap implementation.
机译:蓝牙是短程的新兴标准,低成本,低功耗无线接入技术。蓝牙技术刚刚开始出现在市场上,迫切需要使新应用程序具有实时约束来运行蓝牙设备。蓝牙规范提出了一种循环罗宾调度器,作为调度蓝牙微微网中的传输的可能解决方案。但是,此基本方案在不对称的交通状况下表现严重。最近,已经提出了几种轮询方案来提高不对称传输的性能并支持带宽保证。但是,没有可用于支持实时应用程序所需的延迟和带宽保证的解决方案。在本文中,我们呈现FPQ,这是一种新的蓝牙微微网的投票算法,支持延迟和带宽保证,并旨在保持公平和高效的流量。我们提供了广泛的模拟,并提供了与其他投票算法的性能比较。我们的绩效研究表明FPQ,同时支持流量和最大延迟QoS要求,在所有情况下延迟至少10%的延迟期限差异偏转循环[5],有时超过30%至50%。此外,FPQ旨在考虑到蓝牙的细节,特别是廉价实现所需的低复杂性。

著录项

  • 来源
    《IEEE InfoCOM》|2003年||共11页
  • 会议地点
  • 作者

    IEEE;

  • 作者单位
  • 会议组织
  • 原文格式 PDF
  • 正文语种
  • 中图分类 TB907.2-53;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号