Lower bound on delay in a random multiple access system

MaRDI QIDQ1179613zbMATH OpenFDO

Authors B. S. Tsybakov, I. B. Likhanov

Publication date 26 June 1992

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

zbMATH Keywords

Poisson inputmean packet delaymultistation packet transmission networkrandom multiple access algorithmshared channel with ternary feedback

Mathematics Subject Classification ID

Communication theory (94A05) Circuits, networks (94C99) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Packet transmission using a blocked unmodified random multiple access stack-algorithm
• Lower bound on delay in an RMA system with \(N\)-conflicts and errors
• On the delay in a multiple-access system with large propagation delay
• Random multiple access in binary feedback channel

Cited in

(5)

• Upper bound on the capacity of a packet random multiple access system with errors
• On the delay in a multiple-access system with large propagation delay
• Lower bound on delay in an RMA system with \(N\)-conflicts and errors
• A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
• Delay performance in random-access networks

This page was built for publication: Lower bound on delay in a random multiple access system

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