Share Email Print

Proceedings Paper

Waiting times and output process of a server computed via Wiener-Hopf factorization
Author(s): Gerhard Hasslinger
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 7 October 1998
PDF: 13 pages
Proc. SPIE 3530, Performance and Control of Network Systems II, (7 October 1998); doi: 10.1117/12.325871
Show Author Affiliations
Gerhard Hasslinger, DeTeSystem (Germany)

Published in SPIE Proceedings Vol. 3530:
Performance and Control of Network Systems II
Wai Sum Lai; Robert B. Cooper, Editor(s)

© SPIE. Terms of Use
Back to Top