Packet delay in the case of a multiple-access stack algorithm
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.
- Packet delay caused by stack-algorithm for overcritical income flow
- Packet delay and queue length for statistical multiplexers with low-speed access lines
- Allowance for packet propagation time in random multiple access
- Packet delay in models of data networks
- scientific article; zbMATH DE number 2163016
- Delay performance in random-access networks
- An random multiple access algorithm with finite stack and packet loss
- Random multiple access of impatient packets
- Packet delay caused by stack-algorithm for overcritical income flow
- Lower bound on delay in an RMA system with N-conflicts and errors
- An random multiple access algorithm with finite stack and packet loss
- Packet transmission using a blocked unmodified random multiple access stack-algorithm
- Differential AR algorithm for packet delay prediction
- Calculation of service delays in multiple-access systems with conflict resolution
- The blocked stack algorithm of RMA in a network with a finite number of stations
- Packet delay under the golden ratio weighted TDM policy in a multiple-access channel
- Delay analysis of the n-ary stack random-access algorithm
- One stochastic process and its application to multiple access in supercritical region
- On tries, contention trees and their analysis
- Random multiple access of impatient packets
This page was built for publication: Packet delay in the case of a multiple-access stack algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800288)
