The tightness in the ergodic analysis of regenerative queueing processes

  • Authors:

  • Evsei Morozov

  • Affiliations:

  • Department of Applied Mathematics and Cybernetics, Petrozavodsk State University, Lenin prospect 33, Petrozavodsk 185640, Russia

  • Venue:
  • Queueing Systems: Theory and Applications
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

The tightness of some queueing stochastic processes is proved and its role in an ergodic analysis is considered. It is proved that the residual service time process in an open Jackson-type network is tight. The same problem is solved for a closed network, where the basic discrete time process is embedded at the service completion epochs. An extention of Kiefer and Wolfowitz’s “key” lemma to a nonhomogeneous multiserver queue with an arbitrary initial state is obtained. These results are applied to get the ergodic theorems for the basic regenerative network processes.