Performance analysis of the \(M/G/c\) retrial queueing systems using the theory of Markov regenerative stochastic Petri nets.

DOI10.1007/BF03398724zbMath1158.90332OpenAlexW2771880256MaRDI QIDQ2476425

Yanyan Li

Publication date: 19 March 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398724

zbMATH Keywords

performance evaluationretrial queueing systemMarkov regenerative stochastic Petri netsmultiple serverstransients and steady state probabilities

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of retrial queues
• Numerical investigation of a multiserver retrial model
• A survey on retrial queues
• An approximation method for the \(M/G/1\) retrial queue with general retrial times
• TimeNET: a toolkit for evaluating non-Markovian stochastic Petri nets
• Retrial Queues

This page was built for publication: Performance analysis of the \(M/G/c\) retrial queueing systems using the theory of Markov regenerative stochastic Petri nets.