A service discovery mechanism with load balance issue in decentralized peer-to-peer network

Peer-to-peer systems (P2P) have attracted much current attention as a popular way to share huge volumes of resources directly within peers. Efficient content search and load balancing are both important research issues in P2P environments, especially in those without centralized global indexes. Although a number of content search schemes are known to alleviate these problems, they cannot provide flexible object searches while balancing the load for content demand in P2P networks, thereby resulting in severe load imbalance and consequently increased user response times. In this paper, we tend to address these problems that take advantage of current domain name server (DNS) architecture by harnessing all available resources in the P2P networks and balance the load without decreasing user response time. We proposed a novel decentralized service discovery mechanism by creating an agent called P2P registry (P2PReg) as a middleware within DNS and peers. 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 with the help of P2PReg. The proposed method does not only perform least searching time and low bandwidth but also balances load in P2P systems in order to avoid hot spot (refers to a node which receives a large volume of requests in rapidly) problems naturally. It is obvious that the more replicas there are, the better the media delivery quality of the specific content object is. We also present the results of simulation work to validate the viability of our approach. Our simulation study showed that serving data discovery over local search is indeed effective in improving the system performance significantly.