Some Methods of Investigating Regeneration Times in Queueing Networks

DOI10.1137/1135054MaRDI QIDQ3210686zbMATH OpenOpenAlexFDO

Authors G. Sh. Tsitsiashvili

Publication date 1990

Published in Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1135054

zbMATH Keywords

acyclic networksservice networksregeneration moments

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Discrete mathematics in relation to computer science (68R99) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Cited in

(3)

• Regenerative Simulation for Queueing Networks with Exponential or Heavier Tail Arrival Distributions
• scientific article; zbMATH DE number 4054770 (Why is no real title available?)
• An Estimate of the Moment of the Regeneration Period in a Closed Central-Server Queueing Network

This page was built for publication: Some Methods of Investigating Regeneration Times in Queueing Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210686)