7,500 research outputs found
Socially-Aware Distributed Hash Tables for Decentralized Online Social Networks
Many decentralized online social networks (DOSNs) have been proposed due to
an increase in awareness related to privacy and scalability issues in
centralized social networks. Such decentralized networks transfer processing
and storage functionalities from the service providers towards the end users.
DOSNs require individualistic implementation for services, (i.e., search,
information dissemination, storage, and publish/subscribe). However, many of
these services mostly perform social queries, where OSN users are interested in
accessing information of their friends. In our work, we design a socially-aware
distributed hash table (DHTs) for efficient implementation of DOSNs. In
particular, we propose a gossip-based algorithm to place users in a DHT, while
maximizing the social awareness among them. Through a set of experiments, we
show that our approach reduces the lookup latency by almost 30% and improves
the reliability of the communication by nearly 10% via trusted contacts.Comment: 10 pages, p2p 2015 conferenc
Self-Healing Protocols for Connectivity Maintenance in Unstructured Overlays
In this paper, we discuss on the use of self-organizing protocols to improve
the reliability of dynamic Peer-to-Peer (P2P) overlay networks. Two similar
approaches are studied, which are based on local knowledge of the nodes' 2nd
neighborhood. The first scheme is a simple protocol requiring interactions
among nodes and their direct neighbors. The second scheme adds a check on the
Edge Clustering Coefficient (ECC), a local measure that allows determining
edges connecting different clusters in the network. The performed simulation
assessment evaluates these protocols over uniform networks, clustered networks
and scale-free networks. Different failure modes are considered. Results
demonstrate the effectiveness of the proposal.Comment: The paper has been accepted to the journal Peer-to-Peer Networking
and Applications. The final publication is available at Springer via
http://dx.doi.org/10.1007/s12083-015-0384-
Epidemic Information Diffusion: A Simple Solution to Support Community-based Recommendations in P2P Overlays
Epidemic protocols proved to be very efficient solutions for supporting
dynamic and complex information diffusion in highly dis- tributed computing
infrastructures, like P2P environments. They are useful bricks for building and
maintaining virtual network topologies, in the form of overlay networks as well
as to support pervasive diffusion of information when it is injected into the
network. This paper proposes a simple architecture exploiting the features of
epidemic approaches to foster a collaborative percolation of information
between computing nodes belonging to the network aimed at building a system
that groups similar users and spread useful information among them.Comment: 8 pages, 2 figure
On the Topology Maintenance of Dynamic P2P Overlays through Self-Healing Local Interactions
This paper deals with the use of self-organizing protocols to improve the
reliability of dynamic Peer-to-Peer (P2P) overlay networks. We present two
approaches, that employ local knowledge of the 2nd neighborhood of nodes. The
first scheme is a simple protocol requiring interactions among nodes and their
direct neighbors. The second scheme extends this approach by resorting to the
Edge Clustering Coefficient (ECC), a local measure that allows to identify
those edges that connect different clusters in an overlay. A simulation
assessment is presented, which evaluates these protocols over uniform networks,
clustered networks and scale-free networks. Different failure modes are
considered. Results demonstrate the viability of the proposal.Comment: A revised version of the paper appears in Proc. of the IFIP
Networking 2014 Conference, IEEE, Trondheim, (Norway), June 201
Network Information Flow in Small World Networks
Recent results from statistical physics show that large classes of complex
networks, both man-made and of natural origin, are characterized by high
clustering properties yet strikingly short path lengths between pairs of nodes.
This class of networks are said to have a small-world topology. In the context
of communication networks, navigable small-world topologies, i.e. those which
admit efficient distributed routing algorithms, are deemed particularly
effective, for example in resource discovery tasks and peer-to-peer
applications. Breaking with the traditional approach to small-world topologies
that privileges graph parameters pertaining to connectivity, and intrigued by
the fundamental limits of communication in networks that exploit this type of
topology, we investigate the capacity of these networks from the perspective of
network information flow. Our contribution includes upper and lower bounds for
the capacity of standard and navigable small-world models, and the somewhat
surprising result that, with high probability, random rewiring does not alter
the capacity of a small-world network.Comment: 23 pages, 8 fitures, submitted to the IEEE Transactions on
Information Theory, November 200
- …