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

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

Citing 6
Cited 2

Introduction to queueing networks

Introduction to queueing networks
G-networks with multiple classes of negative and positive customers

Theoretical Computer Science
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
G-Networks with resets

Performance Evaluation
G-Networks: Development of the Theory of Multiplicative Networks

Automation and Remote Control
Decomposition of Queueing Networks with Dependent Service and Negative Customers

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

The open exponential queuing network with negative customers (G-network) was considered.For each arriving customer, given was a set of its random parameters such as the route defining the sequence of network nodes passed by the customer, route length, size, and servicing duration at each stage of the route. It was assumed that the negative customer arriving to the sth node with the probabilities ωs and ωs+ either kills the positive customer in a randomly chosen server or does not affect it at all and with the probability ωs– =1 – ωs – ωs+ transforms it into a negative customer which after an exponentially distributed time arrives to the s′th node with the given probability. The multidimensional stationary probability distribution of the network states was proved to be representable in the multiplicative form.