ADVANCED INDEXING TECHNIQUES FOR FILE SHARING IN P2P NETWORKS
Main Author: | |
---|---|
Language: | English |
Published: |
University of Cincinnati / OhioLINK
2002
|
Subjects: | |
Online Access: | http://rave.ohiolink.edu/etdc/view?acc_num=ucin1020698148 |
id |
ndltd-OhioLink-oai-etd.ohiolink.edu-ucin1020698148 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-OhioLink-oai-etd.ohiolink.edu-ucin10206981482021-08-03T06:08:34Z ADVANCED INDEXING TECHNIQUES FOR FILE SHARING IN P2P NETWORKS PONNAVAIKKO, KOVENDHAN Computer Science P2P networks indexing file sharing File sharing has been the most popular service for which peer-to-peer (P2P) networks have been used in recent years and it is expected to remain so for a long time. A P2P file-sharing service makes each user's machine a peer in a network of peers and allows the users to share files. Users can issue queries to the network to find out the locations of the files of their interest. The average size of a P2P network is much larger than the average size of a client-server network. Each node in the network receives a lot of queries every second and so has to search through its file indices several times every second to obtain the results for the queries. The time taken by the nodes to respond to the queries can have a large impact on the overall performance of the network. Using proper indexing techniques can reduce the query response time significantly. This thesis work focuses on the study of advanced indexing techniques that can be used to index the filenames in P2P nodes that participate in a file-sharing service. As a case study, a special kind of P2P node, the supernode, was chosen. A supernode provides proxy and indexing services to nodes on slower network connections. Nodes connect to and disconnect from the supernode arbitrarily. So the problem of indexing filenames in the supernode becomes dynamic in nature. We consider two fundamentally different algorithmic models (the Merged Tree Model and the Vector Model) for dynamic indexing. The merged tree model is the model in which the indices obtained from the connecting nodes are combined with a single primary index maintained by the supernode. The vector model is the model in which the indices obtained from the connecting nodes are stored individually as a vector of indices. We provide a formal framework for analyzing the performance of the different models. Furthermore we use simulations to verify the formal framework and to determine precise constant factors. We conclude by demonstrating that a hybrid algorithm is optimal in terms of performance and suggest the parameters to optimization. 2002-05-22 English text University of Cincinnati / OhioLINK http://rave.ohiolink.edu/etdc/view?acc_num=ucin1020698148 http://rave.ohiolink.edu/etdc/view?acc_num=ucin1020698148 unrestricted This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws. |
collection |
NDLTD |
language |
English |
sources |
NDLTD |
topic |
Computer Science P2P networks indexing file sharing |
spellingShingle |
Computer Science P2P networks indexing file sharing PONNAVAIKKO, KOVENDHAN ADVANCED INDEXING TECHNIQUES FOR FILE SHARING IN P2P NETWORKS |
author |
PONNAVAIKKO, KOVENDHAN |
author_facet |
PONNAVAIKKO, KOVENDHAN |
author_sort |
PONNAVAIKKO, KOVENDHAN |
title |
ADVANCED INDEXING TECHNIQUES FOR FILE SHARING IN P2P NETWORKS |
title_short |
ADVANCED INDEXING TECHNIQUES FOR FILE SHARING IN P2P NETWORKS |
title_full |
ADVANCED INDEXING TECHNIQUES FOR FILE SHARING IN P2P NETWORKS |
title_fullStr |
ADVANCED INDEXING TECHNIQUES FOR FILE SHARING IN P2P NETWORKS |
title_full_unstemmed |
ADVANCED INDEXING TECHNIQUES FOR FILE SHARING IN P2P NETWORKS |
title_sort |
advanced indexing techniques for file sharing in p2p networks |
publisher |
University of Cincinnati / OhioLINK |
publishDate |
2002 |
url |
http://rave.ohiolink.edu/etdc/view?acc_num=ucin1020698148 |
work_keys_str_mv |
AT ponnavaikkokovendhan advancedindexingtechniquesforfilesharinginp2pnetworks |
_version_ |
1719431589173133312 |