Analytic properties of multiple-access trees

DOI10.1109/TIT.1985.1057015MaRDI QIDQ3676044zbMATH OpenFDO

Authors Michael Kaplan, Eugene Gulko

Publication date 1985

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

zbMATH Keywords

tree searchcollision detectionreservation protocolchannel feedbackmultiaccess protocolrandom-access channel

Mathematics Subject Classification ID

Communication theory (94A05) Searching and sorting (68P10) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• On queueing problems in random-access communications
• Analysis of contention tree algorithms
• <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
• scientific article; zbMATH DE number 3874593
• Random multiple access in binary feedback channel

Cited in

(7)

• scientific article; zbMATH DE number 3874593 (Why is no real title available?)
• On queueing problems in random-access communications
• scientific article; zbMATH DE number 4022327 (Why is no real title available?)
• <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
• Analysis of contention tree algorithms
• On tries, contention trees and their analysis
• An analytic approach to the asymptotic variance of trie statistics and related structures

This page was built for publication: Analytic properties of multiple-access trees

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