The DOI matches its Crossref record; 20 of the 20 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.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Maximizing the spread of influence through a social network
Kempe, D., Kleinberg, J., & Tardos, É. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956769 · Cited by 7,326
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Reality mining: sensing complex social systems
Eagle, N., & (Sandy) Pentland, A. (2006) · Personal and Ubiquitous Computing · doi:10.1007/s00779-005-0046-3 · Cited by 2,772
Cost-effective outbreak detection in networks
Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., & Glance, N. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281239 · Cited by 2,502
Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874516 · Cited by 2,439
Expander graphs and their applications
Hoory, S., Linial, N., & Wigderson, A. (2006) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-06-01126-8 · Cited by 1,723
Social network analysis for routing in disconnected delay-tolerant MANETs
Daly, E. M., & Haahr, M. (2007) · Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing · doi:10.1145/1288107.1288113 · Cited by 1,151
Impact of Human Mobility on Opportunistic Forwarding Algorithms
Chaintreau, A., Hui, P., Crowcroft, J., Diot, C., Gass, R., & Scott, J. (2007) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2007.1060 · Cited by 1,023
Self-citationThe effect of network topology on the spread of epidemics
Ganesh, A., Massoulie, L., & Towsley, D. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498374 · Cited by 734
Self-citationGallager, R. G. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600329 · Cited by 691
Resource pricing and the evolution of congestion control
Gibbens, R. J., & Kelly, F. P. (1999) · Automatica · doi:10.1016/s0005-1098(99)00135-1 · Cited by 544
Random walks in peer-to-peer networks
Gkantsidis, C., Mihail, M., & Saberi, A. (2004) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354487 · Cited by 525
Gallager, R. G. (1996) · doi:10.1007/978-1-4615-2329-1 · Cited by 494
Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks
Costa, P., Mascolo, C., Musolesi, M., & Picco, G. (2008) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2008.080602 · Cited by 478
Dynamics of stochastic approximation algorithms
Benaïm, M. (1999) · Lecture Notes in Mathematics · doi:10.1007/bfb0096509 · Cited by 413
Designing mobility models based on social network theory
Musolesi, M., & Mascolo, C. (2007) · ACM SIGMOBILE Mobile Computing and Communications Review · doi:10.1145/1317425.1317433 · Cited by 293
A socio-aware overlay for publish/subscribe communication in delay tolerant networks
Yoneki, E., Hui, P., Chan, S., & Crowcroft, J. (2007) · Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems · doi:10.1145/1298126.1298166 · Cited by 255
A proof of alon's second eigenvalue conjecture
Friedman, J. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780646 · Cited by 192
The diameter of opportunistic mobile networks
Chaintreau, A., Mtibaa, A., Massoulie, L., & Diot, C. (2007) · Proceedings of the 2007 ACM CoNEXT conference on - CoNEXT '07 · doi:10.1145/1364654.1364670 · Cited by 183
Self-citation
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
- 20
- 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
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.