{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:24:10Z","timestamp":1743074650425,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319112268"},{"type":"electronic","value":"9783319112275"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-11227-5_5","type":"book-chapter","created":{"date-parts":[[2014,9,2]],"date-time":"2014-09-02T11:14:01Z","timestamp":1409656441000},"page":"43-54","source":"Crossref","is-referenced-by-count":1,"title":["P-Skip Graph: An Efficient Data Structure for Peer-to-Peer Network"],"prefix":"10.1007","author":[{"given":"Amrinderpreet","family":"Singh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shalini","family":"Batra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Coulouris, G., Dollimore, J., Kindberg, T., Blair, G.: Distributed Systems: Concepts and Design, 5th edn. Addison-Wesley (2011)"},{"key":"5_CR2","unstructured":"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)"},{"key":"5_CR3","unstructured":"Andrews, G.R.: Foundations of Multithreaded, Parallel, and Distributed Programming. Addison\u2013Wesley (2000)"},{"key":"5_CR4","unstructured":"Net History (2004), \n                    http:\/\/www.nethistory.info\/History\/email.html"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013393 (2006)","DOI":"10.1145\/1109557.1109601"},{"key":"5_CR6","unstructured":"Herlihy, M.P., Shavit, N.N.: The Art of Multiprocessor Programming. Morgan Kaufmann (2008)"},{"key":"5_CR7","unstructured":"Aspnes, J., Shah, G.: Skip Graphs. Department of Computer Science, Yale University (2006), \n                    http:\/\/www.cs.yale.edu\/SkipGraphs"},{"issue":"4","key":"5_CR8","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1145\/964723.383072","volume":"31","author":"Sylvia Ratnasamy","year":"2001","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Carp, R., Shenker, S.: A Scalable content addressable network. In: Proceedings of the ACM SIGCOMM, pp. 161\u2013170 (2001)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"issue":"1","key":"5_CR9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"Nathan Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing, 193\u2013201 (1992)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"5_CR10","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1145\/964723.383071","volume":"31","author":"Ion Stoica","year":"2001","unstructured":"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\u2013160 (2001)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"5_CR11","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison\u2013Wesley (1994)"},{"key":"5_CR12","unstructured":"Andrews, G.R.: Foundations of Multithreaded. Parallel, and Distributed Programming. Addison\u2013Wesley (2000)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/3-540-45518-3_18","volume-title":"Middleware 2001","author":"A. Rowstron","year":"2001","unstructured":"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.\u00a02218, pp. 329\u2013350. Springer, Heidelberg (2001)"},{"key":"5_CR14","unstructured":"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)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Naorand, M., Ratajczk, D.: Viceroy: A Scalable and dynamic emulation of the butterfly. 21st ACM Symposium on Principles of Distributed Computing, 183\u2013192 (2002)","DOI":"10.1145\/571825.571857"},{"key":"5_CR16","unstructured":"Knighten, B.: Peer to Peer networking (2000), \n                    http:\/\/www.peer-to-peerwg.org\/sep_docs\/collateral\/PtP_IDF_Rev.11.pd"},{"key":"5_CR17","unstructured":"Napster Messages (2000), \n                    http:\/\/opennap.sourceforge.net\/napster.txt"},{"key":"5_CR18","unstructured":"Mayland, B.: Gnutella Protocols (2000), \n                    http:\/\/capnbry.dyndns.org\/gnutella\/protocol.php"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"2554","DOI":"10.1073\/pnas.79.8.2554","volume":"79","author":"J.J. Hopfield","year":"1982","unstructured":"Hopfield, J.J.: Neural networks and physical systems with emergent collective computational abilities. Proc. Natl. Acad. Sci. USA\u00a079, 2554\u20132558 (1982)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"5_CR20","unstructured":"Freenet Project (2000), \n                    https:\/\/freenetproject.org\/"},{"key":"5_CR21","unstructured":"Kaufmann, M., Pawel, P., Wellner Jr., R.: Grid Computing: The Savvy Manager\u2019s Guide (2006)"},{"key":"5_CR22","unstructured":"Stone, E., Czerniak, T., Ryan, C., McAdoo, R.: Peer to Peer routing (2002), \n                    http:\/\/ntrg.cs.tcd.ie\/undergrad\/4ba2.05\/group6\/index.html"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Wilder, U., Shah, G.: Skip lists: a probabilistic alternative to balanced tree. Communications of the ACM (6), 668\u2013676 (1990)","DOI":"10.1145\/78973.78977"}],"container-title":["Advances in Intelligent Systems and Computing","Intelligent Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11227-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T08:23:58Z","timestamp":1676881438000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11227-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319112268","9783319112275"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11227-5_5","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}