SOME LADDER PROCESSES IN CONTINUOUS TIME WITH APPLICATIONS TO QUEUES.
Abstract
Ladder processes are constructed for a basic stochastic process in continuous time with discrete state space. These processes are used to obtain limit theorems for the supremum and infimum functionals defined on this basic process. Application of these results to queues with Poisson arrivals and general Erlangian type service time density are then discussed in the case where no steady state exists, that is, where the traffic intensity is greater than or equal to one. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1967
- Accession Number
- AD0664678
Entities
People
- Frank M. Worthington
Organizations
- Cornell University