7 October 1998 Waiting times and output process of a server computed via Wiener-Hopf factorization
Author Affiliations +
Proceedings Volume 3530, Performance and Control of Network Systems II; (1998) https://doi.org/10.1117/12.325871
Event: Photonics East (ISAM, VVDC, IEMB), 1998, Boston, MA, United States
Abstract
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 modeled by adapting a SMP of small size.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Gerhard Hasslinger, "Waiting times and output process of a server computed via Wiener-Hopf factorization", Proc. SPIE 3530, Performance and Control of Network Systems II, (7 October 1998); doi: 10.1117/12.325871; https://doi.org/10.1117/12.325871
PROCEEDINGS
13 PAGES


SHARE
Back to Top