Measures of Performance for the System G/M/s/N with Two Classes of Customers.
Abstract
In this paper the following queueing system is analyzed completely for its steady state measures of performance: The arrival epochs are in a recurrent process and an arriving customer belongs to either one of the two classes with probability p and 1-p respectively. The number of channels is s and the service time distribution is exponential with the same mean for all customers. The system capacity is N(> or = s) for the number of customers in the system. Arriving class 1 customers are buffered when all servers are busy. Arriving class 2 customers are denied access to the system when k(< or = s) or more service channels are busy. This queueing model is used to represent a telecommunications network where data and voice customers share access and line facilities.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1975
- Accession Number
- ADA015339
Entities
People
- Sagi N. Raju
- U. Narayan Bhat
Organizations
- Southern Methodist University