On the throughput of degenerate intersection and first-come first-served collision resolution algorithms

DOI10.1109/TIT.1985.1057017zbMATH Open0562.94002MaRDI QIDQ3676041FDOQ3676041

Authors: Shivendra S. Panwar, Don Towsley, Jack Keil Wolf 

Publication date: 1985

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

Recommendations

• The simple intersection: capacity and delay
• A decomposition algorithm for Nash equilibria in intersection management
• On the applicability of the number of collisions in \(p\)-persistent CSMA/CD protocols
• <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
• On the Complexity of Maximally Permissive Deadlock Avoidance in Multi-Vehicle Traffic Systems
• Optimal Randomized Comparison Based Algorithms for Collision
• Combinatorial optimization problems arising from interactive congestion situations
• A collision model for randomized routing in fat-tree networks

zbMATH Keywords

Poisson arrival processBernoulli arrival processternary feedback random access channel

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Communication theory (94A05) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Channel models (including quantum) in information and communication theory (94A40)

Cited In (3)

• <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
• High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm
• Throughput of \(Q\)-ary splitting algorithms for contention resolution in communication networks

This page was built for publication: On the throughput of degenerate intersection and first-come first-served collision resolution algorithms

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