Achieving proportional delay differentiation efficiently

Authors:
Hoon-Tong Ngin;Chen-Khong Tham
Affiliations:
Department of Electrical and Computer Engineering, National University of Singapore, 10, Kent Ridge Crescent, Singapore, Singapore 119260;Department of Electrical and Computer Engineering, National University of Singapore, 10, Kent Ridge Crescent, Singapore, Singapore 119260
Venue:
Computer Communications
Year:
2004

Citing 6
Cited 0

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

Visualization

Abstract

In this paper, we focus on efficiently achieving Proportional Delay Differentiation (PDD), an instance of the Proportional Differentiation Model first proposed under the DiffServ framework [IEEE Network (1999)]. PDD can be achieved using a few algorithms, one of the most well-known being Waiting Time Priority(WTP). Using WTP [Proc. ACM SIGCOMM (1999)] as a reference, we show that our proposed Scaled Time Priority (STP) algorithm is able to provide near proportional delay at a complexity of O(1), which is lower than the O(N) complexity of WTP, where N is the number of service classes in the system. Simulation results also show that STP is able to emulate the performance of WTP.