Delay analysis of the n-ary stack random-access algorithm

DOI10.1109/18.21217zbMath0664.94002OpenAlexW2000677489MaRDI QIDQ3816006

Chatschik Bisdikian, Lazaros F. Merakos

Publication date: 1989

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.21217

zbMATH Keywords

performance measurepacket delaybinary feedbackcollision-type packet-switched broadcast communication channel

Mathematics Subject Classification ID

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

Related Items (1)

A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events

This page was built for publication: Delay analysis of the n-ary stack random-access algorithm