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

Zou Jun-ni; Xu Sun-juan; Lin Ru-jian

doi:10.3724/SP.J.1146.2005.00667

Volume 29 Issue 3

Jan. 2011

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2007 > 29(3): 702-706

Zou Jun-ni, Xu Sun-juan, Lin Ru-jian . PSS: A QoS-Oriented and Priority-Based Packet Scheduling Structure[J]. Journal of Electronics & Information Technology, 2007, 29(3): 702-706. doi: 10.3724/SP.J.1146.2005.00667

Citation:

Zou Jun-ni, Xu Sun-juan, Lin Ru-jian . PSS: A QoS-Oriented and Priority-Based Packet Scheduling Structure[J]. Journal of Electronics & Information Technology, 2007, 29(3): 702-706. doi: 10.3724/SP.J.1146.2005.00667

Citation:

PDF( 290 KB)

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

doi: 10.3724/SP.J.1146.2005.00667

Received Date: 2005-06-09
Rev Recd Date: 2006-01-20
Publish Date: 2007-03-19

Abstract

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.

FullText(HTML)

References(1)

References

[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.

Relative Articles

Supplements(0)

Cited By

Proportional views