Scaled time priority: an efficient approximation to waiting time priority

Authors:
Hoon-Tong Ngin;Chen-Khong Tham
Affiliations:
Dept. of Elec. and Comp. Eng., Nat. Univ. of Singapore, Singapore 119260, Singapore and Dept. of Elec. and Comp. Eng., Massey Univ. Pvt., Te Kura Putaiao o, Palmerston North 117576, New Zealand;Department of Electrical and Computer Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore 119260, Singapore
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2004

Citing 11
Cited 0

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Exact admission control for networks with a bounded delay service

IEEE/ACM Transactions on Networking (TON)
Proportional differentiated services: delay differentiation and packet scheduling

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
A scheduler for delay-based service differentiation among AF classes

Broadband communications
Rate allocation and buffer management for differentiated services

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
On Creating Proportional Loss-Rate Differentiation: Predictability and Performance

IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
A Near-Optimal Packet Scheduler for QoS Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Traffic characterization and switch utilization using a deterministic bounding interval dependent traffic model

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
Proportional differentiated services for the internet

Proportional differentiated services for the internet
A case for relative differentiated services and the proportional differentiation model

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Under the framework of DiffServ, Dovrolis presented the proportional differentiation model (PDM) [IEEE Network, October 1999] and found the waiting time priority (WTP) scheme [Proc. ACM SIGCOMM, September 1999] to be a suitable scheduling algorithm to achieve proportional delay differentiation. In this paper, we propose scaled time priority (STP), which is an efficient approximation to waiting time priority (WTP). In particular, STP is able to provide near proportional delay at a complexity of O(1), which is lower than WTP's O(N) complexity, where N is the number of service classes in the system. Simulation results show that STP is able to emulate the performance of WTP.