𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithmic and approximation analyses of the shorter queue model

✍ Scribed by B. M. Rao; M. J. M. Posner


Publisher
John Wiley and Sons
Year
1987
Tongue
English
Weight
804 KB
Volume
34
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

✦ Synopsis


A system of two parallel queues where the arrivals from a single stream of customers join the shorter queue is considered. Arrivals form a homogeneous Poisson stream and the service times in each of the two queues are independent exponential variates.

By treating one of the queues as bounded, the steady-state probability vector for the system can be expressed in a modified matrix-geometric form and can be computed efficiently. Computational procedures for the sojourn time distribution and characteristics of the departure stream are developed. Some numerical results are presented, and based on these results an efficient approximation scheme for the model is developed which can be readily extended to systems with more than two parallel queues.


πŸ“œ SIMILAR VOLUMES


Approximation for the departure process
✍ Susan L. Albin; Sheng-Roan Kai πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 985 KB

A simple renewal process is identified to approximate the complex departure process of a queue often found in queueing network models. The arrival process to the queue is the superposition or merging of several independent component-renewal processes that are approximations of departure processes fr

Fast Algorithms for Numerical, Conservat
✍ C. Buet; S. Cordier; P. Degond; M. Lemou πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 482 KB

We present fast numerical algorithms to solve the nonlinear Fokker-Planck-Landau equation in 3D velocity space. The discretization of the collision operator preserves the properties required by the physical nature of the Fokker-Planck-Landau equation, such as the conservation of mass, momentum, an