On the Throughput of Degenerate Intersection and First-Come First-Served Collision Resolution Algorithms

Shivendra S. Panwar, Don Towsley, Jack K. Wolf

Research output: Contribution to journalArticle

Abstract

It is shown that, for a ternary feedback random access channel with a Poisson arrival process, 0.5 is an upper bound to the throughput for all “degenerate intersection” algorithms (DIA‘s) and first-come first-served algorithms (FCFSA‘s). As a by-product, the nested FCFSA with the largest throughput is found for the random access channel with a Bérnoulli arrival process with parameter p. For p > 0.018, this algorithm has the highest throughput over all DIA's and FCFSA's. Lastly, it is shown that, for some values of p, a non-DIA, non-FCFSA has a higher throughput than the optimum DIA or FCFSA.

Original languageEnglish (US)
Pages (from-to)274-279
Number of pages6
JournalIEEE Transactions on Information Theory
Volume31
Issue number2
DOIs
StatePublished - Mar 1985

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'On the Throughput of Degenerate Intersection and First-Come First-Served Collision Resolution Algorithms'. Together they form a unique fingerprint.

  • Cite this