Achieving differentiated services through multi-class probabilistic priority scheduling

Authors:
Chen-Khong Tham;Qi Yao;Yuming Jiang
Affiliations:
Department of Electrical and Computer Engineering, National University of Singapore, 4 Engineering Drive 3, Singapore 119260, Singapore;Institute for Communications Research, 20 Science Park Road, #02-34/37 TeleTech Park, Singapore Science Park II, Singapore 117674, Singapore;Institute for Communications Research, 20 Science Park Road, #02-34/37 TeleTech Park, Singapore Science Park II, Singapore 117674, Singapore
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2002

Citing 6
Cited 3

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Relative differentiated services in the Internet: issues and mechanisms

SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Proportional differentiated services: delay differentiation and packet scheduling

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A Probabilistic Priority Scheduling Discipline for Multi-Service Networks

ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
A probabilistic priority scheduling discipline for multi-service networks

Computer Communications

Time-dependent performance analysis of a discrete-time priority queue

Performance Evaluation
A study on performance comparison of priority-based queueing scheme with two queueing buffer allocations in an UMTS core network gateway

Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems
A Study on Differentiated Service Queuing Scheme with an Overflow Buffer Allocation Within a UMTS Core Network

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Differentiated services (DiffServ) is a promising architecture for the next generation Internet due to its scalable and flexible design. In DiffServ, scheduling disciplines play an important role in achieving service differentiation. In this paper, we extend the average delay analysis of the probabilistic priority (PP) scheduling discipline first proposed in [Proc. 2001 IEEE Workshop on High Performance Switching and Routing (HPSR 2001), 2001] to the multi-class case. The PP discipline is based on the strict priority discipline with the difference that each priority queue is assigned a parameter pi ∈ [0, 1] which determines the probability that the queue is served. We derive the relationship between the average queueing delay of each class and these parameters, as well as the upper and lower bounds of the average queueing delay for each class. This relationship shows that PP can provide different quality of service (QoS) to different priority classes in a controllable way. Simulation results are presented to assess the validity of these findings in different scenarios, e.g. different traffic types, offered traffic loads and parameterizations. We also specifically address the issues concerning the use of the PP discipline in DiffServ networks to achieve different per-hop-behaviors and describe the performance of a Linux implementation of PP running on a DiffServ testbed. Finally, we evaluate the ability of the PP discipline to provide relative and proportional DiffServ.