Tree-based Indexing for DHT-based P2P Systems

Nowadays, DHT-based P2P technology is used as a basis in many wide spread applications because of its scalability, robustness, and load balance. Many applications, including file sharing, communication and live video streaming are in a large distributed network environment. For an efficient and effe...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computer applications 2013-01, Vol.62 (12), p.27-33
Main Authors: Mar, Yi Yi, Maw, Aung Htein, Nwe, Khine Moe
Format: Article
Language:English
Subjects:
Computer simulation
Construction
Indexing
Networks
Performance indices
Query processing
Robustness
Spreads
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Nowadays, DHT-based P2P technology is used as a basis in many wide spread applications because of its scalability, robustness, and load balance. Many applications, including file sharing, communication and live video streaming are in a large distributed network environment. For an efficient and effective search in large data repositories, complex query processing becomes a major issue for DHT. Towards the goal of supporting complex queries in DHT-based P2P systems, this paper focuses on the usage of k-dimensional tree to build a tree-based index. The proposed index is built without modifying the structure of the overlay network. In this paper, the load balancing among peers is also considered according to the usage of kd-tree. Therefore the performance of kd-tree is studied and show that how it can affect the proposed index over P2P network. In this paper, PlanetSim simulator is used to implement the proposed index and evaluate the performance of the index by using various metrics.
ISSN:0975-8887
0975-8887
DOI:10.5120/10133-4923