Optimal Control of Wireless Networks with Finite Buffers

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 back...

• Type: Journal
• Year: 2010
• Where: INFOCOM
• Authors: Long Bao Le, Eytan Modiano, Ness B. Shroff
• Keywords: Algorithms, Communications, INFOCOM 2010, Ingress Queue Length, Network Utility