Exponential queuing network with dependent servicing, negative customers, and modification of the customer type

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.

Publisher
Maik Nauka Publishing / Springer SBM
Number of issue
7
Language
English
Pages
1066-1088
Status
Published
Volume
65
Year
2004
Organizations
  • 1 Peoples Friendship University, Moscow, Russian Federation
  • 2 Institute of Informatics Problems, Russian Academy of Sciences, Moscow, Russian Federation
Keywords
Customer satisfaction; Markov processes; Probability distributions; Random processes; Routers; Telecommunication services; Theorem proving; Equation system; Exponential queueing networks; Multiplicative networks; Negative customers; Queueing networks
Share

Other records