Heavy-Traffic Approximations for Service Systems With Blocking
Author:
- 6 May 1984
- journal article
- website
- Published by Institute of Electrical and Electronics Engineers (IEEE) in AT&T Bell Laboratories Technical Journal
- Vol. 63 (5) , 689-708
Abstract
This paper develops approximations for the blocking probability and related congestion measures in service systems with s servers, r extra waiting spaces, blocked customers lost, and independent and identically distributed service times that are inde...Keywords
This publication has 16 references indexed in Scilit:
- A Light-Traffic Theorem for Multi-Server QueuesMathematics of Operations Research, 1983
- Poisson Arrivals See Time AveragesOperations Research, 1982
- On the heavy-traffic limit theorem forGI/G/∞ queuesAdvances in Applied Probability, 1982
- Approximating a Point Process by a Renewal Process, I: Two Basic MethodsOperations Research, 1982
- Approximating a Point Process by a Renewal Process: The View Through a Queue, an Indirect ApproachManagement Science, 1981
- A Unified Approximate Evaluation of Congestion Functions for Smooth and Peaky TrafficsIEEE Transactions on Communications, 1981
- Note—Comments on a Queueing InequalityManagement Science, 1980
- Note—Simple Inequalities for Multiserver QueuesManagement Science, 1980
- A low traffic approximation for queuesJournal of Applied Probability, 1972
- On limit laws for service processes in multi-channel systemsSiberian Mathematical Journal, 1967