Results 261 to 270 of about 1,460 (284)

Some distributional approximations in Markovian queueing networks

Advances in Applied Probability, 1982
We consider single-class Markovian queueing networks with state-dependent service rates (the immigration processes of Whittle (1968)). The distance of customer flows from Poisson processes is estimated in both the open and closed cases. The bounds on distances lead to simple criteria for good Poisson approximations.
Brown, TC, Pollett, PK
openaire   +5 more sources

Approximate analysis of a cyclic queuing network with applications to a simultaneous resource possession problem

Performance Evaluation, 1990
Abstract In this paper we develop very accurate approximations for all mean performance measures of interest, for a class of cyclic queuing networks (CQNs). The number of nodes K, and the closed chain population N, are finite but arbitrary. Each node processes type t customers from the single closed chain, and type o customers from a dedicated open ...
Joseph S. Kaufman, Wing Shing Wong
openaire   +1 more source

Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks

European Journal of Operational Research, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Reinaldo Morabito, Maurício C. de Souza, Mariana Vazquez   +2 more
openaire   +2 more sources

Delay bounds for approximate maximum weight matching algorithms for input queued switches

Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2003
Input Queued (IQ) switch architecture has been of interest due to its low memory bandwidth requirement. A scheduling algorithm is required to schedule the transfer of packets through cross-bar switch fabric at every time slot. The performance, that is throughput and delay, of a switch depends on the scheduling algorithm.
Devavrat Shah, Milind Kopikare
openaire   +1 more source

A queuing approximation method for capacity planning of emergency department with time-varying demand

2014 IEEE International Conference on Automation Science and Engineering (CASE), 2014
In this paper, we develop a mix integer programming model for daily personnel scheduling for emergency departments with non-stationary patient arrival over time. The goal is to minimize the total expected waiting time which is estimated by a combination of steady-state analysis of M/M/s queues and inventory-like flow balance equations.
Qiang Liu, Xiaolan Xie 0001, Ran Liu 0005   +2 more
openaire   +1 more source

Diffusion approximations and variation of conditions of ergodicity under identical queuing

Russian Mathematical Surveys, 1997
A tandem network is considered, where each customer has identical service times at all stations. It is assumed that input and service times are independent and that input satisfies only an assumption which is formulated in a serial scheme. Service times are i.i.d. and some conditions for the tail of the distibution are assumed. Under high load at first
openaire   +1 more source

ON APPROXIMATION WITH TRUNCATIONS FOR THE NONSTATIONARY QUEUING MODEL

Systems and Means of Informatics, 2021
openaire   +1 more source

Information Theoretic Approximations for M/G/1 Queuing Systems

1980
The behavior of single server queuing systems is characterized by various “performance distributions”, including distributions of queue length, waiting time, residence time, busy period, number served in a busy period, etc. In principle, if the arrival and service time distributions are known exactly, then these performance distributions can be ...
openaire   +1 more source

Designing an intelligent emergency response system to minimize the impacts of traffic incidents: a new approximation queuing model

International Journal of Urban Sciences, 2022
Hamid R Sayarshad
exaly  

The use of decomposition techniques for the analysis of open restricted queuing networks

Operations Research Letters, 1982
Peter C Bell
exaly