By Topic

Minimum-latency transport protocols with modulo-N incarnation numbers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shankar, A.U. ; Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA ; Lee, D.

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, Cacheing schemes have been proposed to reduce the 3-way handshake to a 2-way handshake, providing the minimum latency desired for transaction-oriented applications. The authors define 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 (≈1/N2) of misinterpretation of incarnation numbers. This restriction can be overcome with some additional cacheing

Published in:

Networking, IEEE/ACM Transactions on  (Volume:3 ,  Issue: 3 )