PSS：一种提供服务质量保证的区分优先级的分组调度架构
doi: 10.3724/SP.J.1146.2005.00667
PSS: A QoS-Oriented and Priority-Based Packet Scheduling Structure
-
摘要: 为解决融合多媒体应用的互联网的QoS问题，该文提出了一种适用于高速分组网络的低复杂度的分组调度通用架构(PSS, Priority-based Scheduling Structure)。PSS将整个调度分为高、低两个优先级调度过程，在高优先级调度过程，提出了一种带约束条件和速率控制因子的排序优先型算法，避免了带宽抢占现象，有效控制了高优先级业务的服务速率；在低优先级过程，提出了一种改进的帧结构型算法，不仅降低了算法复杂度，减小了硬件实现成本，而且缓解了输出业务流的突发性。最后从数学分析和仿真实验两方面证实了PSS架构的可行性和实效性。Abstract: 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.
-
[1] Parekh A and Gallager R. A generalized processor sharing approach to flow controlThe single node case[J].ACM/ IEEE Trans. on Networking.1993, 1(3):344-357 [2] Zhang L. VirtualClock: A new traffic control algorithm for packet switching networks[J].ACM Trans. on Computer Systems.1991, 9(2):101-124 [3] Shreedhar M and Varghese G. Efficient fair queueing using deficit round-robin[J].IEEE/ACM Trans. on Networking.1996, 4(3):375-385 [4] Do V L and Yun K Y. High Performance Switching and Routing. 2003 Workshop on HPSR, California, 24-27 June 2003: 103-110. [5] Wang Song. Hierarchical Qos Integration for Real-time Systems. Dissertation for the degree of Doctor of philosophy in electrical and computer engineering, University of California, IRVINE, 2003: 30-62. [6] Bennett J C R and Zhang H. Hierarchical packet fair queueing algorithms[J].ACM/IEEE Trans. on Networking.1997, 5(5):675-689 [7] 杨帆，刘增基. 一种合理共享空闲带宽的分组调度算法. 南京大学学报(自然科学), 2003, 39(2): 246-264. [8] Bennett J C R and Zhang H. WF2Q: Worst-case fair weighted fair queueing. in Proc. IEEEINFOCOM96, San Francisco, CA, Mar. 1996: 120-128. -
计量
- 文章访问数: 3143
- HTML全文浏览量: 71
- PDF下载量: 762
- 被引次数: 0
下载:
