Bounds for the mean system size in M/G/1/K-queues
نویسندگان
چکیده
منابع مشابه
the search for the self in becketts theatre: waiting for godot and endgame
this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...
15 صفحه اولPerformance bounds for queues via generating functions
Modern applications, e.g. vlsi manufacturing, give rise to complicated queueing models, often of the re-entrant type. Their complexity, together with implications of their performance, renewed interest in their performance and the computation of good control (e.g. scheduling) policies. Recent work concentrated on computable (mostly linear) performance bounds. We show that the linear bounds can ...
متن کاملError Bounds for Perturbing Nonexponential Queues
A general framework is provided to derive analytic error bounds for the effect of perturbations and inaccuracies of nonexponential service or arrival distributions in singleand multi-server queues. The general framework is worked out in detail for the three types of finite or infinite buffer queues: GI/G/1/N , M/G/c/N , and GI/M/c/N . First, for the standard GI/G/1/N queue, it is illustrated ho...
متن کاملBounds For Markovian Queues With Possible Catastrophes
We consider a general Markovian queueing model with possible catastrophes and obtain new and sharp bounds on the rate of convergence. Some special classes of such models are studied in details, namely, (a) the queueing system with S servers, batch arrivals and possible catastrophes and (b) the queueing model with “attracted” customers and possible catastrophes. A numerical example illustrates t...
متن کاملSharp Bounds for Seiffert Mean in Terms of Contraharmonic Mean
and Applied Analysis 3 2. Proof of Theorem 1.1 Proof of Theorem 1.1. Let λ 1 √ 4/π − 1 /2 and μ 3 √3 /6. We first proof that the inequalities T a, b > C λa 1 − λ b, λb 1 − λ a , 2.1 T a, b < C ( μa ( 1 − μb, μb 1 − μa 2.2 hold for all a, b > 0 with a/ b. From 1.1 and 1.2 we clearly see that both T a, b and C a, b are symmetric and homogenous of degree 1. Without loss of generality, we assume th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1995
ISSN: 0377-0427
DOI: 10.1016/0377-0427(95)00012-7