Performance evaluation of prioritized scheduling with buffer management for differentiated services architectures

Authors:
Ahmed E. Kamal;Hossam S. Hassanein
Affiliations:
Department of Electrical and Computer Engineering, Iowa State University, 319 Durham, Ames, IA;School of Computing, Queen's University, Kingston, ON, Canada K7L 3N6
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2004

Citing 7
Cited 2

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
Fair queuing for aggregated multiple links

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
End-to-end QoS routing framework for differentiated services networks

Computer Communications
Investigation of premium service using differentiated services IP

Computer Communications

LGRR: A new packet scheduling algorithm for differentiated services packet-switched networks

Computer Communications
Combined Queue Management and Scheduling Mechanism to Improve Intra-User Multi-Flow QoS in a Beyond 3,5G Network

International Journal of Mobile Computing and Multimedia Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Differentiated services (DiffServ) is an architecture for the Internet in which various applications are supported using a simple classification scheme. Packets entering the DiffServ domain are marked depending on the packets' class. In this paper we introduce a versatile service and buffering scheme for different classes in a differentiated services Internet. The objective of this scheme is to introduce relative differentiation in terms of mean delay, throughput. In this scheme both high-buffer-priority (HPC) and low-buffer-priority (LPC) classes have reserved buffers. In addition, they have a shared buffer, where the priority of the shared buffer occupancy is to HPC traffic. Service priorities can be for high-buffer-priority traffic, low-buffer-priority traffic or round robin. An exact performance model for the proposed scheme is introduced. The performance model represents HPC and LPC traffic arrivals by a discrete batch Markov arrival process (D-BMAP). The model is used to obtain loss ratios, packet delays and throughputs for both HPC and LPC traffic. Performance results show that implementing buffer priorities, with a weighted round robin packet scheduling policy, results in low packet loss ratio and/or delay for the high-priority class without starving the low-priority class.