TY - JOUR
T1 - On the Throughput of Degenerate Intersection and First-Come First-Served Collision Resolution Algorithms
AU - Panwar, Shivendra S.
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 (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.
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 (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.
UR - http://www.scopus.com/inward/record.url?scp=0022035047&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0022035047&partnerID=8YFLogxK
U2 - 10.1109/TIT.1985.1057017
DO - 10.1109/TIT.1985.1057017
M3 - Article
AN - SCOPUS:0022035047
SN - 0018-9448
VL - 31
SP - 274
EP - 279
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 2
ER -