摘要: 针对WiMAX系统中混合业务的特点,提出一种基于Fibonacci的动态带宽分配算法。介绍Fibonacci数列以及带宽调度的体系结构,对于实时轮询业务,在达到其能容忍的最大时延之前完成带宽分配。实验结果表明,与亏空公平优先队列算法相比,该算法能满足不同类型业务的QoS需求,提高系统吞吐量,且具有较好的服务公平性。
关键词:
动态带宽调度,
Fibonacci数列,
吞吐量,
公平性
Abstract: According to the characteristics of the mixed business in WiMAX system, this paper proposes a dynamic bandwidth allocation algorithm based on Fibonacci. It introduces Fibonacci sequence, and the system structure of bandwidth schedule. For Real Time Polling Service (RTPS) service, it finishes the bandwidth allocation before the last tolerant delay. Experimental results show that compared with the deficit fair priority queue algorithm, the proposed algorithm can satisfy the Quality of Service(QoS) requirement of different types. It also improves the throughput of system and good service fairness.
Key words:
dynamic bandwidth schedule,
Fibonacci sequence,
throughput,
fairness
中图分类号:
陈媛媛, 冯慧芳. 基于Fibonacci的动态带宽分配算法[J]. 计算机工程, 2012, 38(06): 116-118.
CHEN Yuan-Yuan, FENG Hui-Fang. Dynamic Bandwidth Allocation Algorithm Based on Fibonacci[J]. Computer Engineering, 2012, 38(06): 116-118.