Fair end-to-end window-based congestion control

By Jeonghoon Mo, Jean C. Walrand. 1998

How researchers see this paper

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

Citations in the corpus

Fair Resource Allocation in Federated Learning (2019, background): “We provide additional details on the framework below; for further background on α -fairness and fairness in resource allocation more generally, we defer the reader to [37, 25]. α -fairness [22, 25] is a popular fairness metric widely-used in resource allocation problems.”
On the Efficiency-Fairness Trade-off (2012, unknown): “Although the ï¿¿-fairness scheme has been studied both from a theoretical and a practical perspective, most prominently in networks (Mo and Walrand 2000, Bonald and Massoulié 2001) and healthcare (Wagstaff 1991), the underlying efficiency-fairness trade-off is still not well understood.”
A Survey of Multi-Objective Optimization in Wireless Sensor Networks: Metrics, Algorithms, and Open Problems (2016, background): “2The max-min criterion constitutes one of the most commonly used fairness metrics [108], in which a feasible flow rate vector x = (xi,∀i) can be interpreted as being max-min fair if the rate xi cannot be increased without decreasing some xj that is smaller than or equal to xi, ∀i = j.”
Understanding TCP vegas: a duality model (2001, unknown): “In [24] a network is modeled by a set of inequalities which, in our context, are the feasibility condition (5), the KarushKuhn-Tucker condition for the constrained optimization (4– 5), and the relation between window and backlog.”
Balancing transport and physical Layers in wireless multihop networks: jointly optimal congestion control and power control (2005, background): “…[17] that analyze network rate allocation as a distributed solution of utility maximization, TCP congestion control mechanisms have recently been analyzed as approximated distributed algorithms solving appropriately formulated network utility maximization problems (e.g., [18], [21]–[23], and [25]).”
A Unified Framework for Max-Min and Min-Max Fairness With Applications (2007, methodology): “However, it is shown in [12] that for wired networks with single-path rou ting, and for a class of utility functions defined as fm(x) = {”
Energy Efficiency in Wireless Networks via Fractional Programming Theory (2015, methodology): “More formally, we define fairness according to the Max-Min fairness concept1 [123], considering unfair those resource allocations which result in some links experiencing very low energy efficiency with respect to some other links.”
Localized algorithm for aggregate fairness in wireless sensor networks (2006, background): “the second problem [8, 9, 10, 11], under the assumptions of fixed link capacities, single-path routing, and/or timely, reliable, end-toend feedback, which make the solutions not immediately applicable in sensor networks.”
Multi-Path TCP: A Joint Congestion Control and Routing Scheme to Exploit Path Diversity in the Internet (2006, background): “Finally, we note that, as in [2], the stability result (2) can be generalized to the case ofα-fair utility functions considered in [20] and to the class of hyper-exponential file-size distrib utions.”
Fairness in Wireless Networks:Issues, Measures and Challenges (2014, background): “For example, in [68] the utility function for proportional fairness as defined in [42] is adopted.”
Networking Low-Power Energy Harvesting Devices: Measurements and Algorithms (2011, unknown): “We note that the utility maximization framework achieves proportional fairness for Uð Þ 1⁄4 logð Þ and max-min fairness for Uð Þ 1⁄4 ð Þ(1) =ð1 Þ with !1 [36].”
Deep-Reinforcement Learning Multiple Access for Heterogeneous Wireless Networks (2017, methodology): “that of α-fairness [17] with a reformulation of the DRL algorithm.”
Downlink scheduling and resource allocation for OFDM systems (2009, background): “A larger class of throughput-based utilities is considered in [2], [5], where efficiency and fairness are”
Alternative Distributed Algorithms for Network Utility Maximization: Framework and Applications (2007, background): “Kelly et al. in 1998, the framework of NUM has found many applications in network resource allocation algorithms and Internet congestion control protocols, e.g., [2]‐[ 7 ].”