ON THE THROUGHPUT OF DEGENERATE INTERSECTION AND FIRST-COME FIRST-SERVED COLLISION RESOLUTION ALGORITHMS.

Shivendra 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 (DIAs) and first-come first-served algorithms (FCFSAs). As a by-product, the nested FCFSA with the largest throughput is found for the random access channel with a Bernoulli arrival process with parameter p. For p greater than equivalent to 0. 018, this algorithm has the highest throughput over all DIAs and FCFSAs. 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
VolumeIT-31
Issue number2
Publication statusPublished - Mar 1985

    Fingerprint

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

Cite this