• DocumentCode
    2455032
  • Title

    Efficiency of first-come first-served algorithms

  • Author

    Loher, Urs

  • Author_Institution
    Corp. Technol., Swisscom AG, Berne, Switzerland
  • fYear
    1998
  • fDate
    16-21 Aug 1998
  • Firstpage
    108
  • Abstract
    We derive a new upper bound on the efficiency of first-come first-served algorithms (FCFSA) based on a genie argument. This upper bound of 0.4906 is only slightly higher than today´s best known algorithm which achieves a maximum stable throughput of 0.4878
  • Keywords
    access protocols; multi-access systems; FCFSA; efficiency; first-come first-served algorithms; genie argument; maximum stable throughput; upper bound; Algorithm design and analysis; Capacity planning; Filtering theory; Protocols; Throughput; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
  • Conference_Location
    Cambridge, MA
  • Print_ISBN
    0-7803-5000-6
  • Type

    conf

  • DOI
    10.1109/ISIT.1998.708696
  • Filename
    708696
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2455032