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).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Coulouris, G., Dollimore, J., Kindberg, T., Blair, G.: Distributed Systems: Concepts and Design, 5th edn. Addison-Wesley (2011)
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)
Andrews, G.R.: Foundations of Multithreaded, Parallel, and Distributed Programming. Addison–Wesley (2000)
Net History (2004), http://www.nethistory.info/History/email.html
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)
Herlihy, M.P., Shavit, N.N.: The Art of Multiprocessor Programming. Morgan Kaufmann (2008)
Aspnes, J., Shah, G.: Skip Graphs. Department of Computer Science, Yale University (2006), http://www.cs.yale.edu/SkipGraphs
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)
Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing, 193–201 (1992)
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)
Papadimitriou, C.H.: Computational Complexity. Addison–Wesley (1994)
Andrews, G.R.: Foundations of Multithreaded. Parallel, and Distributed Programming. Addison–Wesley (2000)
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)
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)
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)
Knighten, B.: Peer to Peer networking (2000), http://www.peer-to-peerwg.org/sep_docs/collateral/PtP_IDF_Rev.11.pd
Napster Messages (2000), http://opennap.sourceforge.net/napster.txt
Mayland, B.: Gnutella Protocols (2000), http://capnbry.dyndns.org/gnutella/protocol.php
Hopfield, J.J.: Neural networks and physical systems with emergent collective computational abilities. Proc. Natl. Acad. Sci. USA 79, 2554–2558 (1982)
Freenet Project (2000), https://freenetproject.org/
Kaufmann, M., Pawel, P., Wellner Jr., R.: Grid Computing: The Savvy Manager’s Guide (2006)
Stone, E., Czerniak, T., Ryan, C., McAdoo, R.: Peer to Peer routing (2002), http://ntrg.cs.tcd.ie/undergrad/4ba2.05/group6/index.html
Wilder, U., Shah, G.: Skip lists: a probabilistic alternative to balanced tree. Communications of the ACM (6), 668–676 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Singh, A., Batra, S. (2015). P-Skip Graph: An Efficient Data Structure for Peer-to-Peer Network. In: Buyya, R., Thampi, S. (eds) Intelligent Distributed Computing. Advances in Intelligent Systems and Computing, vol 321. Springer, Cham. https://doi.org/10.1007/978-3-319-11227-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-11227-5_5
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11226-8
Online ISBN: 978-3-319-11227-5
eBook Packages: EngineeringEngineering (R0)