Critically loaded queueing models that are throughput suboptimal
نویسندگان
چکیده
منابع مشابه
Critically Loaded Queueing Models That Are Throughput Suboptimal
This paper introduces and analyzes the notion of throughput suboptimality for many-server queueing systems in heavy traffic. The queueing model under consideration has multiple customer classes, indexed by a finite set I, and heterogenous, exponential servers. Servers are dynamically chosen to serve customers, and buffers are available for customers waiting to be served. The arrival rates and t...
متن کاملCritically Loaded Queueing Models That Are Throughput Suboptimal1 by Rami Atar
This paper introduces and analyzes the notion of throughput suboptimality for many-server queueing systems in heavy traffic. The queueing model under consideration has multiple customer classes, indexed by a finite set I, and heterogenous, exponential servers. Servers are dynamically chosen to serve customers, and buffers are available for customers waiting to be served. The arrival rates and t...
متن کاملMULTIPLICATION MODULES THAT ARE FINITELY GENERATED
Let $R$ be a commutative ring with identity and $M$ be a unitary $R$-module. An $R$-module $M$ is called a multiplication module if for every submodule $N$ of $M$ there exists an ideal $I$ of $R$ such that $N = IM$. It is shown that over a Noetherian domain $R$ with dim$(R)leq 1$, multiplication modules are precisely cyclic or isomorphic to an invertible ideal of $R$. Moreover, we give a charac...
متن کاملTandem Queueing Systems Maximum Throughput Problem
In this paper we consider the problem of maximum throughput for tandem queueing system. We modeled this system as a Quasi-Birth-Death process. In order to do this we named level the number of customers waiting in the first buffer (including the customer in service) and we called phase the state of the remining servers. Using this model we studied the problem of maximum throughput of the system:...
متن کاملCritically loaded k-limited polling systems
We consider a two-queue polling model with switch-over times and k-limited service (serve at most ki customers during one visit period to queue i) in each queue. The major benefit of the k-limited service discipline is that it besides bounding the cycle time effectuates prioritization by assigning different service limits to different queues. System performance is studied in the heavy-traffic r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2009
ISSN: 1050-5164
DOI: 10.1214/08-aap551