The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
P4p: provider portal for applications
Abstract
As peer-to-peer (P2P) emerges as a major paradigm for scalable network application design, it also exposes significant new challenges in achieving efficient and fair utilization of Internet network resources. Being largely network-oblivious, many P2P applications may lead to inefficient network resource usage and/or low application performance. In this paper, we propose a simple architecture called P4P to allow for more effective cooperative traffic control between applications and network providers. We conducted extensive simulations and real-life experiments on the Internet to demonstrate the feasibility and effectiveness of P4P. Our experiments demonstrated that P4P either improves or maintains the same level of application performance of native P2P applications, while, at the same time, it substantially reduces network provider cost compared with either native or latency-based localized P2P applications.
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
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
BLINC: multilevel traffic classification in the dark
Karagiannis, T., Papagiannaki, K., & Faloutsos, M. (2005) · Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1080091.1080119 · Cited by 997
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
Accurate, scalable in-network identification of p2p traffic using application signatures
Sen, S., Spatscheck, O., & Wang, D. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988742 · Cited by 807
An analysis of Internet content delivery systems
Saroiu, S., Gummadi, K. P., Dunn, R. J., Gribble, S. D., & Levy, H. M. (2002) · ACM SIGOPS Operating Systems Review · doi:10.1145/844128.844158 · Cited by 546
iPlane: an information plane for distributed services
Madhyastha, H. V., Isdal, T., Piatek, M., Dixon, C., Anderson, T. E., Krishnamurthy, A., & Venkataramani, A. (2006) · doi:10.5555/1298455.1298490 · Cited by 526
Self-citationAnalyzing and Improving a BitTorrent Networks Performance Mechanisms
Bharambe, A. R., Herley, C., & Padmanabhan, V. N. (2006) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2006.328 · Cited by 454
An Experimental Study of the Skype Peer-to-Peer VoIP System
Guha, S., & Daswani, N. (2005) · eCommons (Cornell University) · Cited by 435
Do incentives build robustness in bit torrent
Piatek, M., Isdal, T., Anderson, T. E., Krishnamurthy, A., & Venkataramani, A. (2007) · Networked Systems Design and Implementation · Cited by 396
Self-citationCan ISPS and P2P users cooperate for improved performance?
Aggarwal, V., Feldmann, A., & Scheideler, C. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1273445.1273449 · Cited by 393
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
Walking the tightrope: responsive yet stable traffic engineering
Kandula, S., Katabi, D., Davie, B., & Charny, A. (2005) · Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1080091.1080122 · Cited by 352
Should Internet Service Providers Fear Peer-Assisted Content Distribution?
Karagiannis, T., Rodríguez, P., & Papagiannaki, K. (2005) · Cited by 334
Internet pricing and the history of communications
Odlyzko, A. (2001) · Computer Networks · doi:10.1016/s1389-1286(01)00188-8 · Cited by 260
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) · Proceedings of the nineteenth ACM symposium on Operating systems principles · doi:10.1145/945445.945475 · Cited by 232
Modeling and Caching of Peer-to-Peer Traffic
Saleh, O., & Hefeeda, M. M. (2006) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2006.320218 · Cited by 123
A system for authenticated policy-compliant routing
Raghavan, B., & Snoeren, A. C. (2004) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1015467.1015487 · Cited by 92
Cache replacement policies revisited: the case of P2P traffic
Wierzbicki, A., Leibowitz, N., Ripeanu, M., & Woźniak, R. (2004) · IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid) · doi:10.1109/ccgrid.2004.1336565 · Cited by 90
Characterizing and Mitigating Inter-domain Policy Violations in Overlay Routes
Seetharaman, S., & Ammar, M. (2006) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2006.320219 · Cited by 35
Cited by
A Survey on Software-Defined Networking
Xia, W., Wen, Y., Foh, C. H., Niyato, D., & Xie, H. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2330903 · Cited by 1,096
Self-citationReview of Internet of Things (IoT) in Electric Power and Energy Systems
Bedi, G., Venayagamoorthy, G. K., Singh, R., Brooks, R. R., & Wang, K.-C. (2018) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2802704 · Cited by 755
Labovitz, C., Iekel-Johnson, S., McPherson, D., Oberheide, J., & Jahanian, F. (2010) · Proceedings of the ACM SIGCOMM 2010 conference · doi:10.1145/1851182.1851194 · Cited by 545
Network of Information (NetInf) – An information-centric networking architecture
Dannewitz, C., Kutscher, D., Ohlman, B., Farrell, S., Ahlgren, B., & Karl, H. (2013) · Computer Communications · doi:10.1016/j.comcom.2013.01.009 · Cited by 306
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
Metadata
- Authors
- Xie, H., Yang, Y. R., Krishnamurthy, A., Liu, Y. G., & Silberschatz, A.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2008-08-17
- Volume
- 38
- Issue
- 4
- Pages
- 351-362
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2125890410
- Cited by
- 628
- References
- 19
- FWCI
- 181.62
- 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.