S. Albers, L. Favrholdt, and O. Giel, On paging with locality of reference, Journal of Computer and System Sciences, vol.70, issue.2, pp.145-175, 2005.
DOI : 10.1016/j.jcss.2004.08.002

D. Aldous and J. M. Steele, The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence, Probability on discrete structures, pp.1-72, 2004.
DOI : 10.1007/978-3-662-09444-0_1

R. P. Anstee, A polynomial algorithm for b-matchings: An alternative approach, Information Processing Letters, vol.24, issue.3, pp.153-157, 1987.
DOI : 10.1016/0020-0190(87)90178-5

M. Bayati, C. Borgs, J. Chayes, and R. Zecchina, Belief Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions, SIAM Journal on Discrete Mathematics, vol.25, issue.2, pp.989-1011, 2011.
DOI : 10.1137/090753115

B. Bollobás, Random Graphs, 2001.

C. Bordenave, M. Lelarge, and J. Salez, Matchings on infinite graphs. ArXiv e-prints, 2011.
DOI : 10.1007/s00440-012-0453-0
URL : https://hal.archives-ouvertes.fr/hal-00935246

Y. Boufkhad, F. Mathieu, F. De-montgolfier, D. Perino, and L. Viennot, Achievable catalog size in peer-to-peer video-on-demand systems, Proc. of IPTPS, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00471724

M. Dietzfelbinger, A. Goerdt, M. Mitzenmacher, A. Montanari, R. Pagh et al., Tight Thresholds for Cuckoo Hashing via XORSAT, Abramsky et al. [1], pp.213-225
DOI : 10.1007/978-3-642-14165-2_19
URL : http://arxiv.org/abs/0912.0287

N. Fountoulakis and K. Panagiotou, Orientability of Random Hypergraphs and the Power of Multiple Choices, Abramsky et al. [1], pp.348-359
DOI : 10.1007/978-3-642-14165-2_30

T. Kurtz, Approximation of Population Processes, CBMS-NSF Regional Conference Series in Applied Mathematics, 1981.
DOI : 10.1137/1.9781611970333

M. Lelarge, A New Approach to the Orientation of Random Hypergraphs, p.2012
DOI : 10.1137/1.9781611973099.23
URL : https://hal.archives-ouvertes.fr/hal-01270322

L. Lovász and M. D. Plummer, Matching theory, Annals of Discrete Mathematics, vol.121, p.29, 1986.
DOI : 10.1090/chel/367

M. Mitzenmacher, A. Richa, and R. Siaraman, The Power of Two Random Choices: A Survey of Techniques and Results, Handbook of randomized computing, 2001.
DOI : 10.1007/978-1-4615-0013-1_9

J. Pearl, Reverend bayes on inference engines: A distributed hierarchical approach, Proceedings of the American Association of Artificial Intelligence National Conference on AI, pp.133-136, 1982.

J. Pearl, Probabilistic reasoning in intelligent systems: networks of plausible inference, 1988.

J. Salez, The cavity method for counting spanning subgraphs subject to local constraints. ArXiv e-prints, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00577234

K. Suh, C. Diot, J. Kurose, L. Massoulie, C. Neumann et al., Push-to-peer video-on-demand system: Design and evaluation, IEEE Journal on Selected Areas in Communications, vol.25, issue.9, pp.1706-1716, 2007.

B. Tan and L. Massoulié, Optimal content placement for peer-to-peer video-on-demand systems A strongly polynomial algorithm to solve combinatorial linear programs, Proceedings of IEEE Infocom, pp.250-256, 1986.

S. Tewari and L. Kleinrock, On Fairness, Optimal Download Performance and Proportional Replication in Peer-to-Peer Networks, Proc. of IFIP Networking, 2005.
DOI : 10.1007/11422778_57

V. Vazirani, Approximation Algorithms, 2003.
DOI : 10.1007/978-3-662-04565-7

W. Wu and J. Lui, Exploring the optimal replication strategy in p2p-vod systems: Characterization and evaluation, Proceedings of IEEE Infocom, 2011.

Y. Zhou, T. Z. Fu, and D. M. Chiu, Statistical modeling and analysis of P2P replication to support VoD service, 2011 Proceedings IEEE INFOCOM, 2011.
DOI : 10.1109/INFCOM.2011.5935322