The level of handshake required for establishing a connection

  • Hagit Attiya
  • Rinat Rappoport
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 857)


A connection between two hosts across a wide-area network can consist of many sessions over time, each called an incarnation. A connection is synchronized using a connection establishment protocol to allow a reliable exchange of data. A handshake mechanism is employed to establish the connection. This paper identifies the precise level of handshake needed under different assumptions on the nodes and on the network, using a formal model of connection management. In particular, the following parameters are studied: the size of the memory at the nodes, the amount of information retained between incarnations, and the existence of time constraints on the system. In each case, we either present a two-way handshake protocol, show that no two-way handshake protocol exists and give a three-way handshake protocol, or show that no protocol exists at all (regardless of the handshake level).


transport protocols connection management incarnation connectionless network 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    H. Attiya, S. Dolev and J. L. Welch, “Memory Requirements for Connection Management,” Technical Report LPCR #9316, Laboratory for Parallel Computing Research, Department of Computer Science, The Technion, Haifa, June 1993.Google Scholar
  2. 2.
    H. Attiya and R. Rappoport, “The Level of Handshake Required to Establish a Connection,” Technical Report #828, Department of Computer Science, The Technion, Haifa, July 1994.Google Scholar
  3. 3.
    D. Belsnes, “Single-Message Communication,” IEEE Transactions on Communication, Vol. T-COM-24, No. 2, pp. 190–194, February 1976.CrossRefGoogle Scholar
  4. 4.
    E. W. Biersack and D. Feldmeier, “A Timer-Based Connection Management Protocol with Synchronized Clocks and its Verification,” to appear in Computer Networks and ISDN systems.Google Scholar
  5. 5.
    D. Comer, Internetworking with TCP/IP, Volume I: Principles, Protocols and Architecture, Prentice-Hall, Englewood Cliffs, NJ, 1991.Google Scholar
  6. 6.
    J. G. Fletcher and R. W. Watson, “Mechanisms for a Reliable Timer-Based Protocol,” Computer Networks, Vol. 2, pp. 271–290, 1978.CrossRefGoogle Scholar
  7. 7.
    J. F. Kurose and Y. Yemini, “The Specification and Verification of a Connection Establishment Protocol using Temporal Logic,” in Protocol Specification, Testing and Verification II (C. A. Sunshine, Ed), North-Holland, New-York, 1982.Google Scholar
  8. 8.
    G. LeLann and H. LeGoff, “Verification and Evaluation of Communication Protocols,” Computer Networks, Vol. 2, pp. 50–69, 1978.CrossRefGoogle Scholar
  9. 9.
    S. S. Lam and A. U. Shankar, “Protocol Verification via Projections,” IEEE Trans. on Software Engineering, Vol. 10, No. 4, pp. 325–342, July 1984.Google Scholar
  10. 10.
    B. Liskov, L. Shrira and J. Wroclawski, “Efficient At-Most-Once Messages Based on Synchronized Clocks,” ACM Trans. on Computers, Vol. 9, No. 2, pp. 125–142.Google Scholar
  11. 11.
    N. Lynch and M. Tuttle, “An Introduction to Input/Output Automata,” CWI Quarterly, Vol. 2, No. 3, pp. 219–246, September 1989.Google Scholar
  12. 12.
    S. L. Murphy and A. U. Shankar, “Connection Management for the Transport Layer: Service Specification and Protocol Verification,” IEEE Trans. on Communications, Vol. 39, No. 12, pp. 1762–1775, December 1991.CrossRefGoogle Scholar
  13. 13.
    S. L. Murphy, “Service Specification and Protocol Construction for a Layered Architecture,” Ph.D. dissertation, Department of Computer Science, University of Maryland, May 1990. Also Computer Science Dept., University of Maryland, Tech. Rep. CS-TR-2583 (or UMIACS-TR-91-3), January 1991.Google Scholar
  14. 14.
    A. A. Schoone, “Verification of Connection-Management Protocols,” in the 2nd Workshop on Distributed Algorithms, LNCS No. 312, pp. 167–186, September 1987.Google Scholar
  15. 15.
    A. U. Shankar, “Modular Design Principals for Protocols with an Application to the Transport Layer,” Proceedings of the IEEE, Vol. 79, No. 12, December 1991.Google Scholar
  16. 16.
    A. U. Shankar and D. Lee, “Modulo-N Incarnation Numbers for Cache-based Transport Protocols,” Computer Science Dept., University of Maryland, Tech. Rep. CS-TR-3046 (or UMIACS-TR-93-24), March 1993.Google Scholar
  17. 17.
    J. F. SØgaard-Andersen, N. A. Lynch and B. W. Lampson, “Correctness of Communication Protocols, a Case Study,” Tech. Rep. MIT/LCS/TR-589, Laboratory for Computer Science, MIT, November 1993.Google Scholar
  18. 18.
    C. A. Sunshine and Y. K. Dalal, “Connection Management in Transport Protocols, ” Computer Networks, Vol. 2, pp. 454–473, 1978.CrossRefGoogle Scholar
  19. 19.
    A. Tanenbaum, Computer Networks, 2nd edition, Prentice Hall, 1988.Google Scholar
  20. 20.
    R. S. Tomlinson, “Selecting Sequence Numbers,” Proc. ACM SIGCOMM/SIGOPS Interprocess Communications Workshop, pp. 11–23, 1975; in ACM Operating Systems Review, Vol. 9, No. 3, 1975.Google Scholar
  21. 21.
    Transmission Control Protocol, DARPA Network Working Group Report RFC-793, University of Southern California, September 1981.Google Scholar
  22. 22.
    R. W. Watson, “Timer-based mechanisms in reliable transport protocol connection management,” Computer Networks, Vol. 5, pp. 47–56, 1981.CrossRefGoogle Scholar
  23. 23.
    R. W. Watson, “The Delta-t Transport Protocol: Features and Experience,” Proc. IEEE Conf. on Local Computer Networks, pp. 399–407, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Hagit Attiya
    • 1
  • Rinat Rappoport
    • 1
  1. 1.The TechnionHaifaIsrael

Personalised recommendations