The average CRI-length of a controlled ALOHA collision resolution algorithm

DOI10.1016/0304-3975(93)90195-YzbMath0781.68027MaRDI QIDQ1208718

Ulrich Schmid

Publication date: 16 May 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Mellin transformasymptotic analysisconflict resolution algorithmcontrolled \(S\)-ALOHACRI length

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Communication theory (94A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the asymptotics of the average CRI length of the slotted ALOHA collision resolution algorithm
• <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
• A perspective on multiaccess channels
• Estimating the multiplicities of conflicts to speed their resolution in multiple access channels

This page was built for publication: The average CRI-length of a controlled ALOHA collision resolution algorithm