• Aucun résultat trouvé

Repairing Flocks in Peer-to-Peer Networks

N/A
N/A
Protected

Academic year: 2021

Partager "Repairing Flocks in Peer-to-Peer Networks"

Copied!
6
0
0

Texte intégral

(1)

HAL Id: hal-00973457

https://hal.archives-ouvertes.fr/hal-00973457

Submitted on 4 Apr 2014

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci- entific research documents, whether they are pub- lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Repairing Flocks in Peer-to-Peer Networks

Benoît Romito, Hugo Pommier, François Bourdon

To cite this version:

Benoît Romito, Hugo Pommier, François Bourdon. Repairing Flocks in Peer-to-Peer Networks.

IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, 2011, Lyon, France. p.308-312. �hal-00973457�

(2)
(3)
(4)
(5)
(6)

Références

Documents relatifs

In the first one there are some peers owning all the chunks (roots) composing a file and the aim is to study the time required to ensure that every chunk is spread out on the

There is a broad spectrum of peer-to-peer systems : the peer-to-peer file sharing systems allow a keyword-based search ; the peer-to-peer data management sys- tems transpose in

Lorsqu’un écrit scientifique issu d’une activité de recherche financée au moins pour moitié par des dotations de l’État, des collectivités territoriales ou des

For example: suppose that are 100 objects and 50 nodes bamboo, a node requests an object for the first time, the algorithm calculates the number of hops and

Our main goal is to introduce the architecture of prototype of such p2p network and search request routing/data storing/indexing protocols for it, that allows any node to

It then focuses on trust issues within ontology based peer-to-peer networks and closes with requirements that are needed for a successful and trustful network and a possible

Supporting Structured Credentials and Sensitive Policies through Interoperable Strategies for Automated Trust Negotiation, ACM Transactions on Information and System Security,

The simulations were performed by varying five parameters: (i) average inter-arrival time (T arr ); (ii) number of peers interested in the target file during the simulation period (N