Analyzing the performance of greedy maximal scheduling via local pooling and graph theory

Authors:
Berk Birand;Maria Chudnovsky;Bernard Ries;Paul Seymour;Gil Zussman;Yori Zwols
Affiliations:
Columbia University, New York City, NY, USA;Columbia University, New York City, NY, USA;University of Warwick, Coventry, United Kingdom;Princeton University, Princeton, NJ, USA;Columbia University, New York, NY, USA;Columbia University, New York, NY, USA
Venue:
Proceedings of the 2010 ACM workshop on Wireless of the students, by the students, for the students
Year:
2010

Citing 5
Cited 0

Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach

Proceedings of the 12th annual international conference on Mobile computing and networking
The impact of imperfect scheduling on cross-layer congestion control in wireless networks

IEEE/ACM Transactions on Networking (TON)
A refined performance characterization of longest-queue-first policy in wireless networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Understanding the capacity region of the Greedy maximal scheduling algorithm in multihop wireless networks

IEEE/ACM Transactions on Networking (TON)
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory

INFOCOM'10 Proceedings of the 29th conference on Information communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient operation of wireless networks and switches requires using simple scheduling algorithms. In general, simple greedy algorithms (known as Greedy Maximal Scheduling - GMS) are guaranteed to achieve only a fraction of the maximum possible throughput. It was recently shown that in networks in which the Local Pooling conditions are satisfied, GMS achieves 100% throughput. Moreover, in networks in which the σ-Local Pooling conditions hold, GMS achieves σ% throughput. In this extended abstract, we characterize all the network graphs in which Local Pooling holds under primary interference constraints. We then show that in all bipartite graphs (i.e., input-queued switches) of size up to 7×n, GMS is guaranteed to achieve 66% throughput, thereby improving upon the previously known 50% lower bound. Finally, we study the performance of GMS in interference graphs and show that in certain specific topologies its performance could be very bad. Overall, we demonstrate that using graph theoretical techniques can significantly contribute to our understanding of greedy scheduling algorithms. The proofs of the results have been omitted for brevity and can be found in [1].