scientific article; zbMATH DE number 3875136

MaRDI QIDQ3342448zbMATH OpenFDO

Authors Micha Hofri

Publication date 1984

zbMATH Keywords

branching processescollision resolutioncommunication networklocal network of broadcasting processesmulti-user communicationStack-Algorithmtransmission protocol

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Analysis of a stack algorithm for random multiple-access communication
• scientific article; zbMATH DE number 4118297
• Local-area network with random-multiple-access stack algorithm
• Delay analysis of the n-ary stack random-access algorithm
• scientific article; zbMATH DE number 4029431

Cited in

(8)

• A stack protocol of CTM type with quartet feedback
• The throughput of the stack algorithm in a channel with \(N\)-conflicts
• Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis
• STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN
• Analysis of a stack algorithm for random multiple-access communication
• Limiting distribution of the collision resolution interval
• scientific article; zbMATH DE number 4118297 (Why is no real title available?)
• Interrelation of characteristics of blocked RMA stack algorithms

This page was built for publication:

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