Throughput optimal routing in overlay networks
Author(s)
Paschos, Georgios S.; Modiano, Eytan H.
DownloadModiano_Throughput optimal.pdf (1.331Mb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
Maximum throughput requires path diversity enabled by bifurcating traffic at different network nodes. In this work, we consider a network where traffic bifurcation is allowed only at a subset of nodes called routers, while the rest nodes (called forwarders) cannot bifurcate traffic and hence only forward packets on specified paths. This implements an overlay network of routers where each overlay link corresponds to a path in the physical network. We study dynamic routing implemented at the overlay. We develop a queue-based policy, which is shown to be maximally stable (throughput optimal) for a restricted class of network scenarios where overlay links do not correspond to overlapping physical paths. Simulation results show that our policy yields better delay over dynamic policies that allow bifurcation at all nodes, such as the backpressure policy. Additionally, we provide a heuristic extension of our proposed overlay routing scheme for the unrestricted class of networks.
Date issued
2014-09Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics; Massachusetts Institute of Technology. Laboratory for Information and Decision SystemsJournal
Proceedings of the 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Paschos, Georgios S., and Eytan Modiano. “Throughput Optimal Routing in Overlay Networks.” 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton) (September 2014).
Version: Original manuscript
ISBN
978-1-4799-8009-3