On the public citation graph

Multimodal Congestion Control for Low Stable-State Queuing

0 signed · 42 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11499169_22openalex-snapshot
Processor Sharing Flows in the Internet
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.1109/90.234856openalex-snapshot
A generalized processor sharing approach to flow control in integrated services networks: the single-node case
inferredcites →https://doi.org/10.1109/90.779192openalex-snapshot
End-to-end Internet packet dynamics
inferredcites →https://doi.org/10.1109/infcom.1996.497885openalex-snapshot
WF/sup 2/Q: worst-case fair weighted fair queueing
inferredcites →https://doi.org/10.1109/infcom.2005.1498463openalex-snapshot
TCP-Africa: an adaptive and fair rapid increase rule for scalable TCP
inferredcites →https://doi.org/10.1109/infcom.2007.125openalex-snapshot
Congestion Control for Small Buffer High Speed Networks
inferredcites →https://doi.org/10.1109/infcom.2007.302openalex-snapshot
Multimodal Congestion Control for Low Stable-State Queuing
inferredcites →https://doi.org/10.1109/infocom.2006.187openalex-snapshot
JetMax: Scalable Max-Min Congestion Control for High-Speed Heterogeneous Networks
inferredcites →https://doi.org/10.1109/iscc.2005.93openalex-snapshot
Link Buffer Sizing: A New Look at the Old Problem
inferredcites →https://doi.org/10.1109/tnet.2007.912037openalex-snapshot
One More Bit is Enough
inferredcites →https://doi.org/10.1145/1015467.1015499openalex-snapshot
Sizing router buffers
inferredcites →https://doi.org/10.1145/1040132.1040133openalex-snapshot
DOD standard internet protocol
inferredcites →https://doi.org/10.1145/1070873.1070884openalex-snapshot
Part I
inferredcites →https://doi.org/10.1145/1070873.1070885openalex-snapshot
Part II
inferredcites →https://doi.org/10.1145/1070873.1070886openalex-snapshot
Part III
inferredcites →https://doi.org/10.1145/190314.190317openalex-snapshot
TCP Vegas
inferredcites →https://doi.org/10.1145/190809.190317openalex-snapshot
TCP Vegas
inferredcites →https://doi.org/10.1145/205447.205461openalex-snapshot
A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer
inferredcites →https://doi.org/10.1145/205447.205462openalex-snapshot
Congestion avoidance and control
inferredcites →https://doi.org/10.1145/217382.217453openalex-snapshot
Efficient fair queueing using deficit round robin
inferredcites →https://doi.org/10.1145/217391.217453openalex-snapshot
Efficient fair queueing using deficit round robin
inferredcites →https://doi.org/10.1145/52324.52356openalex-snapshot
Congestion avoidance and control
inferredcites →https://doi.org/10.1145/571697.571725openalex-snapshot
Passive estimation of TCP round-trip times
inferredcites →https://doi.org/10.1145/633025.633035openalex-snapshot
Congestion control for high bandwidth-delay product networks
inferredcites →https://doi.org/10.1145/74681.74686openalex-snapshot
A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks
inferredcites →https://doi.org/10.1145/75246.75248openalex-snapshot
Analysis and simulation of a fair queueing algorithm
inferredcites →https://doi.org/10.1145/75247.75248openalex-snapshot
Analysis and simulation of a fair queueing algorithm
inferredcites →https://doi.org/10.17487/rfc2481openalex-snapshot
A Proposal to add Explicit Congestion Notification (ECN) to IP
inferredcites →https://doi.org/10.5210/fm.v8i9.1072openalex-snapshot
The many paradoxes of broadband

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-31559-1_13openalex-snapshot
The Weak Convergence of TCP Bandwidth Sharing
inferred← citeshttps://doi.org/10.1007/s40313-013-0048-8openalex-snapshot
Adaptive Dead Time Compensation on Congestion Control of TCP Networks: An Unified Solution
inferred← citeshttps://doi.org/10.1109/icnp.2007.4375867openalex-snapshot
Price of Asynchrony: Queuing under Ideally Smooth Congestion Control
inferred← citeshttps://doi.org/10.1109/iscc.2007.4381581openalex-snapshot
MCP: Few Bits for Fairing and Small Queues in the Stable State
inferred← citeshttps://doi.org/10.1109/iwqos.2012.6245974openalex-snapshot
AIST: Insights into queuing and loss on highly multiplexed links
inferred← citeshttps://doi.org/10.1177/0037549707081179openalex-snapshot
Simulation Perspectives on Link Buffer Sizing
inferred← citeshttps://doi.org/10.13140/rg.2.1.1369.5526openalex-snapshot
Approaches to Congestion Control in Packet Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1610.09123openalex-snapshot
The Weak Convergence of TCP Bandwidth Sharing
inferred← citeshttps://doi.org/10.7936/k71v5c69openalex-snapshot
A Theory of Load Adjustments and its Implications for Congestion Control
inferred← citeshttps://doi.org/10.7936/k7668b7gopenalex-snapshot
Networking Mechanisms for Delay-Sensitive Applications
inferred← citeshttps://doi.org/10.7936/k7cc0xxqopenalex-snapshot
Lower Bounds on Queuing and Loss at Highly Multiplexed Links
showing the first 11 of 12 · page through all 12
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.