On dropping sequences for RED

In this note, we show how to compare the dropping sequences in the random early detection algorithm once all the parameters have been fixed. This is done for a single node, as well as for one TCP connection. The method proposed here uses convexity properties to provide comparing tools for all types...

Full description

Saved in:
Bibliographic Details
Main Authors: Gaujal, B., Hordijk, A.
Format: Conference Proceeding
Language:English
Subjects:
Cost function
Delay
Detection algorithms
Discrete event systems
Stochastic processes
Throughput
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this note, we show how to compare the dropping sequences in the random early detection algorithm once all the parameters have been fixed. This is done for a single node, as well as for one TCP connection. The method proposed here uses convexity properties to provide comparing tools for all types of dropping schemes. In particular, we compare Bernoulli with uniform dropping. We also provide the optimal dropping scheme in terms of workload for the single node and end-to-end delay for the connection.
DOI:10.1109/NGI.2005.1431674