Exponential Servers Sharing a Finite Storage: Comparison of Space Allocation Policies

摘要

Consider a finite waiting room shared by several servers. Such a system may approximate, for instance, a packet switch in a communications network. It is assumed that interarrival and service times have exponential distributions, and that a customer is lost if he cannot enter the waiting room. Different policies for sharing the finite waiting room are compared-the measure of performance being the probability that a customer is lost. © 1980, IEEE. All rights reserved.