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...
Saved in:
Main Authors: | Upfal, Eli, John, Augustine, Pandurangan, Gopal, Robinson, Peter |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/106530 http://hdl.handle.net/10220/25076 http://dl.acm.org/citation.cfm?id=2095163 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
On the complexity of information spreading in dynamic networks
by: Dutta, Chinmoy, et al.
Published: (2015) -
Enforcing efficient equilibria in network design games via subsidies
by: Augustine, John, et al.
Published: (2013) -
Efficient implementations of the BP heuristic for the shortest linear program (SLP) problem
by: Liu, Shuqing
Published: (2021) -
On the tradeoff among efficiency, fairness and revenue in resource allocation
by: Hua, Xia
Published: (2012) -
Multi-exponentiation algorithm based on binary GCD computation and its application to side-channel countermeasure
by: Yen, Sung-Ming, et al.
Published: (2014)