<tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access

DOI10.1109/TIT.1985.1057013MaRDI QIDQ3682375zbMATH OpenOpenAlexFDO

Authors Peter Mathys, Philippe Flajolet

Publication date 1985

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

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

zbMATH Keywords

channel-access protocolscontention-based random- access systemsfunctional equationspacket-delay analysisPoisson processrecursive algorithmslotted ALOHA systemthroughput characteristicstree algorithms

Mathematics Subject Classification ID

Communication theory (94A05)

Recommendations

• Throughput of \(Q\)-ary splitting algorithms for contention resolution in communication networks
• Random access algorithms with multiple reception capability and \(n\)-ary feedback channel
• Analytic properties of multiple-access trees
• On the throughput of degenerate intersection and first-come first-served collision resolution algorithms
• Delay analysis of the n-ary stack random-access algorithm

Cited in

(30)

• An analysis of a contention resolution algorithm. Another approach
• The number of packets transmitted by collision detect random access schemes
• The evaluation of an alternative sum with applications to the analysis of some data structures
• On the balance property of Patricia tries: External path length viewpoint
• Analytical depoissonization and its applications
• A stack protocol of CTM type with quartet feedback
• On the asymptotics of the average CRI length of the slotted ALOHA collision resolution algorithm
• The average CRI-length of a controlled ALOHA collision resolution algorithm
• On The variance of the extremal path length in a symmetric digital trie
• A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events
• Sorting algorithms for broadcast communications: mathematical analysis.
• A deadlock model for a multi-service medium access protocol employing multi-slot N-ary stack algorithm (msSTART)
• Dynamic tree algorithms
• An analytic approach to the asymptotic variance of trie statistics and related structures
• Throughput of \(Q\)-ary splitting algorithms for contention resolution in communication networks
• Throughput and delay analysis of an opportunistic tree algorithm
• High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm
• On the throughput of degenerate intersection and first-come first-served collision resolution algorithms
• Analytic properties of multiple-access trees
• On a tree collision resolution algorithm in presence of capture
• Analysis of contention tree algorithms
• FIFO by sets ALOHA (FS-ALOHA): a collision resolution algorithm for the contention channel in wireless ATM systems
• The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects
• Corrections to “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm”
• On tries, contention trees and their analysis
• Analysis of \(d\)-ary tree algorithms with successive interference cancellation
• Mellin transforms and asymptotics: Harmonic sums
• A note on binomial recurrences arising in the analysis of algorithms
• How to select a loser
• Distances in random digital search trees

This page was built for publication: &lt;tex&gt;Q&lt;/tex&gt;-ary collision resolution algorithms in random-access systems with free or blocked channel access

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