Delay analysis of interval-searching contention resolution algorithms

DOI10.1109/TIT.1985.1057016MaRDI QIDQ3676040zbMATH OpenFDO

Authors Jian-Cheng Huang, Toby Berger

Publication date 1985

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

zbMATH Keywords

integral equationrandom multiple-access communications systemthroughput-delay characteristictransmission lag

Mathematics Subject Classification ID

Communication theory (94A05) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Recommendations

• Delay Analysis of 0.487 Contention Resolution Algorithms
• An analysis of a contention resolution algorithm. Another approach
• Some new random multiple-access algorithms
• Delay analysis of the n-ary stack random-access algorithm
• Random multiple access in binary feedback channel

Cited in

(6)

• Calculation of service delays in multiple-access systems with conflict resolution
• A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary events
• Performance analysis of test scheduling schemes for a multi-access communications network
• Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation
• Asymptotically optimal gossiping in radio networks
• Delay Analysis of 0.487 Contention Resolution Algorithms

This page was built for publication: Delay analysis of interval-searching contention resolution algorithms

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