Sciweavers

Share
CISS
2008
IEEE

Throughput of random access without message passing

9 years 4 months ago
Throughput of random access without message passing
— 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.
Alexandre Proutiere, Yung Yi, Mung Chiang
Added 29 May 2010
Updated 29 May 2010
Type Conference
Year 2008
Where CISS
Authors Alexandre Proutiere, Yung Yi, Mung Chiang
Comments (0)
books