P2P Overlay Maintenance Algorithm

摘要

Peer to peer networking has emerged as viable business model and systems architecture for internet scale application since it attracts millions of simultaneous participants. In P2P overlay network (collection of peer connections in a P2P network) peers join and leave the overlay arbitrarily and do not stay in the overlay for a predictable time. To ensure dependability of the overlay, peers with neighbor links to the joining or leaving peers requires updates. Therefore overlay maintenance protocols have to be devised to include efficient features that able to handle peer chum. In this paper we are focusing on the P2P overlay maintenance protocol through which the peers in the overlay maintains routing properties, referred as overlay maintenance. We have proposed an efficient method to find stale routing table entries in a way that retains the desired routing behavior since the look up query traffic and overlay maintenance traffic both compete for the underlying network bandwidth and resources, maintenance traffic should be constrained to that needed for target table accuracy.