Blocking of finite source inputs which require simultaneous servers with general think and holding times

Authors:
Nico M. Van Dijk
Affiliations:
Free University, Amsterdam, The Netherlands
Venue:
Operations Research Letters
Year:
1989

Citing 8
Cited 0

Asymptotic expansions for closed Markovian networks with state-dependent service rates

Journal of the ACM (JACM)
Stochastic modelling and analysis: a computational approach

Stochastic modelling and analysis: a computational approach
Insensitivity in two-node blocking models with applications

Proc. of the international seminar on Teletraffic analysis and computer performance evaluation
Introduction to queueing networks

Introduction to queueing networks
Mean-Value Analysis of Closed Multichain Queuing Networks

Journal of the ACM (JACM)
Sizing a Message Store Subject to Blocking Criteria

Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems: Performance of Computer Systems
A Statistical Mechanics of Some Interconnection Networks

Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
Queuing networks with population size constraints

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies a multi-server loss system with a finite source input of sources that require simultaneous serving by several servers. The stationary distribution of busy sources is extended to general think and holding times and proven to be of an insensitive product form. The proof is simple and self-contained. Moreover, the arrival theorem is shown to hold and used to compute blocking probabilities.