An random multiple access algorithm with finite stack and packet loss

zbMATH Open0963.94500MaRDI QIDQ1814643FDOQ1814643

Authors: S. P. Fedortsov, N. A. Ryleeva 

Publication date: 19 August 1998

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

Recommendations

• Random multiple access of impatient packets
• Analysis of a stack algorithm for random multiple-access communication
• Delay analysis of the n-ary stack random-access algorithm
• Packet delay in the case of a multiple-access stack algorithm
• Local-area network with random-multiple-access stack algorithm

zbMATH Keywords

packet losspacket delaystationary probability distributionrandom multiple access algorithm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Channel models (including quantum) in information and communication theory (94A40)

Cited In (13)

• STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN
• The blocked stack algorithm of RMA in a network with a finite number of stations
• Random multiple packet access: part-and-try algorithm
• Packet Multiple Access for Channel With Binary Feedback, Capture, and Multiple Reception
• Delay analysis of the n-ary stack random-access algorithm
• Analysis of a stack algorithm for random multiple-access communication
• Some new random multiple-access algorithms
• Packet transmission using a blocked unmodified random multiple access stack-algorithm
• Title not available (Why is that?)
• Random multiple access of packets to a channel with errors
• Random multiple access of impatient packets
• Packet delay in the case of a multiple-access stack algorithm
• Local-area network with random-multiple-access stack algorithm

This page was built for publication: An random multiple access algorithm with finite stack and packet loss

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