基于帧的ATM层次调度机制性能界及其仿真研究  

Study of Performance Bound and Simulation of Frame Based Hierarchical Fair Queueing Scheduling in ATM Network

作　　者：姜宁康[1] 李毓麟[1] 

机构地区：[1]上海交通大学光纤区域通信网国家重点实验室,上海200030

出　　处：《电子学报》2001年第6期770-773,共4页Acta Electronica Sinica

摘　　要：对网络交换节点中所采用的调度机制的研究是网络提供QoS保证的一个重要课题 .在本文中 ,结合基于帧调度器的简单性和GPS(generalizedprocessorsharing)算法的良好性能 ,提出了一种新颖的基于帧的层次调度算法HFFQ(HierarchicalFrame basedFairQueueing) .HFFQ能同时支持实时业务和非实时业务 ,另外采用了简单计数的方法来替代复杂的系统虚拟时间的计算过程 ,大大减少了算法的实现复杂度 .最后 ,用理论分析和仿真的方法 ,对HFFQ的公平性、服务率等指标的性能进行了论证 .结果显示 ,它和PGPS(Packet by packetGPS)相比 。One important issue in the provision of QoS guarantees is the study of the scheduling disciplines to be employed at network switches. We strive to combine the simplicity of frame-based schedulers with the performance characteristics of generalized processor sharing (GPS) disciplines, and propose a new scheduling mechanism named Hierarchical Frame-based Fair Queueing (HFFQ). HFFQ can support both real time traffic and non-real time traffic at the same time. In addition, it tremendously decrease the implement complexity by using counters to substitute the computing of system virtual time of other mechanism. At last, we evaluate some performance metrics of the HFFQ, such as fairness, service rate etc, using both analysis and simulation, and the results show that HFFQ has a better performance than that of PGPS.

关 键 词：帧 异步传输模式 通信网 仿真 信元调度 公平队列 

分 类 号：TN915.2[电子电信—通信与信息系统]