Backpressure with Adaptive Redundancy (BWAR)
Majed Alresaini, Maheswaran Sathiamoorthy, Bhaskar Krishnamachari and, Michael J. Neely

TL;DR
BWAR is a novel hybrid backpressure routing algorithm with adaptive redundancy that improves delay performance in low traffic conditions and maintains high throughput, outperforming existing schemes in mobile networks.
Contribution
This paper introduces BWAR, a new hybrid backpressure routing method with adaptive redundancy that is robust, distributed, and does not require prior load knowledge.
Findings
BWAR does not reduce maximum throughput compared to traditional backpressure.
BWAR achieves better delay bounds than traditional backpressure.
BWAR outperforms Spray and Wait in high load scenarios.
Abstract
Backpressure scheduling and routing, in which packets are preferentially transmitted over links with high queue differentials, offers the promise of throughput-optimal operation for a wide range of communication networks. However, when the traffic load is low, due to the corresponding low queue occupancy, backpressure scheduling/routing experiences long delays. This is particularly of concern in intermittent encounter-based mobile networks which are already delay-limited due to the sparse and highly dynamic network connectivity. While state of the art mechanisms for such networks have proposed the use of redundant transmissions to improve delay, they do not work well when the traffic load is high. We propose in this paper a novel hybrid approach that we refer to as backpressure with adaptive redundancy (BWAR), which provides the best of both worlds. This approach is highly robust and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
