Analysis of a stack algorithm for random multiple-access communication

DOI10.1109/TIT.1985.1057014MaRDI QIDQ3676042zbMATH OpenFDO

Authors Guy Fayolle, Philippe Flajolet, Micha Hofri, Philippe Jacquet

Publication date 1985

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

zbMATH Keywords

Capetanakis- Tsybakov-Mikhailov collision resolution algorithmsingle-channel packet switching communications network

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Communication theory (94A05)

Recommendations

• An random multiple access algorithm with finite stack and packet loss
• scientific article; zbMATH DE number 3875136
• Random multiple access of impatient packets
• Delay analysis of the n-ary stack random-access algorithm
• Local-area network with random-multiple-access stack algorithm

Cited in

(33)

• STABILITY AND PERFORMANCE OF STACK ALGORITHMS FOR RANDOM ACCESS COMMUNICATION MODELED AS A TREE STRUCTURED QBD MARKOV CHAIN
• An analysis of a contention resolution algorithm. Another approach
• An extension of the kantorovich-rubinstein mass-transshipment problem
• scientific article; zbMATH DE number 4129785 (Why is no real title available?)
• On queueing problems in random-access communications
• On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel
• A probabilistic analysis of some tree algorithms
• Analytical depoissonization and its applications
• Limit theorems for recursive algorithms
• scientific article; zbMATH DE number 4118297 (Why is no real title available?)
• Dynamic tree algorithms
• scientific article; zbMATH DE number 3875136 (Why is no real title available?)
• Delay analysis of the n-ary stack random-access algorithm
• An exact closed-form formula of collision probability in diverse multiple access communication systems with frame slotted aloha protocol
• An analytic approach to the asymptotic variance of trie statistics and related structures
• The throughput of the stack algorithm in a channel with \(N\)-conflicts
• Survey of USSR contributions to random multiple-access communications
• Renewal theory in the analysis of tries and strings
• A stack protocol of CTM type with quartet feedback
• Packet transmission using a blocked unmodified random multiple access stack-algorithm
• A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events
• Analysis of contention tree algorithms
• Mathematical theory of queueing networks
• Random multiple access of packets to a channel with errors
• scientific article; zbMATH DE number 3932929 (Why is no real title available?)
• Random multiple access of impatient packets
• Stacked OSTBC: Error Performance and Rate Analysis
• An access algorithm for a communication channel
• Allowance for packet propagation time in random multiple access
• Scale-free, self-organizing very large sensor networks
• Analysis of a multiaccess control scheme
• Interrelation of characteristics of blocked RMA stack algorithms
• Local-area network with random-multiple-access stack algorithm

This page was built for publication: Analysis of a stack algorithm for random multiple-access communication

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