RUS  ENG
Full version
JOURNALS // Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika // Archive

Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2016 Number 3, Pages 39–42 (Mi vmumm151)

This article is cited in 1 paper

Short notes

System with priority queues and unreliable server

S. Zh. Aibatov

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Abstract: A single server queue with an unreliable server and priority customers is considered. The limit distribution of the number of ordinary customers in the system is obtained.

Key words: unreliable server, priorities, completion time.

UDC: 511

Received: 06.03.2015


 English version:
Moscow University Mathematics Bulletin, Moscow University Måchanics Bulletin, 2016, 71:3, 111–114

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026