Passage times for overtake-free paths in Gordon–Newell networks
From MaRDI portal
Publication:3946928
DOI10.2307/1426680zbMath0486.60087OpenAlexW4238835919WikidataQ56912828 ScholiaQ56912828MaRDI QIDQ3946928
Publication date: 1982
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1426680
Queueing theory (aspects of probability theory) (60K25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items (9)
Analysis of a three node queueing network ⋮ Mathematical theory of queueing networks ⋮ The cyclic queue and the tandem queue ⋮ Networks of queues in discrete time ⋮ Cycle times in single server cyclic Jackson networks. ⋮ On passage times in Jackson networks: Two-stations walk and overtake-free paths ⋮ Theory of queuing networks and its applications to the analysis of information-computing systems ⋮ Travel times in queueing networks and network sojourns ⋮ The cycle-time distribution in a central server network with state-dependent branching
This page was built for publication: Passage times for overtake-free paths in Gordon–Newell networks
