Random infinite trees and supercritical behavior of collision resolution algorithms

DOI10.1109/18.243471MaRDI QIDQ4307359zbMATH OpenOpenAlexFDO

Authors Philippe Jacquet

Publication date 4 October 1994

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.243471

zbMATH Keywords

generating functionsthroughputmultiple-access channelcollision resolution

Mathematics Subject Classification ID

Communication theory (94A05) Network design and communication in computer systems (68M10)

Recommendations

• Random recursive trees: a boundary theory approach
• Random ultrametric trees and applications
• Supercritical percolation on large scale-free random trees
• On tail bounds for random recursive trees
• Schröder's problems and scaling limits of random trees
• scientific article; zbMATH DE number 975608
• Percolation on random recursive trees
• scientific article; zbMATH DE number 953132
• Tree limits and limits of random trees
• On hitting times of random walks on trees

Cited in

(4)

• Analysis of tree algorithm for collision resolution
• Dynamic tree algorithms
• One stochastic process and its application to multiple access in supercritical region
• On a tree collision resolution algorithm in presence of capture

This page was built for publication: Random infinite trees and supercritical behavior of collision resolution algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4307359)