Optimal control of wireless networks with finite buffers
Name
Modiano-2010-Optimal Control of Wireless Networks with Finite.pdf
Size
224.29 KB
Format
Adobe PDF
Checksum (MD5)
b8f204b2bb20725b1c0d4d371a9345cb
Author(s)
Le, Long Bao
Modiano, Eytan H.
Shroff, Ness B.
Date Issued
March 2010
Journal
2010 Proceedings IEEE INFOCOM
Publisher
Institute of Electrical and Electronics Engineers
Citation
Le, Long Bao, Eytan Modiano, and Ness B. Shroff. “Optimal Control of Wireless Networks with Finite Buffers.” 2010 Proceedings IEEE INFOCOM. San Diego, CA, USA, 2010. 1-9. © Copyright 2011 IEEE
Version
Final published version
Abstract
This paper considers network control for wireless networks with finite buffers. We investigate the performance of joint flow control, routing, and scheduling algorithms which achieve high network utility and deterministically bounded backlogs inside the network. Our algorithms guarantee that buffers inside the network never overflow. We study the tradeoff between buffer size and network utility and show that if internal buffers have size (N - 1)/à ¿ then a high fraction of the maximum utility can be achieved, where à ¿ captures the loss in utility and N is the number of network nodes. The underlying scheduling/routing component of the considered control algorithms requires ingress queue length information (IQI) at all network nodes. However, we show that these algorithms can achieve the same utility performance with delayed ingress queue length information. Numerical results reveal that the considered algorithms achieve nearly optimal network utility with a significant reduction in queue backlog compared to the existing algorithm in the literature. Finally, we discuss extension of the algorithms to wireless networks with time-varying links.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/INFCOM.2010.5462026
