Text-Based Content Search and Retrieval in Ad-hoc P2P Communities

Cuenca-Acuna, Francisco Matias; Nguyen, Thu D.

doi:10.1007/3-540-45745-3_20

Cited by 79 publications

(84 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…SWAN is built upon generic group structure similar to that in Jon Kleinberg's model [13]. Studies like [25,26,27] have presented the methodologies of building an information sharing system by grouping peer nodes. The resource registration service in our previous system [10] is utilized in SWAN.…”

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

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

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

View full text Add to dashboard Cite

show abstract

“…In a related paper [12], the authors define the concept of neighborhood in hierarchical P2P networks and use this concept to devise a method for hub selection and ranking. The PlanetP [5] system uses an unstructured P2P network where nodes propagate Bloom filter summaries of their indices to the network using a gossiping algorithm. Each peer uses a variation of tf/idf to decide what nodes to contact to answer a query.…”

Section: Related Workmentioning

confidence: 99%

LibraRing: An Architecture for Distributed Digital Libraries Based on DHTs

Tryfonopoulos

Idreos

Koubarakis

2005

Research and Advanced Technology for Digital Libraries

View full text Add to dashboard Cite

show abstract

“…Hence so far the query issued by clients are up to context of keyword's complexity and for keyword matching only. More recently, PlanetP [6] presents a distributed text-base content search algorithm in P2P communities. Each peer has a summary produced by VSM.…”

Section: Related Workmentioning

confidence: 99%

Efficient Semantic-Based Content Search in P2P Network

Shen

Shu

2004

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

Abstract-Most existing Peer-to-Peer (P2P) systems support only title-based searches and are limited in functionality when compared to today's search engines. In this paper, we present the design of a distributed P2P information sharing system that supports semantic-based content searches of relevant documents. First, we propose a general and extensible framework for searching similar documents in P2P network. The framework is based on the novel concept of Hierarchical Summary Structure. Second, based on the framework, we develop our efficient document searching system, by effectively summarizing and maintaining all documents within the network with different granularity. Finally, an experimental study is conducted on a real P2P prototype, and a large-scale network is further simulated. The results show the effectiveness, efficiency and scalability of the proposed system.

show abstract

Text-Based Content Search and Retrieval in Ad-hoc P2P Communities

Abstract: We consider the problem of content search and retrieval in peer-to-peer (P2P)

Cited by 79 publications

References 24 publications

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

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

LibraRing: An Architecture for Distributed Digital Libraries Based on DHTs

Efficient Semantic-Based Content Search in P2P Network

Contact Info

Product

Resources

About