Fair Resource Allocation in Wireless Networks Using Queue-Length-Based Scheduling and Congestion Control

By Atilla Eryilmaz, Rayadurgam Srikant. IEEE/ACM Transactions on Networking, 2005

590 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/3fb91268745c698c0b6277288a02be4b854e2f74

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

1. Michael J. Neely
2. Mung Chiang
3. Rayadurgam Srikant
4. John C. Doyle
5. Steven H. Low
6. Atilla Eryilmaz
7. Sanjay Shakkottai
8. Ness B. Shroff

In Electrical and Electronic Engineering

1. Michael J. Neely
2. Mung Chiang
3. Rayadurgam Srikant
4. John C. Doyle
5. Atilla Eryilmaz
6. Steven H. Low
7. Sanjay Shakkottai
8. Alexander L. Stolyar

Citations in the corpus

• Resource Allocation and Cross-Layer Control in Wireless Networks (2006, background): “LIMITATION OF ABSTRACT UL NSN 7540-01-280-5500 Standard Form 298 (Rev.2-89) Prescribed by ANSI Std. 239-18 298-102 Vol. , No (2006) 1 143 c 2006 now Publishers Inc. Resource Allocation and Cross Layer Control in Wireless Networks Leonidas Georgiadis1, Michael Neely2 and Leandros Tassiulas3”
• Fairness and Optimal Stochastic Control for Heterogeneous Networks (2005, methodology): “We note that alternative optimization approaches have recently been considered in [29], [35] using fluid limit models, and in [36] using stochastic gradient theory (see, for example, [37]).”
• Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks (2006, background): “, H(x) = Rx); fair scheduling in cellular network in the downlink [6] where the servers correspond to the wireless links from the base station to the users and the routing corresponds to an identity function; and TCP [20] with time-varying capacity as in lasthop wireless networks where each (wired o”
• Joint congestion control, routing, and MAC for stability and fairness in wireless networks (2006, methodology): “In [9], [15], [20], and [25], the authors propose and study rate control algorithms that adapt the flow rates instantaneously as a function of the entry queue-lengths.”
• Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures (2007, methodology): “3) Channel level stochastic: Models in [17], [35], [81], [99], [128] consider random channel fluctuations.”
• Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm (2005, methodology): “Thus the main di erence of the algorithm in [6] from the corresponding special case of GPD algorithm is the \static" traÆc generation rule, di erent from the \greedy" rule employed by GPD algorithm (see generating switch rule (101) above).”
• Network Optimization and Control (2008, background): “Such fluctuations can be incorporated into the stochastic models in [11–14].”
• A tutorial on cross-layer optimization in wireless networks (2006, background): “Channel variations: Both formulations can be generalized to the case with channel variations (e.g., due to fading and/or mobility of the nodes), in which case only the scheduling component needs to be changed [30] , [33], [40].”