K Salah - Applied mathematics and computation, 2011 - Elsevier
This paper presents modeling and analysis of a finite-queuing system of a server with two stages of service. In real life, such systems may represent typical network servers or client …
FR Moore - IBM Journal of Research and Development, 1972 - ieeexplore.ieee.org
A simplification and extension to Gordon and Newell's approach to closed queuing networks is derived. The equations, valid for exponential servers, with one server being a multiserver …
M Reiser, H Kobayashi - … of the 7th Asilomar Conference on …, 1973 - hisashikobayashi.com
A class of exponential server queuing networks, called semiclosed networks, is introduced. In a semiclosed network, the number of customers К is a random variable such that K_< …
M Andersson, J Cao, M Kihl… - … Conference on Internet …, 2003 - portal.research.lu.se
Performance modeling is an important topic in capacity planning and overload control for web servers. We present a queueing model of an Apache web server that uses bursty arrival …
We present the results of a parametric study of the buffer size needed to prevent overflow or loss in single and multiple server systems where data arrivals or service times are" bursty"," …
Queuing network models are commonly used to analyze the performance of computer system. Unfortunately, the class of queuing network models which can be exactly analyzed …
EK Bowdon - IEEE Transactions on Computers, 1969 - ieeexplore.ieee.org
Priority Assignment in a Network of Computers Page 1 IEEE TRANSACTIONS ON COMPUTERS, VOL. C-18, NO. 11, NOVEMBER 1969 Priority Assignment in a Network of Computers …
RJT Morris - The Bell System Technical Journal, 1981 - ieeexplore.ieee.org
Priority service disciplines are widely used in computer and communications systems. Many such systems can be modeled by queuing networks, but presently developed theory does …
RJ Walstra - Proceedings of the 1985 ACM SIGMETRICS …, 1985 - dl.acm.org
We will propose a new, iterative method for approximately analyzing closed networks of queues with nonexponential service time distributions and FCFS scheduling. Our method is …