Queueing Models With Finite and Infinite Buffering Capacity
نویسندگان
چکیده
Queueing theory offers a large variety of techniques that can be used in performance modelling of computer systems and data communication networks. The diversity of assumptions causes that the numerical results, obtained for the same system but by means of different techniques, can often be numerically very different. The project is aimed at finding common denominators for numerical results obtained with the assumption of infinite buffer capacity and that obtained with the assumption of finite buffer capacity. To be precise, this project investigates the traffic intensity regions where the approximation of queueing systems with finite buffer capacity by the queueing systems with infinite buffer capacity can be done with some amount of safety margin. The investigation includes both queueing systems with single arrivals (M/M/1, M/D/1), and a queueing system with batched arrivals (M(b) /M/1), and two the most important characteristics of queueing systems are considered, the probability of overflow and average waiting time in the system.
منابع مشابه
Queueing models of optical delay lines in synchronous and asynchronous optical packet-switching networks
Xiaoming Zhu Joseph M. Kahn University of California Department of Electrical Engineering and Computer Sciences 307 Cory Hall Berkeley, California 94720-1772 E-mail: [email protected] Abstract. Buffering with optical delay lines (ODLs) in optical packetswitching networks is a way to mitigate network contention. We study queueing models of ODLs in synchronous and asynchronous optical packe...
متن کاملA finite capacity queueing network model capturing blocking, congestion and spillbacks
Analytic queueing network models constitute a flexible tool for the study of network flow. These aggregate models are simple to manipulate and their analytic aspect renders them suitable for use within an optimization framework. Analytic queueing network models often assume infinite capacity for all queues. For real systems this infinite capacity assumption does not hold, but is often maintaine...
متن کاملAn analytic finite capacity queueing network model capturing the propagation of congestion and blocking
Analytic queueing network models often assume infinite capacity for all queues. For real systems this infinite capacity assumption does not hold, but is often maintained due to the difficulty of grasping the between-queue correlation structure present in finite capacity networks. This correlation structure helps explain bottleneck effects and spillbacks, the latter being of special interest in ...
متن کاملLimits for Queues as the Waiting Room Grows
We study the convergence of finite-capacity open queueing systems to their infinite-capacity counterparts as the capacity increases. Convergence of the transient behavior is easily established in great generality provided that the finite-capacity system can be identified with the infinitecapacity system up to the first time that the capacity is exceeded. Convergence of steady-state distribution...
متن کاملOptimality of the fastest available server policy
We give sufficient conditions under which a policy that assigns customers to the Fastest Available Server, labelled FAS, is optimal in queueing models with multiple independent Poisson arrival processes and heterogeneous parallel exponential servers. The criterion is to minimize the long-run average cost per unit time. We obtain results for loss models and for queueing systems with a finite-cap...
متن کامل