Upper Bound for the Delay in a Multiple-Random-Access System with a Splitting Algorithm

Papers [R. G. Gallager, Proc. AFOSR Workshop in Commun. Theory Appl., 1978, pp. 74–76; B. S. Tsybakov and V. A. Mikhailov, Probl. Peredachi Inf., 1980, vol. 16, no. 4, pp. 65–79] propose a multiple-random-access algorithm which, in a sense, has been a record-setter in terms of transmission rate up to now. In this paper we obtain an upper bound for the mean-session packet-transmission delay for this algorithm.