We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Using Proximity Measure to Improve Locality in Structured P2P Networks

by Rofide Hadighi, Mohammed Gharib
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 45 - Number 2
Year of Publication: 2012
Authors: Rofide Hadighi, Mohammed Gharib
10.5120/6753-9005

Rofide Hadighi, Mohammed Gharib . Using Proximity Measure to Improve Locality in Structured P2P Networks. International Journal of Computer Applications. 45, 2 ( May 2012), 31-37. DOI=10.5120/6753-9005

@article{ 10.5120/6753-9005,
author = { Rofide Hadighi, Mohammed Gharib },
title = { Using Proximity Measure to Improve Locality in Structured P2P Networks },
journal = { International Journal of Computer Applications },
issue_date = { May 2012 },
volume = { 45 },
number = { 2 },
month = { May },
year = { 2012 },
issn = { 0975-8887 },
pages = { 31-37 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume45/number2/6753-9005/ },
doi = { 10.5120/6753-9005 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:36:35.797932+05:30
%A Rofide Hadighi
%A Mohammed Gharib
%T Using Proximity Measure to Improve Locality in Structured P2P Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 45
%N 2
%P 31-37
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Peer-to-peer networks are generally characterized in terms of sharing computer resources without the intermediation of a centralized server. Interconnected nodes in peer-to-peer networks are able to communicate through a self organizing topology which runs as an overlay on top of the physical network. The mismatch problem between underlay and overlay network in such systems, known as locality problem, creates extra traffic in the network. Knowledge about peers in the underlay network can be used to find the solution of locality problem by defining a proximity measure. This paper proposes an algorithm to measure proximity of nodes in peer-to-peer networks. In this algorithm, we measure proximity among pairs of nodes in the overlay network. The main advantages of our algorithm are making use of two metric for proximity evaluation, and comparing our simulation results with a well known and a structured peer-to-peer network for a better assessment. Also using real data is proper for algorithm performance verification. Results on real data indicate a good performance for the algorithm with low overhead in time and traffic by.

References
  1. L. Napster, "Napster," URL: http://www. napster. com, 2001.
  2. Y. Wang, et al. , "Analyzing the characteristics of gnutella overlays," in Fourth International Conference on Information Technology, ITNG '07, 2007, pp. 1095-1100.
  3. R. A. Ferreira, et al. , "Locality in structured peer-to-peer networks," Journal of Parallel and Distributed Computing, vol. 66, pp. 257-273, 2006.
  4. V. Aggarwal, et al. , "Improving user and ISP experience through ISP-aided P2P locality," in INFOCOM Workshops, 2008, pp. 1-6.
  5. L. G. A. Sung, et al. , "A survey of data management in peer-to-peer systems," School of Computer Science, University of Waterloo, 2005.
  6. O. Abboud, et al. , "Underlay awareness in P2P systems: Techniques and challenges," in IEEE International Symposium on Parallel & Distributed Processing, IPDPS 2009. , 2009, pp. 1-8.
  7. C. Miers, et al. , "A taxonomy for locality algorithms on peer-to-peer networks," Latin America Transactions, IEEE vol. 8, pp. 323 - 331, 2010.
  8. M. Gharib, et al. , "A Novel Method for Supporting Locality in Peer-to-Peer Overlays Using Hypercube Topology," in International Conference on Intelligent Systems, Modelling and Simulation (ISMS), 2010, pp. 391-395.
  9. M. Gharib, et al. , "The Effect of Using Cube Connected Cycle for Improving Locality Awareness in Peer-to-Peer Networks," in 12th International Conference on Computer Modelling and Simulation (UKSim),, 2010, pp. 491-496.
  10. A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems," in Middleware, Heidelberg, Germany, 2001, pp. 329-350.
  11. B. Y. Zhao, et al. , "Tapestry: A resilient global-scale overlay for service deployment," IEEE Journal on elected Areas in Communications,, vol. 22, pp. 41-53, 2004.
  12. P. F. SylviaRatnasamy, et al. , "A Scalable, Content-Addressable Network," SIGCOMM, vol. 1, pp. 161–172, 2001.
  13. M. J. Freedman, et al. , "Geographic locality of IP prefixes," in the 5th ACM SIGCOMM conference on Internet Measurement, 2005, pp. 3-17.
  14. F. Dabek, et al. , "Vivaldi: A decentralized network coordinate system," in Proceedings of the 2004 conference on Applications, technologies, architectures,SIGCOMM '04, 2004, pp. 15-26.
  15. D. Doval and D. O'Mahony, "Overlay networks: A scalable alternative for P2P," Internet Computing, IEEE, vol. 7, pp. 79-82, 2003.
  16. K. Dhara, et al. , "Overview of Structured Peer-to-Peer Overlay Algorithms," Handbook of Peer-to-Peer Networking, pp. 223-256, 2010.
  17. D. Cvetkovic, et al. , "Graphs for small multiprocessor interconnection networks," Applied Mathematics and Computation, vol. 217, pp. 2468-2480, 2010.
  18. J. Duato, et al. , Interconnection networks: An engineering approach: Morgan Kaufmann, 2003.
  19. T. Feng, "A survey of interconnection networks," Computer, vol. 14, pp. 12-27, 1981.
  20. I. Stoica, et al. , "Chord: a scalable peer-to-peer lookup protocol for internet applications," Networking, IEEE/ACM Transactions on, vol. 11, pp. 17-32, 2003.
  21. Y. Liu, et al. , "Location-aware topology matching in P2P systems," in in Proc INFOCOM, 2004, pp. 2220-2230
  22. P. Maymounkov and D. Mazieres, "Kademlia: A peer-to-peer information system based on the xor metric," Peer-to-Peer Systems, vol. 2429, pp. 53-65, 2002.
  23. D. Malkhi, et al. , "Viceroy: A scalable and dynamic emulation of the butterfly," in Proceedings of the twenty-first annual symposium on Principles of distributed computing,PODC '02, 2002, pp. 183-192.
  24. K. Fujii and S. Goto, "Correlation between hop count and packet transfer time," APAN/IWS2000, February, 2000.
  25. N. S. Woo and A. Agrawala, "A symmetric tree structure interconnection network and its message traffic," Computers, IEEE Transactions on, vol. 100, pp. 765-769, 1985.
  26. (22 Feb). Available: http://www-01. ibm. com/software/analytics/spss/
  27. (Nov 23). Available: http://iplane. cs. washington. edu/data/data. html
  28. J. P. Ahulló and P. G. López, "PlanetSim: An extensible framework for overlay network and services simulations," in Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops,Simutools '08, 2008, pp. 660-670.
  29. P. García, et al. , "Planetsim: A new overlay network simulation framework," Software Engineering and Middleware, vol. 3437, pp. 123-136, 2005
Index Terms

Computer Science
Information Sciences

Keywords

Peer-to-peer Networks Locality Problem Binary Tree Diamond Tree Hypercube Topology

Powered by PhDFocusTM