E. Anceaume, F. Castella, R. Ludinard, and B. Sericola, Markov Chains Competing for Transitions: Application to Large-Scale Distributed Systems, Methodology and Computing in Applied Probability, vol.15, issue.2, 1953.
DOI : 10.1007/s11009-011-9239-6
URL : https://hal.archives-ouvertes.fr/inria-00485667

J. Fourneau, Discrete Time Markov Chains Competing over Resources: Product Form Steady-State Distribution, 2008 Fifth International Conference on Quantitative Evaluation of Systems, pp.147-156, 2008.
DOI : 10.1109/QEST.2008.31
URL : https://hal.archives-ouvertes.fr/hal-00953623

S. Karlin and H. M. Taylor, A Second Course in Stochastic Processes, 1981.

M. F. Neuts, Matrix-Geometric Solutions to Stochastic Models, 1981.
DOI : 10.1007/978-3-642-69546-9_91

M. Luby, LT codes, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2002.
DOI : 10.1109/SFCS.2002.1181950

P. Maymounkov, Online codes, 2002.

A. Shokrollahi, Raptor codes, IEEE/ACM Transactions on Networking, pp.2551-2567, 2006.
DOI : 10.1109/tit.2006.874390

H. R. Ribeiro and E. Anceaume, A Comparative Study of Rateless Codes for P2P Distributed Storage, Proceedings of the 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2010.