Maxmin fair scheduling in wireless networks

By Leandros Tassiulas, S. Sarkar. Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2002

301 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/ca14c2094ec13d69b751ca4237a92e70f9f70589

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

Localized algorithm for aggregate fairness in wireless sensor networks (2006, background): “Other works [34, 35, 4, 3] assum e single-path routing, which simplifies the fairness problem.”
Joint rate control and scheduling in multihop wireless networks (2004, background): “Past works on rate control in wireless networks either consider only single-hop flows [7], [8], [9], or impose simplified assumptions on a restrictive set of scheduling policies [10], [11], [12], [13], [14].”
Distributed fair scheduling in a wireless LAN (2000, background): “There has been some work on achieving fairness in wireless networks (e.g., [3], [12], [16], [17], [27], [ 26 ]).”
Joint congestion control, routing, and MAC for stability and fairness in wireless networks (2006, background): “More recently, the problem of serving elastic traffic over wireless networks has been investigated in [ 23 ], [26], [16], [8], [10], [21], [17], [6].”
End-to-end performance and fairness in multihop wireless backhaul networks (2004, background): “While [14, 22, 31] aim at implementing max-min fairness, [24, 35] address proportional fairness.”
Hop-by-Hop Congestion Control Over a Wireless Multi-Hop Network (2004, background): “Further, as in [18], we assume that at any instant of time, data flows that do not share nodes can transmit/receive simultaneously, but data flows that share a node cannot do so.”
A Unified Framework for Max-Min and Min-Max Fairness With Applications (2007, background): “It is now widely used in various areas of networ king [27, 29, 28, 13, 10, 7, 19, 16, 8, 1].”
Modeling Per-Flow Throughput and Capturing Starvation in CSMA Multi-Hop Wireless Networks (2006, methodology): “Several forms of fairness have been proposed: weighted fairness [14], [23], max-min fairness [15], [29] and proportional fairness [18], [22]; these objectives have been implemented either using TDMA or random access.”