We develop a methodology for studying ''large deviations type'' questions. Our approach does not require that the large deviations principle holds, and is thus applicable to a larg class of systems. We study a system of queues with exponential servers, which share an arrival stream. Arrivals are...

In this paper, we consider deterministic (both fluid and discrete) polling systems with N queues with infinite buffers and we show how to compute the best polling sequence (minimizing the average total workload). With two queues, the best polling sequence is always periodic when the system is...

A set of jobs need to be served by a server which can serve only one job at a time. Jobs have processing times and incur waiting costs (linear in their waiting time). The jobs share their costs through compensation using monetary transfers. In the first part, we provide an axiomatic...

In this paper we introduce multi-server queueing systems that can be considered as extensions of conventional M/M/s queue to fractional number of servers. We show that the extended Erlang's delay function can be used to calculate delay probabilities for such systems. This approach enables the...

Using the generalized Lorden inequality, new conditions for polynomial convergence were obtained for processes describing the operation of complex queuing networks with unreliable nodes and a random structure

The procedure for studying the structure of real networks is described. The paper considers the capabilities of the Wolfram Mathematica package and the Python programming language, in particular, the netlib library, for collecting and analyzing information about real systems (for example,...