On the public citation graph
Nonlinear AIMD Congestion Control and Contraction Mappings
0 signed · 27 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0024-3795(85)90125-9openalex-snapshot
Upper bounds on the maximum modulus of subdominant eigenvalues of nonnegative matrices
inferredcites →https://doi.org/10.1016/0169-7552(89)90019-6openalex-snapshot
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
inferredcites →https://doi.org/10.1016/j.automatica.2004.09.017openalex-snapshot
Analysis and design of AIMD congestion control algorithms in communication networks
inferredcites →https://doi.org/10.1016/j.automatica.2006.07.026openalex-snapshot
Modelling TCP congestion control dynamics in drop-tail environments
inferredcites →https://doi.org/10.1016/j.comnet.2005.07.017openalex-snapshot
Loss strategies for competing AIMD flows
inferredcites →https://doi.org/10.1016/j.laa.2004.07.016openalex-snapshot
Positive matrices associated with synchronised communication networks
inferredcites →https://doi.org/10.1017/s0001867800000884openalex-snapshot
A Markovian growth-collapse model
inferredcites →https://doi.org/10.1017/s0001867800013574openalex-snapshot
Ergodicity properties of stress release, repairable system and workload models
inferredcites →https://doi.org/10.1017/s0269964804181084openalex-snapshot
STOCHASTIC DIFFERENTIAL EQUATION FOR TCP WINDOW SIZE: ANALYSIS AND EXPERIMENTAL VALIDATION
inferredcites →https://doi.org/10.1049/ip-cta:20050171openalex-snapshot
Tools for the analysis and design of communication networks with Markovian dynamics
inferredcites →https://doi.org/10.1057/palgrave.jors.2600523openalex-snapshot
Rate control for communication networks: shadow prices, proportional fairness and stability
inferredcites →https://doi.org/10.1109/tnet.2004.833149openalex-snapshot
A Method for Estimating the Proportion of Nonresponsive Traffic at a Router
inferredcites →https://doi.org/10.1109/tnet.2005.845545openalex-snapshot
CYRF: a theory of window-based unicast congestion control
inferredcites →https://doi.org/10.1109/tnet.2006.876178openalex-snapshot
A positive systems model of TCP-like congestion control: asymptotic results
inferredcites →https://doi.org/10.1137/040620953openalex-snapshot
Stochastic Equilibria of AIMD Communication Networks
inferredcites →https://doi.org/10.1137/0605058openalex-snapshot
Explicit Solutions to Optimization Problems on the Intersections of the Unit Ball of the $l_1 $ and $l_\infty $ Norms with a Hyperplane
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11117-018-0624-zopenalex-snapshot
A Perron–Frobenius type result for integer maps and applications
inferred← citeshttps://doi.org/10.1016/j.automatica.2008.12.017openalex-snapshot
A result on second order nonlinear operators arising in high-speed networking applications
inferred← citeshttps://doi.org/10.1016/j.automatica.2012.03.014openalex-snapshot
Deterministic and stochastic convergence properties of AIMD algorithms with nonlinear back-off functions
inferred← citeshttps://doi.org/10.1080/00207179.2011.568005openalex-snapshot
A Google-like model of road network dynamics and its application to regulation and control
inferred← citeshttps://doi.org/10.1080/00207179.2012.664787openalex-snapshot
An ergodic AIMD algorithm with application to high-speed networks
inferred← citeshttps://doi.org/10.1109/cdc.2015.7402444openalex-snapshot
On the modified AIMD algorithm for distributed resource management with saturation of each user's share
inferred← citeshttps://doi.org/10.1109/codit62066.2024.10708312openalex-snapshot
Nonlinear AIMD with Time-Varying Resource and Saturation Constraints
inferred← citeshttps://doi.org/10.1109/ecc.2015.7330559openalex-snapshot
Asynchronous algorithms for network utility maximisation with a single bit
inferred← citeshttps://doi.org/10.1109/ecc.2015.7330869openalex-snapshot
A general nonlinear increase-decrease resource allocation algorithm with applications
inferred← citeshttps://doi.org/10.1109/tac.2017.2651160openalex-snapshot
On the AIMD Algorithm Under Saturation Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1404.5064openalex-snapshot
Nonhomogeneous Place-Dependent Markov Chains, Unsynchronised AIMD, and Network Utility Maximization
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.