On the public citation graph
Scaling Limits of a Tandem Queue with Two Infinite Orbits
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.1007/978-3-030-91825-5_27openalex-snapshot
Analysis of Tandem Retrial Queue with Common Orbit and Poisson Arrival Process
inferredcites →https://doi.org/10.1007/978-3-030-92507-9_20openalex-snapshot
Scaling Limits of a Tandem Retrial Queue with Common Orbit and Poisson Arrival Process
inferredcites →https://doi.org/10.1007/978-3-031-09331-9_11openalex-snapshot
Mathematical Model of the Tandem Retrial Queue M | GI | 1 | M | 1 with a Common Orbit
inferredcites →https://doi.org/10.1007/978-3-031-23207-7_21openalex-snapshot
Analysis of Tandem Retrial Queue with Common Orbit and MMPP Incoming Flow
inferredcites →https://doi.org/10.1007/978-3-540-78725-9openalex-snapshot
Retrial Queueing Systems: A Computational Approach
inferredcites →https://doi.org/10.1007/bf02411467openalex-snapshot
Tandem behavior of a telecommunication system with finite buffers and repeated calls
inferredcites →https://doi.org/10.1007/s11134-012-9290-1openalex-snapshot
Queues in tandem with customer deadlines and retrials
inferredcites →https://doi.org/10.1007/s12351-011-0113-7openalex-snapshot
An explicit solution for a tandem queue with retrials and losses
inferredcites →https://doi.org/10.1016/0377-2217(93)90337-mopenalex-snapshot
Tandem behavior of a telecommunication system with repeated calls: II, A general case without buffers
inferredcites →https://doi.org/10.1016/j.apm.2010.01.003openalex-snapshot
Investigation of the BMAP/G/1→·/PH/1/M tandem queue with retrials and losses
inferredcites →https://doi.org/10.1016/j.cor.2009.10.004openalex-snapshot
On tandem blocking queues with a common retrial queue
inferredcites →https://doi.org/10.1017/s0269964800004319openalex-snapshot
Fixed Point Approximations for Retrial Networks
inferredcites →https://doi.org/10.1017/s0269964801153027openalex-snapshot
TWO QUEUES IN TANDEM WITH RETRIAL CUSTOMERS
inferredcites →https://doi.org/10.1134/s1064226916120159openalex-snapshot
Optimal control of data transmission in a mobile two-agent robotic system
inferredcites →https://doi.org/10.1504/ijor.2021.120038openalex-snapshot
A source-retrial queuing network with finite shared buffers in multi-queue nodes: a method of approximate analysis
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4758285openalex-extracted
A Survey on the Tandem Queuing Models
inferred← citeshttps://doi.org/10.1016/j.asej.2026.104155openalex-snapshot
Two-tandem servers inventory system with multi-orbit to minimise customer loss
inferred← citeshttps://doi.org/10.3390/math12101500openalex-snapshot
Analysis of a Two-Stage Tandem Queuing System with Priority and Clearing Service in the Second Stage
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.