Analysis of contention tree algorithms

DOI10.1109/18.868486MaRDI QIDQ4545806zbMATH OpenOpenAlexFDO

Authors Marc J. M. de Jong, A. J. E. M. Janssen

Publication date 14 May 2003

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

Full work available at URL https://research.tue.nl/nl/publications/4cd7627c-2fb5-4ca7-a731-5e6612735742

zbMATH Keywords

broadcast communicationcollision resolutioncontention tree algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• An analysis of a contention resolution algorithm. Another approach
• Analytic properties of multiple-access trees
• Analysis of a stack algorithm for random multiple-access communication
• <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
• An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels

Cited in

(10)

• An analysis of a contention resolution algorithm. Another approach
• Dynamic tree algorithms
• The M/M/1 queue with gated random order of service
• Analysis of \(d\)-ary tree algorithms with successive interference cancellation
• Analytic properties of multiple-access trees
• An analytic approach to the asymptotic variance of trie statistics and related structures
• scientific article; zbMATH DE number 4022327 (Why is no real title available?)
• On tries, contention trees and their analysis
• Interrelation of characteristics of blocked RMA stack algorithms
• scientific article; zbMATH DE number 2088525 (Why is no real title available?)

This page was built for publication: Analysis of contention tree algorithms

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