Abstract
This paper presents techniques for guaranteeing idempotent semantics for classes of network operations in fault-tolerant networks. This is accomplished through operation transformation and message filtering. The conventional response to a failed or corrupted message transmission is to retransmit the failed message. This retry mechanism can lead to duplicate message delivery. If duplicated messages are non-idempotent, duplicate message delivery places the system into an inconsistent state. We explore methods of guaranteeing message idempotence at both the application and network protocol levels.
Preview
Unable to display preview. Download preview PDF.
References
T. Anderson, editor. Resilient Computing Systems, volume I, chapter 10, pages 178–196. Wiley-Interscience, 1985. Chapter by: C. I. Dimmer.
David E. Culler, Anurag Sah, Klaus Erik Schauser, Thorsten von Eicken, and John Wawrzynek. Fine-grain parallelism with minimal hardware support: A compiler-controlled threaded abstract machine. In Proceedings of the Fourth International Conference on the Architectural Support for Programming Languages and Operating Systems, April 1991.
André DeHon, Frederic Chong, Matthew Becker, Eran Egozy, Henry Minsky, Samuel Peretz, and Thomas F. Knight, Jr. METRO: A router architecture for high-performance, short-haul routing networks. In Proceedings of the International Symposium on Computer Architecture, pages 266–277, May 1994.
André DeHon. Robust, high-speed network design for large-scale multiprocessing. Master's thesis, MIT, 545 Technology Sq., Cambridge, MA 02139, February 1993.
A. Gottlieb, R. Grishman, C. Kruskal, K. McAuliffe, L. Rudolph, and M. Snir. Designing an mimd parallel computer. IEEE Transactions on Computers, C-32(2):175–189, February 1984.
G. Graunke and S. Thakkar. Synchronization algorithms for shared-memory multiprocessors. IEEE Computer, 23(6):60–70, June 1990.
(Ed.) Jon Postel. Transmission control protocol — darpa internet program protocol specification. RFC 793, USC/ISI, Information Sciences Institute, University of Southern California, 4676 Admiralty Way, Marina del Rey, California, 90291, September 1981.
J. H. Saltzer, D. P. Reed, and D. D. Clark. End-to-end arguments in system design. ACM Transactions on Computer Systems, 2(4):277–288, November 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eslick, I., DeHon, A., Knight, T. (1994). Guaranteeing idempotence for tightly-coupled, fault-tolerant networks. In: Bolding, K., Snyder, L. (eds) Parallel Computer Routing and Communication. PCRCW 1994. Lecture Notes in Computer Science, vol 853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58429-3_39
Download citation
DOI: https://doi.org/10.1007/3-540-58429-3_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58429-2
Online ISBN: 978-3-540-48787-6
eBook Packages: Springer Book Archive