Computer networks: 2nd edition
Computer networks: 2nd edition
Service specification and protocol construction for a layered architecture
Service specification and protocol construction for a layered architecture
Efficient at-most-once messages based on synchronized clocks
ACM Transactions on Computer Systems (TOCS)
Internetworking with TCP/IP (2nd ed.), vol. I
Internetworking with TCP/IP (2nd ed.), vol. I
A timer-based connection management protocol with synchronized clocks and its verification
Computer Networks and ISDN Systems
Modulo-N incarnation numbers for cache-based transport protocols
Modulo-N incarnation numbers for cache-based transport protocols
Connection management without retaining information
Information and Computation
The Specification and Verification of a Connection Establishment Protocol Using Temporal Logic
Proceedings of the IFIP WG6.1 Second International Workshop on Protocol Specification, Testing and Verification
Verification of Connection-Management Protocols
Proceedings of the 2nd International Workshop on Distributed Algorithms
Proceedings of the 1975 ACM SIGCOMM/SIGOPS workshop on Interprocess communications
Trade-offs between message delivery and quiesce times in connection management protocols
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
LIVENESS IN TIMED AND UNTIMED SYSTEMS
LIVENESS IN TIMED AND UNTIMED SYSTEMS
Correctness of Communications Protocols, A case Study
Correctness of Communications Protocols, A case Study
| Hi-index | 0.00 |
A connection between two hosts across a wide-area network may consist of many sessions over time, each called an incarnation. A connection is synchronized using a connection establishment protocol, based on a handshake mechanism, to allow reliable exchange of data. This paper identifies the precise level of handshake needed under different assumptions on the nodes and on the network, using a formal model for connection management. In particular, the following parameters are studied: the size of the memory at the nodes, the information retained between incarnations, and the existence of time constraints on the network. Among the results we obtain are: (1) If both nodes have bounded memory, no incarnation management protocol exists. (2) If the nodes have unbounded memory, then a two-way handshake incarnation management protocol exists. (3) If the nodes have unbounded memory, and the server does not retain connection-specific information between incarnations, then a three-way handshake incarnation management protocol exists. On the other hand, a two-way handshake incarnation management protocol does not exist, even if some global information is retained. (4) If a bound on maximum packet lifetime (MPL) is known, then a two-way handshake incarnation management protocol exists, in which the server does not retain connection-specific information between incarnations.