With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing

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.

[1]  Lata Narayanan,et al.  Optimal Local Buffer Management for Information Gathering with Adversarial Traffic , 2017, SPAA.

[2]  Moti Medina,et al.  A Constant Approximation Algorithm for Scheduling Packets on Line Networks , 2016, ESA.

[3]  Micah Adler,et al.  Tight bounds for the performance of Longest In System on DAGs , 2005, J. Algorithms.

[4]  Allan Borodin,et al.  Adversarial queuing theory , 2001, JACM.

[5]  Boaz Patt-Shamir,et al.  The Space Requirement of Local Forwarding on Acyclic Networks , 2017, PODC.

[6]  Ashish Goel,et al.  Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model , 2004, SIAM J. Comput..

[7]  Joseph Naor,et al.  The Design of Competitive Online Algorithms via a Primal-Dual Approach , 2009, Found. Trends Theor. Comput. Sci..

[8]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[9]  Lisa Zhang,et al.  General dynamic routing with per-packet delay guarantees of O(distance+1/session rate) , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[10]  Boaz Patt-Shamir,et al.  Buffer Size for Routing Limited-Rate Adversarial Traffic , 2016, DISC.

[11]  Rafail Ostrovsky,et al.  Dynamic routing on networks with fixed-size buffers , 2003, SODA '03.

[12]  Boaz Patt-Shamir,et al.  Buffer overflows of merging streams , 2003, SPAA '03.

[13]  Boaz Patt-Shamir,et al.  Buffer overflow management in QoS switches , 2001, STOC '01.

[14]  Michael H. Goldwasser.  A survey of buffer management policies for packet switches , 2010, SIGA.

[15]  Nick McKeown,et al.  The Tiny Tera: A Packet Switch Core , 1998, IEEE Micro.

[16]  Adi Rosén,et al.  Rate vs. buffer size: greedy information gathering on the line , 2007, SPAA '07.

[17]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[18]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.