首页> 外文会议>Database Systems for Advanced Applications >A Data Partition Based Near OptimalScheduling Algorithm for Wireless Multi-channel Data Broadcast
【24h】

A Data Partition Based Near OptimalScheduling Algorithm for Wireless Multi-channel Data Broadcast

机译:基于数据分割的无线多路数据广播近最优调度算法

获取原文
获取原文并翻译 | 示例

摘要

Data broadcast is an efficient way to disseminate information to large numbers of users in wireless environments. The Square Root Rule (SRR) is the theoretical basis for the single channel broadcast scheduling. In this paper, we extend the SRR and propose the Multi-channel Square Root Rule (MSRR) for scheduling variable-length data with skewed access probabilities on variable-bandwidth channels. The theoretical optimal average access latency is also provided. However, this optimal value can not be achieved in reality. Based on MSRR, we provide a two-phase scheduling algorithm which achieves near optimal access latency. First data are partitioned and allocated to different channels according to MSRR. Second, different scheduling strategies are adopted on each channel according to the skewness of data subset allocated on that channel. Experiments show that the difference of average access latency between our results and the optimal value is below five percent in most situations.
机译:数据广播是一种在无线环境中将信息传播给大量用户的有效方法。平方根规则(SRR)是单频道广播调度的理论基础。在本文中,我们扩展了SRR并提出了多信道平方根规则(MSRR),用于在可变带宽信道上调度具有偏斜访问概率的变长数据。还提供了理论上的最佳平均访问延迟。但是,实际上不能实现该最佳值。基于MSRR,我们提供了一种两阶段调度算法,可实现接近最佳的访问延迟。根据MSRR,第一数据被划分并分配给不同的信道。其次,根据在该信道上分配的数据子集的偏斜度,在每个信道上采用不同的调度策略。实验表明,在大多数情况下,我们的结果与最佳值之间的平均访问延迟差异小于5%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号