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
IEEE/ACM Transactions on Networking (TON)
Fairness and optimal stochastic control for heterogeneous networks
IEEE/ACM Transactions on Networking (TON)
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
Autonomous routing algorithms for networks with wide-spread failures
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
IEEE Transactions on Wireless Communications
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
IEEE Transactions on Information Theory
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
Longest-queue-first scheduling under SINR interference model
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Delay-based network utility maximization
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Delay-guaranteed cross-layer scheduling in multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |
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.