Title :
Random infinite trees and supercritical behavior of collision resolution algorithms
Author :
Jacquet, Philippe
Author_Institution :
INRIA, LeChesnay, France
fDate :
7/1/1993 12:00:00 AM
Abstract :
An analytical evaluation is given of the behavior of the free access stack algorithm when the input load, a Poisson flow of λ packet per slot, is above the maximum throughput achievable by the protocol (within 0.360177 packet per slot) under an infinite population model. In particular, the marginal output stream that the system sustains on the channel is analytically and quantitatively derived
Keywords :
multi-access systems; packet switching; protocols; telecommunication channels; trees (mathematics); Poisson flow; collision resolution algorithms; free access stack algorithm; infinite population model; marginal output stream; multiple access channels; protocol; random infinite trees; supercritical behavior; telecommunication channels; Access protocols; Communication networks; Error correction; Ethernet networks; Load flow analysis; Mathematical model; Packet switching; Performance analysis; Steady-state; Throughput;
Journal_Title :
Information Theory, IEEE Transactions on
