Abstract
As the number and diversity of networks increases, the need for sophisticated network protocols has grown. Because network protocols must deal with distant parties, they are prey to all the well-known problems faced by distributed systems. This paper addresses one of these problems: synchronization. Though connectionless protocols require little knowledge of the other party’s state, in connection-oriented protocols, we hope that the parties remain synchronized. Thus, for example, if one party disconnects, we expect the other to disconnect. If one party thinks that a connection has been established, we expect the other to agree. In this paper we address two issues: the loss of synchronization itself, and detection of this loss.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bochman, G. v., “Finite state descriptions of communication protocols,” IFIP, Liege, Belgium, Feb. 1978, pp. F3–1–F3–11.
Hoare, C. A. R., “Communicating Sequential Processes,” Communications of the ACM, vol. 21, No. 8, August 1978, pp. 666–677
Merlin, P. M., “A Methodology for the Design and Implementation of Communication Protocols,” IEEE Trans. on Communications, vol. COM-24, No. 7, June 1976, pp. 614–621.
Postel, J. B., D. Farber, “Graph Modeling of Computer Communications Protocols,” Proc. 5th Texas Conf. on Computing Systems, Austin, Texas, October 1976, pp. 66–77.
Brand, D. and P. Zafiropulo, “On communicating finite-state machines,” Tech Report RZ-1053, IBM Zurich Research Lab, Ruschlikon, Switzerland.
Brand, D. and P. Zafiropulo, “On communicating finite-state machines,” Journal of the ACM, vol. 30, no. 2, April 1983, pp. 323–342.
Gouda, M. G., “Synthesis of communicating finite state machines with guaranteed progress,” IEEE Trans. on Communications, vol. COM-32, No. 7, July 1984, pp. 779–788.
Miller, R. E., “The construction of self-synchronizing finite state protocols,” Distributed Computing, vol 2, 1987, pp. 104–112.
Chow, C.-H., M. G. Gouda, and S. S. Lam, “A discipline for constructing Multiphase Communication Protocols,” ACM Transactions on Computer Systems, vol 3., No. 4, November 1985, pp. 315–343.
Milner, R., “Calculi for Synchrony and Asynchrony”, Theoretical Computer Science, vol 25, 1983, pp. 267–310.
Gouda, M. G., C. H. Chow, and S. Lam, “On the decidability of livelock detection in networks of communicating finite state machines,” IFIP, Liege, Belgium, 1985, pp. 47–56.
Hoperoft, J. E., and J. D. Ullman, “Formal Languages and their relation to Automata,” Addison-Wesley, Reading Mass 1969.
Constable, R. L., H. B. Hunt III, and S. Sahni, “On the computational complexity of scheme equivalence,” Report No. 74–201, Dept. of Computer Science, Cornell University, Ithaca, NY, 1974.
Garey, M. R., and D. S. Johnson, “Computers and Intractability: A guide to the Theory of NP-Completeness,” W. H. Freeman and Company, San Francisco, 1979.
Massey, W. S., “Algebraic Topology: an Introduction,” Harcourt, Brace & World, Inc, New York, 1967.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag London
About this paper
Cite this paper
Parker, J.D. (1990). Synchronization in Network Protocols. In: Rattray, C. (eds) Specification and Verification of Concurrent Systems. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3534-0_17
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3534-0_17
Publisher Name: Springer, London
Print ISBN: 978-3-540-19581-8
Online ISBN: 978-1-4471-3534-0
eBook Packages: Springer Book Archive