By Topic

Comments on "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
$33 $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)
A. L. Olah ; Dept. of Electr. Eng., Twente Univ., Enschede, Netherlands ; S. M. Heemstra de Groot

The authors comment on a class of minimum-latency transport protocols that have been analyzed by Shankar and Lee (see ibid., vol.3, no.3, p.255, 1995). The protocols use unique incarnation numbers and caching schemes to reduce the latency of connection setup whenever possible. They discuss three modifications to the protocol. (1) A modification to the opening procedure which eliminates some constraints for the correctness of the protocol. (2) A modification which allows data messages in the opening state of the client to be sent. This reduces the latency in some situations for the price of stricter constraints for correctness. (3) An alternate way of closing connections. Apart from these modifications, they also show that the proofs can be refined to get somewhat less restrictive constraints for the correctness of the protocol.

Published in:

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