Home // EMERGING 2010, The Second International Conference on Emerging Network Intelligence // View article

Past-based Search Function in Pastry

Authors:
Wang-Cheol Song
Seung-Chan Lee

Keywords: Search Function, Structured P2P, Pastry, PAST, DHT

Abstract:
The P2P technology is very popular to share several kinds of contents such as mp3 and video in the Internet. Recently the structured P2P has been studied widely, and there are many P2P algorithms such as Pastry, CAN, Chord, Tapestry and so on based on the Distributed Hash Table (DHT). As these structured P2P provides the context-aware routing, content can be shared among user-peers without help of any servers. However, the general users are used to utilize the keyword-based search engine in the Internet for searching content, and the structured P2P supports only the exact matching. Hence, a keyword-based searching algorithm is required. In this paper we propose a search function in Pastry – one of the structured P2Ps. The search function is designed using PAST which is the file storage system of Pastry.

Pages: 56 to 60

Copyright: Copyright (c) IARIA, 2010

Publication date: October 25, 2010

Published in: conference

ISSN: 2326-9383

ISBN: 978-1-61208-103-8

Location: Florence, Italy

Dates: from October 25, 2010 to October 30, 2010