PMA-Chord: Peer Mobility Adaptable Lookup for Chord Protocol

International Journal of Computer Trends and Technology (IJCTT)          
© - November Issue 2013 by IJCTT Journal
Volume-5 Issue-5                           
Year of Publication : 2013
Authors :Kola Vineel Babu , Mr.P.Prasanna Murali Krishna


Kola Vineel Babu , Mr.P.Prasanna Murali Krishna"PMA-Chord: Peer Mobility Adaptable Lookup for Chord Protocol"International Journal of Computer Trends and Technology (IJCTT),V5(5):243-248 November Issue 2013 .ISSN Published by Seventh Sense Research Group.

Abstract:- Structured Overlay Networks provide a promising system for high-performance applications because they may be fault-tolerant, scalable and self managing. Organized overlays provide lookup services that guide keys to nodes that may be employed as processing or storage assets. Consequently, it truly is non-trivial to provide consistent data services on best of structured overlays which are built on key-based search. In this paper, we analyze the regularity of incidence of inconsistent lookups. We demonstrate that the impact of look-up inconsistencies may be lowered by assigning responsibility of important intervals to nodes. We present our results as being a trade-off between availability and uniformity of tips. More, because so many distributed applications apply quorum techniques at their core, we examine the likelihood that majority-based quorum techniques will operate accurately in a structured overlay with inconsistent searches. Our investigation shows the probability of majority-established algorithms to operate correctly despite lookup inconsistencies is high.


[1] R. Bhagwan, S. Savage, and G. Voelker. Understanding availability. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS), 2003.
[2] T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43, 1996.
[3] A. Ghodsi. Distributed k-ary System: Algorithms for Distributed Hash Tables. PhD thesis, KTH — Royal Institute of Technology, Sweden, Dec. 2006.
[4] D. K. Gifford. Weighted voting for replicated data. In SOSP ’79: Proceedings of the seventh ACM symposium on Operating systems principles, pages 150—162, New York, NY, USA, 1979. ACM Press.
[5] S. Gilbert and N. Lynch. Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News, 33(2):51-59, 2002.
[6] D. Karger, E. Lehman, F. Leighton, M. Levine, D. Lewin, and R. Panigrahy. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In Proceedings of the 29th ACM Symposium on Theory of Computing, 1997.
[7] J. Li. Routing tradeoffs in dynamic peer-to-peer networks. PhD thesis, MIT — Massachusetts Institute of Technology, Nov. 2005.
[8] P. Linga, A. Crainiceanu, J. Gehrke, and J. Shanmugasudaram. Guaranteeing correctness and availability in p2p range indices. In Proceedings of 2005 ACM SIGMOD, pages 323—334, 2005.
[9] N. A. Lynch, D. Malkhi, and D. Ratajczak. Atomic data access in distributed hash tables. In IPTPS ’01: Revised Papers from the First International Workshop on Peer-to-Peer Systems, pages 295—305, London, UK, 2002. Springer-Verlag.
[10] S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz. Handling churn in a dht. Technical report, EECS Department, University of California, 2003.
[11] J. Risson, K. Robinson, and T. Moors. Fault tolerant active rings for structured peer-to-peer overlays. lcn, 0:18—25, 2005.
[12] S. Saroiu, P. Gummadi, and S. Gribble. A measurement study of peer-to-peer file sharing systems. In In Proc. of MMCN, 2002.
[13] I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In Proc. of the ACM SIGCOMM, 2001.
[14] S. Zhuang, D. Geels, I. Stoica, and R. Katz. On failure detection algorithms in overlay networks. In Proc. of INFOCOM, 2005.

Keywords :— Rough sets, multigranular rough sets ,database , topological property.