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.

• Type: Conference
• Year: 2008
• Where: CISS
• Authors: Alexandre Proutiere, Yung Yi, Mung Chiang
• Keywords: CISS 2008, Information Management, Maximal Scheduling Algorithms, Random Access Algorithms, Scheduling Algorithms