MINIMUM-LATENCY TRANSPORT PROTOCOLS WITH MODULO-N INCARNATION NUMBERS

To provide reliable connection management, a transport protocol uses 3 -way handshakes in which user incarnations are identified by bounded i ncarnation numbers from some modulo-N space, Cacheing schemes have bee n proposed to reduce the 3-way handshake to a 2-way handshake, providi ng the minimum latency desired for transaction-oriented applications. In:this paper, we define a class of cacheing protocols and determine t he minimum N and optimal cache residency time as a function of real-ti me constraints (e.g., message lifetime, incarnation creation rate, ina ctivity duration, etc.), The protocols use the client-server architect ure and handle failures and recoveries, Both clients and servers gener ate incarnation numbers from a local counter (e.g., clock), These prot ocols assume a maximum duration for each incarnation; without this ass umption, there is a very small probability (approximate to 1/N-2) of m isinterpretation of incarnation numbers, This restriction can be overc ome with some additional cacheing.