An Efficient Contents Discovery Mechanism in Pure P2P Environments

Abstract

Recently, the rapid growth of Internet technology and the deployment of high speed networks make many kinds of multimedia services possible. Preexisting multimedia services are designed based on the client-server model which has the problems such as the server failure and the low speed communication due to the high load on the central server. To solve these problems, P2P (peer-to-peer) networks have been introduced and they have also been expanded through Internet environments. In this paper, we propose a pure P2P network based contents discovery mechanism for multimedia services. In the proposed scheme, each host maintains the location information not only on the contents which are recently requested by other hosts but also on the replicas of its local contents. In pure P2P network environments, our proposed scheme has faster response time and incurs smaller traffic than the pre-existing discovery schemes. By decentralizing the location information and differentiating the reply path, our proposed scheme can also solve the search results loss problem that occurs when the network is unsettled.

This work was supported by the Korea Research Foundation Grant (KRF-2002-041-D00420)