虚拟时钟调度算法研究  

STUDY OF VIRTUAL CLOCK PACKET SCHEDULING ALGORITHM

作　　者：高文宇[1] 陈松乔[1] 王建新[1] 

机构地区：[1]中南大学信息科学与工程学院,湖南长沙410083

出　　处：《计算机应用与软件》2005年第6期1-3,130,共4页Computer Applications and Software

基　　金：国家自然科学基金重大研究计划(90304010)

摘　　要：FIFO队列调度算法由于实现简单、执行效率高而在网络中得到大量的应用,但FIFO队列无法实现对资源的分配;另一种调度算法公平队列调度则可以实现对带宽资源的公平分配,但是它存在可扩展性问题。而基于虚拟时钟的算法在实现对资源进行公平分配的同时具备良好的可扩展性,从而能够满足QoS控制中对于分组调度算法的需求。本文主要对一些基于虚拟时钟的调度算法进行了分析和讨论,这也是进行QoS控制研究的基础。FIFO scheduling algorithm is widely used in the networks because of its simplicity and high performance.But it cannot perform resource allocation.Another scheduling algorithm,which is fair queuing scheduling algorithm (FQ),can perform fair resource allocation among different flows,but it also has a shortcoming of non-scalability.However,the virtual clock-based packet scheduling algorithm can perform resource allocation as long as maintain good scalability.In this paper,several virtual clock-based scheduling algorithms were discussed,and this task was the basis of how to combine these algorithm with QoS control mechanism.

关 键 词：虚拟时钟 算法研究 队列调度算法 FIFO队列 分组调度算法 公平分配 可扩展性 QOS控制 执行效率 带宽资源 控制研究 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术] O121.5[自动化与计算机技术—计算机科学与技术]