• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Computer Communications and Networks >Equal-rate scheduling algorithm: Implementation and Performance Analysis in IEEE 802.16m
【24h】

Equal-rate scheduling algorithm: Implementation and Performance Analysis in IEEE 802.16m

机译：平均调度算法：IEEE 802.16M中的实施和性能分析

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Scheduling algorithms play a key role in determining the overall performance of high-speed wireless systems. We propose an algorithm which tries to equalise the throughputs of all users in a wireless system and compare its performance with other scheduling algorithms from literature. On one end of the spectrum, we have the Max-Min algorithm which equalises the throughput among all users and achieves the least throughput among all scheduling algorithms. At the other end of the spectrum, we have the max-rate algorithm which always selects the best user and therefore starves users far away from the base station (BS). Hence, algorithms such as Proportional Fair (PF) which aim at maximising the throughput subject to some fairness constraint have been proposed. However, till date no algorithm exists which can ensure a minimum rate guarantee, given the number of users in the system and their respective requirements, because the constraints might not be feasible in the first place. Our objective is to design an equal rate scheduling algorithm, which maximises the number of users that can be supported with a given rate, and also achieves a small variance among the received throughputs of the users. We propose Weighted Proportional Fair (WPF) to achieve the objective, and also show that our algorithm can provide inputs to the Call Admission Control (CAC) to determine the maximum number of users that can be supported with a certain rate.
机译：调度算法在确定高速无线系统的整体性能方面发挥着关键作用。我们提出了一种算法，该算法试图均衡无线系统中所有用户的吞吐量，并将其与来自文献的其他调度算法进行比较。在频谱的一端，我们具有MAX-MIN算法，该算法等于所有用户之间的吞吐量，并实现了所有调度算法之间的最小吞吐量。在频谱的另一端，我们具有最大速率算法，总是选择最佳用户，因此删除远离基站（BS）的用户。因此，已经提出了诸如比例公平（PF）的算法，其目的是已经提出了最大化对某些公平约束的吞吐量。但是，截至系统中的用户数及其各自要求，截至目前，无需算法，可确保最低速率保证，因为其各自的要求，这首先可能不可行。我们的目的是设计一个平等的速率调度算法，它最大化了可以支持给定速率的用户数量，并且还实现了用户的接收吞吐量之间的小方差。我们提出加权比例公平（WPF）来实现目标，并且还表明，我们的算法可以为呼叫准入控制（CAC）提供输入，以确定可以以一定速率支持的最大用户数。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号