Advertisement

P-Skip Graph: An Efficient Data Structure for Peer-to-Peer Network

  • Amrinderpreet Singh
  • Shalini Batra
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 321)

Abstract

Peer-to-peer networks display interesting characteristics of fast queries, updation, deletion, fault-tolerance etc., while lacking any central authority. Adjacency Matrix, Skip-Webs, Skip-Nets, Skip-List, Distributed Hash Table, and many more data structures form the candidature for peer-to-peer networks, of which, Skip-Graph (evolved version of skip-list) displays one of the best characteristics as it help to search and locate a node in a peer-to-peer network efficiently with time complexity being O(log n). However when a hotspot node is searched and queried again and again, the Skip-Graph does not learn or adapt to the situation and still searches traditionally with O(log n) complexity. In this paper we propose a new data structure P-skip graph, a modified version of Skip graph, which reduces the search time of a hot spot node drastically from initial time of O(log n). Results provided by Simulations of a skip graph-based Peer-to-Peer application demonstrate that the proposed approach can in fact effectively decrease the search time to O(1).

Keywords

Search Time Distribute Hash Table Overlay Graph Content Addressable Network Efficient Data Structure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Coulouris, G., Dollimore, J., Kindberg, T., Blair, G.: Distributed Systems: Concepts and Design, 5th edn. Addison-Wesley (2011)Google Scholar
  2. 2.
    Schollmeier, R.: A Definition of Peer-to-Peer Networking for the Classification of Peer-to-Peer Architectures and Applications. In: Proceedings of the First International Conference on Peer-to-Peer Computing. IEEE (2002)Google Scholar
  3. 3.
    Andrews, G.R.: Foundations of Multithreaded, Parallel, and Distributed Programming. Addison–Wesley (2000)Google Scholar
  4. 4.
  5. 5.
    Goodrich, M.T., Nelson, M.J., Sun, J.Z.: The Rainbow Skip Graph: A Fault-Tolerant Constant-Degree Distributed Data Structure. In: SODA 2006 Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 384–393 (2006)Google Scholar
  6. 6.
    Herlihy, M.P., Shavit, N.N.: The Art of Multiprocessor Programming. Morgan Kaufmann (2008)Google Scholar
  7. 7.
    Aspnes, J., Shah, G.: Skip Graphs. Department of Computer Science, Yale University (2006), http://www.cs.yale.edu/SkipGraphs
  8. 8.
    Ratnasamy, S., Francis, P., Handley, M., Carp, R., Shenker, S.: A Scalable content addressable network. In: Proceedings of the ACM SIGCOMM, pp. 161–170 (2001)Google Scholar
  9. 9.
    Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing, 193–201 (1992)Google Scholar
  10. 10.
    Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishna, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proceedings of the SIGCOMM, pp. 149–160 (2001)Google Scholar
  11. 11.
    Papadimitriou, C.H.: Computational Complexity. Addison–Wesley (1994)Google Scholar
  12. 12.
    Andrews, G.R.: Foundations of Multithreaded. Parallel, and Distributed Programming. Addison–Wesley (2000)Google Scholar
  13. 13.
    Rowstron, A., Druschel, P.: Pastry: Scalable, Distributed object location and routing for large scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  14. 14.
    Joseph, D., Kubiatowikz, J., Rao, S., Zhao, B.Y.: Tapestry: An infrastructure for fault tolerant wide area location and routing. Technical Report UCB/CSD-01-1141, University of California, Berkeley (April 2001)Google Scholar
  15. 15.
    Malkhi, D., Naorand, M., Ratajczk, D.: Viceroy: A Scalable and dynamic emulation of the butterfly. 21st ACM Symposium on Principles of Distributed Computing, 183–192 (2002)Google Scholar
  16. 16.
    Knighten, B.: Peer to Peer networking (2000), http://www.peer-to-peerwg.org/sep_docs/collateral/PtP_IDF_Rev.11.pd
  17. 17.
  18. 18.
    Mayland, B.: Gnutella Protocols (2000), http://capnbry.dyndns.org/gnutella/protocol.php
  19. 19.
    Hopfield, J.J.: Neural networks and physical systems with emergent collective computational abilities. Proc. Natl. Acad. Sci. USA 79, 2554–2558 (1982)CrossRefMathSciNetGoogle Scholar
  20. 20.
    Freenet Project (2000), https://freenetproject.org/
  21. 21.
    Kaufmann, M., Pawel, P., Wellner Jr., R.: Grid Computing: The Savvy Manager’s Guide (2006)Google Scholar
  22. 22.
    Stone, E., Czerniak, T., Ryan, C., McAdoo, R.: Peer to Peer routing (2002), http://ntrg.cs.tcd.ie/undergrad/4ba2.05/group6/index.html
  23. 23.
    Wilder, U., Shah, G.: Skip lists: a probabilistic alternative to balanced tree. Communications of the ACM (6), 668–676 (1990)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Amrinderpreet Singh
    • 1
  • Shalini Batra
    • 2
  1. 1.Samsung Engineering Lab (R&D)NoidaIndia
  2. 2.Thapar UniversityPatialaIndia

Personalised recommendations