2018
DOI: 10.1007/s11009-018-9658-8
|View full text |Cite
|
Sign up to set email alerts
|

On Lattice Path Counting and the Random Product Representation, with Applications to the Er/M/1 Queue and the M/Er/1 Queue

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 24 publications
0
1
0
Order By: Relevance
“…Baek et al (2014); Griffiths et al (2006); Yu et al (2011); Yue et al (2009); Zhang et al (2016)). Besides, Liu and Fralix (2019) employed the lattice path counting techniques to examine the time-dependent and equilibrium behavior of continuous-time Markov chains (CTMC) and Markovian queueing systems. More recently, Pandey and Gangeshwer (2020) utilized the probability-generating function approach to derive the steady-state 10.3389/fenrg.2023.1329899 queue-size distribution by employing the ambulance service as a server.…”
Section: Service In Phasesmentioning
confidence: 99%
“…Baek et al (2014); Griffiths et al (2006); Yu et al (2011); Yue et al (2009); Zhang et al (2016)). Besides, Liu and Fralix (2019) employed the lattice path counting techniques to examine the time-dependent and equilibrium behavior of continuous-time Markov chains (CTMC) and Markovian queueing systems. More recently, Pandey and Gangeshwer (2020) utilized the probability-generating function approach to derive the steady-state 10.3389/fenrg.2023.1329899 queue-size distribution by employing the ambulance service as a server.…”
Section: Service In Phasesmentioning
confidence: 99%