Exponential Servers Sharing a Finite Storage: Comparison of Space Allocation Policies.
DELAWARE UNIV NEWARK DEPT OF STATISTICS AND COMPUTER SCIENCE
Pagination or Media Count:
Consider a finite waiting room shared by several servers. Such a system may approximate, for instance, a packet switch in a communications network or a buffer shared by producer-consumer parallel processes. It is assumed that a customer is lost if he cannot enter the waiting room. Furthermore, the waiting room is partitioned into L1 areas, where L is the number of servers each of the first L areas is reserved for the exclusive use of one server, the L1st is common and may be used by all servers. This allocation policy is referred to as L1- sharing.
- Statistics and Probability