Social Peer-to-Peer for Resource Discovery

Liu, Lu; Antonopoulos, Nick; Mackin, Stephen

doi:10.1109/pdp.2007.76

Cited by 26 publications

(9 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Authors in [5] present a new social-like P2P algorithm (Social-P2P) for resource discovery by mimicking human interactions in social networks where peer nodes are people and connections are relationships. Random Walk [6] is one popular searching method in P2P which a query is forwarded to a randomly chosen neighbor hop by hop until enough responses have been found.…”

Section: Background and Related Workmentioning

confidence: 99%

socP2P: P2P content discovery enhancement by considering social networks characteristics

Farahbakhsh

Crespi

Cuevas

et al. 2012

2012 IEEE Symposium on Computers and Communications (ISCC)

View full text Add to dashboard Cite

Abstract-Content management appears as an essential requirement in order to deploy enhanced P2P networks. In P2P networks, the content that is requested by the query node could be located at different locations/nodes; therefore an efficient search mechanism is required. The proposed search algorithm in this paper, called socP2P, relies on peers' social relationships (friendships, shared interests, shared background and experiences) to improve the content discovery compared to similar solutions. With socP2P nodes can improve searches by using knowledge gained by 'overheard information' during their stay in the network. In addition, our algorithm exploits peers' common interests, friendships, and capability of memorizing experiences (received and routed queries) by them. Simulation results show that socP2P is able to achieve a high success rate, low delay and low overhead. We have verified that our algorithm is not only useful in finding popular contents in the network but also good enough to locate rare files. The obtained results reflect that exploiting social information in P2P networks leads to a more efficient content search mechanism.Keywords: Content Discovery, Peer-to-Peer networks, Social Network, Random Walk I. BACKGROUND AND RELATED WORK A Peer-to-Peer (P2P) network is a virtual overlay network, built at application layer, on top of a physical network topology. Decentralization and self-organization are key features of P2P networks. AS the number and location of contents in a P2P system have a strong impact on the performance, it is not surprising that content management in P2P networks is one of the research challenges in this area. Peers do not have global knowledge about the network and they have to interact with each other to find the required resource. With the increasing number of peers, the rate of possible interactions may also increase exponentially and hence this strategy is not applicable. In addition, existing unstructured P2P search techniques create huge network traffic or they require high search overhead [4].Most of the search methods for unstructured P2P networks are focusing on solving their issues by means of blind flooding. Authors in [5] present a new social-like P2P algorithm (Social-P2P) for resource discovery by mimicking human interactions in social networks where peer nodes are people and connections are relationships. Random Walk [6] is one popular searching method in P2P which a query is forwarded to a randomly chosen neighbor hop by hop until enough responses have been found. Also Gnutella [8] appears as one of the most popular P2P file-sharing applications which require nodes to broadcast messages to their neighbors in order to perform content lookup.Given that recent studies of P2P systems have provided a series of useful solutions to improve the performance of content management in P2P networks, realizing an advanced method of content management by means of social relations of users in OSNs is still an open issue in ongoing research. The objectives, requirements and chall...

show abstract

Section: Background and Related Workmentioning

confidence: 99%

socP2P: P2P content discovery enhancement by considering social networks characteristics

Farahbakhsh

Crespi

Cuevas

et al. 2012

2012 IEEE Symposium on Computers and Communications (ISCC)

View full text Add to dashboard Cite

show abstract

“…This idea is extended in [18], where a P2P algorithm for resource discovery is used by representing peers as people and connections as relationships. Such organization significantly reduces the overheads of obtaining information from neighbors.…”

Section: Related Workmentioning

confidence: 99%

“…Such organization significantly reduces the overheads of obtaining information from neighbors. Similarly to [18], our proposed protocol attempts to create new connections based on query results and past experiences.…”

Section: Related Workmentioning

confidence: 99%

Adaptive neighborhood selection in peer-to-peer networks based on content similarity and reputation

Pogkas¹,

Kriakov

Chen

et al. 2009

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

To address the two most critical issues in P2P file-sharing systems: efficient information discovery and authentic data acquisition, we propose a Gnutella-like file-sharing protocol termed Adaptive Gnutella Protocol (AGP) that not only improves the querying efficiency in a P2P network but also enhances the quality of search results at the same time. The reputation scheme in the proposed AGP evaluates the credibility of peers based on their contributions to P2P services and subsequently clusters nodes together according to their reputation and shared content, essentially transforming the P2P overlay network into a topology with collaborative and reputed nodes as its core. By detecting malicious peers as well as free-riders and eventually pushing them to the edge of the overlay network, our AGP propagates search queries mainly within the core of the topology, accelerating the information discovery process. Furthermore, the clustering of nodes based on authentic and similar content in our AGP also improves the quality of search results. We have implemented the AGP with the PeerSim simulation engine and conducted thorough experiments on diverse network topologies and various mixtures of honest/dishonest nodes to demonstrate improvements in topology transformation, query efficiency, and search quality by our AGP.

show abstract

“…al [19] presented a content location solution in which peers loosely organize themselves into interest-based structure on top of the existing Gnutella network. A social-like P2P algorithm is presented in our previous study [20] for resource discovery by mimicking human interactions in social networks. Koo et.…”

Section: Small World Overlay In Peer-to-peer Networkmentioning

confidence: 99%

Fault-tolerant peer-to-peer search on small-world networks

Liu¹,

Antonopoulos²,

Mackin³

2007

Future Generation Computer Systems

Self Cite

View full text Add to dashboard Cite

This paper presents small world architecture for P2P networks (SWAN) for content discovery in multi-group P2P systems. A semi-structured P2P algorithm of SWAN is utilized to create and find long-range shortcuts toward remote peer groups. In SWAN, not every peer node needs to be connected to remote groups, but every peer node can easily find which peer nodes have external connections to a specific peer group. From our analysis and simulation, SWAN has the advantages of both structured and unstructured P2P networks and can achieve good performance in both stable and dynamic environments.Keywords: Peer-to-peer; Small world; Information search IntroductionMost early Internet applications are distributed using client/server architecture that has a series of drawbacks, such as performance bottlenecks and low fault tolerance. On the contrary, peer-to-peer (P2P) architecture does not rely on centralized servers to provide access to services and offers an appealing alternative to the client/server model, especially for large-scale distributed applications. This paper presents small world architecture for P2P networks (SWAN) for resource discovery and discovery in multi-group P2P systems. A semi-structured P2P algorithm of SWAN is used to create and discover long-range shortcuts between different peer groups, which can satisfy the following requirements of design:(1) Not every peer node needs to connect to other peer groups;(2) Each peer node needs to know or can easily find which peer nodes have external connections to which peer groups; 3 (3) External links to other peer groups need to be distributed within the peer group and cannot be centralized in one or a few peer nodes.The rest of paper is organized as follows: Section 2 discusses related work. Section 3 presents the SWAN algorithms. The small-world properties of SWAN are analysed in Section 4. The performance evaluation and simulations are given in Section 5 and Section 6, respectively. We conclude the work in Section 7. Related Work Resource Discovery in Peer-to-Peer NetworksExisting P2P solutions for resource discovery can be generally classified into two categories: structured and unstructured P2P systems. Distributed hash tables (DHTs) have become the dominant methodology for resource discovery in structured P2Pnetworks [5]. The observed problem of most DHTs is that the cost of maintaining a consistent distributed index is too high in dynamic environments [6]. Some structured P2P protocols (e.g. Kademlia [7]) are beginning to seek ways to save the cost of maintaining a consistent index. In contrast, unstructured P2P systems (e.g. Gnutella) do not control data placement and are more resilient in dynamic environments, but current unstructured P2P search techniques tend to either require high search overhead or generate massive network traffic.In contrast, SWAN uses a semi-structured P2P search method combining the techniques of both structured and unstructured search methods. SWAN does not strictly rely on DHTs. It can find the requested data inside and ...

show abstract

Social Peer-to-Peer for Resource Discovery

Abstract: Abstract

Cited by 26 publications

References 28 publications

socP2P: P2P content discovery enhancement by considering social networks characteristics

socP2P: P2P content discovery enhancement by considering social networks characteristics

Adaptive neighborhood selection in peer-to-peer networks based on content similarity and reputation

Fault-tolerant peer-to-peer search on small-world networks

Contact Info

Product

Resources

About