Search

A model of a queueing network is proposed which leads to a stochastic equation generalizing a standard Lindley equation for a single FCFS server. We study the problem of the existence and uniqueness of a stationary solution to this equation and its connection with random processes on a Cayley tree.

A model of centralized symmetric message-switched networks is considered, where the messages having a common address must be served in the central node in the order which corresponds to their epochs of arrival to the network. The limitN → ∞ is discussed, whereN is the branching number of the network graph. This procedure is inspired by an analogy with statistical mechanics (the mean-field approximation). The corresponding limit theorems are established and the limiting probability distribution for the network response time is obtained. Properties of this distribution are discussed in terms of an associated boundary problem.

R.L. Dobrushin (1929-1995) made substantial contributions to Queueing Network Theory (QNT). A review of results from QNT which arose from his ideas or were connected to him in other ways is given. We also comment on various related open problems.

One gives a limit theorem for the joint distribution of the stationary waiting times of customers in the queues of a multiphase queueing system, functioning in a heavy traffic regime. One proves that the joint distribution function of the waiting times is a solution of a problem with a directional derivative for an elliptic differential equation in a polyhedral angle.