Early detection of message forwarding faults

SIAM Journal on Computing

Volumn 30, Issue 4, 2000, Pages 1169-1196

  Herzberg, Amir ^a   Kutten, Shay ^b  

^a IBM HAIFA RESEARCH LAB   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Competitive algorithms; Distributed algorithms; Fault tolerance; Network protocols; Real time; Time adaptive

Indexed keywords

ALGORITHMS; ASYNCHRONOUS TRANSFER MODE; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS; REAL TIME SYSTEMS; TELECOMMUNICATION LINKS;

COMPETITIVE ALGORITHMS; DISTRIBUTED ALGORITHMS; FAULT DETECTION; MESSAGE FORWARDING; TIME ADAPTIVE;

FAILURE ANALYSIS;

EID: 0034848036     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796312745     Document Type: Article

References (33)

1. Y. AFEK, B. AWERBUCH, AND E. GAFNI, Applying static network protocols to dynamic networks, in Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1987, pp. 358-370.
2. Y. AFEK, B. AWERBUCH, S. A. PLOTKIN, AND M. SAKS, Local management of a global resource in a communication network, J. ACM, 43 (1996), pp. 1-19.
3. B. AWERBUCH, S. KUTTEN, AND D. PELEG, Competitive distributed job scheduling, in Proceedings of the 24th ACM Symposium on Theory of Computing, Victoria, Canada, 1992, pp. 571-580.
4. H. ATTIYA AND N. LYNCH, Time bounds for real-time process control in presence of timing uncertainty, Inform. and Comput., 110 (1994), pp. 183-232.
5. H. ATTIYA, C. DWORK, N. LYNCH, AND L. STOCKMEYER, Bounds on the time to reach agreement in the presence of timing uncertainty, in Proceedings of the 23rd ACM Symposium on Theory of Computing, New Orleans, LA, 1991, pp. 359-369.
6. B. AWERBUCH AND S. EVEN, Reliable broadcast protocols in unreliable networks, Networks, 16 (1986), pp. 381-396.
7. Y. AFEK AND E. GAFNI, End-to-end communication in unreliable networks, in Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, Toronto, Ontario, Canada, 1988, pp. 131-148.
8. B. AWERBUCH, O. GOLDREICH, AND A. HERZBERG, A quantitative approach to dynamic networks, in Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, Quebec City, Quebec, Canada, 1990, pp. 189-204.
9. Y. AFEK, B. AWERBUCH, E. GAFNI, E. ROSEN, AND N. SHAVIT, Slide - the key to polynomial end-to-end communication, J. Algorithms, 22 (1997), pp. 158-186.
10. Y. AFEK AND M. SAKS, Detecting global termination conditions in the face of uncertainty, in Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, Vancouver, Canada, 1987, pp. 109-124.
11. A. E. BARATZ, J. P. GRAY, P. E. GREEN, JR., J. M. JAFFE, AND D. P. POZEFSKY, SNA networks of small systems, IEEE J. Selected Areas in Comm., 3 (1985), pp. 416-426.
12. A. E. BARATZ AND A. SEGALL, Reliable link initialization procedures, IEEE Trans. Comm., 36 (1988), pp. 144-152.
13. R. BAR-YEHUDA, S. KUTTEN, Y. WOLFSTAHL, AND S. ZAKS, Making distributed spanning tree algorithms fault resilient, in Proceedings of the Fourth Symposium on Theoretical Aspects of Comptuer Science, Passau, Germany, Lecture Notes in Comput. Sci. 247, Springer-Verlag, Berlin, 1987, pp. 432-444.
14. C. T. CHOU, I. CIDON, I. GOPAL, AND S. ZAKS, Synchronizing asynchronous bounded delay networks, in Distributed Algorithms: Second International Workshop, J. van Leeuwen, ed., Lecture Notes in Comput. Sci. 312, Springer-Verlag, New York, 1988, pp. 212-218.
15. I. CIDON AND R. ROM, Failsafe end-to-end protocols in computer networks with changing topology, IEEE Trans. Comm., 35 (1987), pp. 410-413.
16. D. DOLEV, J. HALPERN, B. SIMONS, AND R. STRONG, Dynamic fault-tolerant clock synchronization, J. ACM, 42 (1995), pp. 143-185.
17. D. DOLEV, R. REISCHUK, AND H. R. STRONG, Early stopping in Byzantine agreement, J. ACM, 37 (1990), pp. 720-741.
18. M. AJTAI, J. ASPNES, C. DWORK, AND O. WAARTS, A theory of competitive analysis for distributed algorithms, in Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1994, pp. 401-411.
19. S. G. FINN, Resynch procedures and failsafe network protocol, IEEE Trans. Comm., 27 (1979), pp. 840-846.
20. O. GOLDREICH, A. HERZBERG, AND Y. MANSOUR, Source to destination communication in the presence of faults, in Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, Edmonton, Canada, 1989, pp. 85-101.
21. G. GROVER, High Availability for Networks (HAPN) - Non-Disruptive VR Switching, internal memorandum, IBM T. J. Watson Research Center, Yorktown Heights, NY, 1982.
22. P. M. GOPAL, R. A. SULTAN, AND B. K. KADABA, Performance Limits of APPN Architecture, internal memorandum, IBM T. J. Watson Research Center, Yorktown Heights, NY, 1987.
23. A. HERZBERG, Network management in the presence of faults, in Proceedings of the Ninth International Conference on Computers and Communication, Tel Aviv, Israel, 1988.
24. A. HERZBERG AND S. KUTTEN, Efficient detection of message forwarding faults, in Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, Edmonton, Canada, 1989, pp. 339-353.
25. S. KUTTEN, Optimal fault tolerant distributed construction of a spanning forest, Inform. Process. Lett., 27 (1988), pp. 299-307.
26. J. M. MCQUILLAN, I. RICHER, AND E. C. ROSEN, The new routing algorithm for the ARPANET, IEEE Trans. Comm., 28 (1980), pp. 711-719.
27. J. Y. HALPERN AND Y. MOSES, Knowledge and common knowledge in a distributed environment, J. ACM, 37 (1990), pp. 549-587.
28. R. PERLMAN, Network Layer Protocols with Byzantine Robustness, Ph.D. thesis, MIT Laboratory for Computer Science, Cambridge, MA, 1988.
29. S. PONZIO, Network consensus in the presence of timing uncertainty: Omission and Byzantine failures, in Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, Montreal, Quebec, Canada, 1991, pp. 125-138.
30. A. SEGALL AND J. M. JAFFE, Route setup with local identifiers, IEEE Trans. Comm., 34 (1986), pp. 45-53.
31. W. STALLINGS, Handbook of Computer Communication Standards, Vol. 1, Macmillan, New York, 1987.
32. A. TANNENBAUM, Computer Networks, Prentice-Hall, Englewood Cliffs, NJ, 1981.
33. H. ZIMMERMAN, OSI reference model - the ISO model of architecture for open systems interconnection, IEEE Trans. Comm., 28 (1980), pp. 425-432.