Throughput of random access without message passing

Alexandra Proutière, Yung Yi, Mung Chiang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

33 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationCISS 2008, The 42nd Annual Conference on Information Sciences and Systems
Pages509-514
Number of pages6
DOIs
StatePublished - Sep 22 2008
EventCISS 2008, 42nd Annual Conference on Information Sciences and Systems - Princeton, NJ, United States
Duration: Mar 19 2008Mar 21 2008

Publication series

NameCISS 2008, The 42nd Annual Conference on Information Sciences and Systems

Other

OtherCISS 2008, 42nd Annual Conference on Information Sciences and Systems
CountryUnited States
CityPrinceton, NJ
Period3/19/083/21/08

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Information Systems
  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Throughput of random access without message passing'. Together they form a unique fingerprint.

  • Cite this

    Proutière, A., Yi, Y., & Chiang, M. (2008). Throughput of random access without message passing. In CISS 2008, The 42nd Annual Conference on Information Sciences and Systems (pp. 509-514). [4558579] (CISS 2008, The 42nd Annual Conference on Information Sciences and Systems). https://doi.org/10.1109/CISS.2008.4558579