An Optimal Lower Bound for Buffer Management in Multi-Queue Switches

Marcin Bienkowski. An Optimal Lower Bound for Buffer Management in Multi-Queue Switches. In Dana Randall, editor, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011. pages 1295-1305, SIAM, 2011. [doi]

@inproceedings{Bienkowski11,
  title = {An Optimal Lower Bound for Buffer Management in Multi-Queue Switches},
  author = {Marcin Bienkowski},
  year = {2011},
  url = {http://www.siam.org/proceedings/soda/2011/SODA11_098_bienkowskim.pdf},
  researchr = {https://researchr.org/publication/Bienkowski11},
  cites = {0},
  citedby = {0},
  pages = {1295-1305},
  booktitle = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011},
  editor = {Dana Randall},
  publisher = {SIAM},
}