Improving Oblivious Reconfigurable Networks with High Probability

by   Tegan Wilson, et al.

Oblivious Reconfigurable Networks (ORNs) use rapidly reconfiguring switches to create a dynamic time-varying topology. Prior theoretical work on ORNs has focused on the tradeoff between maximum latency and guaranteed throughput. This work shows that by relaxing the notion of guaranteed throughput to an achievable rate with high probability, one can achieve a significant improvement in the latency/throughput tradeoff. For a fixed maximum latency, we show that almost twice the maximum possible guaranteed throughput rate can be achieved with high probability. Alternatively for a fixed throughput value, relaxing to achievement with high probability decreases the maximum latency to almost the square root of the latency required to guarantee the throughput rate. We first give a lower bound on the best maximum latency possible given an achieved throughput rate with high probability. This is done using an LP duality style argument. We then give a family of ORN designs which achieves these tradeoffs. The connection schedule is based on the Vandermonde Basis Scheme of Amir, Wilson, Shrivastav, Weatherspoon, Kleinberg, and Agarwal, although the period and routing scheme differ significantly. We prove achievable throughput with high probability by interpreting the amount of flow on each edge as a sum of negatively associated variables, and applying a Chernoff bound. This gives us a design with maximum latency that is tight with our lower bound (up to a log factor) for almost all constant throughput values.


page 1

page 2

page 3

page 4


Optimal Oblivious Reconfigurable Networks

Oblivious routing has a long history in both the theory and practice of ...

Asymptotic Achievable Rate of Two-Dimensional Constraint Codes based on Column by Column Encoding

In this paper, we propose a column by column encoding scheme suitable fo...

On Throughput Bounds of NOMA-ALOHA

In this paper, we focus on the throughput of random access with power-do...

Improved Bi-criteria Approximation for the All-or-Nothing Multicommodity Flow Problem in Arbitrary Networks

This paper addresses the following fundamental maximum throughput routin...

High Probability Bounds for a Class of Nonconvex Algorithms with AdaGrad Stepsize

In this paper, we propose a new, simplified high probability analysis of...

Finding the Sweet Spot for Frame Aggregation in 802.11 WLANs

This letter proposes an algorithm for the dynamic tuning of the maximum ...

Please sign up or login with your details

Forgot password? Click here to reset