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
StatePublished - Mar 1985

Fingerprint

Throughput
Byproducts
Feedback
Values

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

Cite this

ON THE THROUGHPUT OF DEGENERATE INTERSECTION AND FIRST-COME FIRST-SERVED COLLISION RESOLUTION ALGORITHMS. / Panwar, Shivendra; Towsley, Don; Wolf, Jack K.

In: IEEE Transactions on Information Theory, Vol. IT-31, No. 2, 03.1985, p. 274-279.

Research output: Contribution to journalArticle

@article{78433c3223c0454ba64767e222948e28,
title = "ON THE THROUGHPUT OF DEGENERATE INTERSECTION AND FIRST-COME FIRST-SERVED COLLISION RESOLUTION ALGORITHMS.",
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.",
author = "Shivendra Panwar and Don Towsley and Wolf, {Jack K.}",
year = "1985",
month = "3",
language = "English (US)",
volume = "IT-31",
pages = "274--279",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

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

AU - Panwar, Shivendra

AU - Towsley, Don

AU - Wolf, Jack K.

PY - 1985/3

Y1 - 1985/3

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0022035047&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022035047&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0022035047

VL - IT-31

SP - 274

EP - 279

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 2

ER -