Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


ucin1020698148.pdf (471.32 KB)

ETD Abstract Container

Abstract Header

ADVANCED INDEXING TECHNIQUES FOR FILE SHARING IN P2P NETWORKS

PONNAVAIKKO, KOVENDHAN
http://rave.ohiolink.edu/etdc/view?acc_num=ucin1020698148

Abstract Details

2002, MS, University of Cincinnati, Engineering : Computer Science.
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.
Dr. Fred Annexstein (Advisor)
75 p.
Computer Science
P2P networks; indexing; file sharing

Recommended Citations

Citations

  • PONNAVAIKKO, K. (2002). ADVANCED INDEXING TECHNIQUES FOR FILE SHARING IN P2P NETWORKS [Master's thesis, University of Cincinnati]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1020698148

    APA Style (7th edition)

  • PONNAVAIKKO, KOVENDHAN. ADVANCED INDEXING TECHNIQUES FOR FILE SHARING IN P2P NETWORKS. 2002. University of Cincinnati, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=ucin1020698148.

    MLA Style (8th edition)

  • PONNAVAIKKO, KOVENDHAN. "ADVANCED INDEXING TECHNIQUES FOR FILE SHARING IN P2P NETWORKS." Master's thesis, University of Cincinnati, 2002. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1020698148

    Chicago Manual of Style (17th edition)

ucin1020698148
721
© 2002, all rights reserved.
This open access ETD is published by University of Cincinnati and OhioLINK.