The DOI matches its Crossref record; 115 of the 115 references it cites were found in a registry or an index.
A survey and comparison of peer-to-peer overlay network schemes
Abstract
Over the Internet today, computing and communications environments are significantly more complex and chaotic than classical distributed systems, lacking any centralized organization or hierarchical control. There has been much interest in emerging Peer-to-Peer (P2P) network overlays because they provide a good substrate for creating large-scale data sharing, content distribution, and application-level multicast applications. These P2P overlay networks attempt to provide a long list of features, such as: selection of nearby peers, redundant storage, efficient search/location of data items, data permanence or guarantees, hierarchical naming, trust and authentication, and anonymity. P2P networks potentially offer an efficient routing architecture that is self-organizing, massively scalable, and robust in the wide-area, combining fault tolerance, load balancing, and explicit notion of locality. In this article we present a survey and comparison of various Structured and Unstructured P2P overlay networks. We categorize the various schemes into these two groups in the design spectrum, and discuss the application-level network performance of each group.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Basic local alignment search tool
Altschul, S. F., Gish, W., Miller, W., Myers, E. W., & Lipman, D. J. (1990) · Journal of Molecular Biology · doi:10.1006/jmbi.1990.9999 · Cited by 98,669
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Hardin, G. (1968) · Science · doi:10.1126/science.162.3859.1243 · Cited by 25,167
(1994) · Cited by 21,711
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Rowstron, A., & Druschel, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45518-3_18 · Cited by 7,276
The vision of autonomic computing
Kephart, J. O., & Chess, D. M. (2003) · Computer · doi:10.1109/mc.2003.1160055 · Cited by 6,572
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
Foster, I., Kesselman, C., & Tuecke, S. (2001) · The International Journal of High Performance Computing Applications · doi:10.1177/109434200101500302 · Cited by 6,547
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
Cited by
A survey of network virtualization
Chowdhury, N. M. M. K., & Boutaba, R. (2010) · Computer Networks · doi:10.1016/j.comnet.2009.10.017 · Cited by 1,189
A Survey on Security and Privacy Issues of Bitcoin
Conti, M., Sandeep Kumar, E., Lal, C., & Ruj, S. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2842460 · Cited by 1,116
“Bitcoin uses an unstructured peer-to-peer (P2P) network [56] based on the non-encrypted persistent TCP”
MethodBuyya, R., Ranjan, R., & Calheiros, R. N. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13119-6_2 · Cited by 1,023
Bubbles of Trust: A decentralized blockchain-based authentication system for IoT
Hammi, M. T., Hammi, B., Bellot, P., & Serhrouchni, A. (2018) · Computers & Security · doi:10.1016/j.cose.2018.06.004 · Cited by 691
Reinforcement Learning Based Routing in Networks: Review and Classification of Approaches
Mammeri, Z. (2019) · IEEE Access · doi:10.1109/access.2019.2913776 · Cited by 427
MedChain: efficient healthcare data sharing via Blockchain
Shen, B., Guo, J., & Yang, Y. (2019) · Applied Sciences · doi:10.3390/app9061207 · Cited by 412
Ancillotti, E., Bruno, R., & Conti, M. (2013) · Computer Communications · doi:10.1016/j.comcom.2013.09.004 · Cited by 362
The convergence of social and technological networks
Kleinberg, J. (2008) · Communications of the ACM · doi:10.1145/1400214.1400232 · Cited by 346
An Advanced Hybrid Peer-to-Peer Botnet
Wang, P., Sparks, S., & Zou, C. C. (2010) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2008.35 · Cited by 333
A Review of Information Dissemination Protocols for Vehicular Ad Hoc Networks
Panichpapiboon, S., & Pattara-atikom, W. (2011) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2011.070711.00131 · Cited by 292
Complex networks and decentralized search algorithms
Kleinberg, J. (2007) · Proceedings of the International Congress of Mathematicians Madrid, August 22–30, 2006 · doi:10.4171/022-3/50 · Cited by 272
A Survey on Anonymity and Privacy in Bitcoin-Like Digital Cash Systems
Kus Khalilov, M. C., & Levi, A. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2818623 · Cited by 271
A Survey of Green Information-Centric Networking: Research Issues and Challenges
Fang, C., Yu, F. R., Huang, T., Liu, J., & Liu, Y. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2394307 · Cited by 268
Applications, Architectures, and Protocol Design Issues for Mobile Social Networks: A Survey
Kayastha, N., Niyato, D., Wang, P., & Hossain, E. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2011.2169033 · Cited by 253
A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Passarella, A. (2012) · Computer Communications · doi:10.1016/j.comcom.2011.10.005 · Cited by 226
“The interested reader is referred to [159,160] for extended surveys on P2P overlay networks.”
BackgroundEnergy Efficiency Dilemma: P2P-cloud vs. Datacenter
Sharifi, L., Rameshan, N., Freitag, F., & Veiga, L. (2014) · 2014 IEEE 6th International Conference on Cloud Computing Technology and Science · doi:10.1109/cloudcom.2014.137 · Cited by 20
A survey of structured P2P systems for RDF data storage and retrieval
Filali, I., Bongiovanni, F., Huet, F., & Baude, F. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-23074-5_2 · Cited by 19
Metadata
- Authors
- Lua, E. K., Crowcroft, J., Pias, M., Sharma, R., & Lim, S.
- Venue
- IEEE Communications Surveys & Tutorials
- Published
- 2005
- Volume
- 7
- Issue
- 2
- Pages
- 72-93
- ISSN
- 1553-877X (ISSN-L)
- 2373-745X
- OpenAlex
- W2121531691
- Cited by
- 1,496
- References
- 115
- FWCI
- 92.65
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.