An overlay architecture for throughput optimal multipath routing
Author(s)
Jones, Nathaniel M.; Paschos, Georgios S.; Shrader, Brooke E.; Modiano, Eytan H.
DownloadMobiHoc2014(jones).pdf (242.6Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
Legacy networks are often designed to operate with simple single-path routing, like shortest-path, which is known to be throughput suboptimal. On the other hand, previously proposed throughput optimal policies (i.e., backpressure) require every device in the network to make dynamic routing decisions. In this work, we study an overlay architecture for dynamic routing such that only a subset of devices (overlay nodes) need to make dynamic routing decisions. We determine the essential collection of nodes that must bifurcate traffic for achieving the maximum multicommodity network throughput. We apply our optimal node placement algorithm to several graphs and the results show that a small fraction of overlay nodes is sufficient for achieving maximum throughput. Finally, we propose a heuristic policy (OBP), which dynamically controls traffic bifurcations at overlay nodes. In all studied simulation scenarios, OBP not only achieves full throughput, but also reduces delay in comparison to the throughput optimal backpressure routing.
Date issued
2014-08Department
Lincoln Laboratory; Massachusetts Institute of Technology. Department of Aeronautics and AstronauticsJournal
Proceedings of the 15th ACM international symposium on Mobile ad hoc networking and computing (MobiHoc '14)
Publisher
Association for Computing Machinery (ACM)
Citation
Nathaniel M. Jones, Georgios S. Paschos, Brooke Shrader, and Eytan Modiano. 2014. An overlay architecture for throughput optimal multipath routing. In Proceedings of the 15th ACM international symposium on Mobile ad hoc networking and computing (MobiHoc '14). ACM, New York, NY, USA, 73-82.
Version: Author's final manuscript
ISBN
9781450326209