RUS  ENG
Full version
JOURNALS // Problemy Fiziki, Matematiki i Tekhniki (Problems of Physics, Mathematics and Technics) // Archive

PFMT, 2018 Issue 1(34), Pages 64–68 (Mi pfmt555)

This article is cited in 1 paper

MATHEMATICS

Queueing networks with finite number of flows of negative customers and with limited sojourn time

Yu. V. Malinkovskya, N. N. Borodinb

a F. Scorina Gomel State University
b P.O. Sukhoi Gomel State Technical University

Abstract: The exponential queueing network with the usual positive and so called negative customers is considered. The sojourn time of customers in the network nodes is limited by the random variable which conditional distribution is exponential when customer quality in node is fixed. The customers serviced in nodes and customers leaving the nodes when sojourn time is completed can stay positive, become negative or leave the network in accordance with different routing matrixes.

Keywords: network, negative customer, limited sojourn time.

UDC: 519.21

Received: 26.01.2018



© Steklov Math. Inst. of RAS, 2026