THE TRANSIENT BEHAVIOR OF THE QUEUE WITH ALTERNATING PRIORITIES, WITH SPECIAL REFERENCE TO THE WAITINGTIMES,
Abstract
A server operates two units with independent Poisson arrival processes and with independent, general servicetimes. He serves each unit until its queue becomes empty and then switches to the other unit of customers waiting there. If both units are empty, he operates the unit in which the first customer arrives and stays in it until it again becomes empty. This report discusses the time dependent and asymptotic distributions for the queuelength processes and for several virtual waitingtime processes. The analysis is in terms of imbedded semi-Markov processes. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1968
- Accession Number
- AD0665783
Entities
People
- Marcel F. Neuts
- Micha Yadin
Organizations
- Purdue University