The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Optimal and scalable distribution of content updates over a mobile social network
Abstract
We study the dissemination of dynamic content, such as news or traffic information, over a mobile social network. In this application, mobile users subscribe to a dynamic-content distribution service, offered by their service provider. To improve coverage and increase capacity, we assume that users share any content updates they receive with other users they meet. We make two contributions. First, we determine how the service provider can allocate its bandwidth optimally to make the content at users as "fresh" as possible. More precisely, we define a global fairness objective (namely, maximizing the aggregate utility over all users) and prove that the corresponding optimization problem can be solved by gradient descent. Second, we specify a condition under which the system is highly scalable: even if the total bandwidth dedicated by the service provider remains fixed, the expected content age at each user grows slowly (as log(n)) with the number of users n. To the best of our knowledge, our work is the first to address these two aspects (optimality and scalability) of the distribution of dynamic content over a mobile social network.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Cited by
Age of Information: An Introduction and Survey
Yates, R. D., Sun, Y., Brown, D. R., Kaul, S. K., Modiano, E., & Ulukus, S. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3065072 · Cited by 1,160
Multicasting in delay tolerant networks: a social network perspective
Gao, W., Li, Q., Zhao, B., & Cao, G. (2009) · Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing · doi:10.1145/1530748.1530790 · Cited by 537
Mobile Data Offloading through Opportunistic Communications and Social Participation
Han, B., Hui, P., Kumar, V. S. A., Marathe, M. V., Shao, J., & Srinivasan, A. (2012) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2011.101 · Cited by 489
Data Offloading Techniques in Cellular Networks: A Survey
Rebecchi, F., Dias de Amorim, M., Conan, V., Passarella, A., Bruno, R., & Conti, M. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2369742 · Cited by 352
Understanding user behavior in online social networks: a survey
Jin, L., Chen, Y., Wang, T., Hui, P., & Vasilakos, A. V. (2013) · IEEE Communications Magazine · doi:10.1109/mcom.2013.6588663 · Cited by 316
Metadata
- Authors
- Ioannidis, S., Chaintreau, A., & Massoulie, L.
- Venue
- IEEE INFOCOM 2009
- Publisher
- IEEE
- Published
- 2009-04
- Pages
- 1422-1430
- OpenAlex
- W2128466234
- Cited by
- 281
- References
- 1
- FWCI
- 22.40
- 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: Optimal and scalable distribution of content updates over a mobile social network. https://app.cochat.ai/papers/10.1109/infcom.2009.5062058
- The paper
- Ioannidis, S., Chaintreau, A., & Massoulie, L. (2009). Optimal and scalable distribution of content updates over a mobile social network. IEEE INFOCOM 2009. https://doi.org/10.1109/infcom.2009.5062058
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.