A distributed algorithm for throughput optimal routing in overlay networks
Name
CV_C_222.pdf
Description
Accepted version
Size
771.12 KB
Format
Adobe PDF
Checksum (MD5)
a24ef225883d4330838d68f8cd35fd2c
Author(s)
Rai, Anurag
Singh, Rahul
Modiano, Eytan H
Date Issued
May 2019
Journal
2019 IFIP Networking Conference (IFIP Networking)
Publisher
IEEE
Citation
Rai, Anurag, Rahul Singh and Eytan Modiano. “A distributed algorithm for throughput optimal routing in overlay networks.” 2019 IFIP Networking Conference (IFIP Networking), Warsaw, Poland, 20-22 May 2019, IEEE © 2019 The Author(s)
Version
Author's final manuscript
Abstract
We address the problem of optimal routing in overlay networks. An overlay network is constructed by adding new overlay nodes on top of a legacy network. The overlay nodes are capable of implementing any dynamic routing policy, however, the legacy underlay has a fixed, single path routing scheme and uses a simple work-conserving forwarding policy. Moreover, the underlay routes are pre-determined and unknown to the overlay network. The overlay network can increase the achievable throughput of the legacy network by using multiple routes, which consist of direct routes and indirect routes through other overlay nodes. We develop an optimal dynamic routing algorithm for such overlay networks called the Optimal Overlay Routing Policy (OORP). OORP is derived using the classical dual subgradient descent method, and it can be implemented in a distributed manner. We show that the queue-lengths can be used as a substitute for the dual variables in the algorithm. However, the underlay queue-lengths are unknown to the overlay, so we propose two regression based schemes that learn simplified models of the backlog in the underlay using historical data and use them to estimate the queue-lengths in real time. Simulation results show that near-optimal performance can be achieved without any knowledge of the underlay.
MIT Department
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.23919/IFIPNetworking.2019.8816834
