Packet delay in the case of a multiple-access stack algorithm (Q800288)

The paper deals with the delay analysis of packets in a system with random multiple-access. The authors consider the system in the case of the stack algorithm of multiple-access. The analysis is carried out under the assumption that the arrival stream of packets is memoryless. Using the stack algorithm the authors find the probability distributions of virtual and active packet delays. Additionally the average values as well as other moments of these delays are found. According to the considered assumptions the system states are described by a homogeneous Markov chain. To calculate the values of the virtual delay moments, the authors introduce the generation functions. Next, introducing new definitions, like: transmission period, collisionless period or collision multiplicity the authors give formulas for the active delay. The theoretical analysis is completed by the results obtained in the case of Poisson arrival process.