Random multiple packet access: part-and-try algorithm

MaRDI QIDQ1155579zbMATH OpenFDO

Authors B. S. Tsybakov, V. A. Mikhaĭlov

Publication date 1981

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

zbMATH Keywords

deterministic tree algorithmsslotted ALOHA multiple random access system

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Communication theory (94A05)

Recommendations

• scientific article; zbMATH DE number 3713612
• Random multiple access of impatient packets
• Random multiple access with known appearance times of successfully transmitted packets
• Random multiple access of packets to a channel with errors
• Randomized and nonrandomized algorithms of random multiple access
• Random multiple access system with impatient packets
• An random multiple access algorithm with finite stack and packet loss
• Packet transmission using a blocked unmodified random multiple access stack-algorithm
• Some new random multiple-access algorithms
• Some Optimal Algorithms of Random Multiple Access

Cited in

(4)

• Analytical depoissonization and its applications
• Packet transmission using a blocked unmodified random multiple access stack-algorithm
• scientific article; zbMATH DE number 3713612 (Why is no real title available?)
• Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms

This page was built for publication: Random multiple packet access: part-and-try algorithm

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