Towards robust and efficient computation in dynamic peer-to-peer networks

symposium on discrete algorithms, Volume abs/1108.0809, 2012, Pages 551-569.

Cited by: 56|Views15
EI

Abstract:

Motivated by the need for robust and fast distributed computation in highly dynamic Peer-to-Peer (P2P) networks, we study algorithms for the fundamental distributed agreement problem. P2P networks are highly dynamic networks that experience heavy node churn (i.e., nodes join and leave the network continuously over time). Our goal is to de...More

Code:

Data:

ZH
Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments