DocumentCode :
939947
Title :
On the throughput of degenerate intersection and first-come first-served collision resolution algorithms
Author :
Panwar, Shivendra S. ; Towsley, Don ; Wolf, Jack R.
Volume :
31
Issue :
2
fYear :
1985
fDate :
3/1/1985 12:00:00 AM
Firstpage :
274
Lastpage :
279
Abstract :
It is shown that, for a ternary feedback random access channel with a Poisson arrival process, 
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 Bernoulli arrival process with parameter 
. For 
, this algorithm has the highest throughput over all DIA\´s and FCFSA\´s. Lastly, it is shown that. for some values of , a non-DIA, non-FCFSA has a higher throughput than the optimum DIA or FCFSA.
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 Bernoulli arrival process with parameter . For , this algorithm has the highest throughput over all DIA\´s and FCFSA\´s. Lastly, it is shown that. for some values of , a non-DIA, non-FCFSA has a higher throughput than the optimum DIA or FCFSA.Keywords :
Packet switching; Artificial satellites; Coaxial cables; Delay; Feedback; Road accidents; Throughput; Upper bound;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1985.1057017
Filename :
1057017
Link To Document :
