On the public citation graph

The Burstiness Behavior of Regulated Flows in Networks

https://doi.org/10.1007/11422778_74
0 signed · 31 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.1002/ett.4460120413openalex-snapshot
Performance guarantees in communication networks
inferredcites →https://doi.org/10.1002/j.1538-7305.1982.tb03089.xopenalex-snapshot
Stochastic Theory of a Data-Handling System with Multiple Sources
inferredcites →https://doi.org/10.1007/3-540-45318-0_1openalex-snapshot
Network Calculus
inferredcites →https://doi.org/10.1007/978-1-4471-0459-9openalex-snapshot
Performance Guarantees in Communication Networks
inferredcites →https://doi.org/10.1007/978-3-662-11657-9openalex-snapshot
Elements of Queueing Theory
inferredcites →https://doi.org/10.1016/s0166-5316(02)00116-5openalex-snapshot
Worst case burstiness increase due to FIFO multiplexing
inferredcites →https://doi.org/10.1016/s0169-7552(97)00003-2openalex-snapshot
Traffic distortion and inter-source cross-correlation in high-speed integrated networks
inferredcites →https://doi.org/10.1016/s1388-3437(03)80194-4openalex-snapshot
Buffer overflow bounds for multiplexed regulated traffic streams
inferredcites →https://doi.org/10.1017/s0021900200015898openalex-snapshot
On the dynamics and performance of stochastic fluid systems
inferredcites →https://doi.org/10.1023/a:1019107708752openalex-snapshot
The output of a switch, or, effective bandwidths for networks
inferredcites →https://doi.org/10.1109/18.61109openalex-snapshot
A calculus for network delay. I. Network elements in isolation
inferredcites →https://doi.org/10.1109/18.61110openalex-snapshot
A calculus for network delay. II. Network analysis
inferredcites →https://doi.org/10.1109/18.817518openalex-snapshot
Stochastically bounded burstiness for communication networks
inferredcites →https://doi.org/10.1109/35.894382openalex-snapshot
Traffic theory and the Internet
inferredcites →https://doi.org/10.1109/90.234858openalex-snapshot
Performance and stability of communication networks via robust exponential bounds
inferredcites →https://doi.org/10.1109/90.282603openalex-snapshot
On the self-similar nature of Ethernet traffic (extended version)
inferredcites →https://doi.org/10.1109/infcom.2002.1019338openalex-snapshot
Intelligent shaping: well shaped throughout the entire network?
inferredcites →https://doi.org/10.1109/infcom.2002.1019346openalex-snapshot
Extremal traffic and bounds for the mean delay of multiplexed regulated traffic streams
inferredcites →https://doi.org/10.1109/infcom.2002.1019348openalex-snapshot
Stochastic analysis of some Expedited Forwarding networks
inferredcites →https://doi.org/10.1109/infcom.2003.1208710openalex-snapshot
Simplification of network analysis in large-bandwidth systems
inferredcites →https://doi.org/10.1109/jproc.2002.802002openalex-snapshot
Theories and models for Internet quality of service

What points at this work

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

inferred← citeshttps://doi.org/10.1016/j.peva.2007.10.004openalex-snapshot
Buffer overflow asymptotics for multiplexed regulated traffic
inferred← citeshttps://doi.org/10.1109/icdcs.2010.62openalex-snapshot
Does Link Scheduling Matter on Long Paths?
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062019openalex-snapshot
A Case for Decomposition of FIFO Networks
inferred← citeshttps://doi.org/10.1109/infcom.2011.5934905openalex-snapshot
The impact of link scheduling on long paths: Statistical analysis and optimal bounds
inferred← citeshttps://doi.org/10.1109/infcom.2013.6567050openalex-snapshot
Capacity provisioning for schedulers with tiny buffers
inferred← citeshttps://doi.org/10.1109/jcn.2006.6182789openalex-snapshot
Flow-aware link dimensioning for guaranteed-QoS services in broadband convergence networks
inferred← citeshttps://doi.org/10.1109/jsac.2011.110511openalex-snapshot
On the Impact of Link Scheduling on End-to-End Delays in Large Networks
inferred← citeshttps://doi.org/10.1145/1190095.1190107openalex-snapshot
Worst case burstiness increase due to arbitrary aggregate multiplexing
inferred← citeshttps://doi.org/10.15388/informatica.2010.271openalex-snapshot
Tight Arrival Curve at the Output of a Work-Conserving Blind Multiplexing Server
inferred← citeshttps://doi.org/10.48550/arxiv.1101.1237openalex-snapshot
Statistical Analysis of Link Scheduling on Long Paths
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.