A rapid evaluation of peers session length in Kademlia P2P networks

as a classical peer-to-peer (P2P) distributed hash table (DHT) designed for the P2P eMule file sharing system, Kademlia has shown the advantages of a purely decentralized approach communicating P2P networks. One crucial point in Kademlia implementations (collectively called Kad) is long-session peers which are more important to maintain stable daily function than other peers. This paper presents Kad features in current eMule. We see that eMule scale has shrunk against 100,000 simultaneous alive peers and peers' session length is closed related to its attributes. Furthermore, RPSE is proposed to rapid evaluate the session length of Kad peers based on the bottom of the routing table. A key feature of our proposed method that differentiates it from prior methods is executable without a certain term monitor, feasible to peer-side. At last, the validity of the method is analyzed in real-life networks.