Model of complex searching over structured P2P overlay under dynamic environment

Khan, Saiful and Gani, Abdullah (2012) Model of complex searching over structured P2P overlay under dynamic environment. International Journal of Information and Electronics Engineering, 2 (2). pp. 146-150. ISSN 2010-3719,

Preview

PDF 2012_Model_of_Complex_Searching_Over_Structured_P2P_Overlay_under_Dynamic_Environment.pdf Download (791kB)

Abstract

This paper aims to present a model to achieve complex searching (e.g. Wild card searching, blind searching, full text searching, metadata searching, etc.) over Structured P2P Overlay under dynamic environment. Lack of complex searching over Structured Overlay network and poor resilience due to peer dynamics makes it unsuitable for implementing the P2P systems and thus makes it very unpopular. In implementing the complex searching technique in structured overlay, the query must be processed by each node (peer) locally. This requires query to be efficiently broadcasted to all the nodes. However, broadcasting based algorithms tend to perform badly under highly dynamic environment and also create huge amount of maintenance traffic. This paper proposes a model which combines broadcasting based algorithm with efficient maintenance algorithm, which will reduce the maintenance traffic and increase the search efficiency.

Item Type:	Article
Funders:	UNSPECIFIED
Uncontrolled Keywords:	Structured overlay; Distributed hash table (dht); Churn; P2P and broadcast
Subjects:	T Technology > T Technology (General)
Divisions:	Faculty of Computer Science & Information Technology
Depositing User:	Ms Maisarah Mohd Muksin
Date Deposited:	15 Jan 2013 02:21
Last Modified:	12 Oct 2018 01:27
URI:	http://eprints.um.edu.my/id/eprint/4463

Actions (login required)

View Item