International E-publication: Publish Projects, Dissertation, Theses, Books, Souvenir, Conference Proceeding with ISBN.  International E-Bulletin: Information/News regarding: Academics and Research

Dynamic Discovery of Resources in Structured P2P Systems

    ,

Author Affiliations

  • 1Computer Engineering Department, University of Zabol, Zabol, IRAN
  • 2 Computer Engineering Department, School of Eng., I.A.U. Zabol Branch, Zabol, IRAN

Res. J. Recent Sci., Volume 4, Issue (12), Pages 95-105, December,2 (2015)

Abstract

A distributed system is a collection of autonomous computers that appear to their user as one single coherent system. The main goal of any distributed system is sharing resources in a controlled and efficient way. But before any resources can be shared, they should be located. Structured peer-to-peer (P2P) systems have been recognized as an efficient approach to solve the resource locating and discovery problem in large-scale dynamic distributed systems. Efficiency of structured P2Presource discovery approaches attributed to their structured property. However, system dynamism (a.k.a. Churn) caused by changes in the system membership, i.e., nodes that join or leave the system or simply fail, perturbs the structure of the system and endangers the expected correctness and efficiency of resource discovery solutions. In this paper we propose an approach to dynamic searching and discovery of resources that adapts its operation dynamically with the dynamism in the system by using a structure maintenance technique that we have already presented in our recent paper. Although our approach is general enough to be applied to a lot of structured P2P systems, for the sake of brevity here we implemented this resource discovery approach for a well-known structured P2P system called Chord. We analyzed the efficiency of our presented resource discovery mechanism using master equation approach of physics and by experiments. We see how the simulation results and theoretical analyses both show the improved efficiency of our resource searching and discovery mechanisms.

References

  1. Tanenbaum AS and Van Steen M., Distributed Systems: Principles and Paradigms, 2nd ed., New Jersey: Prentice Hall Press, (2006)
  2. Mewada Shivlal and Singh Umesh Kumar, Performance Analysis of Secure Wireless Mesh Networks, Res.J.Recent Sci.,1(3), 80-85 (2012)
  3. Yao Z. and Loguinov D., Analysis of Link Lifetimes and Neighbor Selection in Switching DHTs, IEEE Transactions on Parallel and Distributed Systems, 22(11), 1834-1841, (2011)
  4. Rao W, Chen L, chee Fu AW and Wang G, Optimal Resource Placement in Structured Pee-to-Peer Networks, IEEE Transactions on Parallel and Distributed Systems, 21(7), 1011-1026, (2010)
  5. Karger E. Lehman, T. Leighton, R. Panigrahy and M. Levine, Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web, in In STOC ’97: Proceedings of the 29th annual ACM symposium on theory of computing, New York, (1997)
  6. Zhang Q., Miao Z., Zhang Y., Xu W. and Du Y., Multi-Attribute Resource Discovery in Structured P2P Networks, Proceedings of the 9th International Symposium on Linear Drives for Industry Applications, 2(1), Lecture Notes in Electrical Engineering, 271, 501-508, (2013)
  7. R. Mahajan, M. Castro and A. Rowstron., Controlling the Cost of Reliability in Peer-to-Peer Overlayss, in 2nd International Workshop on Peer-to-Peer Systems (IPTPS ’03), Berkeley, CA, USA, (2003)
  8. S. El-Ansary, Designs and Analyses in Structured P2P Systems, Ph.D. Thesis, Department of Microelectronics and Information Technology, The Royal Institute of Technology (KTH), Stockholm, Sweden, (2005)
  9. Krishnamurthy S., El-Ansary S., Aurell E. and Haridi S., Comparing Maintenance Strategies for Overlays, in Parallel, Distributed and Network-Based Processing, Toulouse, France, (2008)
  10. Stoica, Morris R., Liben-Nowell D., Karger D., Kaashoek M.F., Dabek F. and Balakrishnan H., Chord: A scalable Peer-to-Peer Lookup Service For Internet Applications," in Transactions on Networking, (2003)
  11. Karger, F. Kaashoek and D.R, Koorde: A simple degree optimal distributed hash table, in 2nd International Workshop on Peer-to-Peer Systems (IPTPS ’03), Berkeley, CA, USA, February, (2003)
  12. Malkhi NR, Viceroy: A Scalable and dynamic Emulation of the Butterfly, in Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC ’02), Monterey, California, August (2002)
  13. Ratnasamy S, Francis P., Handley M, Karp R and Shenker S, A Scalable Content Addressable Network, in ACM SIGCOMM ’01 Conference, Berkeley, CA, (2001)
  14. Kumar, S. Merugu, J. Xu and E. W. Ze, "Ulysses: A Robust, Low-Diameter, Low-Latency Peer-to-Peer Network," in ICNP '03 11th IEEE International Conference on Network Protocols, Washington, DC, USA, 2003)
  15. Druschel P and Rowstron A, Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-To-Peer Systems, in IFIP/ACM International Conference on Distributed Systems Platforms, (2001)
  16. Zhao Y., Huang L., Stribling J. and Rhea S.C., Tapestry: A Resilient Global-Scale Overlay for Service Deployment, IEEE Journal on Selected Areas in Communications, 22(5), 41-53, (2004)
  17. Alima L.O., El-Ansary S., Brand P. and Haridi S., DKS(N,k,f): A Family of Low Communicatio, Scalable and Fault-Tolerant Infrastructures for P2P Applications, in CCGRID2003- International Workshop on Global and Peer to Peer Computing on Large Scale Distributed Systems, Tokyo, Japan, (2003)
  18. Aberer K., Datta A. and Hauswitrh M., "Route Maintenance Overheads in DHT Overlays," The 6th Workshop on Distributed Data and Structures, EPF Lausanne, Switzerland, July 8-9, (2004)
  19. Aberer K, Datta A and Hauswirth M, Efficient, Self Contained Handling of Identity, IEEE Transactions on Knowledge and Data Engineering, 16(2), 36-54, (2004)
  20. Maymounkov P. and Mazières David, Kademlia: A Peer-to-Peer Information System Based on the XOR Metric, in Peer-to-Peer Systems, 2429, Springer Berlin / Heidelberg, 53-65, (2002)
  21. Arbabi M. Sharifi et.al., Mirtaheri SL and Mousavi Khaneghah SE, A Low Overhead Structure Maintenance Approach for Building Robust Structured P2P Systems, IST, Tehran, (2012)
  22. Analysis of G-CSF Treatment of CN using Fast Fourier Transform, Balamuralitharan S. and Rajasekaran S., Res. J. Recent Sci., 1(4), 14-21(2012)
  23. A branch-and-bound procedure for resource leveling in multi-mode resource constraint project scheduling problem, Afshar-NadjafiBehrouz, NajjarbashiHojjat and MehdizadehEsmaeil, Res.J.Recent Sci.,1(7), 33-38 (2012)
  24. Krishnamurthy S., El-Ansary S., Aurell E. and Haridi S., An Analytical Study of a Structured Overlay in the Presence of Dynamic Membership, IEEE Transactions on Networking, 16(4), 814-825, (2008)
  25. Krishnamurthy S., El-Ansary S., Aurell E. and Haridi S., A Statistical Theory of Chord under Churn, in 4th Int. Workshop on Peer-to-Peer Systems (IPTPS'05), Ithaca, NY, (2005)
  26. El-Ansary S. and Hardi S., An Overview of StructuredOverlay Networks, in Handbook of Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, Stockholm, Auerbach, 665-683, (2006)
  27. Behmaneshfar Ali, Shahbazi S. and Vaezi S., Analysis of the Sampling in Quality Control Charts in non uniform Process by using a New Statistical Algorithm, Res.J.Recent Sci.,1(8), 36-41 (2012)
  28. Iyer K. and Khan Z.A., Depression-AReview, Res.J.Recent Sci., 1(4), 79-87 (2012)