The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Peer-to-peer architecture case study: Gnutella network
Abstract
Despite recent excitement generated by the P2P paradigm and despite surprisingly fast deployment of some P2P applications, there are few quantitative evaluations of P2P system behavior. Due to its open architecture and achieved scale, Gnutella is an interesting P2P architecture case study. Gnutella, like most other P2P applications, builds at the application level a virtual network with its own routing mechanisms. The topology of this overlay network and the routing mechanisms used have a significant influence on application properties such as performance, reliability, and scalability. We built a 'crawler' to extract the topology of Gnutella's application level network, we analyze the topology graph and evaluate generated network traffic. We find that although Gnutella is not a pure power-law network, its current configuration has the benefits and drawbacks of a power-law structure. These findings lead us to propose changes to the Gnutella protocol and implementations that bring significant performance and scalability improvements.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
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
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Chord: A scalable peer-to-peer lookup service for internet applications
Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., & Balakrishnan, H. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383071 · Cited by 9,623
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
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
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
Systems Competition and Network Effects
Katz, M. L., & Shapiro, C. (1994) · Journal of Economic Perspectives · doi:10.1257/jep.8.2.93 · Cited by 2,646
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
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing
Zhao, B. Y., Kubiatowicz, J. D., & Joseph, A. D. (2001) · Cited by 2,146
Adar, E., & Huberman, B. A. (2000) · First Monday · doi:10.5210/fm.v5i10.792 · Cited by 1,527
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
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
Growth dynamics of the World-Wide Web
Huberman, B. A., & Adamic, L. A. (1999) · Nature · doi:10.1038/43604 · Cited by 863
An architecture for a secure service discovery service
Czerwinski, S. E., Zhao, B. Y., Hodes, T. D., Joseph, A. D., & Katz, R. H. (1999) · Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking · doi:10.1145/313451.313462 · Cited by 610
Zipf, Power-laws, and Pareto-a ranking tutorial
Adamic, L. A. (2000) · Cited by 277
Internet Growth: Is There a “Moore’s Law” for Data Traffic?
Coffman, K. G., & Odlyzko, A. M. (2002) · Massive computing · doi:10.1007/978-1-4615-0005-6_3 · Cited by 173
An Architecture for Secure Wide-Area Service Discovery
Hodes, T. D., Czerwinski, S. E., Zhao, B. Y., Joseph, A. D., & Katz, R. H. (2002) · Wireless Networks · doi:10.1023/a:1013772027164 · Cited by 92
Power law distributions in real and virtual worlds
Shiode, N., & Batty, M. (2000) · Research Repository (Kingston University London) · Cited by 34
Cited by
Choosing reputable servents in a P2P network
Cornelli, F., Damiani, E., di Vimercati, S. D. C., Paraboschi, S., & Samarati, P. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511496 · Cited by 349
Music Information Retrieval: Recent Developments and Applications
Schedl, M., Gómez, E., & Urbano, J. (2014) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000042 · Cited by 267
A Distributed Ledger for Supply Chain Physical Distribution Visibility
Wu, H., Li, Z., King, B., Ben Miled, Z., Wassick, J., & Tazelaar, J. (2017) · Information · doi:10.3390/info8040137 · Cited by 232
Metadata
- Authors
- Ripeanu, M.
- Venue
- Proceedings First International Conference on Peer-to-Peer Computing
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-14
- Pages
- 99-100
- OpenAlex
- W2139506608
- Cited by
- 737
- References
- 20
- FWCI
- 27.25
- Type
- conference paper
- 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.