Queuing approximation - Open Access .click

Results 261 to 270 of about 588,874 (281)

Some of the next articles are maybe not open access.

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 Sayarshad
exaly

Application of Queuing System using Fuzzy Approximation Method in a Departmental Store

2022
A José Anand
exaly

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

Operations Research Letters, 1982
Peter C Bell
exaly

Dynamic Queuing for Approximate Fairness in Programmable Shared Memory Switches