On the public citation graph
Modelling buffer admission mechanisms using stochastic automata networks
0 signed · 23 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/0169-7552(90)90007-fopenalex-snapshot
A space priority queuing mechanism for multiplexing ATM channels
inferredcites →https://doi.org/10.1016/0169-7552(93)90066-dopenalex-snapshot
Traffic control in the B-ISDN
inferredcites →https://doi.org/10.1016/0743-7315(91)90007-vopenalex-snapshot
A methodology for solving markov models of parallel systems
inferredcites →https://doi.org/10.1109/32.99196openalex-snapshot
Stochastic automata network of modeling parallel systems
inferredcites →https://doi.org/10.1109/49.76638openalex-snapshot
Switched bath Bernoulli process (SBBP) and the discrete-time SBBP/G/1 queue with application to statistical multiplexer performance
inferredcites →https://doi.org/10.1109/49.76640openalex-snapshot
An efficient solution method for Markov models of ATM links with loss priorities
inferredcites →https://doi.org/10.1109/infcom.1990.91367openalex-snapshot
Comparative performance study of space priority mechanisms for ATM networks
inferredcites →https://doi.org/10.1109/infcom.1992.263473openalex-snapshot
Finite buffer discrete-time queues with multiple Markovian arrivals and services in ATM networks
inferredcites →https://doi.org/10.1109/tc.1982.1676110openalex-snapshot
Performance Analysis Using Stochastic Petri Nets
inferredcites →https://doi.org/10.1137/0608020openalex-snapshot
Further Comparisons of Direct Methods for Computing Stationary Distributions of Markov Chains
inferredcites →https://doi.org/10.1145/317786.317819openalex-snapshot
On the stochastic structure of parallelism and synchronization models for distributed algorithms
inferredcites →https://doi.org/10.1145/317795.317819openalex-snapshot
On the stochastic structure of parallelism and synchronization models for distributed algorithms
inferredcites →https://doi.org/10.1287/opre.33.5.1107openalex-snapshot
Regenerative Analysis and Steady State Distributions for Markov Chains
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/s0166-5316(02)00227-4openalex-snapshot
Iterative disaggregation for a class of lumpable discrete-time stochastic automata networks
inferred← citeshttps://doi.org/10.1016/s0169-7552(97)00122-0openalex-snapshot
MRAP: A multiservices resource allocation policy for wireless ATM network
inferred← citeshttps://doi.org/10.1109/qest.2009.12openalex-snapshot
Analyzing Large Sparse Markov Chains of Kronecker Products
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.