@inproceedings{81a7bb0854fd44b4be4631009d9bdc2c,
title = "With great speed come small buffers: Space-bandwidth tradeoffs for routing",
abstract = "We consider the Adversarial Queuing Theory (AQT) model, where packet arrivals are subject to a maximum average rate 0 1 and burstiness 0. In this model, we analyze the size of buffers required to avoid overflows in the basic case of a path. Our main results characterize the space required by the average rate and the number of distinct destinations: we show that O( d1/ + ) space suffice, where d is the number of distinct destinations and =1/ and we show that (1 over d1/ + ) space is necessary. For directed trees, we describe an algorithm whose buffer space requirement is at most 1 + d' + σ where d' is the maximum number of destinations on any root-leaf path.",
keywords = "Adversarial queuing theory, Buffer overflow, Directed paths, Directed trees, Multiple destinations, Packet forwarding, Packet networks",
author = "Avery Miller and Boaz Patt-Shamir and Will Rosenbaum",
note = "Publisher Copyright: {\textcopyright} 2019 ACM.; 38th ACM Symposium on Principles of Distributed Computing, PODC 2019 ; Conference date: 29-07-2019 Through 02-08-2019",
year = "2019",
month = jul,
day = "16",
doi = "10.1145/3293611.3331614",
language = "الإنجليزيّة",
series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
publisher = "Association for Computing Machinery",
pages = "117--126",
booktitle = "PODC 2019 - Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing",
address = "الولايات المتّحدة",
}