On the public citation graph

Two Discrete-Time Queues in Tandem

0 signed · 59 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/j.1538-7305.1978.tb02116.xopenalex-snapshot
A Combinatorial Lemma and Its Application to Concentrating Trees of Discrete-Time Queues
inferredcites →https://doi.org/10.1007/978-3-662-11761-3openalex-snapshot
Formulas and Theorems for the Special Functions of Mathematical Physics
inferredcites →https://doi.org/10.1109/proc.1977.10604openalex-snapshot
Queueing systems, Vol. I: Theory
inferredcites →https://doi.org/10.1109/tcom.1976.1093274openalex-snapshot
An Approximate Time-Delay Analysis for Packet-Switching Communication Networks
inferredcites →https://doi.org/10.1109/tcom.1976.1093299openalex-snapshot
Behavior of Tandem Buffers with Geometric Input and Markovian Output
inferredcites →https://doi.org/10.1109/tcom.1977.1093702openalex-snapshot
Queueing Models for Computer Communications System Analysis
inferredcites →https://doi.org/10.2307/2315931openalex-snapshot
Theory of Functions of a Complex Variable.
inferredcites →https://doi.org/10.6028/jres.063b.002openalex-snapshot
On a modification of Watson's Lemma

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.3657637openalex-extracted
Designing Efficient Omni-Channel Services
inferred← citeshttps://doi.org/10.1002/j.1538-7305.1978.tb02116.xopenalex-snapshot
A Combinatorial Lemma and Its Application to Concentrating Trees of Discrete-Time Queues
inferred← citeshttps://doi.org/10.1007/3-540-44592-7_7openalex-snapshot
Appendix
inferred← citeshttps://doi.org/10.1007/bf01153532openalex-snapshot
Open queueing networks in discrete time-some limit theorems
inferred← citeshttps://doi.org/10.1007/bf01157855openalex-snapshot
Two competing discrete-time queues with priority
inferred← citeshttps://doi.org/10.1007/bf01206555openalex-snapshot
A tandem of discrete-time queues with arrivals and departures at each stage
inferred← citeshttps://doi.org/10.1007/bf02031599openalex-snapshot
Tandem queues with deterministic service times
inferred← citeshttps://doi.org/10.1016/0167-6377(90)90069-hopenalex-snapshot
Recursive computation of steady-state probabilities in priority queues
inferred← citeshttps://doi.org/10.1016/0167-6377(94)90005-1openalex-snapshot
Approximate analysis of discrete-time tandem queueing networks with bursty and correlated input traffic and customer loss
inferred← citeshttps://doi.org/10.1016/0169-7552(93)90029-4openalex-snapshot
End-to-end delays in multistage ATM switching networks: approximate analytic derivation of tail probabilities
inferred← citeshttps://doi.org/10.1016/0305-0548(93)90006-5openalex-snapshot
Performance of discrete-time queueing systems
inferred← citeshttps://doi.org/10.1016/b978-0-12-361801-6.50012-5openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/j.adhoc.2008.04.010openalex-snapshot
Towards an end-to-end delay analysis of wireless multihop networks
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.05.004openalex-snapshot
A modified HOL priority scheduling discipline: Performance analysis
inferred← citeshttps://doi.org/10.1016/j.peva.2009.03.001openalex-snapshot
A performance analysis of discrete-time tandem queues with Markovian sources
inferred← citeshttps://doi.org/10.1016/s0166-5316(98)00024-8openalex-snapshot
Discrete-time multiserver queues with priorities
inferred← citeshttps://doi.org/10.1080/15326349208807228openalex-snapshot
Discrete-time priority queues with two-state markov modulated arrivals
inferred← citeshttps://doi.org/10.1109/18.485740openalex-snapshot
A simple analysis of average queueing delay in tree networks
inferred← citeshttps://doi.org/10.1109/90.893872openalex-snapshot
Performance modeling of multihop network subject to uniform and nonuniform geometric traffic
inferred← citeshttps://doi.org/10.1109/c2spca.2013.6749397openalex-snapshot
Analysis and estimation of overflow probability in Jackson queueing networks
inferred← citeshttps://doi.org/10.1109/coase.2005.1506742openalex-snapshot
Analysis of base-stock controlled production-inventory system using discrete-time queueing models
inferred← citeshttps://doi.org/10.1109/glocom.1992.276640openalex-snapshot
Approximate analysis of discrete-time tandem queueing networks with customer loss
inferred← citeshttps://doi.org/10.1109/glocom.2005.1578409openalex-snapshot
Delay performance of different MAC schemes for multihop wireless networks
inferred← citeshttps://doi.org/10.1109/icc.2000.853764openalex-snapshot
Inequality comparisons and traffic smoothing in multi-stage ATM multiplexers
inferred← citeshttps://doi.org/10.1109/icc.2004.1312912openalex-snapshot
Exact queueing analysis of discrete time tandems with arbitrary arrival processes
inferred← citeshttps://doi.org/10.1109/infcom.1989.101432openalex-snapshot
Recursive computation of steady-state probabilities in priority queues
inferred← citeshttps://doi.org/10.1109/infcom.1991.147677openalex-snapshot
Discrete-time priority queueing systems with two-state Markov modulated arrival processes
inferred← citeshttps://doi.org/10.1109/infcom.1995.515939openalex-snapshot
Queueing analysis of ATM tandem queues with correlated arrivals
inferred← citeshttps://doi.org/10.1109/infcom.1997.644504openalex-snapshot
Analysis of queueing displacement using switch port speedup
inferred← citeshttps://doi.org/10.1109/isit.1994.394646openalex-snapshot
A simple derivation of queueing delay in a tree network of discrete-time queues with deterministic service time
inferred← citeshttps://doi.org/10.1109/ita.2011.5743595openalex-snapshot
Latency-optimizing file splitting for transmission over a large multi-hop network
inferred← citeshttps://doi.org/10.1109/jsac.1987.1146612openalex-snapshot
Discrete-Time Priority Queues with Partial Interference
inferred← citeshttps://doi.org/10.1109/mascot.1994.284384openalex-snapshot
Discrete time open queueing networks with feedback, bulk arrivals and services
inferred← citeshttps://doi.org/10.1109/tc.1981.1675789openalex-snapshot
An Analysis of a Tandem Queueing System for Flow Control in Computer Networks
inferred← citeshttps://doi.org/10.1109/tcom.1980.1094650openalex-snapshot
Discrete-Time Queueing Systems and Their Networks
inferred← citeshttps://doi.org/10.1109/tcom.1983.1095740openalex-snapshot
Two Interfering Queues in Packet-Radio Networks
inferred← citeshttps://doi.org/10.1109/tcom.1987.1096727openalex-snapshot
Exact Delay Analysis of Packet-Switching Concentrating Networks
inferred← citeshttps://doi.org/10.1109/tcomm.1994.582893openalex-snapshot
An analysis of a discrete-time queue for broadband ISDN with priorities among traffic classes
inferred← citeshttps://doi.org/10.1109/tit.2005.855621openalex-snapshot
Equivalent Models for Queueing Analysis of Deterministic Service Time Tree Networks
inferred← citeshttps://doi.org/10.1109/tmc.2007.70777openalex-snapshot
Tandem Queue Models with Applications to QoS Routing in Multihop Wireless Networks
inferred← citeshttps://doi.org/10.1109/wcnc.2007.552openalex-snapshot
A Tandem Queue Model for Performance Analysis in Multihop Wireless Networks
inferred← citeshttps://doi.org/10.1177/10591478241231874openalex-snapshot
Prioritization in the Presence of Self-ordering Opportunities in Omnichannel Services
inferred← citeshttps://doi.org/10.1287/opre.28.3.512openalex-snapshot
A Two-Fold Tandem Net with Deterministic Links and Source Interference
inferred← citeshttps://doi.org/10.1287/opre.32.4.753openalex-snapshot
A Tandem Network of Queues with Deterministic Service and Intermediate Arrivals
inferred← citeshttps://doi.org/10.1287/opre.33.1.161openalex-snapshot
Tests for the Nonergodicity of Multidimensional Markov Chains
inferred← citeshttps://doi.org/10.1504/ijor.2008.016150openalex-snapshot
Analysis and design of a Production-Inventory system using discrete-time queueing models
inferred← citeshttps://doi.org/10.18500/1816-9791-2013-13-2-1-111-117openalex-snapshot
Analysis of Closed Unreliable Queueing Networks with Batch Movements of Customers
inferred← citeshttps://doi.org/10.18500/1816-9791-2013-13-2-1-8-14openalex-snapshot
Matrix Representation of Dilation Operator on the Product of Zero-Dimensional Locally Compact Abelian Groups
inferred← citeshttps://doi.org/10.2139/ssrn.5376003openalex-snapshot
Exact Results for Discrete-Time Tandem Queues with Server Interruptions
inferred← citeshttps://doi.org/10.51983/ajeat-2015.4.1.753openalex-snapshot
Minimizing the Delay Time of Data Transfer in Access Networks Using Queue Models
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93328openalex-snapshot
Analytical models for the multiplexing of worst case traffic sources and their application to ATM traffic control.
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.