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: | , , , |
---|---|
其他作者: | |
格式: | Conference or Workshop Item |
語言: | English |
出版: |
2015
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/106530 http://hdl.handle.net/10220/25076 http://dl.acm.org/citation.cfm?id=2095163 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
成為第一個發表評論!