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

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

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 co...

Full description

Bibliographic Details
Main Authors: Upfal, Eli, John, Augustine, Pandurangan, Gopal, Robinson, Peter
Other Authors: School of Physical and Mathematical Sciences
Format: Conference Paper
Language:English
Published: 2015
Subjects:
DRNTU::Science::Mathematics::Discrete mathematics::Algorithms
Online Access:https://hdl.handle.net/10356/106530
http://hdl.handle.net/10220/25076
http://dl.acm.org/citation.cfm?id=2095163

Internet

https://hdl.handle.net/10356/106530
http://hdl.handle.net/10220/25076
http://dl.acm.org/citation.cfm?id=2095163

Similar Items