B. Bosilca, C. Coti, T. Herault, P. Lemarinier, and J. Dongarra, Constructing resiliant communication infrastructure for runtime environments, International Conference in Parallel Computing, pp.441-451, 2009.

S. [. Banerjee, B. Lee, A. Bhattacharjee, and . Srinivasan, Resilient multicast using overlays, ACM SIGMETRICS Performance Evaluation Review, vol.31, issue.1, pp.102-113, 2003.
DOI : 10.1145/885651.781041
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.5731

M. Castro, P. Druschel, A. M. Kermarrec, A. Nandi, A. Rowstron et al., SplitStream: high-bandwidth multicast in cooperative environments, Proceedings of the nineteenth ACM symposium on Operating systems principles, p.313, 2003.

A. [. Caron, F. Datta, C. Petit, and . Tedeschi, Selfstabilization in tree-structured peer-to-peer service discovery systems, IEEE Symposium on Reliable Distributed Systems, pp.207-216, 2008.

]. B. Coh03 and . Cohen, Incentives build robustness in bittorrent In Workshop on Economics of Peer-to-Peer systems, Citeseer, vol.6, pp.68-72, 2003.

[. Dan, V. Fodor, and I. Chatzidrossos, On the Performance of Multiple-Tree-Based Peer-to-Peer Live Streaming, IEEE INFOCOM 2007, 26th IEEE International Conference on Computer Communications, pp.2556-2560, 2007.
DOI : 10.1109/INFCOM.2007.320

C. [. Guo, Y. Liang, and . Liu, AQCS: Adaptive Queue-Based Chunk Scheduling for P2P Live Streaming, NETWORKING 2008 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet, pp.433-444, 2009.
DOI : 10.1007/978-3-540-79549-0_38

[. Giroire, M. Remigiusz, N. Nisse, and S. Pérennes, Maintaining Balanced Trees for Structured Distributed Streaming Systems
DOI : 10.1109/TMC.2009.60
URL : https://hal.archives-ouvertes.fr/hal-00824269

]. Y. Hua-chu, S. G. Rao, and H. Zhang, A case for end system multicast, Proc. of ACM Sigmetrics, pp.1-12, 2000.

. Hlp-+-07-]-t, P. Herault, O. Lemarinier, L. Peres, J. Pilard et al., A model for large scale self-stabilization, IEEE Parallel and Distributed Processing Symposium, pp.1-10, 2007.

]. B. Lqk-+-08, Y. Li, Y. Qu, S. Keung, C. Xie et al., Inside the new coolstreaming: Principles, measurements and performance implications, 27th IEEE International Conference on Computer Communications, 2008.

[. Li, G. Xie, K. Hwang, and Z. Li, Churn-Resilient Protocol for Massive Data Dissemination in P2P Networks, IEEE Transactions on Parallel and Distributed Systems, vol.22, issue.8, pp.1342-1349, 2011.
DOI : 10.1109/TPDS.2011.15

R. [. Magharei and . Rejaie, PRIME: Peer-to-Peer Receiver-Driven Mesh-Based Streaming, IEEE/ACM Transactions on Networking, vol.17, issue.4, pp.1052-1065, 2009.
DOI : 10.1109/TNET.2008.2007434

R. [. Magharei, Y. Rejaie, and . Guo, Mesh or Multiple-Tree: A Comparative Study of Live P2P Streaming Approaches, IEEE INFOCOM 2007, 26th IEEE International Conference on Computer Communications, pp.1424-1432, 2007.
DOI : 10.1109/INFCOM.2007.168

C. Meng-shiuan-pan, Y. Tsai, and . Tseng, The Orphan Problem in ZigBee Wireless Networks, IEEE Transactions on Mobile Computing, vol.8, issue.11, pp.1573-1584, 2009.
DOI : 10.1109/TMC.2009.60

[. Venkataraman, K. Yoshida, and P. Francis, Chunkyspread: Heterogeneous Unstructured Tree-Based Peer-to-Peer Multicast, Proceedings of the 2006 IEEE International Conference on Network Protocols, pp.2-11, 2006.
DOI : 10.1109/ICNP.2006.320193

J. [. Zhang, B. Liu, T. S. Li, and . Yum, CoolStreaming/DONet: A data-driven overlay network for efficient live media streaming, proceedings of IEEE Infocom, pp.13-17, 2005.

[. Zhang, Z. Shao, and M. Chen, Optimal distributed p2p streaming under node degree bounds, 18th IEEE International Conference on Network Protocols, pp.253-262, 2010.

[. Alouf, A. Dandoush, and P. Nain, Performance Analysis of Peer-to-Peer Storage Systems, Proceedings of the 20th International Teletraffic Congress (ITC), pp.642-653, 2007.
DOI : 10.1007/978-3-540-72990-7_57
URL : https://hal.archives-ouvertes.fr/inria-00118211

J. William, J. R. Bolosky, D. Douceur, M. Ely, and . Theimer, Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs, ACM SIGMET- RICS Perf. Eval. Review, vol.28, pp.34-43, 2000.

R. Bhagwan, K. Tati, Y. Chung-cheng, S. Savage, and G. M. Voelker, Total recall: System support for automated availability management, Proc. of the USENIX NSDI, pp.337-350, 2004.

F. Byung-gon-chun, A. Dabek, E. Haeberlen, H. Sit, M. F. Weatherspoon et al., Efficient replica maintenance for distributed storage systems, Proc. of USENIX NSDI, pp.45-58, 2006.

R. B. Cooper, Introduction to Queuing Theory, 1981.

A. Datta and K. Aberer, Internet-Scale Storage Systems under Churn -- A Study of the Steady-State using Markov Models, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06), pp.133-144, 2006.
DOI : 10.1109/P2P.2006.22

S. [. Dandoush, P. Alouf, and . Nain, Simulation analysis of download and recovery processes in P2P storage systems
URL : https://hal.archives-ouvertes.fr/hal-00641069

F. Ford, . Labelle, I. Florentina, M. Popovici, . Stokely et al., Availability in globally distributed storage systems, Proceedings of the 9th USENIX conference on Operating systems design and implementation, pp.1-7, 2010.

R. [. Flajolet and . Sedgewick, Analytic combinatorics, 2008.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

]. J. Kbc-+-00, D. Kubiatowicz, Y. Bindel, S. Chen, P. Czerwinski et al., OceanStore: an architecture for global-scale persistent storage, ACM SIGARCH Computer Architecture News, vol.28, issue.5, pp.190-201, 2000.

. G. Lms-+-97-]-m, M. Luby, M. A. Mitzenmacher, D. A. Shokrollahi, V. Spielman et al., Practical loss-resilient codes, Proceedings of the 29th annual ACM symposium on Theory of computing, pp.150-159, 1997.

S. [. Legtchenko, P. Monnet, G. Sens, and . Muller, Churnresilient replication strategy for peer-to-peer distributed hash-tables, Proceedings of SSS, volume LNCS 5873, pp.485-499, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00374095

[. Picconi, B. Baynat, and P. Sens, Predicting durability in DHTs using Markov chains, 2007 2nd International Conference on Digital Information Management, pp.532-538, 2007.
DOI : 10.1109/ICDIM.2007.4444278
URL : https://hal.archives-ouvertes.fr/hal-01336261

. Pla and . Planetlab, URL: http://www.planet-lab.org

P. [. Rowstron and . Druschel, Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems, Proc. of IFIP/ACM Intl. Conf. on Distributed Systems Platforms (Middleware), volume LNCS 2218, pp.329-350, 2001.
DOI : 10.1007/3-540-45518-3_18

[. Ramabhadran and J. Pasquale, Analysis of longrunning replicated systems, Proc. of IEEE INFOCOM, pp.1-9, 2006.

[. Venkatesan, I. Iliadis, and R. Haas, Reliability of Data Storage Systems under Network Rebuild Bandwidth Constraints, 2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp.189-197, 2012.
DOI : 10.1109/MASCOTS.2012.31

N. Valancius, L. Laoutaris, C. Massoulié, P. Diot, J. Weatherspoon et al., Greening the internet with nano data centers Erasure coding vs. replication: A quantitative comparison, ACM CoNEXT '09 Revised papers from the 1st Intl. Workshop on Peer-to-Peer Systems (IPTPS), volume LNCS 2429, pp.37-48, 2002.

S. Alouf, E. Altman, J. Galtier, J. F. Lalande, and C. Touati, Quasi-optimal bandwidth allocation for multi-spot MFT- DMA satellites, A.7 Bibliography [AAG + 05] INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, pp.560-571, 2005.

J. Araujo, J. Bermond, and F. Giroire, Weighted Improper Colouring, Combinatorial Algorithms, pp.1-18, 2011.
DOI : 10.1007/978-3-642-25011-8_1
URL : https://hal.archives-ouvertes.fr/inria-00635882

]. K. Aardal, S. P. Van-hoesel, A. M. Koster, C. Mannino, and A. Sassano, Models and solution techniques for frequency assignment problems, Annals of Operations Research, vol.19, issue.1???4, pp.79-129, 2007.
DOI : 10.1007/s10479-007-0178-0

M. [. Baccelli, M. Klein, S. Lebourges, and . Zuyev, Stochastic geometry and architecture of communication networks, Telecommunication Systems, vol.7, issue.1/3, pp.209-227, 1997.
DOI : 10.1023/A:1019172312328

]. D. Bré79 and . Brélaz, New methods to color the vertices of a graph, Communications of the ACM, vol.22, issue.4, pp.251-256, 1979.

]. R. Bro41 and . Brooks, On colouring the nodes of a network, Mathematical Proceedings of the Cambridge Philosophical Society, vol.37, issue.02, pp.194-197, 1941.

R. [. Cowen, D. R. Cowen, and . Woodall, Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency, Journal of Graph Theory, vol.1, issue.2, pp.187-195, 1986.
DOI : 10.1002/jgt.3190100207

L. J. Cowen, W. Goddard, and C. E. Jesurum, Defective coloring revisited, Journal of Graph Theory, vol.24, issue.3, pp.205-219, 1995.
DOI : 10.1002/(SICI)1097-0118(199703)24:3<205::AID-JGT2>3.0.CO;2-T
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1032.4522

F. [. Correa, J. Havet, and . Sereni, About a Brooks-type theorem for improper colouring, Australasian Journal of Combinatorics, vol.43, pp.219-230, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00223009

]. M. Flm-+-00, C. Fischetti, G. Lepschy, G. Minerva, E. Romanin-jacur et al., Frequency assignment in mobile radio systems using branch-and-cut techniques, European Journal of Operational Research, vol.123, issue.2, pp.241-255, 2000.

]. S. For87 and . Fortune, A sweepline algorithm for voronoi diagrams, Algorithmica, vol.2, issue.1, pp.153-174, 1987.

P. [. Gupta and . Kumar, The capacity of wireless networks. Information Theory, IEEE Transactions on, vol.46, issue.2, pp.388-404, 2000.

M. Haenggi, J. G. Andrews, F. Baccelli, O. Dousse, and M. Franceschetti, Stochastic geometry and random graphs for the analysis and design of wireless networks. Selected Areas in Communications, IEEE Journal on, issue.7, pp.271029-1046, 2009.

[. Havet, B. Reed, and J. Sereni, L(2,1)-labelling of graphs, Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms , SODA '08, pp.621-630, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00486183

]. R. Kar72 and . Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-103, 1972.

]. L. Lov66 and . Lovász, On decompositions of graphs, Studia Sci. Math. Hungar, vol.1, pp.273-238, 1966.

A. [. Mannino and . Sassano, An enumerative algorithm for the frequency assignment problem, Discrete Applied Mathematics, vol.129, issue.1, pp.155-169, 2003.
DOI : 10.1016/S0166-218X(02)00239-1

D. R. Woodall, Improper colorings of graphs, Pitman Res. Notes Math. Ser. Longman Scientific and Technical, vol.218, pp.45-63, 1990.

R. K. Yeh, A survey on labeling graphs with a condition at distance two, Discrete Mathematics, vol.306, issue.12, pp.1217-1231, 2006.
DOI : 10.1016/j.disc.2005.11.029