The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Cooperative content distribution and traffic engineering in an ISP network
Abstract
Traditionally, Internet Service Providers (ISPs) make profit by providing Internet connectivity, while content providers (CPs) play the more lucrative role of delivering content to users. As network connectivity is increasingly a commodity, ISPs have a strong incentive to offer content to their subscribers by deploying their own content distribution infrastructure. Providing content services in an ISP network presents new opportunities for coordination between traffic engineering (to select efficient routes for the traffic) and server selection (to match servers with subscribers). In this work, we develop a mathematical framework that considers three models with an increasing amount of cooperation between the ISP and the CP. We show that separating server selection and traffic engineering leads to sub-optimal equilibria, even when the CP is given accurate and timely information about the ISP’s network in a partial cooperation. More surprisingly, extra visibility may result in a less efficient outcome and such performance degradation can be unbounded. Leveraging ideas from cooperative game theory, we propose an architecture based on the concept of Nash bargaining solution. Simulations on realistic backbone topologies are performed to quantify the performance differences among the three models. Our results apply both when a network provider attempts to provide content, and when separate ISP and CP entities wish to cooperate. This study is a step toward a systematic understanding of the interactions between those who provide and operate networks and those who generate and distribute content.
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
A tutorial on decomposition methods for network utility maximization
Palomar, D. P., & Chiang, M. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879350 · Cited by 1,647
Self-citation
Cited by
Less pain, most of the gain: incrementally deployable ICN
Fayazbakhsh, S. K., Lin, Y., Tootoonchian, A., Ghodsi, A., Koponen, T., Maggs, B., Ng, K. C., Sekar, V., & Shenker, S. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486023 · Cited by 307
An SDN-Based CDN/ISP Collaboration Architecture for Managing High-Volume Flows
Wichtlhuber, M., Reinecke, R., & Hausheer, D. (2015) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2015.2404792 · Cited by 86
Metadata
- Authors
- Jiang, W., Zhang-Shen, R., Rexford, J., & Chiang, M.
- Venue
- Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
- Publisher
- ACM
- Published
- 2009-06-15
- Pages
- 239-250
- OpenAlex
- W2137300478
- Cited by
- 181
- References
- 1
- FWCI
- 8.91
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Cooperative content distribution and traffic engineering in an ISP network. https://app.cochat.ai/papers/10.1145/1555349.1555377
- The paper
- Jiang, W., Zhang-Shen, R., Rexford, J., & Chiang, M. (2009). Cooperative content distribution and traffic engineering in an ISP network. Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems. https://doi.org/10.1145/1555349.1555377
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.