Decomposition of Queueing Networks with Dependent Service and Negative Customers

Authors:
P. P. Bocharov;E. V. Gavrilov;C. D'apice;A. V. Pechinkin
Affiliations:
Peoples Friendship University, Moscow, Russia;Peoples Friendship University, Moscow, Russia;University of Salerno, Salerno, Italy;Institute of Informatics Problems, Russian Academy of Sciences, Moscow, Russia
Venue:
Automation and Remote Control
Year:
2004

Citing 3
Cited 3

Introduction to queueing networks

Introduction to queueing networks
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
G-Networks: Development of the Theory of Multiplicative Networks

Automation and Remote Control

Exponential Queuing Network with Dependent Servicing, Negative Customers, and Modification of the Customer Type

Automation and Remote Control
An initiative for a classified bibliography on G-networks

Performance Evaluation
Bibliography on G-networks, negative customers and applications

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Queueing networks with negative customers (G-networks) and dependent service at different nodes are studied. Every customer arriving at the network is defined by a set of random parameters: his route over the network (a sequence of nodes visited by the customers), route length, and volume and service length of the customer at every stage of the route. For G-networks, which are the analogs of BCMP-networks, the multidimensional stationary distribution of the network state probabilities is shown to be representable in product form.