Throughput of random access without message passing
Alexandre Proutière, Yung Yi, Mung Chiang · 2008
We develop distributed scheduling schemes that are based on simple random access algorithms and that have no message passing. In spite of their simplicity, these schemes are shown to provide high throughput performance: they achieve the same performance as that of some maximal scheduling algorithms, e.g. Maximum Size scheduling algorithms.