TY - GEN
T1 - Efficient detection of message forwarding faults
AU - Herzberg, Amir
AU - Kutten, Shay
PY - 1989
Y1 - 1989
N2 - In most communication networks, when two processors wish to communicate, they try to send messages over a single path connecting them. We present communication efficient protocols that quickly detect and locate any failure along the path. Whenever there is excessive delay in forwarding the message along the path, the protocols detect a failure (even if the failure is malicious). The protocols ensure optimal time for either message delivery or failure detection. We prove a tight lower and upper bound of θ(n log n) on the message complexity of time optimal protocols that do not delay acknowledgements. The upper bound improves upon previous results.
AB - In most communication networks, when two processors wish to communicate, they try to send messages over a single path connecting them. We present communication efficient protocols that quickly detect and locate any failure along the path. Whenever there is excessive delay in forwarding the message along the path, the protocols detect a failure (even if the failure is malicious). The protocols ensure optimal time for either message delivery or failure detection. We prove a tight lower and upper bound of θ(n log n) on the message complexity of time optimal protocols that do not delay acknowledgements. The upper bound improves upon previous results.
UR - http://www.scopus.com/inward/record.url?scp=0024914766&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0024914766
SN - 0897913264
T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
SP - 339
EP - 353
BT - Proc Eighth ACM Symp Princ Distrib Comput
PB - Publ by ACM
T2 - Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing
Y2 - 14 August 1989 through 16 August 1989
ER -