Blocking When Service Is Required From Several Facilities Simultaneously

AT&T Technical Journal

Volumn 64, Issue 8, 1985, Pages 1807-1856

  Whitt, W ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

TELEPHONE SYSTEMS, AUTOMATIC - MATHEMATICAL MODELS;

BLOCKING PROBABILITY; BLOCKING SYSTEM; MULTISERVER SERVICE FACILITIES; SIMULTANEOUS RESOURCE POSSESSION;

TELEPHONE SYSTEMS;

EID: 0022144982     PISSN: 87562324     EISSN: 15387305     Source Type: Journal    
DOI: 10.1002/j.1538-7305.1985.tb00038.x     Document Type: Article

References (76)

1. “Poisson Arrivals See Time Averages,”
2. “Blocking in a Shared Resource Environment,”
3. “Insensitivity of Blocking Probabilities in a Circuit‐Switching Network,”
4. “Analysis of Dependence Effects in Telephone Trunking Networks,”
5. “Models and Problems of Dynamic Memory Allocation,”
6. “A Stochastic Model of Fragmentation in Dynamic Storage Allocation,”
7. “The M/M/∞ Service System With Ranked Servers in Heavy Traffic,”
8. “Analysis of Mixtures of Wide and Narrow Band Traffic,”
9. “The Camp‐On Problem for Multiple‐Address Traffic,”
10. “Capacity Bounds for Multiresource Queues,”
11. “Sizing a Message Store Subject to Blocking Criteria,”
12. “A Queueing System in Which Customers Require a Random Number of Servers,”
13. “Queues in Which Customers Receive Simultaneous Service From a Random Number of Servers: A System Point Approach,”
14. “A Multiple Dispatch Queueing Model of Police Patrol Operations,”
15. “An M/G/c Queue in Which the Number of Servers Required is Random,”
16. “Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics,”
17. “The Overload Performance of Engineered Networks With Nonhierarchial and Hierarachial Routing,”
18. “Some Properties of the Erlang Loss Functions,”
19. “Methods in Traffic Calculations,”
20. “Resource Sharing for Efficiency in Traffic Systems,”
21. “Stochastically Monotone Markov Chains,”
22. “Monotone Matrices and Monotone Markov Processes,”
23. “An Operator Analytic Approach to the Jackson Network,”
24. “Open Networks of Queues: Their Algebraic Structure and Estimating Their Transient Behavior,”
25. “Open and Closed Models for Networks of Queues,”
26. “Estimates of Distributions of Random Variables for Certain Communications Models,”
27. “Traffic Measurements in Data Networks, Recent Measurement Results, and Some Implications,”
28. “Insensitivity of Steady‐State Distributions of Generalized Semi‐Markov Processes With Speeds,”
29. “Insensitivity in Queueing Systems,”
30. “Continuity of Generalized Semi‐Markov Processes,”
31. “Open, Closed and Mixed Networks of Queues With Different Classes of Customers,”
32. “Networks of Queues,”
33. “The Insensitivity of Stationary Probabilities in Networks of Queues,”
34. “Networks of Queues and the Method of Stages,”
35. “Queueing Networks With Population Size Constraints,”
36. “Heavy‐Traffic Approximations for Service Systems With Blocking,”
37. “Classes of Orderings of Measures and Related Correlation Inequalities. I. Multivariate Totally Positive Distributions,”
38. “Stochastic Inequalities on Partially Ordered Space,”
39. “On the Heavy‐Traffic Limit Theorem for GI/G/∞ Queues,”
40. “Weak Convergence of Probability Measures and Random Functions in the Function Space D[0, ∞),”
41. “Some Useful Functions for Functional Limit Theorems”
42. “Weak Convergence of Probability Measures on the Function Space C[0, ∞),”
43. “Comparing Counting Processes and Queues,”
44. “Blocking Probabilities in Large Circuit‐Switched Networks,”
45. “Loss Probabilities in Circuit‐Switched Star Networks,”
46. “Analysis of Circuit‐Switched Networks Employing Originating Office Control With Spill Forward,”
47. “End‐to‐End Blocking for Circuit‐Switched Networks: Polynomial Algorithms for Some Special Cases,”