S. Albers, L. M. 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, The ?(2) limit in the random assignment problem, Random Structures and Algorithms, vol.8, issue.4, pp.381-418, 2001.
DOI : 10.1002/rsa.1015

D. Aldous and A. Bandyopadhyay, A survey of max-type recursive distributional equations, The Annals of Applied Probability, vol.15, issue.2, pp.1047-1110, 2005.
DOI : 10.1214/105051605000000142

D. Aldous and R. Lyons, Processes on Unimodular Random Networks, Electronic Journal of Probability, vol.12, issue.0, pp.1454-1508, 2007.
DOI : 10.1214/EJP.v12-463

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

N. Alon and J. H. Spencer, The probabilistic method, Wiley. com, 2004.

M. M. Amble, P. Parag, S. Shakkottai, and L. Ying, Content-aware caching and traffic management in content distribution networks, 2011 Proceedings IEEE INFOCOM, pp.2858-2866, 2011.
DOI : 10.1109/INFCOM.2011.5935123

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

K. B. Athreya and P. E. Ney, Branching processes, 1972.
DOI : 10.1007/978-3-642-65371-1

Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal, Balanced Allocations, SIAM Journal on Computing, vol.29, issue.1, pp.180-200, 1999.
DOI : 10.1137/S0097539795288490

A. Bandyopadhyay and D. Gamarnik, Counting without sampling, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.452-479, 2008.
DOI : 10.1145/1109557.1109655

M. Bayati, C. Borgs, J. Chayes, and R. Zecchina, On the exactness of the cavity method for weighted b-matchings on arbitrary graphs and its relation to linear programs, Journal of Statistical Mechanics: Theory and Experiment, vol.2008, issue.06, pp.2008-06001, 2008.
DOI : 10.1088/1742-5468/2008/06/L06001

M. Bayati, D. Gamarnik, D. Katz, C. Nair, and P. Tetali, Simple deterministic approximation algorithms for counting matchings, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, pp.122-127, 2007.
DOI : 10.1145/1250790.1250809

URL : http://chandra.ie.cuhk.edu.hk/pub/papers/CM-stoc07.pdf

E. A. Bender and E. R. Canfield, The asymptotic number of labeled graphs with given degree sequences, Journal of Combinatorial Theory, Series A, vol.24, issue.3, pp.296-307, 1978.
DOI : 10.1016/0097-3165(78)90059-6

I. Benjamini and O. Schramm, Recurrence of distributional limits of finite planar graphs, Electron. J. Probab, vol.6, issue.13, p.pp, 2001.

P. Billingsley, Convergence of probability measures, Wiley. com, vol.493, 2009.
DOI : 10.1002/9780470316962

B. Bollobás, A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs, European Journal of Combinatorics, vol.1, issue.4, pp.311-316, 1980.
DOI : 10.1016/S0195-6698(80)80030-8

B. Bollobás, Random graphs, volume 73, 2001.

B. Bollobás and O. Riordan, Sparse graphs: Metrics and random models, Random Structures & Algorithms, vol.62, issue.1, pp.1-38, 2011.
DOI : 10.1002/rsa.20334

C. Bordenave, Lecture notes on random graphs and probabilistic combinatorial optimization!! draft in construction!!, 2012.

C. Bordenave, M. Lelarge, and J. Salez, Matchings on infinite graphs. Probability Theory and Related Fields, pp.1-26, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00935246

C. Borgs, J. Chayes, and D. Gamarnik, Convergent sequences of sparse graphs: A large deviations approach, Random Structures & Algorithms, vol.393, 2013.
DOI : 10.1002/rsa.20694

C. Borgs, J. Chayes, J. Kahn, and L. Lovász, Left and right convergence of graphs with bounded degree, Random Structures & Algorithms, vol.2, issue.1, pp.1-28, 2013.
DOI : 10.1002/rsa.20414

Y. Boufkhad, F. Mathieu, F. De-montgolfier, D. Perino, and L. Viennot, Achievable catalog size in peer-to-peer video-on-demand systems, Proceedings of the 7th Internnational Workshop on Peer-to-Peer Systems (IPTPS), pp.1-6, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00471724

A. Braunstein, M. Mézard, and R. Zecchina, Survey propagation: An algorithm for satisfiability, Random Structures and Algorithms, vol.13, issue.2, pp.201-226, 2005.
DOI : 10.1002/rsa.20057

URL : https://hal.archives-ouvertes.fr/hal-00008893

T. Britton, M. Deijfen, and A. Martin-löf, Generating Simple Random Graphs with Prescribed Degree Distribution, Journal of Statistical Physics, vol.66, issue.6, pp.1377-1397, 2006.
DOI : 10.1007/s10955-006-9168-x

J. A. Cain, P. Sanders, and N. Wormald, The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '07, pp.469-476, 2007.

H. Che, Y. Tung, and Z. Wang, Hierarchical Web caching systems: modeling, design and experimental results, IEEE Journal on Selected Areas in Communications, vol.20, issue.7, pp.1305-1314, 2002.
DOI : 10.1109/JSAC.2002.801752

N. Chen and M. Olvera-cravioto, Directed random graphs with given degree distributions. arXiv preprint, 2012.

M. Chertkov, Exactness of belief propagation for some graphical models with loops, Journal of Statistical Mechanics: Theory and Experiment, vol.2008, issue.10, p.10016, 2008.
DOI : 10.1088/1742-5468/2008/10/P10016

P. Cisco-white, Cisco visual networking index: Forecast and methodology, pp.2012-2017, 2013.

E. Cohen and S. Shenker, Replication strategies in unstructured peer-to-peer networks, ACM SIGCOMM Computer Communication Review, vol.32, issue.4, pp.177-190, 2002.
DOI : 10.1145/964725.633043

R. Darling and J. R. Norris, Differential equation approximations for markov chains. Probability surveys, pp.37-79, 2008.
DOI : 10.1214/07-ps121

URL : http://arxiv.org/abs/0710.3269

A. Dembo and A. Montanari, Gibbs measures and phase transitions on sparse random graphs, Brazilian Journal of Probability and Statistics, vol.24, issue.2, pp.137-211, 2010.
DOI : 10.1214/09-BJPS027

URL : http://arxiv.org/abs/0910.5460

M. Dietzfelbinger, A. Goerdt, M. Mitzenmacher, A. Montanari, R. Pagh et al., Tight Thresholds for Cuckoo Hashing via XORSAT, Proceedings of the 37th international colloquium conference on Automata, languages and programming, ICALP'10, pp.213-225, 2010.
DOI : 10.1007/978-3-642-14165-2_19

M. Dietzfelbinger and C. Weidling, Balanced allocation and dictionaries with tightly packed constant size bins, Theoretical Computer Science, vol.380, issue.1-2, pp.47-68, 2007.
DOI : 10.1016/j.tcs.2007.02.054

URL : http://doi.org/10.1016/j.tcs.2007.02.054

J. Dilley, B. Maggs, J. Parikh, H. Prokop, R. Sitaraman et al., Globally distributed content delivery, IEEE Internet Computing, vol.6, issue.5, pp.50-58, 2002.
DOI : 10.1109/MIC.2002.1036038

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.77.3792

A. G. Dimakis, P. B. Godfrey, Y. Wu, M. J. Wainwright, and K. Ramchandran, Network coding for distributed storage systems. Information Theory, IEEE Transactions on, vol.56, issue.9, pp.4539-4551, 2010.

R. Durrett, Random graph dynamics, 2007.
DOI : 10.1017/CBO9780511546594

P. Erdos and A. Renyi, On the evolution of random graphs, Publ. Math. Inst. Hungary. Acad. Sci, vol.5, pp.17-61, 1960.

D. Fernholz and V. Ramachandran, The k-orientability thresholds for G n,p, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '07, pp.459-468, 2007.

N. Fountoulakis, M. Khosla, and K. Panagiotou, The multiple-orientability thresholds for random hypergraphs, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1222-1236, 2011.

N. Fountoulakis, K. Panagiotou, and A. Steger, On the Insertion Time of Cuckoo Hashing, SIAM Journal on Computing, vol.42, issue.6, 1006.
DOI : 10.1137/100797503

C. Fricker, P. Robert, and J. Roberts, A versatile and accurate approximation for lru cache performance, Proceedings of the 24th International Teletraffic Congress. International Teletraffic Congress, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00671937

C. Fricker, P. Robert, J. Roberts, and N. Sbihi, Impact of traffic mix on caching performance in a content-centric network, 2012 Proceedings IEEE INFOCOM Workshops, pp.310-315, 2012.
DOI : 10.1109/INFCOMW.2012.6193511

URL : https://hal.archives-ouvertes.fr/hal-00666169

A. Frieze and P. Melsted, Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables, Random Structures & Algorithms, vol.31, issue.3, pp.334-364, 2012.
DOI : 10.1002/rsa.20427

A. Frieze, P. Melsted, and M. Mitzenmacher, An analysis of random-walk cuckoo hashing, Approximation, Randomization, and Combinatorial Optimization . Algorithms and Techniques, pp.490-503, 2009.

R. Gallager, Low-density parity-check codes. Information Theory, IRE Transactions on, vol.8, issue.1, pp.21-28, 1962.

D. Gamarnik, D. Goldberg, and T. Weber, Correlation Decay in Random Decision Networks, Mathematics of Operations Research, vol.39, issue.2, 2009.
DOI : 10.1287/moor.2013.0609

D. Gamarnik and D. Katz, Correlation decay and deterministic fptas for counting list-colorings of a graph, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp.1245-1254, 2007.

D. Gamarnik and S. Misra, Giant component in random multipartite graphs with given degree sequences. arXiv preprint, 2013.

D. Gamarnik, T. Nowicki, and G. Swirszcz, Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method, Random Structures and Algorithms, vol.5, issue.2, pp.76-106, 2006.
DOI : 10.1002/rsa.20072

P. Gao and N. C. Wormald, Load balancing and orientability thresholds for random hypergraphs, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.97-104, 2010.
DOI : 10.1145/1806689.1806705

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.7903

E. N. Gilbert, Random Graphs, The Annals of Mathematical Statistics, vol.30, issue.4, pp.1141-1144, 1959.
DOI : 10.1214/aoms/1177706098

G. H. Gonnet, Expected Length of the Longest Probe Sequence in Hash Code Searching, Journal of the ACM, vol.28, issue.2, pp.289-304, 1981.
DOI : 10.1145/322248.322254

L. J. Guibas and E. Szemeredi, The analysis of double hashing, Journal of Computer and System Sciences, vol.16, issue.2, pp.226-274, 1978.
DOI : 10.1016/0022-0000(78)90046-6

I. Heller and C. Tompkins, 14 . An Extension of a Theorem of Dantzig???s, Linear inequalities and related systems, pp.247-254, 1956.
DOI : 10.1515/9781400881987-015

T. Heskes, On the Uniqueness of Loopy Belief Propagation Fixed Points, Neural Computation, vol.50, issue.11, pp.2379-2413, 2004.
DOI : 10.1162/08997660260028674

A. T. Ihler, J. Fisher, I. , and A. S. Willsky, Loopy belief propagation: Convergence and effects of message errors, In Journal of Machine Learning Research, pp.905-936, 2005.

S. James and P. Crowley, ISP managed peer-to-peer, Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS '09, pp.167-168, 2009.
DOI : 10.1145/1882486.1882525

S. Janson, T. Luczak, and V. Kolchin, Random graphs, 2000.
DOI : 10.1002/9781118032718

W. Jiang, S. Ioannidis, L. Massoulié, and F. Picconi, Orchestrating massively distributed CDNs, Proceedings of the 8th international conference on Emerging networking experiments and technologies, CoNEXT '12, pp.133-144, 2012.
DOI : 10.1145/2413176.2413193

R. M. Karp, Reducibility among combinatorial problems, 1972.
DOI : 10.1007/978-3-540-68279-0_8

F. P. Kelly, Loss networks. The annals of applied probability, pp.319-378, 1991.

M. Khosla, Balls into Bins Made Faster, ESA, Lecture Notes in Computer Science, 2013.
DOI : 10.1007/978-3-642-40450-4_51

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.368.4133

J. H. Kim, Poisson Cloning Model for Random Graphs. ArXiv e-prints, 2008.
DOI : 10.4171/022-3/43

URL : http://arxiv.org/abs/0805.4133

F. Krz¸aka?akrz¸aka?a, A. Montanari, F. Ricci-tersenghi, G. Semerjian, and L. Zdeborová, Gibbs states and the set of solutions of random constraint satisfaction problems, Proc. Natl. Acad. Sci. USA, pp.10318-10323, 2007.

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

N. Laoutaris, V. Zissimopoulos, and I. Stavrakakis, On the optimization of storage capacity allocation for content distribution, Computer Networks, vol.47, issue.3, pp.409-428, 2005.
DOI : 10.1016/j.comnet.2004.07.020

M. Lelarge, A New Approach to the Orientation of Random Hypergraphs, Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '12, pp.251-264, 2012.
DOI : 10.1137/1.9781611973099.23

URL : https://hal.archives-ouvertes.fr/hal-01270322

L. Lovász and M. D. Plummer, Matching theory, 2009.
DOI : 10.1090/chel/367

G. Lueker and M. Molodowitch, More analysis of double hashing, Proceedings of the twentieth annual ACM symposium on Theory of computing, pp.354-359, 1988.

R. Lyons, Asymptotic Enumeration of Spanning Trees, Combinatorics, Probability and Computing, vol.14, issue.4, pp.491-522, 2005.
DOI : 10.1017/S096354830500684X

E. Maneva, E. Mossel, and M. J. Wainwright, A new look at survey propagation and its generalizations, Journal of the ACM, vol.54, issue.4, 2007.
DOI : 10.1145/1255443.1255445

B. D. Mckay and N. C. Wormald, Uniform generation of random regular graphs of moderate degree, Journal of Algorithms, vol.11, issue.1, pp.52-67, 1990.
DOI : 10.1016/0196-6774(90)90029-E

M. Mezard and A. Montanari, Information, Physics, and Computation, 2009.
DOI : 10.1093/acprof:oso/9780198570837.001.0001

M. Mézard and G. Parisi, The Bethe lattice spin glass revisited, The European Physical Journal B, vol.20, issue.2, pp.217-233, 2001.
DOI : 10.1007/PL00011099

M. Mézard and G. Parisi, The cavity method at zero temperature, Journal of Statistical Physics, vol.111, issue.1/2, pp.1-34, 2003.
DOI : 10.1023/A:1022221005097

M. Mézard, G. Parisi, and M. A. Virasoro, Spin glass theory and beyond, World Scientific Lecture Notes in Physics, vol.9, 1987.

M. Mézard, G. Parisi, and R. Zecchina, Analytic and Algorithmic Solution of Random Satisfiability Problems, Science, vol.297, issue.5582, pp.812-815, 2002.
DOI : 10.1126/science.1073287

M. Mitzenmacher, Some Open Questions Related to Cuckoo Hashing, Algorithms-ESA 2009, pp.1-10, 2009.
DOI : 10.1007/978-3-642-04128-0_1

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.3061

M. Mitzenmacher, Balanced allocations and double hashing. CoRR, abs/1209, 2012.
DOI : 10.1145/2612669.2612684

URL : http://arxiv.org/abs/1209.5360

M. Mitzenmacher, A. W. Richa, and R. Sitaraman, The Power of Two Random Choices: A Survey of Techniques and Results, Handbook of Randomized Computing, pp.255-312, 2000.
DOI : 10.1007/978-1-4615-0013-1_9

M. Mitzenmacher and J. Thaler, Peeling arguments and double hashing, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp.1118-1125, 2012.
DOI : 10.1109/Allerton.2012.6483344

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.648.185

J. M. Mooij and H. J. Kappen, Sufficient Conditions for Convergence of the Sum–Product Algorithm, IEEE Transactions on Information Theory, vol.53, issue.12, pp.4422-4437, 2007.
DOI : 10.1109/TIT.2007.909166

R. Mulet, A. Pagnani, M. Weigt, and R. Zecchina, Coloring random graphs. Physical review letters, p.268701, 2002.

A. Müller and D. Stoyan, Comparison Methods for Stochastic Models and Risks, 2009.

T. Nelson, Literary machines, 93.1 edn, 1993.

R. Pagh and F. F. Rodler, Cuckoo hashing, ESA, pp.121-133, 2001.
DOI : 10.1007/3-540-44676-1_10

J. Pearl, Reverend bayes on inference engines: A distributed hierarchical approach, AAAI, pp.133-136, 1982.

J. Pearl, Probabilistic reasoning in intelligent systems: networks of plausible inference. The Morgan Kaufmann Series in Representation and Reasoning, 1988.

R. Pemantle, Towards a theory of negative dependence, Journal of Mathematical Physics, vol.41, issue.3, p.1371, 2000.
DOI : 10.1063/1.533200

T. J. Richardson and R. L. Urbanke, The capacity of low-density parity-check codes under message-passing decoding. Information Theory, IEEE Transactions on, vol.47, issue.2, pp.599-618, 2001.

Y. Rochman, H. Levy, and E. Brosh, Max Percentile Replication for Optimal Performance in Multi-regional P2P VoD Systems, 2012 Ninth International Conference on Quantitative Evaluation of Systems, pp.238-248, 2012.
DOI : 10.1109/QEST.2012.33

Y. Rochman, H. Levy, and E. Brosh, Resource placement and assignment in distributed network topologies, 2013 Proceedings IEEE INFOCOM, 2013.
DOI : 10.1109/INFCOM.2013.6566991

J. Salez, Weighted enumeration of spanning subgraphs in locally tree-like graphs. Random Structures & Algorithms, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00935248

A. Schrijver, Combinatorial Optimization : Polyhedra and Efficiency (Algorithms and Combinatorics), 2004.

J. G. Shanthikumar and D. D. Yao, The preservation of likelihood ratio ordering under convolution, Stochastic Processes and their Applications, pp.259-267, 1986.
DOI : 10.1016/0304-4149(86)90039-6

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

A. Sznitman, Topics in propagation of chaos, Ecole d'Eté de Probabilités de Saint-Flour XIX?1989, pp.165-251, 1991.
DOI : 10.1070/SM1974v022n01ABEH001689

B. Tan and L. Massoulié, Optimal content placement for peer-to-peer videoon-demand systems, Proceedings IEEE INFOCOM, pp.694-702, 2011.

E. Tardos, A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs, Operations Research, vol.34, issue.2, pp.250-256, 1986.
DOI : 10.1287/opre.34.2.250

S. C. Tatikonda and M. I. Jordan, Loopy belief propagation and gibbs measures, Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence, pp.493-500, 2002.

S. Tewari and L. Kleinrock, On Fairness, Optimal Download Performance and Proportional Replication in Peer-to-Peer Networks, NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems, pp.709-717, 2005.
DOI : 10.1007/11422778_57

S. Tewari and L. Kleinrock, Proportional Replication in Peer-to-Peer Networks, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, 2006.
DOI : 10.1109/INFOCOM.2006.132

V. Valancius, N. Laoutaris, L. Massoulié, C. Diot, and P. Rodriguez, Greening the internet with nano data centers, Proceedings of the 5th international conference on Emerging networking experiments and technologies, CoNEXT '09, pp.37-48, 2009.
DOI : 10.1145/1658939.1658944

R. Van-der and . Hofstad, Random graphs and complex networks Available on http, 2009.

V. V. Vazirani, Approximation algorithms, 2001.
DOI : 10.1007/978-3-662-04565-7

S. Vembu and S. Verdú, Generating random bits from an arbitrary source: Fundamental limits. Information Theory, IEEE Transactions on, vol.41, issue.5, pp.1322-1332, 1995.

H. W. Watson and F. Galton, On the Probability of the Extinction of Families., The Journal of the Anthropological Institute of Great Britain and Ireland, vol.4, pp.138-144
DOI : 10.2307/2841222

Y. Weiss and W. T. Freeman, Correctness of Belief Propagation in Gaussian Graphical Models of Arbitrary Topology, Neural Computation, vol.13, issue.10, pp.2173-2200, 2001.
DOI : 10.1109/18.910585

D. Weitz, Counting independent sets up to the tree threshold, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , STOC '06, pp.140-149, 2006.
DOI : 10.1145/1132516.1132538

W. Whitt, Uniform conditional stochastic order, Journal of Applied Probability, pp.112-123, 1980.
DOI : 10.2307/3212929

W. Whitt, Multivariate monotone likelihood ratio and uniform conditional stochastic order, Journal of Applied Probability, vol.74, issue.03, pp.695-701, 1982.
DOI : 10.1287/moor.6.2.263

N. C. Wormald, Some problems in the enumeration of labelled graphs, Bulletin of the Australian Mathematical Society, vol.21, issue.01, 1978.
DOI : 10.1017/S0004972700011436

W. Wu and J. C. Lui, Exploring the optimal replication strategy in p2p-vod systems: Characterization and evaluation. Parallel and Distributed Systems, IEEE Transactions on, vol.23, issue.8, pp.1492-1503, 2012.

J. Yedidia, W. Freeman, and Y. Weiss, Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms, IEEE Transactions on Information Theory, vol.51, issue.7, pp.2282-2312, 2005.
DOI : 10.1109/TIT.2005.850085

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.9766

L. Zdeborová and F. Krz?ka?a, Phase transitions in the coloring of random graphs, Physical Review E, vol.76, issue.3, p.31131, 2007.
DOI : 10.1103/PhysRevE.76.031131

L. Zdeborová and M. Mézard, The number of matchings in random graphs, Journal of Statistical Mechanics: Theory and Experiment, vol.2006, issue.05, p.5003, 2006.
DOI : 10.1088/1742-5468/2006/05/P05003

Y. Zhou, T. Z. Fu, and D. M. Chiu, A unifying model and analysis of p2p vod replication and scheduling, Proceedings IEEE INFOCOM, pp.1530-1538, 2012.

Y. Zhou, T. Z. Fu, and D. M. Chiu, On Replication Algorithm in P2P VoD, IEEE/ACM Transactions on Networking, vol.21, issue.1, pp.233-243, 2013.
DOI : 10.1109/TNET.2012.2196444

D. Zuckerman, Simulating BPP using a general weak random source, Algorithmica, vol.7, issue.4, pp.367-391, 1996.
DOI : 10.1007/BF01940870