Optimal Control for Generalized Network-Flow Problems
Name
1611.08641.pdf
Size
1003.04 KB
Format
Adobe PDF
Checksum (MD5)
7b3ce16b53433402f468a5e31b93a7fe
Author(s)
Sinha, Abhishek
Modiano, Eytan H
Date Issued
December 2017
Journal
IEEE/ACM Transactions on Networking
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Sinha, Abhishek, and Eytan Modiano. “Optimal Control for Generalized Network-Flow Problems.” IEEE/ACM Transactions on Networking 26, no. 1 (February 2018): 506–519.
Version
Original manuscript
Abstract
We consider the problem of throughput-optimal packet dissemination, in the presence of an arbitrary mix of unicast, broadcast, multicast, and anycast traffic, in an arbitrary wireless network. We propose an online dynamic policy, called Universal Max-Weight (UMW), which solves the problem efficiently. To the best of our knowledge, UMW is the first known throughput-optimal policy of such versatility in the context of generalized network flow problems. Conceptually, the UMW policy is derived by relaxing the precedence constraints associated with multi-hop routing and then solving a min-cost routing and max-weight scheduling problem on a virtual network of queues. When specialized to the unicast setting, the UMW policy yields a throughput-optimal cycle-free routing and link scheduling policy. This is in contrast with the well-known throughput-optimal back-pressure (BP) policy which allows for packet cycling, resulting in excessive latency. Extensive simulation results show that the proposed UMW policy incurs a substantially smaller delay as compared with the BP policy. The proof of throughput-optimality of the UMW policy combines ideas from the stochastic Lyapunov theory with a sample path argument from adversarial queueing theory and may be of independent theoretical interest.
MIT Department
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.1109/TNET.2017.2783846
