Exponential Servers Sharing a Finite Storage: Comparison of Space Allocation Policies
- 1 June 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 28 (6), 910-915
- https://doi.org/10.1109/tcom.1980.1094731
Abstract
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.SCOPUS: ar.jinfo:eu-repo/semantics/publisheKeywords
This publication has 10 references indexed in Scilit:
- Sharing Memory OptimallyIEEE Transactions on Communications, 1983
- Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic ConditionsIEEE Transactions on Communications, 1980
- On the Statistical Analysis of Queue Lengths and Waiting Times for Statistical Multiplexers with ARQ Retransmission SchemesIEEE Transactions on Communications, 1979
- Two queueing systems sharing the same finite waiting roomNaval Research Logistics Quarterly, 1978
- Buffer Management in a Packet SwitchIEEE Transactions on Communications, 1978
- Simulation of queueing network with time varying arrival ratesMathematics and Computers in Simulation, 1976
- Computer Communication Networks: Approaches, Objectives, and Performance ConsiderationsACM Computing Surveys, 1975
- Buffer Behavior with Poisson Arrival and Geometric Output ProcessesIEEE Transactions on Communications, 1974
- Presentation and major design aspects of the CYCLADES computer networkPublished by Association for Computing Machinery (ACM) ,1973
- Errors and error controlProceedings of the IEEE, 1972