The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Can ISPS and P2P users cooperate for improved performance?
Abstract
Peer-to-peer (P2P) systems, which are realized as overlays on top of the underlying Internet routing architecture, contribute a significant portion of today's Internet traffic. While the P2P users are a good source of revenue for the Internet Service Providers (ISPs), the immense P2P traffic also poses a significant traffic engineering challenge to the ISPs. This is because P2P systems either implement their own routing in the overlay topology or may use a P2P routing underlay [1], both of which are largely independent of the Internet routing, and thus impedes the ISP's traffic engineering capabilities. On the other hand, P2P users are primarily interested in finding their desired content quickly, with good performance. But as the P2P system has no access to the underlying network, it either has to measure the path performance itself or build its overlay topology agnostic of the underlay. This situation is disadvantageous for both the ISPs and the P2P users. To overcome this, we propose and evaluate the feasibility of a solution where the ISP offers an "oracle" to the P2P users. When the P2P user supplies the oracle with a list of possible P2P neighbors, the oracle ranks them according to certain criteria, like their proximity to the user or higher bandwidth links. This can be used by the P2P user to choose appropriate neighbors, and therefore improve its performance. The ISP can use this mechanism to better manage the immense P2P traffic, e.g., to keep it inside its network, or to direct it along a desired path. The improved network utilization will also enable the ISP to provide better service to its customers.
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
Andersen, D., Balakrishnan, H., Kaashoek, F., & Morris, R. (2001) · Proceedings of the eighteenth ACM symposium on Operating systems principles · doi:10.1145/502034.502048 · Cited by 1,868
Measuring ISP topologies with rocketfuel
Spring, N., Mahajan, R., & Wetherall, D. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633039 · Cited by 1,256
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
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
Understanding churn in peer-to-peer networks
Stutzbach, D., & Rejaie, R. (2006) · Proceedings of the 6th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1177080.1177105 · Cited by 751
Karagiannis, T., Broido, A., Brownlee, N., Claffy, K. C., & Faloutsos, M. (2005) · IEEE Global Telecommunications Conference, 2004. GLOBECOM '04. · doi:10.1109/glocom.2004.1378239 · Cited by 504
The end-to-end effects of Internet path selection
Savage, S., Collins, A., Hoffman, E., Snell, J., & Anderson, T. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316233 · Cited by 473
Improving Traffic Locality in BitTorrent via Biased Neighbor Selection
Bindal, R., Cao, P., Chan, W., Medved, J., Suwala, G., Bates, T., & Zhang, A. (2006) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2006.48 · Cited by 378
A first-principles approach to understanding the internet's router-level topology
Li, L., Alderson, D., Willinger, W., & Doyle, J. (2004) · Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1015467.1015470 · Cited by 354
Expander flows, geometric embeddings and graph partitioning
Arora, S., Rao, S., & Vazirani, U. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007355 · Cited by 297
Cited by
P4p: provider portal for applications
Xie, H., Yang, Y. R., Krishnamurthy, A., Liu, Y. G., & Silberschatz, A. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402999 · Cited by 628
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
Dynamic adaptive streaming over CCN: A caching and overhead analysis
Liu, Y., Geurts, J., Point, J.-C., Lederer, S., Rainer, B., Muller, C., Timmerer, C., & Hellwagner, H. (2013) · 2013 IEEE International Conference on Communications (ICC) · doi:10.1109/icc.2013.6655116 · Cited by 76
Metadata
- Authors
- Aggarwal, V., Feldmann, A., & Scheideler, C.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2007-07-20
- Volume
- 37
- Issue
- 3
- Pages
- 29-40
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2145116869
- Cited by
- 393
- References
- 16
- FWCI
- 78.00
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Can ISPS and P2P users cooperate for improved performance? https://app.cochat.ai/papers/10.1145/1273445.1273449
- The paper
- Aggarwal, V., Feldmann, A., & Scheideler, C. (2007). Can ISPS and P2P users cooperate for improved performance? ACM SIGCOMM Computer Communication Review. https://doi.org/10.1145/1273445.1273449
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.