355,566 research outputs found
HiTrust: building cross-organizational trust relationship based on a hybrid negotiation tree
Small-world phenomena have been observed in existing peer-to-peer (P2P) networks which has proved useful in the design of P2P file-sharing systems. Most studies of constructing small world behaviours on P2P are based on the concept of clustering peer nodes into groups, communities, or clusters. However, managing additional multilayer topology increases maintenance overhead, especially in highly dynamic environments. In this paper, we present Social-like P2P systems (Social-P2Ps) for object discovery by self-managing P2P topology with human tactics in social networks. In Social-P2Ps, queries are routed intelligently even with limited cached knowledge and node connections. Unlike community-based P2P file-sharing systems, we do not intend to create and maintain peer groups or communities consciously. In contrast, each node connects to other peer nodes with the same interests spontaneously by the result of daily searches
Structure of Peer-to-Peer Social Networks
This paper presents a statistical analysis of the structure of Peer-to-Peer
(P2P) social networks that captures social associations of distributed peers in
resource sharing. Peer social networks appear to be mainly composed of pure
resource providers that guarantee high resource availability and reliability of
P2P systems. The major peers that both provide and request resources are only a
small fraction. The connectivity between peers, including undirected, directed
(out and in) and weighted connections, is scale-free and the social networks of
all peers and major peers are small world networks. The analysis also confirms
that peer social networks show in general disassortative correlations, except
that active providers are connected between each other and by active
requesters. The study presented in this paper gives a better understanding of
peer relationships in resource sharing, which may help a better design of
future P2P networks and open the path to the study of transport processes on
top of real P2P topologies.Comment: APS Style, 8 pages, 5 figures and 4 tables. Final versio
Recommended from our members
Self-organizing peer-to-peer social networks
This is the author's accepted manuscript. The final published article is available from the link below. Copyright @ 2008 The Authors.Peer-to-peer (P2P) systems provide a new solution to distributed information and resource sharing because of its outstanding properties in decentralization, dynamics, flexibility, autonomy, and cooperation, summarized as DDFAC in this paper. After a detailed analysis of the current P2P literature, this paper suggests to better exploit peer social relationships and peer autonomy to achieve efficient P2P structure design. Accordingly, this paper proposes Self-organizing peer-to-peer social networks (SoPPSoNs) to self-organize distributed peers in a decentralized way, in which neuron-like agents following extended Hebbian rules found in the brain activity represent peers to discover useful peer connections. The self-organized networks capture social associations of peers in resource sharing, and hence are called P2P social networks. SoPPSoNs have improved search speed and success rate as peer social networks are correctly formed. This has been verified through tests on real data collected from the Gnutella system. Analysis on the Gnutella data has verified that social associations of peers in reality are directed, asymmetric and weighted, validating the design of SoPPSoN. The tests presented in this paper have also evaluated the scalability of SoPPSoN, its performance under varied initial network connectivity and the effects of different learning rules.National Natural Science of Foundation of Chin
Adaptive service discovery on service-oriented and spontaneous sensor systems
Service-oriented architecture, Spontaneous networks, Self-organisation, Self-configuration, Sensor systems, Social patternsNatural and man-made disasters can significantly impact both people and environments. Enhanced effect can be achieved through dynamic networking of people, systems and procedures and seamless integration of them to fulfil mission objectives with service-oriented sensor systems. However, the benefits of integration of services will not be realised unless we have a dependable method to discover all required services in dynamic environments. In this paper, we propose an Adaptive and Efficient Peer-to-peer Search (AEPS) approach for dependable service integration on service-oriented architecture based on a number of social behaviour patterns. In the AEPS network, the networked nodes can autonomously support and co-operate with each other in a peer-to-peer (P2P) manner to quickly discover and self-configure any services available on the disaster area and deliver a real-time capability by self-organising themselves in spontaneous groups to provide higher flexibility and adaptability for disaster monitoring and relief
Friends for Free: Self-Organizing Artificial Social Networks for Trust and Cooperation
By harvesting friendship networks from e-mail contacts or instant message
"buddy lists" Peer-to-Peer (P2P) applications can improve performance in low
trust environments such as the Internet. However, natural social networks are
not always suitable, reliable or available. We propose an algorithm (SLACER)
that allows peer nodes to create and manage their own friendship networks.
We evaluate performance using a canonical test application, requiring
cooperation between peers for socially optimal outcomes. The Artificial Social
Networks (ASN) produced are connected, cooperative and robust - possessing many
of the disable properties of human friendship networks such as trust between
friends (directly linked peers) and short paths linking everyone via a chain of
friends.
In addition to new application possibilities, SLACER could supply ASN to P2P
applications that currently depend on human social networks thus transforming
them into fully autonomous, self-managing systems
Local Search in Unstructured Networks
We review a number of message-passing algorithms that can be used to search
through power-law networks. Most of these algorithms are meant to be
improvements for peer-to-peer file sharing systems, and some may also shed some
light on how unstructured social networks with certain topologies might
function relatively efficiently with local information. Like the networks that
they are designed for, these algorithms are completely decentralized, and they
exploit the power-law link distribution in the node degree. We demonstrate that
some of these search algorithms can work well on real Gnutella networks, scale
sub-linearly with the number of nodes, and may help reduce the network search
traffic that tends to cripple such networks.Comment: v2 includes minor revisions: corrections to Fig. 8's caption and
references. 23 pages, 10 figures, a review of local search strategies in
unstructured networks, a contribution to `Handbook of Graphs and Networks:
From the Genome to the Internet', eds. S. Bornholdt and H.G. Schuster
(Wiley-VCH, Berlin, 2002), to be publishe
Comparing paedophile activity in different P2P systems
Peer-to-peer (P2P) systems are widely used to exchange content over the
Internet. Knowledge on paedophile activity in such networks remains limited
while it has important social consequences. Moreover, though there are
different P2P systems in use, previous academic works on this topic focused on
one system at a time and their results are not directly comparable.
We design a methodology for comparing \kad and \edonkey, two P2P systems
among the most prominent ones and with different anonymity levels. We monitor
two \edonkey servers and the \kad network during several days and record
hundreds of thousands of keyword-based queries. We detect paedophile-related
queries with a previously validated tool and we propose, for the first time, a
large-scale comparison of paedophile activity in two different P2P systems. We
conclude that there are significantly fewer paedophile queries in \kad than in
\edonkey (approximately 0.09% \vs 0.25%).Comment: Submitte
Investigating Sharing in Memory for Life Systems
Memory for Life (M4L) systems store and organize life events captured by people in digital form using their cameras, mobile phones and so on. This paper describes M4L systems and the challenges for sharing digital events. Based on the challenges, an investigation is carried out in order to find a suitable technology that allows sharing of digital events according to the social network of a user. For this purpose, Web-based online social networks and peer-to-peer networks are particularly studied. The requirements for a social P2P model for sharing human digital events (HDEs) are suggested as future work
- …