English
Related papers

Related papers: Measure-valued stochastic recurrences and the stab…

200 papers

In this paper, we generalize a positive recurrence criterion for multidimensional discrete-time Markov chains over countable state spaces due to Rosberg (JAP, Vol. 17, No. 3, 1980). We revisit the stability analysis of well known…

Information Theory · Computer Science 2009-06-08 Sayee C. Kompalli , Ravi R. Mazumdar

In this paper, we present a stability criterion for Processor Sharing queues, in which the throughput may depend on the number of customers in the system (in such cases such as interferences between the users). Such a system is represented…

Probability · Mathematics 2008-03-18 Pascal Moyal

In this paper, we characterize the stability region of multi-queue multi-server (MQMS) queueing systems with stationary channel and packet arrival processes. Toward this, the necessary and sufficient conditions for the stability of the…

Information Theory · Computer Science 2015-03-19 Hassan Halabian , Ioannis Lambadaris , Chung-Horng Lung

This paper concerns the recurrence structure of the infinite server queue, as viewed through the prism of the maximum dater sequence, namely the time to drain the current work in the system as seen at arrival epochs. Despite the importance…

Probability · Mathematics 2026-01-12 Sergey Foss , Peter Glynn

We study the Multiserver-Job Queuing Model (MJQM) with general independent arrivals and service times under FCFS scheduling, using stochastic recurrence equations (SREs) and ergodic theory. We prove the monotonicity and separability…

Performance · Computer Science 2026-01-29 Francois Baccelli , Diletta Olliaro , Marco Ajmone Marsan , Andrea Marin

We consider an infinite server queue where the arrival and the service rates are both modulated by a stochastic environment governed by an $S$-valued stochastic process $X$ that is ergodic with a limiting measure $\pi\in \mathcal{P}(S)$.…

Probability · Mathematics 2024-10-30 Abhishek Pal Majumder

In this paper, we present a condition to obtain instability for a class of queueing networks where the arrival rates in each server are constant and the departure rate in each server is a decreasing function of the queue lengths of other…

Probability · Mathematics 2023-08-01 Pierre Popineau , Seva Shneer

We consider stability and network capacity in discrete time queueing systems. Relationships between four common notions of stability are described. Specifically, we consider rate stability, mean rate stability, steady state stability, and…

Networking and Internet Architecture · Computer Science 2010-03-18 Michael J. Neely

Given a marked renewal point process (assuming that the marks are i.i.d.) we say that an unbounded region is stable if it contains finitely many points of the point process with probability one. In this paper we provide algorithms that…

Probability · Mathematics 2012-12-27 Jose Blanchet , Jing Dong

This paper considers a parallel system of queues fed by independent arrival streams, where the service rate of each queue depends on the number of customers in all of the queues. Necessary and sufficient conditions for the stability of the…

Probability · Mathematics 2010-01-12 Sem Borst , Matthieu Jonckheere , Lasse Leskelä

In this paper we show that in a multiclass Markovian network with unit rate servers, the condition that the average load $\rho$ at every server is less than unity is indeed sufficient for the stability or positive recurrence for \emph{any}…

Networking and Internet Architecture · Computer Science 2010-06-24 Sayee C. Kompalli , Ravi R. Mazumdar

This paper presents a new condition for the existence of optimal stationary policies in average-cost continuous-time Markov decision processes with unbounded cost and transition rates, arising from controlled queueing systems. This…

Optimization and Control · Mathematics 2015-04-23 Cao Ping , Xie Jingui

Applications of stochastic models often involve the evaluation of steady-state performance, which requires solving a set of balance equations. In most cases of interest, the number of equations is infinite or even uncountable. As a result,…

Optimization and Control · Mathematics 2022-04-08 Shukai Li , Sanjay Mehrotra

We consider a single-server cyclic polling system with three queues where the server follows an adaptive rule: if it finds one of queues empty in a given cycle, it decides not to visit that queue in the next cycle. In the case of limited…

Probability · Mathematics 2013-03-20 Natalia Chernova , Sergey Foss , Bara Kim

The fluid model has proven to be one of the most effective tools for the analysis of stochastic queueing networks, specifically for the analysis of stability. It is known that stability of a fluid model implies positive (Harris) recurrence…

Probability · Mathematics 2007-05-23 David Gamarnik , John Hasenbein

In this paper, we characterize the network stability region (capacity region) of multi-queue multi-server (MQMS) queueing systems with stationary channel distribution and stationary arrival processes. The stability region is specified by a…

Optimization and Control · Mathematics 2011-12-05 Hassan Halabian , Ioannis Lambadaris , Chung-Horng Lung

We present the explicit construction of a stable queue with several servers and impatient customers, under stationary ergodic assumptions. Using a stochastic comparison of the (multivariate) workload sequence with two monotonic stochastic…

Probability · Mathematics 2017-11-20 Pascal Moyal

We analyze a class of stochastically stable quenched measures. We prove that stochastic stability is fully characterized by an infinite family of zero average polynomials in the covariance matrix entries.

Mathematical Physics · Physics 2009-11-10 Alessandra Bianchi , Pierluigi Contucci , Andreas Knauf

It is known that state-dependent, multi-step Lyapunov bounds lead to greatly simplified verification theorems for stability for large classes of Markov chain models. This is one component of the "fluid model" approach to stability of…

Optimization and Control · Mathematics 2012-05-18 Serdar Yüksel , Sean P. Meyn

We consider multi-class single-server queueing networks that have a product form stationary distribution. A new limit result proves a sequence of such networks converges weakly to a stochastic flow level model. The stochastic flow level…

Probability · Mathematics 2009-12-15 N. S. Walton
‹ Prev 1 2 3 10 Next ›