DocumentCode :
3023981
Title :
The robustness and performance of tree algorithms in an unshared feedback error environment
Author :
Suda, Tatsuya ; Bae, Jungok ; Baxter, David C.
Author_Institution :
Dept. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA
fYear :
1988
fDate :
27-31 March 1988
Firstpage :
995
Lastpage :
1004
Abstract :
A discussion is presented of the robustness of the Capetanakis collision resolution algorithm for multiple-access networks. In particular, they show that the algorithm is robust against errors that cause different stations to see different feedback information on the results of the transmission attempts, and they quantify, using simulation, the performance (throughput/delay) degradation caused by those unshared errors.<>
Keywords :
delays; feedback; multi-access systems; performance evaluation; protocols; trees (mathematics); Capetanakis collision resolution algorithm; multiple-access networks; performance; performance degradation; robustness; simulation; throughput/delay; tree algorithms; unshared feedback error environment; Access protocols; Computer errors; Computer science; Degradation; Delay; Feedback; Intelligent networks; Partitioning algorithms; Robustness; Throughput;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
INFOCOM '88. Networks: Evolution or Revolution, Proceedings. Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies, IEEE
Conference_Location :
New Orleans, LA, USA
Print_ISBN :
0-8186-0833-1
Type :
conf
DOI :
10.1109/INFCOM.1988.13016
Filename :
13016
Link To Document :
بازگشت