Network of Single-Server Queues with Dependent Service Times

Authors:
Victor A. Ivnitski
Affiliations:
All-Russia Science Research Institute of Railway Transport, 10, street 3rd Mitischinskaya, 129851 Moscow, Russia ivnit@iitp.ru
Venue:
Queueing Systems: Theory and Applications
Year:
2001

Citing 4
Cited 0

Introduction to queueing theory (2nd ed)

Introduction to queueing theory (2nd ed)
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
Product Form and Local Balance in Queueing Networks

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

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A network of single-server nodes fed by customers of several classes is considered. Each customer is equipped with the random work to be done for completing service. The distribution of this work and the rate of its decreasing during the service depend on the node, the class of the customer, the queue contents and the residual work loads of the customers at the node. The service discipline is LCFS preemptive-resume. For both open and closed network, the stationary distribution is derived. In general, this distribution is not a product form. For the open network, sufficient conditions yielding the product form are given. For both open and closed network, sufficient invariance conditions are found.