On the throughput of degenerate intersection and first-come first-served collision resolution algorithms
From MaRDI portal
Publication:3676041
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
Cited in
(4)- Throughput of \(Q\)-ary splitting algorithms for contention resolution in communication networks
- High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm
- <tex>Q</tex>-ary collision resolution algorithms in random-access systems with free or blocked channel access
- Corrections to “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm”
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)