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

Um protocolo ALM baseado em desigualdade triangular para distribuição de conteúdo

Resumo: A comunicação por difusão seletiva, ou multicast, permite que uma única transmissão seja feita para um grupo de destinatários. Aplicações de distribuição de conteúdo em larga escala na Internet demandam este tipo de comunicação. Por não haver amplo suporte à comunicação multicast na camada de rede da Internet, alguns protocolos (chamados protocolos ALM Application Layer Multicast) simulam a camada de rede através de redes sobrepostas na camada de aplicação, permitindo o uso da comunicação multicast sobre essas redes. Neste trabalho apresentamos o PALMS, um protocolo ALM voltado para a distribuição de contedo conteínuo proveniente de uma única fonte. Os objetivos principais do PALMS são a distribuição de conteúdo utilizando poucas mensagens de controle e a possibilidade de implantação na estrutura atual da Internet. A arquitetura do PALMS consiste de um servidor responsável pela geração de conteúdo, um tracker responsável pelo auxílio a entrada de nós na rede e pelos peers, que além de consumirem o conteúdo também são responsáveis por propaga-lo pela rede. Os peers se organizam em grupos, e acordos de compartilhamento nos grupos determinam de quem o peer recebe e para quais peers o uxo deve ser transmitido.O PALMS conta com um mecanismo que permite aos peers realizarem trocas de acordos além de diminuir o tempo de recebimento do conteúdo. Este mecanismo utiliza o round-trip-time (RTT) entre os peers, e baseia-se no conceito de desigualdades triangulares. Quando um peer atesta que, ao trocar os acordos de recebimento e transmissão com seu peer transmissor, o tempo de recebimento das mensagens diminui, os acordos são trocados assim como e as posições dos peers no grupo. O protocolo foi implementado no simulador PeerSIM utilizando a linguagem Java, e comparado a outros protocolos de distribuição de conteúdo. Experimentos demonstram que, além do PALMS apresentar-se como uma solução factível na Internet hoje, ele também utiliza menor largura de banda para mensagens de controle que as alternativas apresentadas

A novel service discovery model for decentralised online social networks.

Online social networks (OSNs) have become the most popular Internet application that attracts billions of users to share information, disseminate opinions and interact with others in the online society. The unprecedented growing popularity of OSNs naturally makes using social network services as a pervasive phenomenon in our daily life. The majority of OSNs service providers adopts a centralised architecture because of its management simplicity and content controllability. However, the centralised architecture for large-scale OSNs applications incurs costly deployment of computing infrastructures and suffers performance bottleneck. Moreover, the centralised architecture has two major shortcomings: the single point failure problem and the lack of privacy, which challenges the uninterrupted service provision and raises serious privacy concerns. This thesis proposes a decentralised approach based on peer-to-peer (P2P) networks as an alternative to the traditional centralised architecture. Firstly, a self-organised architecture with self-sustaining social network adaptation has been designed to support decentralised topology maintenance. This self-organised architecture exhibits small-world characteristics with short average path length and large average clustering coefficient to support efficient information exchange. Based on this self-organised architecture, a novel decentralised service discovery model has been developed to achieve a semantic-aware and interest-aware query routing in the P2P social network. The proposed model encompasses a service matchmaking module to capture the hidden semantic information for query-service matching and a homophily-based query processing module to characterise user’s common social status and interests for personalised query routing. Furthermore, in order to optimise the efficiency of service discovery, a swarm intelligence inspired algorithm has been designed to reduce the query routing overhead. This algorithm employs an adaptive forwarding strategy that can adapt to various social network structures and achieves promising search performance with low redundant query overhead in dynamic environments. Finally, a configurable software simulator is implemented to simulate complex networks and to evaluate the proposed service discovery model. Extensive experiments have been conducted through simulations, and the obtained results have demonstrated the efficiency and effectiveness of the proposed model.University of Derb