Competitive buffer management for shared-memory switches

@article{Aiello2008CompetitiveBM,
  title={Competitive buffer management for shared-memory switches},
  author={William Aiello and Alexander Kesselman and Yishay Mansour},
  journal={ACM Trans. Algorithms},
  year={2008},
  volume={5},
  pages={3:1-3:16}
}
We consider buffer management policies for shared memory switches. We study the case of overloads resulting in packet loss, where the constraint is the limited shared memory capacity. The goal of the buffer management policy is that of maximizing the number of packets transmitted. The problem is online in nature, and thus we use competitive analysis to measure the performance of the buffer management policies. Our main result is to show that the well-known preemptive Longest Queue Drop (LQD… CONTINUE READING
Highly Cited
This paper has 43 citations. REVIEW CITATIONS

Citations

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

Shared Memory Buffer Management for Heterogeneous Packet Processing

2014 IEEE 34th International Conference on Distributed Computing Systems • 2014
View 10 Excerpts
Highly Influenced

A programmable buffer management platform

2017 IEEE 25th International Conference on Network Protocols (ICNP) • 2017
View 3 Excerpts
Highly Influenced

BASEL (buffer management specification language)

2016 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS) • 2016
View 1 Excerpt

Similar Papers

Loading similar papers…