Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks

DOI10.1109/TIT.2007.913537zbMath1304.94004MaRDI QIDQ3604508

Koushik Kar, Xiang Luo, Saswati Sarkar, Prasanna Chaporkar

Publication date: 24 February 2009

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

wireless networksfairness guaranteesmaximal schedulingthroughput guarantees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication theory (94A05)

Related Items (7)

An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models ⋮ Stability and delay of distributed scheduling algorithms for networks of conflicting queues ⋮ Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model ⋮ Performance analysis for \((X,S)\)-bottleneck cell in large-scale wireless networks ⋮ Distributed throughput-optimal scheduling framework with delay analysis in multi-hop wireless networks ⋮ Throughput optimal scheduling policies in networks of constrained queues ⋮ Distributed link scheduling in wireless networks

This page was built for publication: Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks