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

DOI10.1109/18.21217MaRDI QIDQ3816006zbMATH OpenOpenAlexFDO

Authors 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

binary feedbackcollision-type packet-switched broadcast communication channelpacket delayperformance measure

Mathematics Subject Classification ID

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

Recommendations

• Packet delay in the case of a multiple-access stack algorithm
• An random multiple access algorithm with finite stack and packet loss
• Analysis of a stack algorithm for random multiple-access communication
• Random multiple access in binary feedback channel
• Some new random multiple-access algorithms

Cited in

(10)

• An applicative random-access stack
• A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events
• An random multiple access algorithm with finite stack and packet loss
• Adaptive random access algorithm with improved delay performance
• STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN
• scientific article; zbMATH DE number 3875136 (Why is no real title available?)
• Delay analysis of interval-searching contention resolution algorithms
• Analysis of a stack algorithm for random multiple-access communication
• <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
• Delay performance in random-access networks

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

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