PSS:一种提供服务质量保证的区分优先级的分组调度架构  

PSS:A QoS-Oriented and Priority-Based Packet Scheduling Structure

作　　者：邹君妮[1] 许孙娟[1] 林如俭[1] 

机构地区：[1]上海大学通信工程学院,上海200072

出　　处：《电子与信息学报》2007年第3期702-706,共5页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(60377024);上海市科委科学技术发展基金(04dz12045)资助课题

摘　　要：为解决融合多媒体应用的互联网的QoS问题,该文提出了一种适用于高速分组网络的低复杂度的分组调度通用架构(PSS,Priority-based Scheduling Structure)。PSS将整个调度分为高、低两个优先级调度过程,在高优先级调度过程,提出了一种带约束条件和速率控制因子的排序优先型算法,避免了带宽抢占现象,有效控制了高优先级业务的服务速率;在低优先级过程,提出了一种改进的帧结构型算法,不仅降低了算法复杂度,减小了硬件实现成本,而且缓解了输出业务流的突发性。最后从数学分析和仿真实验两方面证实了PSS架构的可行性和实效性。To solve the QoS issue of the Internet including multi-services, a Priority-based Scheduling Structure （PSS） designed for high-speed packet networks is proposed. PSS divides packet scheduling into high-priority section and low-priority section. In the high-priority section, a sorted-priority algorithm with low implementation complexity is presented to avoid bandwidth preemption and to control effectively service rates of high-priority services. In the low-priority section, an improved framed-based algorithm is proposed, which decreases not only the algorithm complexity but also the hardware implementation cost. Computer simulation results as well as theoretic analysis show that the PSS mechanism has excellent performance in terms of the implementation complexity, fairness and delay properties.

关 键 词：服务质量 分组调度 优先级 排序优先型算法 帧结构型算法 

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