The Effect of Idle Server First Random Routing on the Behavior of a Finite Queue
- 1 May 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 35 (5) , 496-502
- https://doi.org/10.1109/tcom.1987.1096807
Abstract
This paper studies the effect of routing on the behavior of a finite queue which accepts batch Poisson inputs and receives service from multiple synchronous servers. Upon the arrival of a group of customers idle or pseudoidle servers will be considered first in routing decisions. Otherwise routing will be determined randomly in accordance with a preset probability distribution. Results obtained include state probability, blocking probability, delay, and throughput. Validity of analysis has been verified by computer simulations. These results can he used in evaluating the performance of a computer communication network.Keywords
This publication has 5 references indexed in Scilit:
- The Effect of Routing and Buffer Sharing on the Behavior of a Finite Queue with Batch Poisson Inputs and Synchronous ServersSIAM Journal on Applied Mathematics, 1987
- The Behavior of a Finite Queue with Batch Poisson Inputs Resulting from Message Packetization and a Synchronous ServerIEEE Transactions on Communications, 1984
- The Application of the Residue Theorem to the Study of a Finite Queue with Batch Poisson Arrivals and Synchronous serversSIAM Journal on Applied Mathematics, 1984
- Analysis of a Finite Storage System with Batch Input Arising out of Message PacketizationIEEE Transactions on Communications, 1982
- Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic ConditionsIEEE Transactions on Communications, 1980