The Mathematics of Internet Congestion Control
By Rayadurgam Srikant. 2003
482 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/b993628e1a8308f864b6614aeb09c78437918aef
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
- Angelia Nedić
- Alexander Olshevsky
- Asuman E. Ozdaglar
- Rayadurgam Srikant
- Michael G. Rabbat
- Wei Shi
- John N. Tsitsiklis
- Ali H. Sayed
Citations in the corpus
- Exact controllability of complex networks (2013, background): “…this problem because of the extremely complicated interplay between network topology and nonlinear dynamical processes, despite the development of nonlinear control [17–22] in certain particular situations such as consensus [23], communication [24, 25], traffic [26] and device networks [17, 27].”
- Distributed Subgradient Methods for Multi-Agent Optimization (2009, unknown): “Our work is also related to the utility maximization framework for resource allocation in networks (see Kelly et al. [11], Low and Lapsley [12], Srikant [ 13 ], and Chiang et al. [14]).”
- TCP ex machina: computer-generated congestion control (2013, background): “As α → ∞, maximizing the total Uα (x) achieves max-min fairness, where all that matters is the minimum resource allocations in bottom-up order [37].”
- Distributed subgradient methods and quantization effects (2008, methodology): “y(k) is similar to the stopped process analyzed in [ 15 ], defined using xj(k) in place of x Q j (k).”
- Joint congestion control, routing, and MAC for stability and fairness in wireless networks (2006, methodology): “Primal-dual algorithms are well known in the optimization literature and have been studied extensively in different contexts [1], [17], [24], [30].”
- An experimental study of the learnability of congestion control (2014, background): “Many such metrics have been proposed, including alpha-fair throughput [26], flow completion time [8], throughput-over-delay [22], or measures based on a subjective opinion score [13].”
- Malliavin Calculus for Fractional Delay Equations (2009, background): “In spite of this lack of theoretical results, the need for suitable oscillating dynamical models with delays is obvious in the applied literature, and involves problems in signal or disease transmission [6, 32, 35], biochemical reactions [2] or gene regulation [5, 25].”
- Dependable Demand Response Management in the Smart Grid: A Stackelberg Game Approach (2013, methodology): “The ln function has been widely used in economics for modeling the preference ordering of users and for decision making [12], [13].”
- On the Complexity of Scheduling in Wireless Networks (2006, methodology): “In this section, we focus on wireless networks in which all transmissions are carried out at certain fixed rate (i.e., rate control is not exercised), and show that the maximal scheduling policy considered in [5, 26 , 19]2 achieves a constant fraction of the capacity region for such networks.”