Loop-Free Backpressure Routing Using Link-Reversal Algorithms
The backpressure routing policy is known to be a throughput optimal policy that supports any feasible traffic demand in data networks, but may have poor delay performance when packets traverse loops in the network. In this paper, we study loop-free backpressure routing policies that forward packets...
Main Authors: | Rai, Anurag, Li, Chih-ping, Paschos, Georgios, Modiano, Eytan H. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics |
Format: | Article |
Language: | en_US |
Published: |
Association for Computing Machinery (ACM)
2015
|
Online Access: | http://hdl.handle.net/1721.1/97572 https://orcid.org/0000-0001-8238-8130 https://orcid.org/0000-0002-7034-0110 |
Similar Items
-
TCP-aware backpressure routing and scheduling
by: Seferoglu, Hulya, et al.
Published: (2018) -
Separation of Routing and Scheduling in Backpressure-Based Wireless Networks
by: Seferoglu, Hulya, et al.
Published: (2018) -
Diff-Max: Separation of routing and scheduling in backpressure-based wireless networks
by: Seferoglu, Hulya, et al.
Published: (2013) -
Throughput optimal routing in overlay networks
by: Paschos, Georgios S., et al.
Published: (2015) -
A distributed algorithm for throughput optimal routing in overlay networks
by: Rai, Anurag, et al.
Published: (2020)