Optimal approximations for traffic distribution in bounded switch memories

Yaniv Sadeh, Ori Rottenstreich, Haim Kaplan. Optimal approximations for traffic distribution in bounded switch memories. In Dongsu Han, Anja Feldmann, editors, CoNEXT '20: The 16th International Conference on emerging Networking EXperiments and Technologies, Barcelona, Spain, December, 2020. pages 309-322, ACM, 2020. [doi]

@inproceedings{SadehRK20,
  title = {Optimal approximations for traffic distribution in bounded switch memories},
  author = {Yaniv Sadeh and Ori Rottenstreich and Haim Kaplan},
  year = {2020},
  doi = {10.1145/3386367.3431297},
  url = {https://doi.org/10.1145/3386367.3431297},
  researchr = {https://researchr.org/publication/SadehRK20},
  cites = {0},
  citedby = {0},
  pages = {309-322},
  booktitle = {CoNEXT '20: The 16th International Conference on emerging Networking EXperiments and Technologies, Barcelona, Spain, December, 2020},
  editor = {Dongsu Han and Anja Feldmann},
  publisher = {ACM},
  isbn = {978-1-4503-7948-9},
}