Charging and rate control for elastic traffic

By Frank P. Kelly. 1997

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): “In particular, the above function represents zero fairness with α = 0, proportional fairness (Kelly, 1997) with α = 1, harmonic mean fairness (Dashti et al.”
A Survey on Resource Allocation for 5G Heterogeneous Networks: Current Research, Future Trends, and Challenges (2020, background): “proposed in [65] based on changing rate control for elastic transmission of network services.”
A duality model of TCP and queue management algorithms (2003, background): “An optimal rate allocation problem is formulated in (Kelly 1997) where the goal is to choose source rates so as to maximize aggregate source utility subject to capacity constraints.”
Efficiency loss in a network resource allocation game: the case of elastic supply (2004, background): “in [16] (motivated by the proposal made in [14]).”
Balancing transport and physical Layers in wireless multihop networks: jointly optimal congestion control and power control (2005, unknown): “[16], [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.”
Network games (2004, background): “However, from the above broader perspective, we also consider the network design game of [2], the bandwidth allocation of [23, 20], and the cost-sharing of [12, 19, 24] also as mechanisms.”
Volatility of Power Grids Under Real-Time Pricing (2011, background): “Under the above assumptions, the following problem characterizes the ISO’s optimization problem: max X j∈D vj(dj)− X i∈S ci(si) s.t. X j∈D dj = X i∈S si (15) The following lemma which is adopted from [12], provides the justiﬁcation for deﬁning the LMPs as the Lagrangian multipl iers corresponding to”
Network Optimization and Control (2008, background): “Proportional fairness was introduced for communication networks in [3].”
Congestion-dependent pricing of network services (2000, background): “(Such a property is also present in [3] although the setting is different, as it relates to elastic traffic.”
Robust Dynamic Operating Envelopes for DER Integration in Unbalanced Distribution Networks (2022, methodology): “However, the logarithmic objective function actually implies proportionally fair DOEs allocations among all customers in the sense of fairness [35].”
The price of stability for network design with fair cost allocation (2004, background): “An approach of a similar style, though in a different setting related to routing, was pursued by Johari and Tsitsiklis [12]; there, they assumed a network protocol that priced traffic according to a scheme due to Kelly [13], and asked how this protocol would affect the strategic decisions of self-in”
Data Collection and Wireless Communication in Internet of Things (IoT) Using Economic Analysis and Pricing Models: A Survey (2016, background): “The authors in [89] indicated that there exists a unique optimal solution (r∗ = (r∗ 1, .”
The Unreasonable Fairness of Maximum Nash Welfare (2016, unknown): “The concept of envy freeness up to one good originates in the work of Lipton et al. [2004]. They deal with general combinatorial valuations, and give a polynomial-time algorithm that guarantees that the maximum envy is bounded by the maximum marginal value of any player for any good; this guarantee ”