On the deployment of RED on shared-memory buffers

Abstract

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.