Modulo-N incarnation numbers for cache-based transport protocols

Abstract

To provide reliable connection management, a transport protocol uses 3-way handshakes in which user incarnations are identified by bounded incarnation numbers from some modulo-N space. Recently, several caching schemes have been proposed to reduce the 3-way handshake to a 2-way handshake. The authors define a class of caching protocols and determine the minimum value of N needed as a function of real-time constraints (e.g., message lifetime, incarnation creation rate, inactivity duration, cache residency times, 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., a clock). These protocols assume a maximum duration for each incarnation; without this assumption, there is a very small probability of misinterpretation of incarnation numbers. This restriction can be overcome with some additional caching.<>