Abstract
This paper studies the design and performance of the Probabilistic Priority (PP) packet scheduling algorithm to schedule packets. Unlike an earlier design that uses fractional arithmetic and prohibits large number of classes, we present an integer PP algorithm and show that PP is a special scheme of applying lottery scheduling to bandwidth allocation in a strict priority sense. We then propose a Multi-winner PP (MPP) scheduler using multi-winner lottery scheduling to improve the throughput and response time accuracy and a flexible ticket transfer algorithm to improve the deadline violation probability in probabilistic scheduling. Finally, we investigate the issue of parameter assignment for an MPP scheduler and use our techniques to implement a prototype Assured Forwarding (AF) mechanism in a network processor.
Chapter PDF
References
Blake, S., Black, D., Carlson, M., Davis, E., Wang, Z., Weiss, W.: An architecture for differentiated services, IETF RFC 2475 (December 1998)
Eggleston, J., Jamin, S.: Differentiated services with lottery scheduling. In: Wolf, L., Hutchinson, D.A., Steinmetz, R. (eds.) IWQoS 2001. LNCS, vol. 2092, p. 357. Springer, Heidelberg (2001)
Intel IXP 1200 Network Processor: Microcode Programmer’s Reference Manual Revision 11, Part No. 278304-011 (March 2002)
Jiang, Y., Tham, C.K., Ko, C.C.: A probabilistic priority scheduling discipline for multi-service networks. Computer Communications 25(13), 1243–1254 (2002)
Kleinrock, L.: Queueing Systems: Computer applications, vol. 2. John Wiley & Sons, Chichester (1976)
Tham, C.-K., Yao, Q., Jiang, Y.: Achieving differentiated services through multiclass probabilistic priority scheduling. Computer Networks 40, 577–593 (2002)
Waldspurger, C., Weihl, W.: Lottery scheduling: Flexible proportional-share resource management. In: Proc. the First USENIX Symposium on Operating Systems Design and Implementation (OSDI) (November 1994)
Waldspurger, C.: Lottery and stride scheduling: Flexible proportional-share resource management, Ph.D. Thesis, Massachusetts Institute of Technology (September 1995)
Zhang, M., Wang, R., Peterson, L., Krishnamurthy, A.: Probabilistic packet scheduling: Achieving proportional share bandwidth allocation for TCP flows. In: Proc. IEEE INFOCOM (June 2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 IFIP International Federation for Information Processing
About this paper
Cite this paper
Tan, CW., Tham, CK. (2003). Achieving Relative Differentiated Services Using Proportional Probabilistic Priority Scheduling on Network Processor. In: Marshall, A., Agoulmine, N. (eds) Management of Multimedia Networks and Services. MMNS 2003. Lecture Notes in Computer Science, vol 2839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39404-4_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-39404-4_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20050-5
Online ISBN: 978-3-540-39404-4
eBook Packages: Springer Book Archive