Analysis of discrete-time TES/G/1 and TES/D/1-K queueing systems

Tjhie, Dedy Dewanto; Rzehak, Helmut

doi:10.1016/s0166-5316(96)90036-x

Cited by 2 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Discrete time SMP models have been analysed by [7,26,29,30]. Lindley's equation is exploited [7,30] to determine the waiting time distribution via the Fast-Fourier-Transform algorithm.…”

Section: Introductionmentioning

confidence: 99%

“…Lindley's equation is exploited [7,30] to determine the waiting time distribution via the Fast-Fourier-Transform algorithm. The computational complexity of this algorithm is increasing with the utilization p or with the number of states included in the result, as also observed in [27].…”

Section: Introductionmentioning

confidence: 99%

“…The wide applicability of Semi-Markov processes is approved by a transformation scheme from TES sequences into SMP [30] , which are afterwards utilized for queueing analysis.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

<title>Waiting times and output process of a server computed via Wiener-Hopf factorization</title>

Hasslinger

1998

SPIE Proceedings

View full text Add to dashboard Cite

Non-renewal processes are relevant in queueing analysis to include various types of traffic arising in integrated services communication networks. We consider a workload based approach to the single server queue in discrete time domain with semi-Markov arrivals (SMP/G/1). Starting from a subdivision of the busy periods, we generalize a computationally attractive algorithm for the discrete time GI/G/1 queue. The stationary distributions of the waiting and idle time as well as the moments of the busy period are computed. Performance results are given for deterministic servers with autoregressive input and the output process of a server is modelled by adapting a SMP of small size.

show abstract

“…Discrete time SMP models have been analysed by [7,26,29,30]. Lindley's equation is exploited [7,30] to determine the waiting time distribution via the Fast-Fourier-Transform algorithm.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%