Improving the performance of RED deployment on a class based queue with shared buffers

TitleImproving the performance of RED deployment on a class based queue with shared buffers
Publication TypeConference Paper
Year of Publication2001
AuthorsAgharebparast, F., and V. C. M. Leung
Conference NameGlobal Telecommunications Conference, 2001. GLOBECOM '01. IEEE
Pagination2363 -2367 vol.4
Keywordsbuffer storage, CBQ, class based queue, complete partitioning, congestion avoidance, congestion control, estimated average queue length, minimum allocation schemes, packet drop decision, packet drop ratio, packet switching, probability, queueing theory, random early detection, random processes, RED algorithms, RED deployment, RED drop probabilities, RED parameters, shared buffers, simulation results, subqueue length, TCP traffic streams, telecommunication congestion control, telecommunication traffic
Abstract

We address the deployment of random early detection (RED) on class based queues (CBQs) with shared buffer by deriving novel RED algorithms for the complete sharing and sharing with minimum allocation schemes and comparing their performance with RED under complete partitioning that is equivalent to using a dedicated buffer for each CBQ. In our novel RED algorithms, packet drop decision is based on the estimated average lengths of both the effective subqueue and the whole queue. Simulation results ascertain and demonstrate the superiority of the proposed schemes in terms of lower packet drop ratio under congestion situations, with different RED parameters under diverse RED drop probabilities and weight factors

URLhttp://dx.doi.org/10.1109/GLOCOM.2001.966201
DOI10.1109/GLOCOM.2001.966201

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia