An improved lookup protocol model for peer-to-peer networks

With the development of the peer-to-peer (P2P) technology, file sharing is becoming the hottest, fastest growing application on the Internet. Although we can benefit from different protocols separately, our research shows that if there exists a proper model, most of the seemingly different protocols can be classified to a same framework. In this paper, we propose an improved Chord arithmetic based on the binary tree for P2P networks. We perform extensive simulations to study our proposed protocol. The results show that the improved Chord reduces the average lookup path length without increasing the joining and departing complexity.