CFP last date
20 December 2024
Reseach Article

Tree-based Indexing for DHT-based P2P Systems

by Yi Yi Mar, Aung Htein Maw, Khine Moe Nwe
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 62 - Number 12
Year of Publication: 2013
Authors: Yi Yi Mar, Aung Htein Maw, Khine Moe Nwe
10.5120/10133-4923

Yi Yi Mar, Aung Htein Maw, Khine Moe Nwe . Tree-based Indexing for DHT-based P2P Systems. International Journal of Computer Applications. 62, 12 ( January 2013), 27-33. DOI=10.5120/10133-4923

@article{ 10.5120/10133-4923,
author = { Yi Yi Mar, Aung Htein Maw, Khine Moe Nwe },
title = { Tree-based Indexing for DHT-based P2P Systems },
journal = { International Journal of Computer Applications },
issue_date = { January 2013 },
volume = { 62 },
number = { 12 },
month = { January },
year = { 2013 },
issn = { 0975-8887 },
pages = { 27-33 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume62/number12/10133-4923/ },
doi = { 10.5120/10133-4923 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:11:37.273882+05:30
%A Yi Yi Mar
%A Aung Htein Maw
%A Khine Moe Nwe
%T Tree-based Indexing for DHT-based P2P Systems
%J International Journal of Computer Applications
%@ 0975-8887
%V 62
%N 12
%P 27-33
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. F. Marozzo, D. Talia, and P. Trunfio, "P2P-MapReduce: Parallel data processing in dynamic Cloud environment", Journal of Computer and System Sciences, May 2012.
  2. P. J. Alexander, "Peer-to-Peer File Sharing: The Case of the Music Recording Industry", Review of Industrial Organization, vol. 20, no. 2, pp. 151-161, March 1 2002.
  3. A. Amrou, K. Maly, and M. Zubair, "Freelib: Peer-to-peer-based Digital Libraries", in Proceedings of the 20th International Conference on Advanced Information Networking and Applications, 2006.
  4. "Skype". http://www. skype. com
  5. "Zattoo-Live TV and More", http://zattoo. com.
  6. K. W. Hamlen and B. Thuraisingham, " Secure Peer-to-peer Networks for Trusted Collaboration", in International Conference on Collaborative Computing: Networking, Applications and Worksharing, November 2007.
  7. P. H. Chou, R. B. Ortega, and G. Borriello, "The Chinook Hardware/Software Co-synthesis System", in Proceedings of the 8th International Symposium on System Synthesis, 1995.
  8. M. A. Jovanovic, F. S. Annexstein, and K. A. Berman, " Scalability Issue in Large Peer-to-Peer Networks- A Case Study of Gnutella", Cincinati Univ. , Technical Report, 2001.
  9. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications", ACM SIGCOMM Conference, 2001.
  10. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network", in Proceedings on the Conference on Applications, technologies, architectures, and protocols for computer communications, USA, 2001.
  11. A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems", in Proceeding of th 18th IFIP/ACM International Conference on Distributed Systems Platforms, Heideblerg, Germany, November 2001.
  12. B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph, and J. D. Kubiatowicz, "Tapestry: A Resilient Global-Scale Overlay for Service Deployment", IEEE Journal on Selected Areas in Communications, vol. 22, no. 1, January 2004.
  13. P. Maymounkov and D. Mazieres, " Kademlia: A Peer-to-peer Information System Based on the XOR Metric", in Proceedings of The First International Workshop on Peer-to-Peer Systems, London, 2002.
  14. E. Tanin, A. Harwood, and H. Samet, "A Distributed Quadtree Index for Peer-to-Peer Setting", in Proceedings of the 21st International Conference on Data Engineering, April 5-8, 2005, Tokyo, Japan.
  15. P. Yalagandula and J. Browne, "Solving Range Queries in Distributed System", Tech. Rep. TR-04-18, UT CS, 2003.
  16. S. Ramabhadran, S. Ratnasamy, J. M. Hellerstein, and S. Shenker, "Prefix Hash Tree: An Indexing Data Structure over Distributed Hash Tables", in Proceedings of Conference on Applications, technologies, architectures, and protocols for computer communications, USA, 2005.
  17. Y. Shu, B. C. Ooi, K. L. Tan, and A. Zhou, " Supporting Multi-dimensional Range Queries in Peer-to-Peer Systems", in Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing, USA, 2005.
  18. A. Crainiceanu, P. Linga, J. Gehrke, and J. Shanmugasundaram, " Querying Peer-to-Peer Networks Using P-Trees", 7th International Workshop on the Web and Databases, Paris, France, June 17-18, 2004.
  19. C. Schmidt and M. Parashar, " Flexible Information Discovery in Decentralized Distributed Systems", in Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing, 2003.
  20. P. Ganesan, B. Yang, and H. G. Molina, " One Tours to Rule them All: Multi-dimensional Queries in P2P Systems", Seventh International Workshop on the Web and Databases, Paris, France, June 17-18, 2004.
  21. X. Wei and K. Sezaki, "DHR-TREES: A Distributed Multi-dimensional Indexing Structure for P2P Systems", Scalable Computing: Practice and Experience, vol. 8, November 2007.
  22. C. Zhen, G. Shen, S. Li, and S. Shenker, "Distributed Segment Tree: Support of Range Query and Cover Query over DHT", in Proceedings of the 5th International Workshop on Peer-to-Peer Systems, February 2006.
  23. Y. Tang, S. Zhou, J. Xu, and W. C. Lee, " A Lightweight Multi-dimensional Index for Range Queries over DHTs", IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 12, pp. 2046-2054, December 2011.
  24. "DBLP". http://dblp. uni-trier. de/xml.
  25. J. H. Friedman, J. L. Bentley, and R. A. Finkel, "An Algorithm for Finding Best Matches in Logarithmic Expected Time", ACM Transactions on Mathematical Software, vol. 3, no. 3, September 1977.
  26. M. d. Berg, O. Cheong, M. v. Kreveld, and M. Overmars, Computational Geometry: Algorithms and Applications, Springer, 2008
  27. M. Wu, Master Thesis-2006. pdf. On R-tree Index Structures and Nearest Neighbour Queries.
  28. FIPS. PUBS 180-2 Secure Hash Standard U. S. Department of Commerce/NIST, August 1, 2002.
  29. I. Stoica, R. Morris, D. Liben-Nowell, D. r. Karger, M. F. Kaashoek, F. Dabek, and H. Balarishnan, "Chord: AScalabel Peer-to-peer Lookup Protocol for Internet Applications", IEEE/ACM Transactions on Networking, vol. 11, pp. 17-32, February 2003.
  30. P. Garcia, C. Pairot, R. Monderjar, J. Pujol, H. Tejedor, and R. Rallo, "PlanetSim: A New Overlay Network Simulation Framework", in Proceedings of the 4th International Conference on Software Engineering and Middleware, 2005.
Index Terms

Computer Science
Information Sciences

Keywords

Indexing over DHT DHT-based indexing system Query processing over DHT Indexing in structured P2P systems