Fakultät für Informatik und Mathematik


Paper Description

BibTeX entry

    author="I. Dedinski, H. De Meer",
    title="Cooperative Keep-Alives - An Efficient Outage Detection Algorithem for Overlay Networks",
    institution="Fakult{\"a}t f{\"u}r Mathematik und Informatik, Universit{\"a}t Passau",


One of the challenges of today's overlay systems is still scalability. A key issue in almost every P2P architecture for example is the connection count per single peer. If the connection count is too high, the management overhead for the connections (in terms of keep-alive messages, routing overhead) increases. If the count of the connections per node is too low, the resilience of the system against net splits decreases, the system can hardly route in an optimal way. And if keep-alive messages are not sent frequently enough, outdated information could be propagated, which again could cause net splits. This paper presents a new keep alive algorithm that reduces the costs for sending keep-alive messages and, at the same time, preserves the effectiveness and reliability of the standard keep-alive mechanisms in today' s overlay networks. This algorithm can be used to increase the number of connections per node and thus improve the connectivity and routing efficiency in the network while keeping the keep-alive overhead low. When used without increasing the connection count, the algorithm reduces drastically the keep-alive traffic.