Upper Bounds on Performance Measures of Heterogeneous Queues
نویسندگان
چکیده
منابع مشابه
Upper Bounds on Performance Measures of Heterogeneous M/M/c Queues
In many real-life queueing systems, the servers are often heterogeneous, namely they work at different rates. This paper provides a simple method to compute tight upper bounds on two important performance measures of single-class heterogeneous multi-server Markovian queueing systems, namely the average number in queue and the average waiting time in queue. This method is based on an expansion o...
متن کامل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 ...
متن کاملUpper bounds on the solutions to n = p+m^2
ardy and Littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. They believed that the number $mathcal{R}(n)$ of such representations for $n = p+m^2$ is asymptotically given by begin{equation*} mathcal{R}(n) sim frac{sqrt{n}}{log n}prod_{p=3}^{infty}left(1-frac{1}{p-1}left(frac{n}{p}right)right), end{equation*} where $p$ is a prime, $m$ is a...
متن کاملRetrial Queues for Performance Modelling and Evaluation of Heterogeneous Networks
In this paper a single server retrial queue with a finite number of heterogeneous sources of calls is investigated. It is assumed when a given source is idle it will generate a primary call after an exponentially distributed time. If the server is free at the time of the request’s arrival then the call starts to be served. The service time is also exponentially distributed. During the service t...
متن کاملThe Upper Bounds for Performance Measures of a Finite Capacity Polling System under ATM Bursty Arrivals
This paper focuses on the upper bounds for both the mean delay and the loss probability that bursty arrivals incur in an ATM switching system which can be modeled as a finite capacity polling system with nonexhaustive cyclic service. The arrival process to each input port of the system is assumed to be bursty and is modeled by an Interrupted Bernoulli Process(IBP). We compute the upper bounds f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2011
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2011/702834