Abstract
A single server queue with feedback and multiple customer classes is analyzed. Arrival processes are independent Poisson processes. Each round of service is exponentially distributed. After receiving a round of service, a customer may depart or rejoin the end of the queue for more service. The number of rounds of service required by a customer is a random variable with a general distribution. Our main contribution is characterization of response time distributions for the customer classes. Our results generalize in some respects previous analyses of processor-sharing models. They also represent initial efforts to understand response time behavior along paths with loops in local balanced queueing networks.
- 1 Baskett, F., K. Chandy, R. Muntz and F. Palacios, "Open, Closed and Mixed Networks of Queues with Different Classes of Customers," J. ACM, Vol. 22, 1975. Google Scholar
Digital Library
- 2 Kleinrock, L., "Time-Shared Systems: A Theoretical Treatment," J. ACM, Vol. 14, April 1967. Google Scholar
Digital Library
- 3 Sakata, M., S. Noguchi and J. Oizumi, "An Analysis of the M/G/1 Queue Under Round-Robin Discipline," Operations Research, Vol. 19, 1971.Google Scholar
- 4 Coffman, E., R. Muntz and H. Trotter, "Waiting Time Distributions for Processor-Sharing Systems," J. ACM, Vol. 17, January 1970. Google Scholar
Digital Library
- 5 Muntz, R., "Waiting Time Distribution for Round-Robin Queueing Systems," Proc. Symp. on Computer-Communications Networks and Teletraffic, Polytechnic Institute of Brooklyn, April 1972.Google Scholar
- 6 Takacs, L., "A Single-Server Queue with Feedback," The Bell System Technical Journal, March 1963.Google Scholar
Cross Ref
- 7 Wong, J. W., "Distribution of End-to-End Delay in Message-Switched Networks," Computer Networks, Vol. 2, 1978.Google Scholar
- 8 Cohen, J. W., The Single Server Queue, North-Holland Publishing Co., Amsterdam 1969.Google Scholar
- 9 Kleinrock, L., Queueing Systems, Vol. 1: Theory, Wiley-Interscience, 1975, Page 118. Google Scholar
Digital Library
- 10 Reiser, M. and H. Kobayashi, "Queueing Networks with Multiple Closed Chains: Theory and Computational Algorithms," IBM Journal of Research and Development, Vol. 19, May 1975.Google Scholar
Digital Library
- 11 Lam, S. S. and A. U. Shankar, "Response Time Distributions for a Multi-Class Queue with Feedback," Department of Computer Sciences, University of Texas at Austin, Technical Report TR-114, Nov. 1979. Google Scholar
Digital Library
Index Terms
Response time distributions for a multi-class queue with feedback
Recommendations
Response time distributions for a multi-class queue with feedback
PERFORMANCE '80: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluationA single server queue with feedback and multiple customer classes is analyzed. Arrival processes are independent Poisson processes. Each round of service is exponentially distributed. After receiving a round of service, a customer may depart or rejoin ...
Waiting time distributions in the accumulating priority queue
We are interested in queues in which customers of different classes arrive to a service facility, and where performance targets are specified for each class. The manager of such a queue has the task of implementing a queueing discipline that results in ...
Queue Length Distribution in a FIFO Single-Server Queue with Multiple Arrival Streams Having Different Service Time Distributions
This paper considers the queue length distribution in a class of FIFO single-server queues with (possibly correlated) multiple arrival streams, where the service time distribution of customers may be different for different streams. It is widely ...






Comments