DocumentCode
470068
Title
Schedule-based P2P network organization
Author
Tout, Rabih ; Lumineau, Nicolas ; Ghodous, Parisa ; Tanasoiu, Mihai
Author_Institution
LIRIS, Univ. Lyon 1, Villeurbanne
Volume
1
fYear
2007
fDate
28-31 Oct. 2007
Firstpage
382
Lastpage
386
Abstract
In this article, we propose an approach to improve peer-to-peer (P2P) backup protocol. The main idea of PIP backup systems is to use the shared storage space available on each peer in order to store data replicas of each data. These solutions become popular to ensure data availability but several limits quickly appear because of the lack of collaboration between peers. In order to resolve some existing limits related to the large scale highly dynamic context of P2P networks, we define a set of schedules for each peer and for each group of collaborating peers to model their availability and needs. Our approach based on a specific clustered organization of the network allows improving the interaction of the collaborating peers and the definition of a group satisfaction metric which allows efficiently handling and maintaining the peer groups. Indeed, the backup process based on collaborating peers ensures the efficient usage of peer resources. Performances are validated through simulations.
Keywords
peer-to-peer computing; protocols; group satisfaction metric; peer-to-peer backup protocol; schedule-based P2P network; Application software; Availability; Collaboration; Computer crashes; Context modeling; Dynamic scheduling; Image restoration; Large-scale systems; Peer to peer computing; Protocols;
fLanguage
English
Publisher
ieee
Conference_Titel
Digital Information Management, 2007. ICDIM '07. 2nd International Conference on
Conference_Location
Lyon
Print_ISBN
978-1-4244-1475-8
Electronic_ISBN
978-1-4244-1476-5
Type
conf
DOI
10.1109/ICDIM.2007.4444253
Filename
4444253
Link To Document