A distributed algorithm for throughput optimal routing in overlay networks
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...
Main Authors: | Rai, Anurag, Singh, Rahul, Modiano, Eytan H |
---|---|
Other Authors: | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems |
Format: | Article |
Language: | English |
Published: |
IEEE
2020
|
Online Access: | https://hdl.handle.net/1721.1/126219 |
Similar Items
-
Throughput optimal routing in overlay networks
by: Paschos, Georgios S., et al.
Published: (2015) -
An overlay architecture for throughput optimal multipath routing
by: Jones, Nathaniel M., et al.
Published: (2015) -
Scheduling Algorithms for Optimizing Age of Information in Wireless Networks With Throughput Constraints
by: Kadota, Igor, et al.
Published: (2020) -
Loop-Free Backpressure Routing Using Link-Reversal Algorithms
by: Rai, Anurag, et al.
Published: (2015) -
Throughput-optimal multi-hop broadcast algorithms
by: Paschos, Georgios, et al.
Published: (2017)