On the correlation of sojourn times in open networks of exponential multiserver queues

Authors:
Hans Daduna;Ryszard Szekli
Affiliations:
Institut für Mathematische Stochastik, Fachbereich Mathematik, Universität Hamburg, Bundestrasse 55, D-20146 Hamburg, Germany;Institut für Mathematische Stochastik, Fachbereich Mathematik, Universität Hamburg, Bundestrasse 55, D-20146 Hamburg, Germany
Venue:
Queueing Systems: Theory and Applications
Year:
1999

Citing 9
Cited 2

Traffic processes in queueing networks: a Markov renewal approach

Traffic processes in queueing networks: a Markov renewal approach
Heavy-traffic analysis of the sojourn time in a three node Jackson network with overtaking

Queueing Systems: Theory and Applications
Heavy traffic analysis of the sojourn time in tandem queues with overtaking

SIAM Journal on Applied Mathematics
Sojourn time distributions in non-product queueing networks

Frontiers in queueing
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
The Cycle Time Distribution of Exponential Cyclic Queues

Journal of the ACM (JACM)
The Time for a Round Trip in a Cycle of Exponential Queues

Journal of the ACM (JACM)
The Product Form for Sojourn Time Distributions in Cyclic Exponential Queues

Journal of the ACM (JACM)
The Distribution of Sojourn Times in a Queueing Network with Overtaking: Reduction to a Boundary Problem

Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation

An approximate analysis of expected cycle time in business process execution

BPM'06 Proceedings of the 2006 international conference on Business Process Management Workshops
Dependence structure of sojourn times via partition separated ordering

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the joint distribution of successive sojourn times of customers traversing a path in Jackson network. It is shown in a general setting that sojourn times exhibit positive dependence. This especially applies to paths which admit overtaking due to the network topology as well as due to the internal node structure.