One stochastic process and its application to multiple access in supercritical region

A discrete-argument stochastic process is presented. The process is a generalization of the Cinlar (1975) semiregenerative process and process /spl eta/(t) given in Tsybakov (1993). For this process, the theorem, which is similar to the Smith regenerative process theorem, is given. We use this theorem to find the transmission rate and mean packet delay for stack and part-and-try random multiple access algorithms in their supercritical regions. For the part-and-try algorithm, the results are new. For the stack algorithm, we give a new method of finding the rate and delay.