Cache Me if You Can: Capacitated Selfish Replication Games in Networks-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Cache Me if You Can: Capacitated Selfish Replication Games in Networks

Published:2019-07-29 Issue:2 Volume:64 Page:272-310
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Gopalakrishnan Ragavendran,Kanoulas Dimitrios^ORCID,Karuturi Naga Naresh,Rangan C. Pandu,Rajaraman Rajmohan,Sundaram Ravi

Funder

National Science Foundation

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00224-019-09939-7.pdf

Reference72 articles.

1. Ahmadyan, S.N., Etesami, S.R., Poor, H.V.: A random tree search algorithm for Nash equilibrium in capacitated selfish replication games. In: IEEE 55th conference on decision and control (CDC), pp 4439–4444. https://doi.org/10.1109/CDC.2016.7798943 (2016)

2. Angel, E., Bampis, E., Pollatos, G.G., Zissimopoulos, V.: Optimal data placement on networks with constant number of clients. Theoretical Computer Science (2013)

3. Arrow, K.: Social choice and individual values. Yale University Press (1951)

4. Baev, I.D., Rajaraman, R., Swamy, C.: Approximation Algorithms for Data Placement Problems. SIAM J. Comput. 38(4), 1411–1429 (2008)

5. Byers, J.W., Luby, M., Mitzenmacher, M., Rege, A.: A digital fountain approach to reliable distribution of bulk data. In: SIGCOMM ’98, pp 56–67 (1998)

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP