Waiting times and output process of a server computed via Wiener-Hopf factorization

Gerhard Hasslinger

doi:10.1117/12.325871

7 October 1998 Waiting times and output process of a server computed via Wiener-Hopf factorization

Gerhard Hasslinger

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.

Citation Download Citation

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); https://doi.org/10.1117/12.325871

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available