An enhanced RED-Based scheme for differentiated loss guarantees

Authors:
Jahwan Koo;Vladimir V. Shakhov;Hyunseung Choo
Affiliations:
School of Information and Communication Engineering, Sungkyunkwan University, Jangan-gu, Suwon, South Korea;Institute of Computational Mathematics and Mathematical Geophysics of SB RAS, Novosibirsk, Russia;School of Information and Communication Engineering, Sungkyunkwan University, Jangan-gu, Suwon, South Korea
Venue:
APNOMS'06 Proceedings of the 9th Asia-Pacific international conference on Network Operations and Management: management of Convergence Networks and Services
Year:
2006

Citing 5
Cited 1

Proportional differentiated services: delay differentiation and packet scheduling

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
JoBS: Joint Buffer Management and Scheduling for Differentiated Services

IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
Weighted proportional loss rate differentiation of TCP traffic

International Journal of Network Management
On modelling reliability in RED gateways

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
A case for relative differentiated services and the proportional differentiation model

IEEE Network: The Magazine of Global Internetworking

On achieving proportional loss differentiation using dynamic-MQDDP with differential drop probability

Proceedings of the 2007 conference on Human interface: Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, researchers have explored to provide a queue management scheme with differentiated loss guarantees for the future Internet. The Bounded Random Drop (BRD), known as the best existing scheme, is one of such efforts which guarantees strong loss differentiation to the level of traffic in the different service classes. Even though BRD has several benefits such as low complexities and good functionalities, we identify that it has some shortcomings such as low throughput, long queuing delays, and selection problem of optimal values of parameters. Specifically, the shortcomings stem from calculating drop probabilities based on the arrival rate estimation and dropping incoming packets randomly with calculated drop probabilities without considering the current buffer occupancy. A multiple queue management scheme based on differential drop probability, called MQDDP, is proposed to overcome BRD's shortcomings as well as support absolute loss differentiation. This scheme extends the original Random Early Detection (RED), recommended by IETF for next generation Internet gateways, into multiple class-based queues by deriving the drop probability equations based on a queueing model. We also compare MQDDP to BRD for high traffic intensity and show that MQDDP has the better performance in terms of packet drop rate.