S. Caron, F. Giroire, D. Mazauric, J. Monteiro, and S. Pérennes, Data Life Time for Different Placement Policies in P2P Storage Systems, Proceedings of the 3rd Intl. Conference on Data Management in Grid and P2P Systems (Globe), pp.75-88, 2010.
DOI : 10.1007/978-3-642-15108-8_7
URL : https://hal.archives-ouvertes.fr/inria-00496222

S. Caron, F. Giroire, D. Mazauric, J. Monteiro, and S. Pérennes, Data Life Time for Different Placement Policies in P2P Storage Systems, 12es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (Algotel), p.4, 2010.
DOI : 10.1007/978-3-642-15108-8_7
URL : https://hal.archives-ouvertes.fr/inria-00496222

O. Dalle, F. Giroire, J. Monteiro, and S. Pérennes, Analyse des corrélations entre pannes dans les systèmes de stockage pair-à-pair, 11es rencontres francophones sur les Aspects Algorithmiques des Télécommunications (Algotel), page 4p, 2009.

O. Dalle, F. Giroire, J. Monteiro, and S. Pérennes, Analysis of failure correlation impact on peer-to-peer storage systems, 2009 IEEE Ninth International Conference on Peer-to-Peer Computing, pp.184-193, 2009.
DOI : 10.1109/P2P.2009.5284518
URL : https://hal.archives-ouvertes.fr/inria-00485847

A. Ferreira, A. Goldman, and J. Monteiro, Performance evaluation of dynamic networks using an evolving graph combinatorial model, Proceedings of the 2nd IEEE Intl. Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), pp.173-180, 2006.

A. Ferreira, A. Goldman, and J. Monteiro, On the Evaluation of Shortest Journeys in Dynamic Networks, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007), pp.3-10, 2007.
DOI : 10.1109/NCA.2007.35

A. Ferreira, A. Goldman, and J. Monteiro, Using evolving graphs foremost journey to evaluate ad-hoc routing protocols, Proceedings of the 25th Brazilian Symposium on Computer Networks (SBRC), pp.17-30, 2007.

A. Ferreira, A. Goldman, and J. Monteiro, Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs, Wireless Networks, vol.8, issue.1, pp.627-640, 2010.
DOI : 10.1007/s11276-008-0158-6
URL : https://hal.archives-ouvertes.fr/inria-00496219

F. Giroire, J. Monteiro, and S. Pérennes, P2P storage systems: How much locality can they tolerate?, 2009 IEEE 34th Conference on Local Computer Networks, pp.320-323, 2009.
DOI : 10.1109/LCN.2009.5355104
URL : https://hal.archives-ouvertes.fr/inria-00496220

F. Giroire, J. Monteiro, and S. Pérennes, Peer-to-Peer Storage Systems: A Practical Guideline to be Lazy, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010, 2010.
DOI : 10.1109/GLOCOM.2010.5683761
URL : https://hal.archives-ouvertes.fr/inria-00496221

J. Monteiro, The use of evolving graph combinatorial model in routing protocols for dynamic networks, Proceedings of the XV Concurso Latinoamericano de Tesis de Maestría (CLEI) Third prize in the CLEI'08 Master's Thesis Contests, pp.41-57, 2008.

J. Monteiro and O. Dalle, CORRAL: Stackable Copy-on-Write Versioning Device using Linux Device-Mapper, USENIX Annual Technical Conference (USENIX'08), 2008.

J. Monteiro and S. Pérennes, Systèmes de stockage P2P : un guide pratique, 11es Journées Doctorales en Informatique et Réseaux, pp.15-20, 2010.

A. Alouf, P. Dandoush, and . 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

R. J. Anderson, The eternity service, Proceedings of Pragocrypt, pp.242-252, 1996.

M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. H. Katz et al., Above the clouds: A berkeley view of cloud computing, 2009.

C. Batten, K. Barr, A. Saraf, and S. Trepetin, pStore: A secure peer-to-peer backup system, 2002.

R. Bhagwan, D. Moore, S. Savage, and G. M. Voelker, Replication Strategies for Highly Available Peer-to-Peer Storage, Future Directions in Distributed Computing: research and position papers, volume LNCS 2584, pp.153-158, 2003.
DOI : 10.1007/3-540-37795-6_28

R. Bhagwan, S. Savage, and G. Voelker, Understanding availability. In Intl. Workshop on Peer-to-Peer Systems (IPTPS), Peer-to-Peer Systems II, LNCS 2735, pp.256-267, 2003.
DOI : 10.1007/978-3-540-45172-3_24
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.1523

R. Bhagwan, K. Tati, Y. Chung-cheng, S. Savage, and G. M. Voelker, Total recall: System support for automated availability management, Proceedings of the 1st USENIX symposium on Networked Systems Design and Implementation (NSDI), pp.337-350, 2004.

A. Binzenhöfer, T. Hoßfeld, G. Kunzmann, and K. Eger, Efficient Simulation of Large-Scale P2P Networks: Compact Data Structures, 15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07), pp.467-474, 2007.
DOI : 10.1109/PDP.2007.41

G. Bolch, S. Greiner, H. D. Meer, and K. S. Trivedi, Queueing Networks and Markov Chains, 2005.

W. J. Bolosky, J. R. Douceur, D. Ely, and M. Theimer, Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs, ACM SIGMETRICS Performance Evaluation Review, vol.28, issue.1, pp.34-43, 2000.
DOI : 10.1145/345063.339345

J. L. Boudec, D. Mcdonald, and J. Mundinger, A Generic Mean Field Convergence Result for Systems of Interacting Objects, Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007), pp.3-18, 2007.
DOI : 10.1109/QEST.2007.8

J. Busca, F. Picconi, and P. Sens, Pastis: A highly-scalable multi-user peer-topeer file system, Proceedings of the 11th European Conference on Parallel Processing (Euro-par), volume LNCS 3648, pp.1173-1182, 2005.

J. W. Byers, M. Luby, M. Mitzenmacher, and A. Rege, A digital fountain approach to reliable distribution of bulk data, Proceedings of the ACM Conference on Applications , Technologies, Architectures, and Protocols for Computer Communication (SIG- COMM), pp.56-67, 1998.

H. Casanova, Simgrid: a toolkit for the simulation of application scheduling, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid, pp.430-437, 2001.
DOI : 10.1109/CCGRID.2001.923223

B. Chun, F. Dabek, A. Haeberlen, E. Sit, H. Weatherspoon et al., Efficient replica maintenance for distributed storage systems, Proceedings of USENIX symposium on Networked Systems Design and Implementation (NSDI), pp.45-58, 2006.

I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong, Freenet: A Distributed Anonymous Information Storage and Retrieval System, Proceedings of Designing Privacy Enhancing Technologies: Workshop on Design Issues in Anonymity and Unobservability, pp.46-66, 2001.
DOI : 10.1007/3-540-44702-4_4

B. Cohen, Incentives build robustness in BitTorrent, 1st Workshop on Economics of Peer-to-Peer Systems, 2003.

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

R. M. Corless, G. H. Gonnet, D. E. Hare, D. J. Jeffrey, and D. E. Knuth, On the LambertW function, Advances in Computational Mathematics, vol.1, issue.6, pp.329-359, 1996.
DOI : 10.1007/BF02124750

L. P. Cox, C. D. Murray, and B. D. Noble, Pastiche: making backup cheap and easy, Proceedings of the 5th symposium on Operating systems design and implementation (OSDI 02), pp.285-298, 2002.

A. Crespo and H. Garcia-molina, Modeling archival repositories for digital libraries (extended version), 1999.

F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica, Wide-area cooperative storage with cfs, Proceedings of the ACM Symposium on Operating Systems Principles (SOSP), pp.202-215, 2001.

A. Dandoush, Analyse et l'Optimisation des Systèmes de Stockage de Données dans les Réseaux Pair-à-Pair, 2010.

A. Dandoush, S. Alouf, and P. Nain, Simulation analysis of download and recovery processes in P2P storage systems, Proceedings of the International Teletraffic Congress (ITC), 2009.
URL : https://hal.archives-ouvertes.fr/hal-00641069

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

N. G. De-bruijn, A combinatorial problem, Kibern. Sb. Nov. Ser, vol.6, pp.33-40, 1969.

R. Y. De-camargo, F. C. Filho, and F. Kon, Efficient maintenance of distributed data in highly dynamic opportunistic grids, Proceedings of the 2009 ACM symposium on Applied Computing, SAC '09, pp.1067-1071, 2009.
DOI : 10.1145/1529282.1529515

A. Dimakis, P. Godfrey, M. Wainwright, and K. Ramchandran, Network coding for distributed storage systems, Proceedings of IEEE Intl. Conference on Computer Communications (INFOCOM), pp.2000-2008, 2007.

A. G. Dimakis, K. Ramchandran, Y. Wu, and C. Suh, A Survey on Network Codes for Distributed Storage, Proceedings of the IEEE, vol.99, issue.3, 2010.
DOI : 10.1109/JPROC.2010.2096170

J. R. Douceur and R. P. Wattenhofer, Large-scale simulation of replica placement algorithms for a serverless distributed file system, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp.311-322, 2001.
DOI : 10.1109/MASCOT.2001.948882

P. Druschel and A. Rowstron, PAST: a large-scale, persistent peer-to-peer storage utility, Proceedings Eighth Workshop on Hot Topics in Operating Systems, pp.75-80, 2001.
DOI : 10.1109/HOTOS.2001.990064

A. Duminuco and E. Paristech, Data redundancy and maintenance for peer-to-peer file backup systems, 2009.
URL : https://hal.archives-ouvertes.fr/pastel-00005541

A. Duminuco and E. Biersack, Hierarchical Codes: How to Make Erasure Codes Attractive for Peer-to-Peer Storage Systems, 2008 Eighth International Conference on Peer-to-Peer Computing, pp.89-98, 2008.
DOI : 10.1109/P2P.2008.9

A. Duminuco and E. Biersack, A practical study of regenerating codes for peerto-peer backup systems, Proceedings of the 29th IEEE International Conference on Distributed Computing Systems(ICDCS), pp.376-384, 2009.

A. Duminuco, E. Biersack, and T. En-najjary, Proactive replication in distributed storage systems using machine availability estimation, Proceedings of the 2007 ACM CoNEXT conference on , CoNEXT '07
DOI : 10.1145/1364654.1364689

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

M. D. Flouris, Clotho: Transparent data versioning at the block i/o level, Proceedings of the 12th NASA Goddard, 21st IEEE Conference on Mass Storage Systems and Technologies (MSST 2004, pp.315-328, 2004.

W. Galuba, K. Aberer, Z. Despotovic, and W. Kellerer, ProtoPeer: A P2P Toolkit Bridging the Gap Between Simulation and Live Deployement, Proceedings of the Second International ICST Conference on Simulation Tools and Techniques, pp.1-9, 2009.
DOI : 10.4108/ICST.SIMUTOOLS2009.5681

J. Gantz, The diverse and exploding digital universe: An updated forecast of worldwide information growth through 2011, International Data Corporation, 2008.

J. Gantz and D. , The digital universe decade -are you ready? Technical Report White paper, International Data Corporation (IDC) -Sponsored by EMC Corporation, 2010.

S. Ghemawat, H. Gobioff, and S. Leung, The Google file system, ACM SIGOPS Operating Systems Review, vol.37, issue.5, pp.29-43, 2003.
DOI : 10.1145/1165389.945450

A. V. Goldberg and P. N. Yianilos, Towards an archival Intermemory, Proceedings IEEE International Forum on Research and Technology Advances in Digital Libraries -ADL'98-, p.147, 1998.
DOI : 10.1109/ADL.1998.670389

I. Gupta, K. Birman, P. Linga, A. Demers, and R. Van-renesse, Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead, 2nd Intl. Workshop on Peer-to-Peer Systems (IPTPS), 2003.
DOI : 10.1007/978-3-540-45172-3_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.3464

A. Haeberlen, A. Mislove, and P. Druschel, Glacier: highly durable, decentralized storage despite massive correlated failures, Proceedings of USENIX symposium on Networked Systems Design and Implementation (NSDI), pp.143-158, 2005.

R. W. Hamming, Error Detecting and Error Correcting Codes, Bell System Technical Journal, vol.29, issue.2, pp.147-160, 1950.
DOI : 10.1002/j.1538-7305.1950.tb00463.x
URL : http://campus.unibo.it/10913/1/hamming1950.pdf

R. Hasan, Z. Anwar, W. Yurcik, L. Brumbaugh, and R. Campbell, A survey of peer-to-peer storage techniques for distributed file systems, International Conference on Information Technology: Coding and Computing (ITCC'05), Volume II, pp.205-213, 2005.
DOI : 10.1109/ITCC.2005.42

H. Hennion, Limit theorems for products of positive random matrices. The Annals of Probability, pp.1545-1587, 1997.

D. Hitz, J. Lau, and M. Malcolm, File system design for an nfs file server appliance, Proceedings of the USENIX Winter 1994 Technical Conference, pp.235-246, 1994.

I. Ivkovic, Improving gnutella protocol: Protocol analysis and research proposals, 2001.

F. M. Kaashoek and D. R. Karger, Koorde: A Simple Degree-Optimal Distributed Hash Table, 2nd Intl. Workshop on Peer-to-Peer Systems (IPTPS), pp.98-107, 2003.
DOI : 10.1007/978-3-540-45172-3_9

M. Karlsson, M. Mahalingam, M. Karlsson, and M. Mahalingam, Do we need replica placement algorithms in content delivery networks, 7th International Workshop on Web Content Caching and Distribution (WCW), 2002.

T. Klingberg and R. Manfredi, Gnutella protocol 0.6, web document, 2002.

S. Ktari, M. Zoubert, A. Hecker, and H. Labiod, Performance evaluation of replication strategies in DHTs under churn, Proceedings of the 6th international conference on Mobile and ubiquitous multimedia , MUM '07, pp.90-97, 2007.
DOI : 10.1145/1329469.1329481

J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton et al., OceanStore, ACM SIGARCH Computer Architecture News, vol.28, issue.5, pp.190-201, 2000.
DOI : 10.1145/378995.379239

G. Kunzmann, R. Nagel, T. Hossfeld, A. Binzenhofer, and K. Eger, Efficient Simulation of Large-Scale P2P Networks: Modeling Network Transmission Times, 15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP'07), pp.475-481, 2007.
DOI : 10.1109/PDP.2007.42

T. Kurtz, Approximation of Population Processes, Society for Industrial Mathematics, 1981.
DOI : 10.1137/1.9781611970333

S. Legtchenko, S. Monnet, P. Sens, and G. Muller, Churn-Resilient Replication Strategy for Peer-to-Peer Distributed Hash-Tables, Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, volume LNCS 5873, pp.485-499, 2009.
DOI : 10.1007/978-3-642-05118-0_34
URL : https://hal.archives-ouvertes.fr/inria-00374095

Q. Lian, W. Chen, and Z. Zhang, On the impact of replica placement to the reliability of distributed brick storage systems, International Conference on Distributed Computing Systems (ICSCS'05), pp.187-196, 2005.

]. J. Liang, R. Kumar, and K. Ross, Understanding kazaa, 2004.

D. Liben-nowell, H. Balakrishnan, and D. Karger, Analysis of the evolution of peer-to-peer systems, Proceedings of the twenty-first annual symposium on Principles of distributed computing , PODC '02, pp.233-242, 2002.
DOI : 10.1145/571825.571863

W. Lin, D. Chiu, and Y. Lee, Erasure code replication revisited, Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings., pp.90-97, 2004.
DOI : 10.1109/PTP.2004.1334935

P. G. López, C. Pairot, R. Mondéjar, J. P. Ahulló, H. Tejedor et al., PlanetSim: A new overlay network simulation framework, Lecture Notes in Computer Science, vol.3437, pp.123-136, 2004.

E. K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim, A survey and comparison of peer-to-peer overlay network schemes, IEEE Communications Survey and Tutorial, vol.7, issue.2, pp.72-93, 2005.

M. Luby, M. Mitzenmacher, M. Shokrollahi, D. Spielman, and V. Stemann, Practical loss-resilient codes, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.150-159, 1997.
DOI : 10.1145/258533.258573
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.5754

A. Markov, On the problem of representability of matrices, Z. Math. Logik Grundlagen Math, vol.4, pp.157-168, 1958.

P. Maymounkov and D. Mazières, Kademlia: A Peer-to-Peer Information System Based on the XOR Metric, Revised papers from the 1st Intl. Workshop on Peer-to-Peer Systems (IPTPS), pp.53-65, 2002.
DOI : 10.1007/3-540-45748-8_5

C. B. Morrey, I. , and D. Grunwald, Peabody: the time travelling disk, 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies, 2003. (MSST 2003). Proceedings., p.241, 2003.
DOI : 10.1109/MASS.2003.1194861

A. Muthitacharoen, R. Morris, T. M. Gil, and B. Chen, Ivy, Proceedings of 5th Symposium on Operating Systems Design and Implementation, pp.31-44, 2002.
DOI : 10.1145/844128.844132

S. Naicken, A. Basu, B. Livingston, and S. Rodhetbhai, A survey of peer-to-peer network simulators, Proceedings of the 7th Annual Postgraduate Symposium, 2006.

D. A. Patterson, G. Gibson, and R. H. Katz, A case for redundant arrays of inexpensive disks (raid), Proceedings of ACM International Conference on Management of Data (SIGMOD'88), pp.109-116, 1988.

F. 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

E. Pinheiro, W. Weber, and L. Barroso, Failure trends in a large disk drive population, Proceedings of USENIX Conference on File and Storage Technologies (FAST), 2007.

J. S. Plank, A tutorial on Reed???Solomon coding for fault???tolerance in RAID-like systems, Software: Practice and Experience, vol.27, issue.9, pp.995-1012, 1997.
DOI : 10.1002/(SICI)1097-024X(199709)27:9<995::AID-SPE111>3.3.CO;2-Y

J. S. Plank, J. Luo, C. D. Schuman, L. Xu, and Z. Wilcox-o-'hearn, A performance evaluation and examination of open-source erasure coding libraries for storage, Proceedings of the 7th USENIX Conference on File and Storage Technologies (FAST), 2009.

C. G. Plaxton, R. Rajaraman, and A. W. Richa, Accessing nearby copies of replicated objects in a distributed environment, Proceedings of the 9th annual ACM symposium on Parallel algorithms and architectures (SPAA'97), pp.311-320, 1997.

S. Quinlan, J. Mckie, and R. Cox, Fossil, an archival file-server

M. O. Rabin, Efficient dispersal of information for security, load balancing, and fault tolerance, Journal of the ACM, vol.36, issue.2, pp.335-348, 1989.
DOI : 10.1145/62044.62050

S. Ramabhadran and J. Pasquale, Analysis of Long-Running Replicated Systems, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, pp.1-9, 2006.
DOI : 10.1109/INFOCOM.2006.130

S. Ramabhadran and J. Pasquale, A resource allocation problem in replicated peerto-peer storage systems, Proceedings of IEEE International Symposium on Parallel and Distributed Processing (IPDPS), pp.1-8, 2007.

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A scalable contentaddressable network, Proceedings of the ACM Conference on Applications, Technologies , Architectures, and Protocols for Computer Communication (SIGCOMM), 2001.

I. S. Reed and G. Solomon, Polynomial Codes Over Certain Finite Fields, Journal of the Society for Industrial and Applied Mathematics, vol.8, issue.2, pp.300-304, 1960.
DOI : 10.1137/0108018

S. Rhea, P. Eaton, D. Geels, H. Weatherspoon, B. Zhao et al., Pond: The oceanstore prototype, Proceedings of USENIX Conference on File and Storage Technologies (FAST), pp.1-14, 2003.

S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, Handling churn in a dht, Proceedings of the USENIX Annual Technical Conference, pp.10-10, 2004.

G. Riley and M. Ammar, Simulating large networks: How big is big enough?, Proceedings of First International Conference on Grand Challenges for Modeling and Simulation, 2002.

R. Rodrigues and B. Liskov, High availability in dhts: Erasure coding vs. replication . In Workshop on Peer-to-Peer Systems (IPTPS), Peer-to-Peer Systems IV, LNCS, pp.226-239, 2005.

S. M. Ross, Introduction to Probability Models, Ninth Edition, 2006.

A. Rowstron and P. Druschel, Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems, IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pp.329-350, 2001.
DOI : 10.1007/3-540-45518-3_18

A. Rowstron and P. Druschel, Storage management and caching in past, a largescale , persistent peer-to-peer storage utility, Proceedings of the ACM Symposium on Operating Systems Principles (SOSP), pp.188-201, 2001.

B. Schroeder and G. Gibson, Disk failures in the real world: What does an mttf of 1,000,000 hours mean to you, Proceedings of the conference on File and Storage Technologies (FAST), 2007.

E. Sit, A. Haeberlen, F. Dabek, B. Gon-chun, H. Weatherspoon et al., Proactive replication for data durability, 5th Intl. Workshop on Peer-to-Peer Systems (IPTPS), 2006.

A. B. Stirling and M. K. Stirling, Tools for peer-to-peer network simulation, 2006.

I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, Chord: a scalable peer-to-peer lookup protocol for internet applications, IEEE/ACM Transactions on Networking, vol.11, issue.1, pp.17-31, 2003.
DOI : 10.1109/TNET.2002.808407

D. Stutzbach and R. Rejaie, Understanding churn in peer-to-peer networks, Proceedings of the 6th ACM SIGCOMM on Internet measurement , IMC '06, pp.189-202, 2006.
DOI : 10.1145/1177080.1177105

R. D. Team, R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, 2010.

S. A. Theotokis and D. Spinellisa, A survey of peer-to-peer content distribution technologies, ACM Computing Surveys, vol.36, issue.4, pp.335-371, 2004.
DOI : 10.1145/1041680.1041681

H. C. Tijms, Stochastic modelling and analysis: a computational approach, 1986.

N. S. Ting, Simulating peer-to-peer networks, 2006.

A. Traeger, E. Zadok, N. Joukov, and C. P. Wright, A nine year study of file system and storage benchmarking, ACM Transactions on Storage, vol.4, issue.2, pp.1-56, 2008.
DOI : 10.1145/1367829.1367831

G. Utard and A. Vernois, Data durability in peer to peer storage systems, IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004., pp.90-97, 2004.
DOI : 10.1109/CCGrid.2004.1336553

R. Van-renesse, Efficient reliable internet storage, Workshop on Dependable Distributed Data Management, 2004.

R. Van-renesse and F. B. Schneider, Chain replication for supporting high throughput and availability [123] A. Varga. OMNet++: Discrete event simulation systems, Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation (OSDI), pp.7-7, 2004.

H. Weatherspoon, Design and evaluation of distributed wide-area on-line archival storage systems, 2006.

H. Weatherspoon and J. Kubiatowicz, Erasure Coding Vs. Replication: A Quantitative Comparison, Revised papers from the 1st Intl. Workshop on Peer-to-Peer Systems (IPTPS), volume LNCS 2429, pp.328-337, 2002.
DOI : 10.1007/3-540-45748-8_31

Z. Wilcox-o-'hearn, Zfec 1.4.7 -open source erasure code package, 2010.

Z. Wilcox-o-'hearn and B. Warner, Tahoe: the least-authority filesystem, ACM StorageSS, pp.21-26, 2008.

D. Wu, Y. Tian, K. Ng, and A. Datta, Stochastic analysis of the interplay between object maintenance and churn, Computer Communications, vol.31, issue.2, pp.31220-239, 2008.
DOI : 10.1016/j.comcom.2007.08.008

Z. Zhang, Q. Lian, S. Lin, W. Chen, Y. Chen et al., BitVault, ACM SIGOPS Operating Systems Review, vol.41, issue.2, pp.27-36, 2007.
DOI : 10.1145/1243418.1243423

Z. Zhang, S. Lin, Q. Lian, and C. Jin, Repstore: a self-managing and self-tuning storage backend with smart bricks, International Conference on Autonomic Computing, 2004. Proceedings., pp.122-129, 2004.
DOI : 10.1109/ICAC.2004.1301355

B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph et al., Tapestry: A Resilient Global-Scale Overlay for Service Deployment, IEEE Journal on Selected Areas in Communications, vol.22, issue.1, pp.41-53, 2004.
DOI : 10.1109/JSAC.2003.818784

Y. C. Zhang and Q. Lian, Xring: Achieving high-performance routing adaptively in structured p2p, 2004.

I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, Wireless sensor networks: a survey, Computer Networks, vol.38, issue.4, pp.393-422, 2002.
DOI : 10.1016/S1389-1286(01)00302-4

S. Bhadra and A. Ferreira, Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks, Proceedings of Adhoc-Now'03, pp.259-270
DOI : 10.1007/978-3-540-39611-6_23

A. Boukerche, Performance Evaluation of Routing Protocols for Ad Hoc Wireless Networks, Mobile Networks and Applications, vol.9, issue.4, pp.333-342, 2004.
DOI : 10.1023/B:MONE.0000031592.23792.1c

J. Broch, D. A. Maltz, D. B. Johnson, Y. Hu, and J. Jetcheva, A performance comparison of multi-hop wireless ad hoc network routing protocols, Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking , MobiCom '98, pp.85-97, 1998.
DOI : 10.1145/288235.288256

B. Bui-xuan, A. Ferreira, and A. Jarry, COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS, International Journal of Foundations of Computer Science, vol.14, issue.02, pp.267-285, 2002.
DOI : 10.1142/S0129054103001728
URL : https://hal.archives-ouvertes.fr/inria-00071996

C. Carter, S. Yi, and R. Kravets, ARP considered harmful: manycast transactions in ad hoc networks, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003., 2003.
DOI : 10.1109/WCNC.2003.1200660

C. Chen and E. Ekici, A Routing Protocol for Hierarchical LEO/MEO Satellite IP Networks, Wireless Networks, vol.19, issue.2, pp.507-521, 2005.
DOI : 10.1007/s11276-005-1772-1

T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, 1990.

S. Corson and J. Macker, Mobile ad hoc networking (MANET): Routing protocol performance issues and evaluation considerations, 1999.
DOI : 10.17487/rfc2501

A. Farago and V. R. Syrotiuk, Merit, Proceedings of the 7th annual international conference on Mobile computing and networking , MobiCom '01, pp.567-577, 2003.
DOI : 10.1145/381677.381683

A. Ferreira, Building a reference combinatorial model for MANETs, IEEE Network, vol.18, issue.5, pp.24-29, 2002.
DOI : 10.1109/MNET.2004.1337732

A. Ferreira, J. Galtier, and P. Penna, Topological design, routing and hand-over in satellite networks, Handbook of Wireless Networks and Mobile Computing, pp.473-493, 2002.

P. Jacquet, P. Muhlethaler, T. Clausen, A. Laouiti, A. Qayyum et al., Optimized link state routing protocol, Proceedings of 5th IEEE INMIC'01, pp.62-68, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00471712

S. Jain, K. Fall, and R. Patra, Routing in a delay tolerant network, SIGCOMM '04: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, pp.145-158, 2004.

D. B. Johnson and D. A. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks, Mobile Computing, pp.153-181, 1996.
DOI : 10.1007/978-0-585-29603-6_5

B. Krishnamachari, Networking Wireless Sensors, 2005.
DOI : 10.1017/CBO9780511541025

B. S. Manoj, K. J. Kumar, C. Frank, and C. S. Murthy, On the Use of Multiple Hops in Next Generation Wireless Systems, Wireless Networks, vol.19, issue.10, pp.199-221, 2006.
DOI : 10.1007/s11276-005-5267-x

S. Merugu, M. Ammar, and E. Zegura, Routing in space and time in networks with predictable mobility, 2004.

C. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distancevector routing (DSDV) for mobile computers, Conference on Communications Architectures, Protocols and Applications (ACM SIGCOMM'94), pp.234-244, 1994.

C. E. Perkins and E. M. Royer, Ad-hoc on-demand distance vector routing, Proceedings of 2nd IEEE Workshop on Mobile Computing Systems and Applications (WM- CSA'99), pp.90-100, 1999.

C. E. Perkins, E. M. Royer, S. R. Das, and M. K. Marina, Performance comparison of two on-demand routing protocols for ad hoc networks, IEEE Personal Communications, pp.16-28, 2001.
DOI : 10.1109/98.904895

F. J. Ros, UM-OLSR implementation (version 0.8.8) for NS2, 2007.

R. Sen, R. Handorean, G. Roman, and G. Hackmann, Knowledge-driven interactions with services across ad hoc networks, Proceedings of the 2nd international conference on Service oriented computing , ICSOC '04, pp.222-231, 2004.
DOI : 10.1145/1035167.1035199

G. Sharma, R. R. Mazumdar, and N. B. Shroff, On the complexity of scheduling in wireless networks, Proceedings of the 12th annual international conference on Mobile computing and networking , MobiCom '06, pp.227-238, 2006.
DOI : 10.1145/1161089.1161116

I. G. Siqueira, L. B. Ruiz, A. A. Loureiro, M. Jose, and . Nogueira, Coverage area management for wireless sensor networks, International Journal of Network Management, vol.47, issue.1, pp.17-31, 2007.
DOI : 10.1002/nem.604

T. Spyropoulos, K. Psounis, and C. Raghavendra, Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case, IEEE/ACM Transactions on Networking, vol.16, issue.1, 2007.
DOI : 10.1109/TNET.2007.897962

I. Stojmenovic, A. Nayak, and J. Kuruvila, Design guidelines for routing protocols in ad hoc and sensor networks with a realistic physical layer, IEEE Communications Magazine (Ad Hoc and Sensor Networks Series), pp.101-106, 2005.
DOI : 10.1109/MCOM.2005.1404603

J. Wu, Handbook On Theoretical And Algorithmic Aspects Of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks, 2005.
DOI : 10.1201/9780203323687

J. Yoon, M. Liu, and B. Noble, Random waypoint considered harmful, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), pp.1312-1321, 2003.
DOI : 10.1109/INFCOM.2003.1208967
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.1241