Round-Robin Scheduling for Max-Min Fairness in Data Networks

By E. L. Hahne. 1991

How researchers see this paper

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

Fair Resource Allocation in Federated Learning (2019, background): “Fair resource allocation has been extensively studied in fields such as network management (Ee & Bajcsy, 2004; Hahne, 1991; Kelly et al., 1998; Neely et al., 2008) and wireless communications (Eryilmaz & Srikant, 2006; Nandagopal et al.”
Delay Analysis of Random Scheduling and Round Robin in Small Cell Networks (2018, background): “Among the large number of proposed scheduling schemes [2], random scheduling (RS) and round robin (RR) are the most popular practical choices due to their lowimplementation cost [3].”
Maxmin fair scheduling in wireless networks (2002, methodology): “Maxmin fair objective has been extensively studied in the wireline context[2], [7].”
A Unified Framework for Max-Min and Min-Max Fairness With Applications (2007, methodology): “Distributed algorithms for the comput ation of max-min fair allocations [8, 1] are left outside the scope of this paper.”
Fair end-to-end window-based congestion control (1998, background): “One of the most common fariness de nitions is max-min or bottleneck optimality criterion [12, 1, 8, 14, 3].”
Fairness in Wireless Networks:Issues, Measures and Challenges (2014, unknown): “Replacing the weight set W by a weight function u(X) generalizes the definition [23].”