DPCP: A protocol for optimal pull coordination in decentralized social networks
Refereed conference paper presented and published in conference proceedings


Times Cited
Altmetrics Information
.

Other information
AbstractSocial Networking Service has become an essential part of our life today. However, many privacy concerns have recently been raised due to the centralized nature of such services. Decentralized Social Network (DSN) is believed to be a viable solution for these problems. In this paper, we design a protocol to coordinate the pulling operation of DSN nodes. The protocol is the result of forward engineering via utility maximization that takes communication layer congestion level as well as social network layer centrality into consideration. We solve the pulling rate control problem using the primal-dual approach and prove that the protocol can converge quickly when executed in a decentralized manner. Furthermore, we develop a novel 'drumbeats' algorithm to estimate node centrality purely based on passively-observed information. Simulation results show that our protocol reduces the average message propagation delay by 15% when comparing to the baselined Fixed Equal Gap Pull protocol. In addition, the estimated node centrality matches well with the ground-truth derived from the actual topology of the social network.
All Author(s) ListXu H., Hu P., Lau W.C., Zhang Q., Wu Y.
Name of Conference34th IEEE Annual Conference on Computer Communications and Networks, IEEE INFOCOM 2015
Start Date of Conference26/04/2015
End Date of Conference01/05/2015
Place of ConferenceHong Kong
Country/Region of ConferenceHong Kong
Detailed descriptionorganized by IEEE Communications Society,
Year2015
Month8
Day21
Volume Number26
Pages2614 - 2622
ISBN9781479983810
ISSN0743-166X
LanguagesEnglish-United Kingdom

Last updated on 2021-23-10 at 23:28