On the deployment of RED on shared-memory buffers

TitleOn the deployment of RED on shared-memory buffers
Publication TypeJournal Article
Year of Publication2002
AuthorsAgharebparast, F., and V. C. M. Leung
JournalCommunications Letters, IEEE
Pagination458 - 460
Date Publishedoct.
Keywordsbuffer management algorithms, buffer storage, class-based queues, complete partitioning, complete sharing, congestion control, drop probability equations, M/M/1/K queueing model, packet loss ratio, queueing theory, random early detection, RED deployment, shared memory systems, shared-memory buffers, sharing with minimum allocation, TCP delays, TCP traffic flows, telecommunication congestion control, telecommunication traffic

We have proposed novel buffer management algorithms for the deployment of random early detection (RED) on class-based queues with shared-memory buffers, where the total buffer is shared under complete sharing, sharing with minimum allocation, and complete partitioning policies. This letter provides an analytical evaluation of these schemes by deriving the drop probability equations using the traditional M/M/1/K queueing model. This letter also provides a comparison of the delay and loss ratio of these scheme under TCP flows. Sharing with minimum allocation is shown to give the best performance


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

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