Product-form results for two-station networks with shared resources

Authors:
W. Van Der Weij;N. M. Van Dijk;R. D. Van Der Mei
Affiliations:
CWI, Advanced Communication Networks, P.O.Box 94079, 1090 GB Amsterdam, The Netherlands;UVA, University of Amsterdam, Department of Econometrics, Roeterstraat 11, 1018 WB Amsterdam, The Netherlands;CWI, Advanced Communication Networks, P.O.Box 94079, 1090 GB Amsterdam, The Netherlands and VU University Amsterdam, Faculty of Sciences, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands
Venue:
Performance Evaluation
Year:
2012

Citing 19
Cited 0

The Stochastic Rendezvous Network Model for Performance of Synchronous Client-Server-like Distributed Software

IEEE Transactions on Computers
Web server performance measurement and modeling techniques

Performance Evaluation - Special issue on tools for performance evaluation
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
A Characterization of Product-Form Queuing Networks

Journal of the ACM (JACM)
A decision support system for tuning Web servers in distributed object oriented network architectures

ACM SIGMETRICS Performance Evaluation Review
Impact of fairness on Internet performance

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Insensitivity in processor-sharing networks

Performance Evaluation
The Method of Layers

IEEE Transactions on Software Engineering
A Multilayer Client-Server Queueing Network Model with Synchronous and Asynchronous Messages

IEEE Transactions on Software Engineering
Turning back time in Markovian process algebra

Theoretical Computer Science
Compositional reversed Markov processes, with applications to G-networks

Performance Evaluation
Separable equilibrium state probabilities via time reversal in Markovian process algebra

Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
A queueing analysis of max-min fairness, proportional fairness and balanced fairness

Queueing Systems: Theory and Applications
Layered Bottlenecks and Their Mitigation

QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Stability of Parallel Queueing Systems with Coupled Service Rates

Discrete Event Dynamic Systems
Steady state approximations of limited processor sharing queues in heavy traffic

Queueing Systems: Theory and Applications
Dynamic thread assignment in web server performance optimization

Performance Evaluation
Rate stability and output rates in queueing networks with shared resources

Performance Evaluation
Law of Large Number Limits of Limited Processor-Sharing Queues

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Queueing networks are studied with two stations: either in tandem or in parallel, and with a common service resource shared among the two stations. First, a necessary and sufficient criterion, called adjoint reversibility, is provided to decide whether the system possesses a product form or not. This criterion unifies both the parallel (a reversible) and the tandem (a non-reversible) system in one product-form theorem. Next, the criterion is applied separately for the parallel and tandem system to obtain a number of new product-form examples which also includes non-balanced capacity sharing. Despite, but also due to, the different parallel and tandem mechanisms we observe that for certain examples the product form has the same structure, while for others there are essential differences. In addition, it is also proven that several models cannot have a product-form result. The results provide new insights and a step forward in understanding the behavior of multi-layered queueing networks in which resources are shared among stations.