In this paper, the resource availability issue has been addressed with respect to the intermittent connectivity and dynamic presence of peers in a P2P system. We aim to maintain more comprehensive resource available. The contribution of this paper is two fold. First, we analyze the probability of a peer to become a seed consisting of all content. Second, a simple, distributed comprehensive algorithm for resource management is proposed. In order to increase the availability of resources in a P2P network, the peer as well as the fragment of shared content are deliberately allocated during the content sharing process.
|Number of pages||8|
|Journal||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Publication status||Published - 1 Dec 2004|
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)