On the performance of greedy algorithms in packet buffering

@inproceedings{Albers2004OnTP,
  title={On the performance of greedy algorithms in packet buffering},
  author={Susanne Albers and Markus Schmidt},
  booktitle={STOC},
  year={2004}
}
We study a basic buffer management problem that arises in network switches. Consider m input ports, each of which is equipped with a buffer (queue) of limited capacity. Data packets arrive online and can be stored in the buffers if space permits; otherwise packet loss occurs. In each time step the switch can transmit one packet from one of the buffers to the output port. The goal is to maximize the number of transmitted packets. Simple arguments show that any reasonable algorithm, which serves… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 50 extracted citations

Buffer overflow management with class segregation

Inf. Process. Lett. • 2013
View 4 Excerpts
Highly Influenced

Three dozen papers on online algorithms

SIGACT News • 2005
View 6 Excerpts
Highly Influenced

References

Publications referenced by this paper.

Management of Multi-Queue Switches in QoS Networks

Algorithmica • 2003
View 9 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…