A timer-based connection management protocol with synchronized clocks and its verification

Biersack, Ernst W.; Feldmeier, David C.

doi:10.1016/0169-7552(93)90021-u

Cited by 10 publications

(9 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The only drawback with the SC protocols is N's dependence on I, if one is concerned about exceedingly long-lived incarnations, say, of the order of days. If we assume that the probability of two successive connections having identical modulo-N client and server incarnation numbers is negligible (this probability is the same as for 3-way handshakes and is 1 N 2 under reasonable assumptions of incarnation lifetimes), then the following bound which does not depend on I su ces: (T2')…”

Section: (T1) C S > W C and R S > W C And W C > W S And R C > W S And R C > C And R S > Smentioning

confidence: 99%

“…Consider a client-server pair. The server caches an incarnation number x of a client in two ways: (1) if it becomes open to client incarnation x as a result of a 3-way handshake; and (2) if it receives a connection request from the client with incarnation number x when its cache has a value y < x (whether or not the server accepts the request). In both cases, the cacheing of x signi es that the server has not connected previously to incarnation x or to any later incarnation of the client.…”

Section: Protocol Sc1: Unbounded Incarnation Numbersmentioning

confidence: 99%

“…The transport layer in a computer network consists of clients and servers, collectively referred to as entities. 1 We assume that entities can send messages to each other over channels that can lose, reorder, and duplicate messages; this is the typical network service available to the transport layer. Entities and channels can fail and recover.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Minimum-latency transport protocols with modulo-N incarnation numbers

Shankar

Lee

1995

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

To provide reliable connection management, a transport protocol uses 3-way handshakes in which user incarnations are identi ed by bounded incarnation numbers from some modulo-N space. Cacheing schemes have been proposed to reduce the 3-way handshake to a 2-way handshake, providing the minimumlatency desired for transaction-oriented applications. In this paper, we de ne a class of cacheing protocols and determine the minimum N and optimal cache residency time as a function of real-time constraints (e.g. message lifetime, incarnation creation rate, inactivity duration, etc.). The protocols use the client-server architecture and handle failures and recoveries. Both clients and servers generate incarnation numbers from a local counter (e.g. clock). These protocols assume a maximum duration for each incarnation; without this assumption, there is a very small probability ( 1N 2 ) of misinterpretation of incarnation numbers. This restriction can be overcome with some additional cacheing.

show abstract

Section: (T1) C S > W C and R S > W C And W C > W S And R C > W S And R C > C And R S > Smentioning

confidence: 99%

Section: Protocol Sc1: Unbounded Incarnation Numbersmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Minimum-latency transport protocols with modulo-N incarnation numbers

Shankar

Lee

1995

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…Timer-based mechanisms for connection management appear in [3,5,11,23,24], and their comparison with the handshake mechanism for connection management is discussed. Other work considers verification of specific connection management pro-tocols, e.g., [8-10, 13, 14].…”

Section: Introductionmentioning

confidence: 99%

The level of handshake required for managing a connection

Attiya

Rappoport

1997

Distributed Computing

View full text Add to dashboard Cite

A connection between two hosts across a widearea 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.

show abstract

“…The difference between CM protocols lies in the way of assigning the IDs to requests and the way of storing the set of old IDs. Several protocols have been proposed recently which are able to open connections without the three-way handshake such as CMSC (Biersack and Feldmeier, 1993), Delta-t (Fletcher and Watson, 1978), and SCMP (Liskov et al, 1991).…”

Section: Introductionmentioning

confidence: 99%

Assertional Verification of a connection management protocol

Oláh¹,

Groot²

1996

Formal Description Techniques VIII

View full text Add to dashboard Cite

This paper deals with the verification of a connection management protocol which uses timestamps and network-wide synchronized clocks for the reliable opening and closing of connections. We prove the correctness of the protocol over an unreliable, bounded-delay network for the cases when (i) timestamps are unbounded; (ii) timestamps are from a finite modulo-N space. We determine the minimal safe value of N as a function of realtime parameters such as maximum packet lifetime, clock skew and maximum connection duration. The protocol is modeled as a state-transition system and we argue about the properties of the system using an assertional technique based on temporal logic. Apart from handling safety and progress properties, this framework is also suitable to describe real-time aspects of the system.

show abstract

A timer-based connection management protocol with synchronized clocks and its verification

Cited by 10 publications

References 10 publications

Minimum-latency transport protocols with modulo-N incarnation numbers

Minimum-latency transport protocols with modulo-N incarnation numbers

The level of handshake required for managing a connection

Assertional Verification of a connection management protocol

Contact Info

Product

Resources

About