<tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
From MaRDI portal
Publication:3682375
DOI10.1109/TIT.1985.1057013zbMath0566.94001OpenAlexW2077662775MaRDI QIDQ3682375
Peter Mathys, Philippe Flajolet
Publication date: 1985
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1985.1057013
functional equationsPoisson processrecursive algorithmtree algorithmsslotted ALOHA systemchannel-access protocolscontention-based random- access systemspacket-delay analysisthroughput characteristics
Related Items (19)
A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events ⋮ Distances in random digital search trees ⋮ On a tree collision resolution algorithm in presence of capture ⋮ The evaluation of an alternative sum with applications to the analysis of some data structures ⋮ On the balance property of Patricia tries: External path length viewpoint ⋮ Analytical depoissonization and its applications ⋮ An analytic approach to the asymptotic variance of trie statistics and related structures ⋮ On tries, contention trees and their analysis ⋮ A stack protocol of CTM type with quartet feedback ⋮ On the asymptotics of the average CRI length of the slotted ALOHA collision resolution algorithm ⋮ Mellin transforms and asymptotics: Harmonic sums ⋮ A note on binomial recurrences arising in the analysis of algorithms ⋮ How to select a loser ⋮ The average CRI-length of a controlled ALOHA collision resolution algorithm ⋮ Dynamic tree algorithms ⋮ The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects ⋮ Throughput and delay analysis of an opportunistic tree algorithm ⋮ On The variance of the extremal path length in a symmetric digital trie ⋮ Sorting algorithms for broadcast communications: mathematical analysis.
This page was built for publication: <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
