Yu. V. Malinkovskii, “Jackson networks with single-line nodes and limited sojourn or waiting times”, Avtomat. i Telemekh., 2015, Issue 4,Pages <nobr>67

This article is cited in 5 papers

Stochastic Systems, Queuing Systems

Jackson networks with single-line nodes and limited sojourn or waiting times

Yu. V. Malinkovskii^ab

^a Skorina Gomel State University, Gomel, Belarus
^b Tomsk State National Research University, Tomsk, Russia

Abstract: We consider an exponential queueing network with single-line nodes that differs from a Jackson network only in that the time claims sojourn in the system (waiting time for the servicing) at the network's nodes is limited by an exponentially distributed random value. Claims serviced at nodes and claims that have not finished servicing (that exceeded maximal waiting time) move along the network according to different routing matrices. We prove a theorem that generalizes Jackson's theorem for open and closed networks.

Presented by the member of Editorial Board: A. I. Lyakhov

Received: 18.04.2013