A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Nodes within existing P2P networks typically exchange periodic keep-alive messages in order to maintain network connections between neighbours. This paper investigates a number of algorithms which allow each individual connections to extend the interval between successive keep-alive messages based upon the likelihood that a corresponding node will remain in the system. Several studies have shown that older peers are more likely to remain in the network longer than their short-liveddoi:10.4108/icst.collaboratecom2009.8268 dblp:conf/colcom/PriceT09 fatcat:moenzvx4qvbcjarfnpawqs2dre