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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 networksPreprint
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · Cited by 6,467
A scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383072 · Cited by 6,372
Hardin, G. (2009) · Journal of Natural Resources Policy Research · doi:10.1080/19390450903037302 · Cited by 6,367
Architectural styles and the design of network-based software architectures
Fielding, R. T., & Taylor, R. N. (2000) · Cited by 5,094
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
Web caching and Zipf-like distributions: evidence and implications
Breslau, L., Cao, P., Fan, L., Phillips, G., & Shenker, S. (1999) · IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320) · doi:10.1109/infcom.1999.749260 · Cited by 3,467
The many faces of publish/subscribe
Eugster, P. T., Felber, P. A., Guerraoui, R., & Kermarrec, A.-M. (2003) · ACM Computing Surveys · doi:10.1145/857076.857078 · Cited by 3,145
Globus: a Metacomputing Infrastructure Toolkit
Foster, I., & Kesselman, C. (1997) · The International Journal of Supercomputer Applications and High Performance Computing · doi:10.1177/109434209701100205 · Cited by 3,133
Chord: a scalable peer-to-peer lookup protocol for internet applications
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D. R., Kaashoek, M. F., Dabek, F., & Balakrishnan, H. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.808407 · Cited by 3,133
The Physiology of the Grid An Open Grid Services Architecture for Distributed Systems Integration
Foster, I. T., Kesselman, C., Nick, J. M., & Tuecke, S. J. (2002) · Cited by 3,055
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
Maymounkov, P., & Mazières, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_5 · Cited by 3,004
Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00083-9 · Cited by 2,810
Web Services Business Process Execution Language Version 2.0
Barreto, C., Bullard, V., Erl, T., Evdemon, J., Jordan, D., Kand, K., König, D., Moser, S., Stout, R., Ten-Hove, R., et al. (2007) · Cited by 2,772
Provable data possession at untrusted stores
Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., & Song, D. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315318 · Cited by 2,705
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/316194.316229 · Cited by 2,613
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
Lamport (1979) · IEEE Transactions on Computers · doi:10.1109/tc.1979.1675439 · Cited by 2,519
Practical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
Meyer, B. (1992) · Computer · doi:10.1109/2.161279 · Cited by 2,162
Automated Planning: Theory & Practice
Nau, D. S., Ghallab, M., & Traverso, P. (2004) · HAL · Cited by 2,129
Semantic Matching of Web Services Capabilities
Paolucci, M., Kawamura, T., Payne, T. R., & Sycara, K. P. (2002) · Lecture notes in computer science · doi:10.1007/3-540-48005-6_26 · Cited by 2,121
Freenet: A Distributed Anonymous Information Storage and Retrieval System
Clarke, I., Sandberg, O., Wiley, B., & Hong, T. W. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44702-4_4 · Cited by 2,109
OceanStore: an architecture for global-scale persistent storage
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., et al. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357007 · Cited by 2,002
Karger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine, M., & Lewin, D. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258660 · Cited by 1,981
Measurement study of peer-to-peer file sharing systems:
Saroiu, S., Gummadi, P. K., & Gribble, S. D. (2001) · SPIE Proceedings · doi:10.1117/12.449977 · Cited by 1,905
The small-world phenomenon: an algorithmic perspective
Kleinberg, J. (2000) · Proceedings of the thirty-second annual ACM symposium on Theory of computing · doi:10.1145/335305.335325 · Cited by 1,882
Implementing remote procedure calls
Birrell, A. D., & Nelson, B. J. (1984) · ACM Transactions on Computer Systems · doi:10.1145/2080.357392 · Cited by 1,829
A scalable content-addressable network
Ratnasamy, S., Francis, P., Handley, M., Karp, R., & Shenker, S. (2001) · ACM SIGCOMM Computer Communication Review · doi:10.1145/964723.383072 · Cited by 1,799
Tapestry: A Resilient Global-Scale Overlay for Service Deployment
Zhao, B. Y., Huang, L., Stribling, J., Rhea, S. C., Joseph, A. D., & Kubiatowicz, J. D. (2004) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2003.818784 · Cited by 1,730
Scribe: a large-scale and decentralized application-level multicast infrastructure
Castro, M., Druschel, P., Kermarrec, A.-M., & Rowstron, A. I. T. (2002) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.803069 · Cited by 1,461
Wide-area cooperative storage with CFS
Dabek, F., Kaashoek, M. F., Karger, D., Morris, R., & Stoica, I. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502054 · Cited by 1,428
Protocols for Public Key Cryptosystems
Merkle, R. C. (1980) · 1980 IEEE Symposium on Security and Privacy · doi:10.1109/sp.1980.10006 · Cited by 1,418
Bruijn, D. N. D. (1946) · TU/e Research Portal · Cited by 1,289
Castro, M., Druschel, P., Kermarrec, A.-M., Nandi, A., Rowstron, A. I. T., & Singh, A. K. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945474 · Cited by 1,247
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility
Rowstron, A., & Druschel, P. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502053 · Cited by 1,218
Adamic, L. A., Lukose, R. M., Puniyani, A. R., & Huberman, B. A. (2001) · Physical Review E · doi:10.1103/physreve.64.046135 · Cited by 1,203
Modeling and performance analysis of BitTorrent-like peer-to-peer networks
Qiu, D., & Srikant, R. (2004) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1015467.1015508 · Cited by 1,201
Memory coherence in shared virtual memory systems
Li, K., & Hudak, P. (1989) · ACM Transactions on Computer Systems · doi:10.1145/75104.75105 · Cited by 1,167
Vivaldi: a decentralized network coordinate system
Dabek, F., Cox, R., Kaashoek, F., & Morris, R. (2004) · Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1015467.1015471 · Cited by 1,154
Fensel, D., Facca, F. M., Simperl, E., & Toma, I. (2011) · Semantic Web Services · doi:10.1007/978-3-642-19193-0_7 · Cited by 1,095
Making gnutella-like P2P systems scalable
Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., & Shenker, S. (2003) · Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/863955.864000 · Cited by 1,082
(2001) · Cited by 1,052
Predicting Internet network distance with coordinates-based approaches
Ng, T. S. E., & Zhang, H. (2003) · Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies · doi:10.1109/infcom.2002.1019258 · Cited by 1,050
Power-Law Distribution of the World Wide Web
Adamic, L. A., & Huberman, B. A. (2000) · Science · doi:10.1126/science.287.5461.2115a · Cited by 1,015
A model for web services discovery with QoS
Ran, S. (2003) · ACM SIGecom Exchanges · doi:10.1145/844357.844360 · Cited by 999
Feedback Control of Computing Systems
Hellerstein, J. L., Diao, Y., Parekh, S., & Tilbury, D. M. (2004) · Wiley eBooks · doi:10.1002/047166880x · Cited by 972
Rhea, S. C., Geels, D., Roscoe, T., & Kubiatowicz, J. D. (2004) · Cited by 875
The dawning of the autonomic computing era
Ganek, A. G., & Corbi, T. A. (2003) · IBM Systems Journal · doi:10.1147/sj.421.0005 · Cited by 844
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
Gummadi, K. P., Dunn, R. J., Saroiu, S., Gribble, S. D., Levy, H. M., & Zahorjan, J. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945475 · Cited by 818
Topologically-aware overlay construction and server selection
Ratnasamy, S., Handley, M. J., Karp, R. M., & Shenker, S. J. (2003) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2002.1019369 · Cited by 790
A low-bandwidth network file system
Muthitacharoen, A., Chen, B., & Mazières, D. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502052 · Cited by 784
Similarity Search for Web Services
Dong, X. L., Halevy, A. Y., Madhavan, J., Nemes, E., & Zhang, J. (2004) · Elsevier eBooks · doi:10.1016/b978-012088469-8.50035-8 · Cited by 765
Accessing nearby copies of replicated objects in a distributed environment
Plaxton, C. G., Rajaraman, R., & Richa, A. W. (1997) · Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures - SPAA '97 · doi:10.1145/258492.258523 · Cited by 760
A blueprint for introducing disruptive technology into the Internet
Peterson, L., Anderson, T., Culler, D., & Roscoe, T. (2003) · ACM SIGCOMM Computer Communication Review · doi:10.1145/774763.774772 · Cited by 752
Secure routing for structured peer-to-peer overlay networks
Castro, M., Druschel, P., Ganesh, A., Rowstron, A., & Wallach, D. S. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844156 · Cited by 743
Improving search in peer-to-peer networks
Yang, B., & García-Molina, H. (2003) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2002.1022237 · Cited by 740
Zhuang, S. Q., Zhao, B. Y., Joseph, A. D., Katz, R. H., & Kubiatowicz, J. D. (2001) · International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV) · doi:10.1145/378344.378347 · Cited by 722
Implementation and performance of Munin
Carter, J. B., Bennett, J. K., & Zwaenepoel, W. (1991) · Proceedings of the thirteenth ACM symposium on Operating systems principles · doi:10.1145/121132.121159 · Cited by 689
Requirements engineering in the year 00: a research perspective
van Lamsweerde, A. (2000) · Proceedings of the 22nd international conference on Software engineering - ICSE '00 · doi:10.1145/337180.337184 · Cited by 671
SkipNet: A Scalable Overlay Network with Practical Locality Properties
Harvey, N. J. A., Dunagan, J., Jones, M. B., Saroiu, S., Theimer, M. M., & Wolman, A. (2003) · Cited by 614
Finding similar files in a large file system
Manber, U. (1994) · Cited by 594
Meteor-s web service annotation framework
Patil, A. A., Oundhakar, S., Sheth, A., & Verma, K. (2004) · International World Wide Web Conference (WWW) · doi:10.1145/988672.988747 · Cited by 514
Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs
Bolosky, W. J., Douceur, J. R., Ely, D., & Theimer, M. (2000) · Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/339331.339345 · Cited by 484
Architecture Decisions: Demystifying Architecture
Tyree, J., & Akerman, A. (2005) · IEEE Software · doi:10.1109/ms.2005.27 · Cited by 459
Introduction to Web services architecture
Gottschalk, K., Graham, S., Kreger, H., & Snell, J. (2002) · IBM Systems Journal · doi:10.1147/sj.412.0170 · Cited by 419
Applications and statistics for multiple high-scoring segments in molecular sequences.
Karlin, S., & Altschul, S. F. (1993) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.90.12.5873 · Cited by 367
Iyer, S., Rowstron, A. I. T., & Druschel, P. (2002) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/571825.571861 · Cited by 363
Cox, L. P., Murray, C. D., & Noble, B. D. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844155 · Cited by 334
Finding nearest neighbors in growth-restricted metrics
Karger, D. R., & Ruhl, M. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.510013 · Cited by 334
PIC: practical Internet coordinates for distance estimation
Costa, M., Castro, M., Rowstron, R., & Key, P. B. (2004) · Proceedings of the ... International Conference on Distributed Computing Systems/Proceedings of the International Conference on Distributed Computing Systems · doi:10.1109/icdcs.2004.1281582 · Cited by 317
Service-oriented modeling and architecture
Arsanjani, A. (2004) · Medical Entomology and Zoology · Cited by 314
Incremental Cryptography: The Case of Hashing and Signing
Bellare, M., Goldreich, O., & Goldwasser, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_22 · Cited by 312
Toward autonomic web services trust and selection
Maximilien, E. M., & Singh, M. P. (2004) · Proceedings of the 2nd international conference on Service oriented computing · doi:10.1145/1035167.1035198 · Cited by 305
Virtual landmarks for the internet
Tang, L., & Crovella, M. (2003) · Proceedings of the 2003 ACM SIGCOMM conference on Internet measurement - IMC '03 · doi:10.1145/948205.948223 · Cited by 297
A game theoretic framework for incentives in P2P systems
Buragohain, C., Agrawal, D., & Suri, S. (2004) · Proceedings Third International Conference on Peer-to-Peer Computing (P2P2003) · doi:10.1109/ptp.2003.1231503 · Cited by 285
Publius: a robust, tamper-evident, censorship-resistant web publishing system
Waldman, M., Rubin, A. D., & Cranor, L. F. (2000) · Cited by 281
Incentives for Sharing in Peer-to-Peer Networks
Golle, P., Leyton-Brown, K., Mironov, I., & Lillibridge, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45598-1_9 · Cited by 256
Kay, J., & Lauder, P. (1988) · Communications of the ACM · doi:10.1145/35043.35047 · Cited by 254
Bieberstein, N., Bose, S., Walker, L., & Lynch, A. (2005) · IBM Systems Journal · doi:10.1147/sj.444.0691 · Cited by 253
Maintenance-free global data storage
Rhea, S., Wells, C., Eaton, P., Geels, D., Zhao, B., Weatherspoon, H., & Kubiatowicz, J. (2001) · IEEE Internet Computing · doi:10.1109/4236.957894 · Cited by 251
Developing web services choreography standards?the case of REST vs. SOAP
Muehlen, M. Z., Nickerson, J. V., & Swenson, K. D. (2004) · Decision Support Systems · doi:10.1016/j.dss.2004.04.008 · Cited by 235
A Survey of Peer-to-Peer Security Issues
Wallach, D. S. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36532-x_4 · Cited by 224
Can Heterogeneity Make Gnutella Scalable?
Lv, Q., Ratnasamy, S., & Shenker, S. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_9 · Cited by 216
Design and evaluation of a resource selection framework for Grid applications
Liu, C., Yang, L., Foster, I. T., & Angulo, D. J. B. (2003) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1109/hpdc.2002.1029904 · Cited by 209
The Case for a Hybrid P2P Search Infrastructure
Loo, B. T., Huebsch, R., Stoica, I. G., & Hellerstein, J. M. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-30183-7_14 · Cited by 204
Replica control in distributed systems: as asynchronous approach
Pu, C., & Leff, A. (1991) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/115790.115856 · Cited by 194
Risks of the Passport single signon protocol
Kormann, D. P., & Rubin, A. D. (2000) · Computer Networks · doi:10.1016/s1389-1286(00)00048-7 · Cited by 171
Defending against eclipse attacks on overlay networks
Singh, A. K., Castro, M., Druschel, P., & Rowstron, A. I. T. (2004) · ACM SIGOPS European Workshop · doi:10.1145/1133572.1133613 · Cited by 165
Modeling distances in large-scale networks by matrix factorization
Mao, Y. J., & Saul, L. K. (2004) · ACM SIGCOMM Internet Measurement Conference (IMC) · doi:10.1145/1028788.1028827 · Cited by 138
Service components for managing the life-cycle of service compositions
Yang, J. Y., & Papazoglou, M. (2003) · Information Systems · doi:10.1016/s0306-4379(03)00051-6 · Cited by 130
Alimal, L. O., El-Ansary, S., Brand, P., & Haridi, S. (2003) · IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid) · doi:10.1109/ccgrid.2003.1199386 · Cited by 127
Big-Bang Simulation for Embedding Network Distances in Euclidean Space
Shavitt, Y., & Tankel, T. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.838597 · Cited by 108
Approximate object location and spam filtering on peer-to-peer systems
Zhou, F. C., Li, Z., Zhao, B. Y., et al. (2003) · doi:10.5555/1515915.1515917 · Cited by 105
Mutation detection by pyrosequencing: sequencing of exons 5–8 of the p53 tumor suppressor gene
Garcia, C. A., Ahmadian, A., Gharizadeh, B., Lundeberg, J., Ronaghi, M., & Nyrén, P. (2000) · Gene · doi:10.1016/s0378-1119(00)00257-2 · Cited by 97
A Quality of Service Management Framework Based on User Expectations
Deora, V., Shao, J., Gray, W. A., & Fiddian, N. J. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-24593-3_8 · Cited by 94
Power-Law Distribution of the World Wide Web
(2000) · Science · doi:10.1126/science.287.5461.2113o · Cited by 82
Xml, Web Services, and the Data Revolution
Coyle, F. P. (2002) · CERN Document Server (European Organization for Nuclear Research) · Cited by 78
BlastAlign: a program that usesblastto align problematic nucleotide sequences
Belshaw, R. D., & Katzourakis, A. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth459 · Cited by 68
A Probabilistic Approach to Predict Peers’ Performance in P2P Networks
Despotovic, Z., & Aberer, K. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30104-2_6 · Cited by 53
Skogsrud, H., Benatallah, B., & Casati, F. (2004) · International World Wide Web Conference (WWW) · doi:10.1145/988672.988680 · Cited by 51
Hierarchical Peer-to-Peer Networks Using Lightweight SuperPeer Topologies
Kleis, M., Lua, E. K., & Zhou, X. (2005) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc.2005.78 · Cited by 49
Self-citationApproximate Object Location and Spam Filtering on Peer-to-Peer Systems
Zhou, F. C., Li, Z., Zhao, B. Y., et al. (2003) · Lecture notes in computer science · doi:10.1007/3-540-44892-6_1 · Cited by 48
Context aware service composition
Vuković, M. (2021) · doi:10.48456/tr-700 · Cited by 45
Modeling and Analyzing Context-Aware Composition of Services
Colombo, E., Mylopoulos, J., & Spoletini, P. (2005) · Lecture notes in computer science · doi:10.1007/11596141_16 · Cited by 29
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”
MethodBubbles 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
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.