Packet transmission using a blocked unmodified random multiple access stack-algorithm

MaRDI QIDQ1820123zbMATH OpenFDO

Authors B. S. Tsybakov, S. P. Fedortsov

Publication date 1986

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

zbMATH Keywords

random multiple access systemunmodified treelike algorithmupper bound on packet delay

Mathematics Subject Classification ID

Communication theory (94A05) Channel models (including quantum) in information and communication theory (94A40)

Review text

We derive an upper bound on packet delay in a random multiple access system with an unmodified treelike algorithm. This bound is linear for low intensities of the incoming packet stream.

Recommendations

• An random multiple access algorithm with finite stack and packet loss
• scientific article; zbMATH DE number 3713612
• Packet delay in the case of a multiple-access stack algorithm
• Random multiple access of impatient packets
• Random multiple access of packets to a channel with errors
• Analysis of a stack algorithm for random multiple-access communication
• Random multiple access with known appearance times of successfully transmitted packets
• Random multiple access system with impatient packets
• Random multiple packet access: part-and-try algorithm
• The number of packets transmitted by collision detect random access schemes

Cited in

(4)

• Random multiple packet access: part-and-try algorithm
• Lower bound on delay in a random multiple access system
• Lower bound on delay in an RMA system with N-conflicts and errors
• scientific article; zbMATH DE number 3713612 (Why is no real title available?)

This page was built for publication: Packet transmission using a blocked unmodified random multiple access stack-algorithm

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