• DocumentCode
    2043580
  • Title

    Throughput of random access without message passing

  • Author

    Proutiere, Alexandre ; Yi, Yung ; Chiang, Mung

  • Author_Institution
    Microsoft Res., Cambridge
  • fYear
    2008
  • fDate
    19-21 March 2008
  • Firstpage
    509
  • Lastpage
    514
  • 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.
  • Keywords
    queueing theory; radio networks; scheduling; distributed scheduling scheme; message passing; queue-length information exchange; random access algorithm; wireless network; Access protocols; Buffer storage; Interference; Message passing; Radio transmitters; Scheduling algorithm; Symmetric matrices; Telecommunication traffic; Throughput; Traffic control;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Sciences and Systems, 2008. CISS 2008. 42nd Annual Conference on
  • Conference_Location
    Princeton, NJ
  • Print_ISBN
    978-1-4244-2246-3
  • Electronic_ISBN
    978-1-4244-2247-0
  • Type

    conf

  • DOI
    10.1109/CISS.2008.4558579
  • Filename
    4558579
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2043580