Interrelation of characteristics of blocked RMA stack algorithms

DOI10.1134/S0032946007040072MaRDI QIDQ941884zbMATH OpenOpenAlexFDO

Authors G. S. Evseev, A. M. Tyurlikov

Publication date 2 September 2008

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0032946007040072

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Communication theory (94A05)

Recommendations

• scientific article; zbMATH DE number 4029431
• Analysis of a stack algorithm for random multiple-access communication
• scientific article; zbMATH DE number 3875136
• The throughput of the stack algorithm in a channel with \(N\)-conflicts
• A simple stable RMA algorithm for LAN

Cites work

• scientific article; zbMATH DE number 3659453 (Why is no real title available?)
• scientific article; zbMATH DE number 3801440 (Why is no real title available?)
• Analysis of contention tree algorithms
• Analysis of tree algorithm for collision resolution
• Survey of USSR contributions to random multiple-access communications
• Tree algorithms for packet broadcast channels

Cited in

(2)

• scientific article; zbMATH DE number 4029431 (Why is no real title available?)
• Analysis of \(d\)-ary tree algorithms with successive interference cancellation

This page was built for publication: Interrelation of characteristics of blocked RMA stack algorithms

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