Optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic

Authors:
Juan José Jaramillo;R. Srikant
Affiliations:
Coordinated Science Laboratory and Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign;Coordinated Science Laboratory and Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 7
Cited 4

Scheduling real-time traffic with deadlines over a wireless channel

Wireless Networks
Convex Optimization

Convex Optimization
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm

Queueing Systems: Theory and Applications
Downlink Wireless Packet Scheduling with Deadlines

IEEE Transactions on Mobile Computing
Admission control and scheduling for QoS guarantees for variable-bit-rate applications on wireless channels

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
A tutorial on cross-layer optimization in wireless networks

IEEE Journal on Selected Areas in Communications
Joint congestion control, routing, and MAC for stability and fairness in wireless networks

IEEE Journal on Selected Areas in Communications

Optimal scheduling for fair resource allocation in ad hoc networks with elastic and inelastic traffic

IEEE/ACM Transactions on Networking (TON)
Scheduling for end-to-end deadline-constrained traffic with reliability requirements in multihop networks

IEEE/ACM Transactions on Networking (TON)
Scheduling of access points for multiple live video streams

Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Control of wireless networks with secrecy

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the problem of congestion control and scheduling in ad hoc wireless networks that have to support a mixture of best-effort and real-time traffic. Optimization and stochastic network theory have been successful in designing architectures for fair resource allocation to meet long-term throughput demands. However, to the best of our knowledge, strict packet delay deadlines were not considered in this framework previously. In this paper, we propose a model for incorporating the quality of service (QoS) requirements of packets with deadlines in the optimization framework. The solution to the problem results in a joint congestion control and scheduling algorithm which fairly allocates resources to meet the fairness objectives of both elastic and inelastic flows, and per-packet delay requirements of inelastic flows.