A Flexible Resource Location Protocol for Peer-to-Peer Network

Abstract

An important and fundamental issue in designing structured peer-to-peer networks is the tradeoff between the number of logical links and the number of hops. We present a flexible resource location protocol called K-Chord, for KC, which is based on the idea of proportional search. We conduct indepth study on KC. We show that KC achieves an excellent tradeoff between the number of logical links and the number of hops. The performances of KC have been evaluated using both theoretical analysis and simulation.