Short: Gossip-based sampling in social overlays
2014 (English)In: Networked Systems: Second International Conference, NETYS 2014, Marrakech, Morocco, May 15–17, 2014, Revised Selected Papers, 2014, 335-340 p.Conference paper (Refereed)
Performance of many P2P systems depends on the ability to construct a random overlay network among the nodes. Current state-of-the-art techniques for constructing random overlays have an implicit requirement that any two nodes in the system should always be able to communicate and establish a link between them. However, this is not the case in some of the environments where distributed systems are required to be deployed, e.g., Decentralized Online Social Networks, Wireless networks, or networks with limited connectivity because of NATs/firewalls, etc. In this paper we propose a gossip based peer sampling service capable of running on top of such restricted networks and producing an on-the-fly random overlay. The service provides every participating node with a set of uniform random nodes from the network, as well as efficient routing paths for reaching those nodes via the restricted network.
Place, publisher, year, edition, pages
2014. 335-340 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 8593
Gossip, Peer sampling, Random overlay, Social overlay, Artificial intelligence, Computer science, Computers, Distributed systems, Efficient routing, On-line social networks, OR-networks, State-of-the-art techniques, Overlay networks
IdentifiersURN: urn:nbn:se:kth:diva-168867DOI: 10.1007/978-3-319-09581-3_26ScopusID: 2-s2.0-84905907041ISBN: 9783319095806OAI: oai:DiVA.org:kth-168867DiVA: diva2:819733
2nd International Conference on Networked Systems, NETYS 2014; Marrakech; Morocco; 15 May 2014 through 17 May 2014
QC 201506112015-06-112015-06-092015-06-11Bibliographically approved