A rapid service discovery mechanism with low bandwidth requirement in decentralized peer-to-peer network

Abstract

Peer-to-peer systems (P2P) have attracted much current attention as a popular way to share huge volumes of resources directly within peers. Existing service discovery protocols and delivery mechanisms designed for decentralized peer-to-peer systems tend to be very inefficient in locating peers and retrieving services, either generating too much load on the system, or providing a bad user experience. To address this problem with least effort, we proposed a novel decentralized service discovery mechanism by creating a new service call P2P Registry (RP2Reg) in DNS. In our scheme, each peer is able to register and discover desirable services automatically through current DNS within a short duration in an efficient way. The proposed method not only performs least searching time and low bandwidth but also ensure that the search process results in a nearest peer that has the desired content. We also present the results of simulation work to validate the viability of our approach. Our simulation study showed that the proposed method achieves fast query response time without incurring excessive service discovery traffic with less server load as compare with Bruth-Force searching solution. © Springer-Verlag Berlin Heidelberg 2004.