Semi-Stationary Clearing Processes.
Abstract
A clearing process describes the net quantity in a service system (e.g. a batch service queue or dam) which receives an exogenous random input over time, and has an output mechanism that intermittently clears random quantities from the system. A semi-stationary clearing process is strictly stationary over its random clearing epochs. We describe the asymptotic distributions of such processes and show how they arise in limits of certain functionals of these processes. We identify some clearing processes with uniform asymptotic distributions. This is true for modulo c clearing with a stationary input if the Palm probability is used rather than the usual probability. We also present a functional central limit law and law of the interated logorithm for clearing processes, as well as a result on the convergence of a sequence of such processes. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 01, 1976
- Accession Number
- ADA032877
Entities
People
- Richard F. Serfozo
- Shaler Stidham
Organizations
- Syracuse University