On the public citation graph
A simple, scalable and provably stable explicit rate computation scheme for flow control in communication networks
0 signed · 21 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.1002/(sici)1099-1131(199805/06)11:3<189::aid-dac360>3.0.co;2-vopenalex-snapshot
Characteristics of ABR explicit rate control algorithms in WAN environments and an ABR control algorithm suitable for public networks
inferredcites →https://doi.org/10.1016/0017-9310(79)90047-4openalex-snapshot
Theory and problems of heat transfer, (schaum's outline series)
inferredcites →https://doi.org/10.1109/35.544198openalex-snapshot
Allocating fair rates for available bit rate service in ATM networks
inferredcites →https://doi.org/10.1109/90.266057openalex-snapshot
Feedback control of congestion in packet switching networks: the case of a single congested node
inferredcites →https://doi.org/10.1109/glocom.1997.638440openalex-snapshot
ERAQLES an efficient explicit rate algorithm for ABR
inferredcites →https://doi.org/10.1109/icnp.1998.723722openalex-snapshot
A definition of general weighted fairness and its support in explicit rate switch algorithms
inferredcites →https://doi.org/10.1109/infcom.1997.635145openalex-snapshot
A control theoretic approach to the design of closed loop rate based flow control for high speed ATM networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/dac.678openalex-snapshot
Effects of control loop delay on the stability of a rate control algorithm
inferred← citeshttps://doi.org/10.1002/nem.452openalex-snapshot
Interworking of switched ethernet and ATM flow control mechanisms
inferred← citeshttps://doi.org/10.1007/11750673_15openalex-snapshot
Dynamic Resource Allocation in Quality of Service Networks
inferred← citeshttps://doi.org/10.1007/978-1-4471-4147-1_2openalex-snapshot
Congestion Control in Data Transmission Networks: Historical Perspective
inferred← citeshttps://doi.org/10.1016/j.comnet.2006.12.003openalex-snapshot
A new approach to dynamic bandwidth allocation in Quality of Service networks: Performance and bounds
inferred← citeshttps://doi.org/10.1016/j.comnet.2007.11.021openalex-snapshot
Jetmax: Scalable max–min congestion control for high-speed heterogeneous networks
inferred← citeshttps://doi.org/10.1016/s0166-5316(00)00035-3openalex-snapshot
Discrete-time analysis of a rate control mechanism
inferred← citeshttps://doi.org/10.1023/a:1016541127634openalex-snapshot
Stability and Fairness of a Rate Allocation Scheme
inferred← citeshttps://doi.org/10.1109/ccece.2002.1012987openalex-snapshot
Real-time video applications over ABR using FASTRAC-a rate control algorithm
inferred← citeshttps://doi.org/10.1109/iccrd.2011.5764036openalex-snapshot
An Advanced Exponential Max-Min Kelly Control
inferred← citeshttps://doi.org/10.1109/infocom.2006.187openalex-snapshot
JetMax: Scalable Max-Min Congestion Control for High-Speed Heterogeneous Networks
inferred← citeshttps://doi.org/10.1109/tnet.2004.833125openalex-snapshot
Design and Stability Analysis of a Rate Control Algorithm Using the Routh–Hurwitz Stability Criterion
inferred← citeshttps://doi.org/10.1109/tnet.2011.2149540openalex-snapshot
A New Estimation Scheme for the Effective Number of Users in Internet Congestion Control
inferred← citeshttps://doi.org/10.13021/mars/4770openalex-snapshot
Multipath and Explicit Rate Congestion Control on Data Networks
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.