Optimal control of wireless networks with finite buffers

Authors:
Long Bao Le;Eytan Modiano;Ness B. Shroff
Affiliations:
INRS-EMT, University of Quebec, Montreal, QC, Canada;Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA;Department of Electrical and Computer Engineering and Department of Computer Science and Engineering, The Ohio State University, Columbus, OH
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2012

Citing 22
Cited 0

Dynamic power allocation and routing for satellite and wireless networks with time varying channels

Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm

Queueing Systems: Theory and Applications
Maximizing throughput in wireless networks via gossiping

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Resource allocation and cross-layer control in wireless networks

Foundations and Trends® in Networking
The impact of imperfect scheduling on cross-layer congestion control in wireless networks

IEEE/ACM Transactions on Networking (TON)
Distributed link scheduling with constant overhead

Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Throughput Region of Finite-Buffered Networks

IEEE Transactions on Parallel and Distributed Systems
Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control

IEEE/ACM Transactions on Networking (TON)
Fairness and optimal stochastic control for heterogeneous networks

IEEE/ACM Transactions on Networking (TON)
Large Deviations of Queues Sharing a Randomly Time-Varying Server

Queueing Systems: Theory and Applications
Asynchronous congestion control in multi-hop wireless networks with maximal matching-based scheduling

IEEE/ACM Transactions on Networking (TON)
Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks

IEEE/ACM Transactions on Networking (TON)
Distributed throughput maximization in wireless networks via random power allocation

WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Delay-based network utility maximization

INFOCOM'10 Proceedings of the 29th conference on Information communications
Autonomous routing algorithms for networks with wide-spread failures

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Longest-queue-first scheduling under SINR interference model

Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Stability and benefits of suboptimal utility maximization

IEEE/ACM Transactions on Networking (TON)
Throughput-optimal scheduling in multichannel access point networks under infrequent channel measurements

IEEE Transactions on Wireless Communications
Energy optimal control for time-varying wireless networks

IEEE Transactions on Information Theory
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks

IEEE Transactions on Information Theory
Dynamic server allocation to parallel queues with randomly varying connectivity

IEEE Transactions on Information Theory
Dynamic power allocation and routing for time-varying wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers network control for wireless networks with finite buffers. We investigate the performance of joint flow control, routing, and scheduling algorithms that 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 under the one-hop interference model, if internal buffers have size, (N - 1)/2ε then ε-optimal network utility can be achieved, where ε is a control parameter N and 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 at the cost of a larger average backlog bound. We also show how to extend the results to other interference models and to wireless networks with time-varying link quality. Numerical results reveal that the considered algorithms achieve nearly optimal network utility with a significant reduction in queue backlog compared to existing algorithms in the literature.