M/G/1 System with Adjustment at the Beginning of Its Busy Period

Authors:
L. Lakatos
Affiliations:
University of Budapest, Hungary
Venue:
Cybernetics and Systems Analysis
Year:
2005

Citing 3
Cited 0

Computational analysis of single-server bulk-arrival queues Mx/G/1

Computers and Operations Research
Introduction to queueing theory (2nd ed)

Introduction to queueing theory (2nd ed)
Exact and approximate numerical solutions to steady-state single-server queues: M/G/1–a unified approach

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

M/G/1 queuing system is considered in which the first incoming request initializes system adjustment. After adjustment, the system services the first and then the next incoming requests. Ergodic probabilities are computed based on the theory of regenerative processes and on the busy period and time of staying in different states. Recurrence is analyzed which corresponds to the mathematical expectation of the time of staying in different states.