Rate stability and output rates in queueing networks with shared resources

Authors:
M. Jonckheere;R. D. van der Mei;W. van der Weij
Affiliations:
CWI, Probability and Stochastic Networks, Amsterdam, The Netherlands;CWI, Probability and Stochastic Networks, Amsterdam, The Netherlands and VU University, Faculty of Sciences, Amsterdam, The Netherlands;CWI, Probability and Stochastic Networks, Amsterdam, The Netherlands
Venue:
Performance Evaluation
Year:
2010

Citing 5
Cited 3

A decision support system for tuning Web servers in distributed object oriented network architectures

ACM SIGMETRICS Performance Evaluation Review
A queueing analysis of max-min fairness, proportional fairness and balanced fairness

Queueing Systems: Theory and Applications
Bandwidth-sharing networks in overload

Performance Evaluation
Stability of Parallel Queueing Systems with Coupled Service Rates

Discrete Event Dynamic Systems
On pathwise behavior of queues

Operations Research Letters

Dynamic server allocation for unstable queueing networks with flexible servers

Queueing Systems: Theory and Applications
Product-form results for two-station networks with shared resources

Performance Evaluation
Separation of timescales in a two-layered network

Proceedings of the 24th International Teletraffic Congress

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by a variety of applications in information and communication systems, we consider queueing networks in which the service rate at each of the individual nodes depends on the state of the entire system. The behavior of these types of networks is fundamentally different from classical queueing networks, where the service rate at each queue is usually assumed to be independent of the state of the other nodes. We study the per-queue rate stability and output rates for a class of networks with a general capacity allocation function. More specifically, we derive necessary conditions for per-queue rate stability, and give bounds for the per-node output rate and asymptotic growth rates, under mild assumptions on the allocation function. For a set of parallel queues, we further prove the convergence of the output rates (for almost all input parameters) to easily computable values and we give a sharp characterization of the per-queue rate stability. The results provide new intuition and fundamental insight into the stability and throughput behavior of queueing networks with shared resources.