P2P Storage and P2P Simulation Bibliography

Compiled by Julian Monteiro
PhD Student at MASCOTTE team - INRIA, I3S (CNRS, Univ. Nice-Sophia) - France
Last update: 13/10/2009.

QuickSearch:   Number of matching entries: 0.

Search Settings

    AuthorTitleYearJournal/ProceedingsReftypeDOI/URL
    Alouf, S., Dandoush, A. & Nain, P. Performance Analysis of Peer-to-Peer Storage Systems 2007 Internation Teletraffic Congress (ITC), LNCS 4516
    Vol. 4516, pp. 642-653 
    article  
    BibTeX:
    @article{ADN07,
      author = {Sara Alouf and Abdulhalim Dandoush and Philippe Nain},
      title = {Performance Analysis of Peer-to-Peer Storage Systems},
      journal = {Internation Teletraffic Congress (ITC), LNCS 4516},
      publisher = {Springer},
      year = {2007},
      volume = {4516},
      pages = {642--653}
    }
    
    Alqaralleh, B., Wang, C., Zhou, B. & Zomaya, A. Effects of Replica Placement Algorithms on Performance of structured Overlay Networks 2007 IEEE Parallel and Distributed Processing Symposium (IPDPS 2007), pp. 1-8  inproceedings DOI  
    BibTeX:
    @inproceedings{Alqaralleh2007placement,
      author = {Alqaralleh, B.A. and Wang, C. and Zhou, B.B. and Zomaya, A.Y.},
      title = {Effects of Replica Placement Algorithms on Performance of structured Overlay Networks},
      booktitle = {IEEE Parallel and Distributed Processing Symposium (IPDPS 2007)},
      year = {2007},
      pages = {1-8},
      doi = {http://dx.doi.org/10.1109/IPDPS.2007.370650}
    }
    
    Amann, B., Elser, B., Houri, Y. & Fuhrmann, T. IgorFs: A Distributed P2P File System 2008
    Vol. 0IEEE International Conference on Peer-to-Peer Computing, pp. 77-78 
    inproceedings DOI  
    BibTeX:
    @inproceedings{igorfs08Amann,
      author = {Bernhard Amann and Benedikt Elser and Yaser Houri and Thomas Fuhrmann},
      title = {IgorFs: A Distributed P2P File System},
      booktitle = {IEEE International Conference on Peer-to-Peer Computing},
      year = {2008},
      volume = {0},
      pages = {77-78},
      doi = {http://doi.ieeecomputersociety.org/10.1109/P2P.2008.19}
    }
    
    Andel, T.R. & Yasinac, A. On the Credibility of Manet Simulations 2006 IEEE Computer
    Vol. 39(7), pp. 48-54 
    article URL 
    Abstract: Simulation is useful for evaluating protocol performance and operation. However, the lack of rigor with which it’s applied threatens the credibility of the published research within the manet research community.
    BibTeX:
    @article{Andel2006credibility,
      author = {Todd R. Andel and Alec Yasinac},
      title = {On the Credibility of Manet Simulations},
      journal = {IEEE Computer},
      publisher = {IEEE Computer Society Press},
      year = {2006},
      volume = {39},
      number = {7},
      pages = {48--54},
      url = {http://dx.doi.org/10.1109/MC.2006.242}
    }
    
    Anderson, D.P. BOINC: a system for public-resource computing and storage 2004 Proceedings of 5th IEEE/ACM International Workshop on Grid Computing, 2004, pp. 4-10  inproceedings DOI URL 
    Abstract: BOINC (Berkeley Open Infrastructure for Network Computing) is a software system that makes it easy for scientists to create and operate public-resource computing projects. It supports diverse applications, including those with large storage or communication requirements. PC owners can participate in multiple BOINC projects, and can specify how their resources are allocated among these projects. We describe the goals of BOINC, the design issues that we confronted, and our solutions to these problems.
    BibTeX:
    @inproceedings{boinc2004Anderson,
      author = {Anderson, D. P.},
      title = {BOINC: a system for public-resource computing and storage},
      booktitle = {Proceedings of 5th IEEE/ACM International Workshop on Grid Computing, 2004},
      year = {2004},
      pages = {4--10},
      url = {http://dx.doi.org/10.1109/GRID.2004.14},
      doi = {http://dx.doi.org/10.1109/GRID.2004.14}
    }
    
    Anderson, R.J. The Eternity service 1996 Proceedings of Pragocrypt, pp. 242-252  inproceedings  
    BibTeX:
    @inproceedings{Anderson1996eternity,
      author = {Ross J. Anderson},
      title = {The Eternity service},
      booktitle = {Proceedings of Pragocrypt},
      year = {1996},
      pages = {242--252}
    }
    
    Anick, D., Mitra, D. & Sondhi, M. Stochastic theory of a data handling system with multiple sources 1980
    Vol. 1ICC'80; International Conference on Communications, Seattle 
    conference  
    BibTeX:
    @conference{AMS80,
      author = {Anick, D. and Mitra, D. and Sondhi, MM},
      title = {Stochastic theory of a data handling system with multiple sources},
      booktitle = {ICC'80; International Conference on Communications, Seattle},
      year = {1980},
      volume = {1}
    }
    
    Annexstein, F.S., Berman, K.A. & Jovanovic, M.A. Broadcasting in unstructured peer-to-peer overlay networks 2006 Theoretical Computer Science
    Vol. 355, pp. 25-36 
    article  
    BibTeX:
    @article{Annexstein06broadcast,
      author = {Annexstein, Fred S. and Berman, Kenneth A. and Jovanovic, Mijhalo A},
      title = {Broadcasting in unstructured peer-to-peer overlay networks},
      journal = {Theoretical Computer Science},
      year = {2006},
      volume = {355},
      pages = {25--36}
    }
    
    Barton, R.R. Designing simulation experiments 2004 Proceedings of the 36th conference on Winter simulation WSC'04, pp. 73-79  inproceedings  
    BibTeX:
    @inproceedings{Barton2004design,
      author = {Russell R. Barton},
      title = {Designing simulation experiments},
      booktitle = {Proceedings of the 36th conference on Winter simulation WSC'04},
      publisher = {Winter Simulation Conference},
      year = {2004},
      pages = {73--79}
    }
    
    Barton, R.R. Design of experiments: designing simulation experiments 2001 Proceedings of the 33nd conference on Winter simulation (WSC'01), pp. 47-52  inproceedings URL 
    Abstract: Simulation models are useful for examining the performance of alternative system configurations and/or alternative operating procedures for a system. This tutorial provides some techniques for planning a set of simulation model runs, in order to gain insight on system behavior. There is an emphasis on graphical methods.
    BibTeX:
    @inproceedings{Barton2001design,
      author = {Russell R. Barton},
      title = {Design of experiments: designing simulation experiments},
      booktitle = {Proceedings of the 33nd conference on Winter simulation (WSC'01)},
      publisher = {IEEE Computer Society},
      year = {2001},
      pages = {47--52},
      url = {http://portal.acm.org/citation.cfm?id=564133}
    }
    
    Batten, C., Barr, K., Saraf, A. & Trepetin, S. pStore: A Secure Peer-to-Peer Backup System 2002 (MIT-LCS-TM-632)  techreport  
    BibTeX:
    @techreport{pstore2002Batten,
      author = {Christopher Batten and Kenneth Barr and Arvind Saraf and Stanley Trepetin},
      title = {pStore: A Secure Peer-to-Peer Backup System},
      year = {2002},
      number = {MIT-LCS-TM-632}
    }
    
    Baumgart, I., Heep, B. & Krause, S. OverSim: A Flexible Overlay Network Simulation Framework 2007 Proceedings of 10th IEEE Global Internet Symposium (GI '07) in conjunction with IEEE INFOCOM 2007, Anchorage, AK, USA, pp. 79-84  inproceedings DOI URL 
    Abstract: A fundamental problem in studying peer-to-peer networks is the evaluation of new protocols. This paper presents OverSim, a flexible overlay network simulation framework based on OMNeT++. It was designed to fulfill a number of requirements that have been partially neglected by existing simulation frameworks. OverSim includes several structured and unstructured peer-to-peer protocols like Chord, Kademlia and Gia. These protocol implementations can be used for both simulation as well as real world networks. To facilitate the implementation of additional protocols and to make them more comparable OverSim provides several common functions like a generic lookup mechanism for structured peer-to-peer networks and an RPC interface. Several exchangeable underlay network models allow to simulate complex heterogeneous underlay networks as well as simplified networks for large-scale simulations. We show that with OverSim simulations of overlay networks with up to 100,000 nodes are feasible.
    BibTeX:
    @inproceedings{oversim2007,
      author = {Ingmar Baumgart and Bernhard Heep and Stephan Krause},
      title = {OverSim: A Flexible Overlay Network Simulation Framework},
      booktitle = {Proceedings of 10th IEEE Global Internet Symposium (GI '07) in conjunction with IEEE INFOCOM 2007, Anchorage, AK, USA},
      year = {2007},
      pages = {79-84},
      url = {http://doc.tm.uka.de/2007/OverSim_2007.pdf},
      doi = {http://dx.doi.org/10.1109/GI.2007.4301435}
    }
    
    Bhagwan, R., Savage, S. & Voelker, G.M. Replication strategies for highly available peer-to-peer storage systems 2002   techreport  
    BibTeX:
    @techreport{BhSaVo02,
      author = {Ranjita Bhagwan and Stefan Savage and Geoffrey M. Voelker},
      title = {Replication strategies for highly available peer-to-peer storage systems},
      year = {2002}
    }
    
    Bhagwan, R., Tati, K., chung Cheng, Y., Savage, S. & Voelker, G.M. Total recall: System support for automated availability management 2004 Proc. of NSDI, pp. 337-350  inproceedings  
    BibTeX:
    @inproceedings{totalrecall04bhagwan,
      author = {Ranjita Bhagwan and Kiran Tati and Yu-chung Cheng and Stefan Savage and Geoffrey M. Voelker},
      title = {Total recall: System support for automated availability management},
      booktitle = {Proc. of NSDI},
      year = {2004},
      pages = {337--350}
    }
    
    Binzenhöfer, A., Hoßfeld, T., Kunzmann, G. & Eger, K. Efficient Simulation of Large-Scale P2P Networks: Compact Data Structures 2007 Proceedings of 15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing, pp. 467-474  inproceedings DOI URL 
    Abstract: One of the most important design goals of current peer-to-peer (P2P) technology is to be able to offer its service to an arbitrary large number of users. Discrete event simulation is often applied to quantitatively and qualitatively evaluate the performance and scalability of such systems before they are deployed. However, the number of users, processes and events which can be simulated is limited by both the central memory and the time available. In this paper we present compact data structures and event design algorithms, which are intended to be a further step towards efficient simulation of large scale P2P systems. In particular, we give guidelines on how to increase the number of peers which can be simulated and show how to find a good tradeoff between computational time and memory consumption in large scale P2P simulation
    BibTeX:
    @inproceedings{Binzenhofer2007p2pdata,
      author = {Andreas Binzenhöfer and Tobias Hoßfeld and Gerald Kunzmann and Kolja Eger},
      title = {Efficient Simulation of Large-Scale P2P Networks: Compact Data Structures},
      booktitle = {Proceedings of 15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing},
      year = {2007},
      pages = {467-474},
      url = {http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=4135312},
      doi = {http://doi.ieeecomputersociety.org/10.1109/PDP.2007.41}
    }
    
    Blake, C. & Rodrigues, R. High availability, scalable storage, dynamic peer networks: pick two 2003 Proceedings of the 9th conference on Hot Topics in Operating Systems (HOTOS'03)  inproceedings  
    BibTeX:
    @inproceedings{BlRo03,
      author = {Charles Blake and Rodrigo Rodrigues},
      title = {High availability, scalable storage, dynamic peer networks: pick two},
      booktitle = {Proceedings of the 9th conference on Hot Topics in Operating Systems (HOTOS'03)},
      year = {2003}
    }
    
    Bolosky, W.J., Douceur, J.R., Ely, D. & Theimer, M. Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs 2000 SIGMETRICS Perform. Eval. Rev.
    Vol. 28(1), pp. 34-43 
    article DOI  
    BibTeX:
    @article{farsite2000Bolosky,
      author = {William J. Bolosky and John R. Douceur and David Ely and Marvin Theimer},
      title = {Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs},
      journal = {SIGMETRICS Perform. Eval. Rev.},
      publisher = {ACM},
      year = {2000},
      volume = {28},
      number = {1},
      pages = {34--43},
      doi = {http://doi.acm.org/10.1145/345063.339345}
    }
    
    Bracciale, L., Piccolo, F.L., Luzzi, D. & Salsano, S. OPSS: an overlay peer-to-peer streaming simulator for large-scale networks 2007 SIGMETRICS Performance Evaluation Review. Poster session
    Vol. 35(3), pp. 25-27 
    article DOI  
    BibTeX:
    @article{opss2007Bracc,
      author = {Lorenzo Bracciale and Francesca Lo Piccolo and Dario Luzzi and Stefano Salsano},
      title = {OPSS: an overlay peer-to-peer streaming simulator for large-scale networks},
      journal = {SIGMETRICS Performance Evaluation Review. Poster session},
      publisher = {ACM},
      year = {2007},
      volume = {35},
      number = {3},
      pages = {25--27},
      doi = {http://doi.acm.org/10.1145/1328690.1328700}
    }
    
    Bracciale, L., Piccolo, F.L., Salsano, S. & Luzzi, D. Simulation of peer-to-peer streaming over large-scale networks using OPSS 2007 ValueTools '07: Proceedings of the 2nd international conference on Performance evaluation methodologies and tools, pp. 1-10  inproceedings URL 
    BibTeX:
    @inproceedings{Bracciale2007,
      author = {Lorenzo Bracciale and Francesca Lo Piccolo and Stefano Salsano and Dario Luzzi},
      title = {Simulation of peer-to-peer streaming over large-scale networks using OPSS},
      booktitle = {ValueTools '07: Proceedings of the 2nd international conference on Performance evaluation methodologies and tools},
      publisher = {ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)},
      year = {2007},
      pages = {1--10},
      url = {http://portal.acm.org/citation.cfm?id=1345285}
    }
    
    Brinkmann, A., Effert, S., auf der Heide, F. & Scheideler, C. Dynamic and Redundant Data Placement 2007 27th International Conference on Distributed Computing Systems (ICDCS'07) , pp. 29-29  inproceedings DOI  
    BibTeX:
    @inproceedings{Brinkmann2007placement,
      author = {Brinkmann, A. and Effert, S. and auf der Heide, F.M. and Scheideler, C.},
      title = {Dynamic and Redundant Data Placement},
      booktitle = {27th International Conference on Distributed Computing Systems (ICDCS'07) },
      year = {2007},
      pages = {29-29},
      doi = {http://dx.doi.org/10.1109/ICDCS.2007.103}
    }
    
    Busca, J.-M., Picconi, F. & Sens, P. Pastis: A Highly-Scalable Multi-user Peer-to-Peer File System 2005
    Vol. 3648Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30 - September 2, 2005, Proceedings, pp. 1173-1182 
    inproceedings  
    BibTeX:
    @inproceedings{pastis05sens,
      author = {Jean-Michel Busca and Fabio Picconi and Pierre Sens},
      title = {Pastis: A Highly-Scalable Multi-user Peer-to-Peer File System},
      booktitle = {Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30 - September 2, 2005, Proceedings},
      publisher = {Springer},
      year = {2005},
      volume = {3648},
      pages = {1173-1182}
    }
    
    Byers, J.W., Luby, M., Mitzenmacher, M. & Rege, A. A digital fountain approach to reliable distribution of bulk data 1998 Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM'98), pp. 56-67  inproceedings DOI  
    BibTeX:
    @inproceedings{Byers1998fountain,
      author = {Byers,, John W. and Luby,, Michael and Mitzenmacher,, Michael and Rege,, Ashutosh},
      title = {A digital fountain approach to reliable distribution of bulk data},
      booktitle = {Proceedings of the ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM'98)},
      publisher = {ACM},
      year = {1998},
      pages = {56--67},
      doi = {http://doi.acm.org/10.1145/285237.285258}
    }
    
    Cavin, D., Sasson, Y. & Schiper, A. On the accuracy of MANET simulators 2002 POMC '02: Proceedings of the second ACM international workshop on Principles of mobile computing, pp. 38-43  inproceedings  
    BibTeX:
    @inproceedings{accuracy,
      author = {David Cavin and Yoav Sasson and Andr&233; Schiper},
      title = {On the accuracy of MANET simulators},
      booktitle = {POMC '02: Proceedings of the second ACM international workshop on Principles of mobile computing},
      publisher = {ACM Press},
      year = {2002},
      pages = {38--43}
    }
    
    Cecin, F.R., Geyer, C.F.R., Rabello, S. & Barbosa, J.L.V. A peer-to-peer simulation technique for instanced massively multiplayer games 2006 Proceedings of the 10th IEEE international symposium on Distributed Simulation and Real-Time Applications (DS-RT'06), pp. 43-50  inproceedings URL 
    Abstract: We propose a peer-to-peer event ordering and simulation technique aimed at networked real-time action games. Partially based on replicated simulators, its goal is to support decentralized playout in small-scale game sessions on instanced action spaces while being resistant to collusion cheating. The action spaces are linked to persistent-state social spaces of larger scale which are supported by centralized simulation. Together, these two kinds of spaces offer support for massively multiplayer on-line games (MMOGs) that offer a mix of socialization on large-scale persistent environments and fast interaction on small-scale temporary ones. Although player nodes on action spaces are required to run a conservative and an optimistic simulator simultaneously, we show that 2.2 simultaneous simulation steps are executed on average and that 11.95 simultaneous steps occur as the average peak situation for 20-player sessions with 150ms to 300ms network delays between nodes, 5% probability of any late events introducing errors, and rollback and re-execution operations having their execution spreaded through 100ms of real time or longer.
    BibTeX:
    @inproceedings{Cecin2006p2psimtechnique,
      author = {Fabio Reis Cecin and Claudio Fernando Resin Geyer and Solon Rabello and Jorge Luis Victoria Barbosa},
      title = {A peer-to-peer simulation technique for instanced massively multiplayer games},
      booktitle = {Proceedings of the 10th IEEE international symposium on Distributed Simulation and Real-Time Applications (DS-RT'06)},
      publisher = {IEEE Computer Society},
      year = {2006},
      pages = {43--50},
      url = {http://dx.doi.org/10.1109/DS-RT.2006.4}
    }
    
    Chen, P.M., Lee, E.K., Gibson, G.A., Katz, R.H. & Patterson, D.A. RAID: high-performance, reliable secondary storage 1994 ACM Computing Surveys
    Vol. 26(2), pp. 145-185 
    article DOI  
    BibTeX:
    @article{Chen1994raid,
      author = {Peter M. Chen and Edward K. Lee and Garth A. Gibson and Randy H. Katz and David A. Patterson},
      title = {RAID: high-performance, reliable secondary storage},
      journal = {ACM Computing Surveys},
      publisher = {ACM},
      year = {1994},
      volume = {26},
      number = {2},
      pages = {145--185},
      doi = {http://doi.acm.org/10.1145/176979.176981}
    }
    
    Chen, Y., Edler, J., Goldberg, A., Gottlieb, A., Sobti, S. & Yianilos, P. A Prototype Implementation of Archival Intermemory 1999 Proceedings of the Fourth ACM International Conference on Digital Libraries  inproceedings  
    BibTeX:
    @inproceedings{intermemory99chen,
      author = {Yuan Chen and Jan Edler and Andrew Goldberg and Allan Gottlieb and Sumeet Sobti and Peter Yianilos},
      title = {A Prototype Implementation of Archival Intermemory},
      booktitle = {Proceedings of the Fourth ACM International Conference on Digital Libraries},
      year = {1999}
    }
    
    Chun, B.-G., Dabek, F., Haeberlen, A., Sit, E., Weatherspoon, H., Kaashoek, M.F., Kubiatowicz, J. & Morris, R. Efficient replica maintenance for distributed storage systems 2006 NSDI'06: Proceedings of the 3rd conference on Networked Systems Design & Implementation, pp. 4-4  inproceedings  
    BibTeX:
    @inproceedings{carbonite06chun,
      author = {Byung-Gon Chun and Frank Dabek and Andreas Haeberlen and Emil Sit and Hakim Weatherspoon and M. Frans Kaashoek and John Kubiatowicz and Robert Morris},
      title = {Efficient replica maintenance for distributed storage systems},
      booktitle = {NSDI'06: Proceedings of the 3rd conference on Networked Systems Design & Implementation},
      year = {2006},
      pages = {4--4}
    }
    
    Chun, B.-G., Dabek, F., Haeberlen, A., Sit, E., Weatherspoon, H., Kaashoek, M.F., Kubiatowicz, J. & Morris, R. Efficient replica maintenance for distributed storage systems 2006 Proceedings of the 3rd Conference on Networked Systems Design & Implementation (NSDI'06), pp. 45-58  inproceedings  
    BibTeX:
    @inproceedings{Chun2006carbonite,
      author = {Byung-Gon Chun and Frank Dabek and Andreas Haeberlen and Emil Sit and Hakim Weatherspoon and M. Frans Kaashoek and John Kubiatowicz and Robert Morris},
      title = {Efficient replica maintenance for distributed storage systems},
      booktitle = {Proceedings of the 3rd Conference on Networked Systems Design & Implementation (NSDI'06)},
      publisher = {USENIX Association},
      year = {2006},
      pages = {45--58}
    }
    
    Clarke, I., Sandberg, O., Wiley, B. & Hong, T.W. Freenet: A Distributed Anonymous Information Storage and Retrieval System 2001 Lecture Notes in Computer Science
    Vol. 2009, pp. 46-66 
    article URL 
    BibTeX:
    @article{freenet01clarke,
      author = {Ian Clarke and Oskar Sandberg and Brandon Wiley and Theodore W. Hong},
      title = {Freenet: A Distributed Anonymous Information Storage and Retrieval System},
      journal = {Lecture Notes in Computer Science},
      publisher = {Springer},
      year = {2001},
      volume = {2009},
      pages = {46--66},
      url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.4919}
    }
    
    Cohen, B. Incentives Build Robustness in BitTorrent 2003 Workshop on Economics of Peer-to-Peer Systems  misc URL 
    Abstract: The BitTorrent file distribution system uses tit-for-tat as a method of seeking pareto efficiency. It achieves a higher level of robustness and resource utilization than any currently known cooperative technique. We explain what BitTorrent does, and how economic methods are used to achieve that goal.
    BibTeX:
    @misc{bittorrent2003Cohen,
      author = {Cohen, Bram},
      title = {Incentives Build Robustness in BitTorrent},
      year = {2003},
      url = {http://citeseer.ist.psu.edu/cohen03incentives.html}
    }
    
    Cooley, J.A., Mineweaser, J.L., Servi, L.D. & Tsung, E.T. Software-Based Erasure Codes for Scalable Distributed Storage 2003 Proceedings of the 20th IEEE Mass Storage Systems and Technologies (MSS'03), pp. 157  inproceedings  
    BibTeX:
    @inproceedings{Cooley2003softeec,
      author = {Joseph A. Cooley and Jeremy L. Mineweaser and Leslie D. Servi and Eushiuan T. Tsung},
      title = {Software-Based Erasure Codes for Scalable Distributed Storage},
      booktitle = {Proceedings of the 20th IEEE Mass Storage Systems and Technologies (MSS'03)},
      publisher = {IEEE Computer Society},
      year = {2003},
      pages = {157}
    }
    
    Dabek, F., Kaashoek, M.F., Karger, D., Morris, R. & Stoica, I. Wide-area cooperative storage with CFS 2001 Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP), pp. 202-215   inproceedings  
    BibTeX:
    @inproceedings{cfs01dabek,
      author = {Frank Dabek and M. Frans Kaashoek and David Karger and Robert Morris and Ion Stoica},
      title = {Wide-area cooperative storage with CFS},
      booktitle = {Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP)},
      year = {2001},
      pages = {202--215 }
    }
    
    Dabek, F., Li, J., Sit, E., Robertson, J., Kaashoek, M.F. & Morris, R. Designing a DHT for low latency and high throughput 2004 Proceedings of the 1st USENIX Symposium on Networked Systems Design and Implementation (NSDI '04)  inproceedings URL 
    BibTeX:
    @inproceedings{Dabek2004dht,
      author = {Frank Dabek and Jinyang Li and Emil Sit and James Robertson and M. Frans Kaashoek and Robert Morris},
      title = {Designing a DHT for low latency and high throughput},
      booktitle = {Proceedings of the 1st USENIX Symposium on Networked Systems Design and Implementation (NSDI '04)},
      year = {2004},
      url = {http://citeseer.ist.psu.edu/dabek04designing.html}
    }
    
    Dabek, F., Zhao, B.Y., Druschel, P., Kubiatowicz, J. & Stoica, I. Towards a Common API for Structured Peer-to-Peer Overlays 2003 Second International Workshop, IPTPS 2003,, pp. 33-44  inproceedings URL 
    Abstract: In this paper, we describe an ongoing effort to define common APIs for structured peer-to-peer overlays and the key abstractions that can be built on them. In doing so, we hope to facilitate independent innovation in overlay protocols, services, and applications, to allow direct experimental comparisons, and to encourage application development by third parties. We provide a snapshot of our efforts and discuss open problems in an effort to solicit feedback from the research community.
    BibTeX:
    @inproceedings{Dabek2003Towards,
      author = {Frank Dabek and Ben Y. Zhao and Peter Druschel and John Kubiatowicz and Ion Stoica},
      title = {Towards a Common API for Structured Peer-to-Peer Overlays},
      booktitle = {Second International Workshop, IPTPS 2003,},
      year = {2003},
      pages = {33-44},
      url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2735&spage=33}
    }
    
    Dalle, O. Component-based Discrete Event Simulation Using the Fractal Component Model 2007 AI, Simulation and Planning in High Autonomy Systems (AIS) - Conceptual Modeling and Simulation (CMS) Joint Conference , pp. 213-218  inproceedings  
    BibTeX:
    @inproceedings{Dalle07osa,
      author = {Dalle, Olivier},
      title = {Component-based Discrete Event Simulation Using the Fractal Component Model},
      booktitle = {AI, Simulation and Planning in High Autonomy Systems (AIS) - Conceptual Modeling and Simulation (CMS) Joint Conference },
      year = {2007},
      pages = {213--218}
    }
    
    Dalle, O. OSA: an Open Component-based Architecture for Discrete-event Simulations 2006 (RR-5762)  techreport URL 
    BibTeX:
    @techreport{Dalle06osa,
      author = {Olivier Dalle},
      title = {OSA: an Open Component-based Architecture for Discrete-event Simulations},
      year = {2006},
      number = {RR-5762},
      note = {Available from http://www.inria.fr/rrrt/rr-5762.html},
      url = {http://osa.inria.fr/wiki/uploads/OsaPub/RR-OSA.pdf}
    }
    
    Dalle, O., Giroire, F., Monteiro, J. & Pérennes, S. Analysis of Failure Correlation in Peer-to-Peer Storage Systems 2008 (RR-6771)  techreport URL 
    Abstract: In this paper, we propose and study analytical models of self-repairing peer-to-peer storage systems subject to failures. The failures correspond to the simultaneous loss of multiple data blocks due to the definitive loss of a peer (or following a disk crash). In the system we consider that such failures happen continuously, hence the necessity of a self-repairing mechanism (data are written once for ever). We show that, whereas stochastic models of independent failures similar to those found in the literature give a correct approximation of the average behavior of real systems, they fail to capture their variations (e.g. in bandwidth needs). We propose to solve this problem using a new stochastic model based on a fluid approximation and we give a characterization of the behavior of the system according to this model (expectation and standard deviation). This new model is validated using comparisons between its theoretical behavior and computer simulations.
    BibTeX:
    @techreport{DGMP08,
      author = {Olivier Dalle and Frédéric Giroire and Julian Monteiro and Stéphane Pérennes},
      title = {Analysis of Failure Correlation in Peer-to-Peer Storage Systems},
      year = {2008},
      number = {RR-6771},
      url = {http://hal.inria.fr/inria-00346857/}
    }
    
    Dalle, O., Giroire, F., Monteiro, J. & Pérennes, S. Analyse des Corrélations entre Pannes dans les Systèmes de Stockage Pair-à-Pair 2009 11eme rencontres francophones sur les Aspects Algorithmiques des Telecommunications (Algotel'2009)  conference URL 
    Abstract: Dans cet article, nous présentons et étudions des modèles analytiques de systèmes de stockage pair-à-pair fiables à long terme. Les pairs sont sujets à des pannes définitives (défaillance du disque, départ du pair) induisant la perte de toutes les données stockées par le pair. Ces pannes ont lieu en continu. Afin de pérenniser les données il est indispensable d'user de redondance et de maintenir celle-ci au moyen d'un processus permanent de reconstruction. Dans un premier temps nous considérons une approche classiquement utilisée dans la littérature, consistant à modéliser chaque bloc par une chaîne de Markov et à négliger les interdépendances entre blocs. Si celle-ci permet le calcul du comportement moyen du système (par exemple la demande moyenne en bande passante), elle est insuffisante pour en évaluer les fluctuations. Nos simulations démontrent que ces fluctuations sont très importantes même pour des grands systèmes comportant des milliers de pairs. Nous proposons alors un nouveau modèle stochastique prenant en compte l'interdépendance des pannes de blocs, et nous en donnons une approximation fluide. Ceci nous permet de caractériser le comportement du système (calcul de tous les moments) mais aussi de le simuler efficacement, car il est indépendant de la taille du système. La pertinence de notre modèle est validée en comparant les résultats obtenus par des simulations utilisant d'un côté notre modèle fluide et de l'autre un modèle à événements discrets reproduisant fidèlement le comportement du système.
    BibTeX:
    @conference{dgmp09algotel,
      author = {Olivier Dalle and Frédéric Giroire and Julian Monteiro and Stéphane Pérennes},
      title = {Analyse des Corrélations entre Pannes dans les Systèmes de Stockage Pair-à-Pair},
      booktitle = {11eme rencontres francophones sur les Aspects Algorithmiques des Telecommunications (Algotel'2009)},
      year = {2009},
      note = {Best Student Paper Award},
      url = {http://hal.inria.fr/inria-00384822/en/}
    }
    
    Dalle, O., Giroire, F., Monteiro, J. & Pérennes, S. Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems 2009 Proceedings of the 9th International Conference on Peer-to-Peer Computing (P2P'09)  inproceedings  
    Abstract: Peer-to-peer storage systems aim to provide a reliable long-term storage at low

    cost. In such systems, peers fail continuously, hence, the necessity of

    self-repairing mechanisms to achieve high durability. In this paper, we propose

    and study analytical models that assess the bandwidth consumption

    and the probability to lose data of storage systems that use erasure

    coded redundancy. We show by simulations that the classical stochastic approach

    found in the literature, that models each block independently, gives a correct

    approximation of the system average behavior, but fails to capture its

    variations over time. These variations are caused by the simultaneous loss of

    multiple data blocks that results from a peer failing (or leaving the system).

    We then propose a new stochastic model based on a fluid approximation that

    better captures the system behavior. In addition to its expectation, it gives a

    correct estimation of its standard deviation. This new model is validated by simulations.

    BibTeX:
    @inproceedings{dgmp09correlationp2p,
      author = {Olivier Dalle and Frédéric Giroire and Julian Monteiro and Stéphane Pérennes},
      title = {Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems},
      booktitle = {Proceedings of the 9th International Conference on Peer-to-Peer Computing (P2P'09)},
      year = {2009},
      note = {To Appear}
    }
    
    Damola, A., Souza, V., Karlsson, P. & Green, H. Peer-to-Peer Traffic in Operator Networks 2008
    Vol. 0IEEE International Conference on Peer-to-Peer Computing, pp. 177-179 
    inproceedings DOI  
    BibTeX:
    @inproceedings{10.1109/P2P.2008.51,
      author = {Ayodele Damola and Victor Souza and Per Karlsson and Howard Green},
      title = {Peer-to-Peer Traffic in Operator Networks},
      booktitle = {IEEE International Conference on Peer-to-Peer Computing},
      year = {2008},
      volume = {0},
      pages = {177-179},
      doi = {http://doi.ieeecomputersociety.org/10.1109/P2P.2008.51}
    }
    
    Datta, A. & Aberer, K. Internet-Scale Storage Systems under Churn -- A Study of the Steady-State using Markov Models 2006
    Vol. 0IEEE International Conference on Peer-to-Peer Computing (P2P), pp. 133-144 
    inproceedings DOI  
    BibTeX:
    @inproceedings{datta06storagechurn,
      author = {Anwitaman Datta and Karl Aberer},
      title = {Internet-Scale Storage Systems under Churn -- A Study of the Steady-State using Markov Models},
      booktitle = {IEEE International Conference on Peer-to-Peer Computing (P2P)},
      publisher = {IEEE Computer Society},
      year = {2006},
      volume = {0},
      pages = {133-144},
      doi = {http://doi.ieeecomputersociety.org/10.1109/P2P.2006.22}
    }
    
    Dimakis, A., Godfrey, P., Wainwright, M. & Ramchandran, K. Network Coding for Distributed Storage Systems 2007 Proceedings of IEEE International Conference on Computer Communications (Infocom'07), pp. 2000-2008  inproceedings DOI  
    BibTeX:
    @inproceedings{Dimakis2007netcoding,
      author = {Dimakis, A.G. and Godfrey, P.B. and Wainwright, M.J. and Ramchandran, K.},
      title = {Network Coding for Distributed Storage Systems},
      booktitle = {Proceedings of IEEE International Conference on Computer Communications (Infocom'07)},
      year = {2007},
      pages = {2000-2008},
      doi = {http://dx.doi.org/10.1109/INFCOM.2007.232}
    }
    
    Dinh, T.T.A., Lees, M., Theodoropoulos, G. & Minson, R. Large Scale Distributed Simulation of p2p Networks 2008 Proc. 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing PDP 2008, pp. 499-507  inproceedings DOI  
    BibTeX:
    @inproceedings{dpeersim2008Dinh,
      author = {Tien Tuan Anh Dinh and Lees, M. and Theodoropoulos, G. and Minson, R. },
      title = {Large Scale Distributed Simulation of p2p Networks},
      booktitle = {Proc. 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing PDP 2008},
      year = {2008},
      pages = {499--507},
      doi = {http://dx.doi.org/10.1109/PDP.2008.67}
    }
    
    Douceur, J.R. & Wattenhofer, R. Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System 2001 DISC '01: Proceedings of the 15th International Conference on Distributed Computing, pp. 48-62  inproceedings  
    BibTeX:
    @inproceedings{Douceur2001climbing,
      author = {Douceur,, John R. and Wattenhofer,, Roger},
      title = {Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System},
      booktitle = {DISC '01: Proceedings of the 15th International Conference on Distributed Computing},
      publisher = {Springer-Verlag},
      year = {2001},
      pages = {48--62}
    }
    
    Douceur, J.R. & Wattenhofer, R.P. Large-Scale Simulation of Replica Placement Algorithms for a Serverless Distributed File System 2001
    Vol. 0International Symposium on Modeling, Analysis, and Simulation of Computer Systems, pp. 0311 
    inproceedings DOI  
    BibTeX:
    @inproceedings{Douceur2001placement,
      author = {John R. Douceur and Roger P. Wattenhofer},
      title = {Large-Scale Simulation of Replica Placement Algorithms for a Serverless Distributed File System},
      booktitle = {International Symposium on Modeling, Analysis, and Simulation of Computer Systems},
      publisher = {IEEE Computer Society},
      year = {2001},
      volume = {0},
      pages = {0311},
      doi = {http://doi.ieeecomputersociety.org/10.1109/MASCOT.2001.948882}
    }
    
    Druschel, P. & Rowstron, A. PAST: a large-scale, persistent peer-to-peer storage utility 2001 Proceedings of 8th Workshop on Hot Topics in Operating Systems, pp. 75-80  inproceedings  
    BibTeX:
    @inproceedings{past01druschel,
      author = {Druschel, P. and Rowstron, A.},
      title = {PAST: a large-scale, persistent peer-to-peer storage utility},
      booktitle = {Proceedings of 8th Workshop on Hot Topics in Operating Systems},
      year = {2001},
      pages = {75--80}
    }
    
    Duminuco, A. & Biersack, E. Hierarchical Codes: How to Make Erasure Codes Attractive for Peer-to-Peer Storage Systems 2008 Proc. Eighth International Conference on Peer-to-Peer Computing P2P '08, pp. 89-98  inproceedings DOI  
    BibTeX:
    @inproceedings{Duminuco2008hierarchical,
      author = {Duminuco, A. and Biersack, E.},
      title = {Hierarchical Codes: How to Make Erasure Codes Attractive for Peer-to-Peer Storage Systems},
      booktitle = {Proc. Eighth International Conference on Peer-to-Peer Computing P2P '08},
      year = {2008},
      pages = {89--98},
      doi = {http://dx.doi.org/10.1109/P2P.2008.9}
    }
    
    Duminuco, A., Biersack, E. & En-Najjary, T. Proactive replication in distributed storage systems using machine availability estimation 2007 Proceedings of the 2007 ACM CoNEXT conference  conference  
    BibTeX:
    @conference{DBE07,
      author = {Duminuco, A. and Biersack, E. and En-Najjary, T.},
      title = {Proactive replication in distributed storage systems using machine availability estimation},
      booktitle = {Proceedings of the 2007 ACM CoNEXT conference},
      year = {2007}
    }
    
    El-Ansary, S., Alima, L.O., Brand, P. & Haridi, S. Efficient Broadcast in Structured P2P Networks 2003 IPTPS, pp. 304-314  inproceedings URL 
    BibTeX:
    @inproceedings{El-Ansary2003,
      author = {Sameh El-Ansary and Luc Onana Alima and Per Brand and Seif Haridi},
      title = {Efficient Broadcast in Structured P2P Networks},
      booktitle = {IPTPS},
      year = {2003},
      pages = {304-314},
      url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2735&spage=304}
    }
    
    Ernst-Desmulier, J.-B., Bourgeois, J. & Spies, F. P2PPerf: a framework for simulating and optimizing peer-to-peer-distributed computing applications 2008 Concurrent Computing : Practice and Experience
    Vol. 20(6), pp. 693-712 
    article DOI  
    BibTeX:
    @article{p2pperf2008Desm,
      author = {J.-B. Ernst-Desmulier and Julien Bourgeois and François Spies},
      title = {P2PPerf: a framework for simulating and optimizing peer-to-peer-distributed computing applications},
      journal = {Concurrent Computing : Practice and Experience},
      publisher = {John Wiley and Sons Ltd.},
      year = {2008},
      volume = {20},
      number = {6},
      pages = {693--712},
      doi = {http://dx.doi.org/10.1002/cpe.v20:6}
    }
    
    Esch, M., Botev, J., Schloss, H., Höhfeld, A., Scholtes, I. & Zech, B. SimCon - a simulation and visualization environment for overlay networks and large-scale applications 2008 Simutools '08: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops, pp. 1-9  inproceedings  
    BibTeX:
    @inproceedings{simcon2008Esch,
      author = {Markus Esch and Jean Botev and Hermann Schloss and Alexander Höhfeld and Ingo Scholtes and Benjamin Zech},
      title = {SimCon - a simulation and visualization environment for overlay networks and large-scale applications},
      booktitle = {Simutools '08: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops},
      publisher = {ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)},
      year = {2008},
      pages = {1--9}
    }
    
    Fedak, G., Germain, Cé., Néri, V. & Cappello, F. XtremWeb: A Generic Global Computing System 2001 CCGRID, pp. 582-587  inproceedings URL 
    BibTeX:
    @inproceedings{xtremweb2001Fedak,
      author = {Gilles Fedak and Cécile Germain and Vincent Néri and Franck Cappello},
      title = {XtremWeb: A Generic Global Computing System},
      booktitle = {CCGRID},
      year = {2001},
      pages = {582-587},
      url = {http://csdl.computer.org/comp/proceedings/ccgrid/2001/1010/00/10100582abs.htm}
    }
    
    Freedman, M.J., Freudenthal, E. & Mazières, D. Democratizing content publication with coral 2004 NSDI'04: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation, pp. 18-18  inproceedings  
    BibTeX:
    @inproceedings{coral2004Freedman,
      author = {Michael J. Freedman and Eric Freudenthal and David Mazières},
      title = {Democratizing content publication with coral},
      booktitle = {NSDI'04: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation},
      publisher = {USENIX Association},
      year = {2004},
      pages = {18--18}
    }
    
    Fujimoto, R., Perumalla, K., Park, A., Wu, H., Ammar, M. & Riley, G. Large-scale network simulation: how big? how fast? 2003 11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems (MASCOTS'03), pp. 116-123  inproceedings DOI  
    Abstract: Parallel and distributed simulation tools are emerging that offer the ability to perform detailed, packet-level simulations of large-scale computer networks on an unprecedented scale. The state-of-the-art in large-scale network simulation is characterized quantitatively. For this purpose, a metric based on the number of packet transmissions that can be processed by a simulator per second of wallclock time (PTS) is used as a means to quantitatively assess packet-level network simulator performance. An approach to realizing scalable network simulations that leverages existing sequential simulation models and software is described. Results from a recent performance study are presented concerning large-scale network simulation on a variety of platforms ranging from workstations to cluster computers to supercomputers. These experiments include runs utilizing as many as 1536 processors yielding performance as high as 106 million PTS. The performance of packet-level simulations of web and ftp traffic, and denial of service attacks on networks containing millions of network nodes are briefly described, including a run demonstrating the ability to simulate a million web traffic flows in near real-time. New opportunities and research challenges to fully exploit this capability are discussed.
    BibTeX:
    @inproceedings{Fuji03large,
      author = {Fujimoto, R.M. and Perumalla, K. and Park, A. and Wu, H. and Ammar, M.H. and Riley, G.F.},
      title = {Large-scale network simulation: how big? how fast?},
      booktitle = {11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems (MASCOTS'03)},
      year = {2003},
      pages = {116--123},
      doi = {http://dx.doi.org/10.1109/MASCOT.2003.1240649}
    }
    
    Fujimoto, R.M. Parallel and distributed simulation systems 2000   book  
    BibTeX:
    @book{Fujimoto00sim,
      author = {Fujimoto, Richard M.},
      title = {Parallel and distributed simulation systems},
      publisher = {J Wiley & Sons},
      year = {2000}
    }
    
    Gaeta, R., Gribaudo, M., Manini, D. & Sereno, M. Analysis of resource transfers in peer-to-peer file sharing applications using fluid models 2006 Performance Evaluation
    Vol. 63(3), pp. 149 - 174 
    article DOI URL 
    Abstract: This paper proposes a stochastic fluid flow model to compute the transfer time distribution of resources in peer-to-peer file sharing applications. The amount of bytes transferred among peers is represented by a continuous quantity (the fluid level) whose flow rate is modulated by a set of discrete states representing the concurrent upload and download operations on the peers participating to the transfer. A transient solution of the model is then performed to compute the probability that a peer can download a given resource in less than t units of time as a function of several system parameters. In particular, the impact of file popularity, bandwidth characteristics, concurrent downloads and uploads, cooperation level among peers, and user behavior are included in our model specification. We also provide numerical results aiming at proving the potentialities of the approach we adopted as well as to investigate interesting issues related to the effect of incentive mechanisms on the user cooperation.
    BibTeX:
    @article{Gaeta2006analysis,
      author = {R. Gaeta and M. Gribaudo and D. Manini and M. Sereno},
      title = {Analysis of resource transfers in peer-to-peer file sharing applications using fluid models},
      journal = {Performance Evaluation},
      year = {2006},
      volume = {63},
      number = {3},
      pages = {149 - 174},
      note = {P2P Computing Systems},
      url = {http://www.sciencedirect.com/science/article/B6V13-4FR8PGB-1/2/13ef14416dd590facf7db949299cb394},
      doi = {DOI: 10.1016/j.peva.2005.01.001}
    }
    
    Gaidioz, B., Koblitz, B. & Santos, N. Exploring high performance distributed file storage using LDPC codes 2007 Parallel Comput.
    Vol. 33(4-5), pp. 264-274 
    article DOI  
    BibTeX:
    @article{Gaidioz2007ldpc,
      author = {Gaidioz,, Benjamin and Koblitz,, Birger and Santos,, Nuno},
      title = {Exploring high performance distributed file storage using LDPC codes},
      journal = {Parallel Comput.},
      publisher = {Elsevier Science Publishers B. V.},
      year = {2007},
      volume = {33},
      number = {4-5},
      pages = {264--274},
      doi = {http://dx.doi.org/10.1016/j.parco.2007.02.003}
    }
    
    Geels, D. & Kubiatowicz, J. Replica management should be a game 2002 Proceedings of the 10th ACM SIGOPS European Workshop, pp. 235-238  inproceedings DOI  
    BibTeX:
    @inproceedings{Geels2002replicagame,
      author = {Dennis Geels and John Kubiatowicz},
      title = {Replica management should be a game},
      booktitle = {Proceedings of the 10th ACM SIGOPS European Workshop},
      publisher = {ACM},
      year = {2002},
      pages = {235--238},
      doi = {http://doi.acm.org/10.1145/1133373.1133422}
    }
    
    Ghemawat, S., Gobioff, H. & Leung, S.-T. The Google File System 2003 ACM SIGOPS Operating Systems Review
    Vol. 37(5), pp. 29-43 
    article DOI  
    BibTeX:
    @article{Ghemawat2003gfs,
      author = {Sanjay Ghemawat and Howard Gobioff and Shun-Tak Leung},
      title = {The Google File System},
      journal = {ACM SIGOPS Operating Systems Review},
      publisher = {ACM},
      year = {2003},
      volume = {37},
      number = {5},
      pages = {29--43},
      doi = {http://doi.acm.org/10.1145/1165389.945450}
    }
    
    Giuli, T.J. & Baker, M. Narses: A Scalable Flow-Based Network Simulator 2002 ArXiv Computer Science e-prints  inproceedings URL 
    Abstract: Most popular, modern network simulators, such as ns, are targeted towards simulating low-level protocol details. These existing simulators are not intended for simulating large distributed applications with many hosts and many concurrent connections over long periods of simulated time. We introduce a new simulator, Narses, targeted towards large distributed applications. The goal of Narses is to simulate and validate large applications efficiently using network models of varying levels of detail. We introduce several simplifying assumptions that allow our simulator to scale to the needs of large distributed applications while maintaining a reasonable degree of accuracy. Initial results show up to a 45 times speedup while consuming 28% of the memory used by ns. Narses maintains a reasonable degree of accuracy -- within 8% on average.
    BibTeX:
    @inproceedings{narses2002Giuli,
      author = {Giuli, T. J. and Baker, Mary },
      title = {Narses: A Scalable Flow-Based Network Simulator},
      booktitle = {ArXiv Computer Science e-prints},
      year = {2002},
      url = {http://arxiv.org/abs/cs.PF/0211024}
    }
    
    Godfrey, B.P., Shenker, S. & Stoica, I. Minimizing churn in distributed systems 2006 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM '06), pp. 147-158  inproceedings DOI URL 
    BibTeX:
    @inproceedings{Godfrey2006churn,
      author = {Godfrey, Brighten P. and Shenker, Scott and Stoica, Ion },
      title = {Minimizing churn in distributed systems},
      booktitle = {Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM '06)},
      publisher = {ACM},
      year = {2006},
      pages = {147--158},
      url = {http://dx.doi.org/10.1145/1159913.1159931},
      doi = {http://dx.doi.org/10.1145/1159913.1159931}
    }
    
    Goldberg, A.V. & Yianilos, P.N. Towards an Archival Intermemory 1998 ADL '98: Proceedings of the Advances in Digital Libraries Conference, pp. 147  inproceedings  
    BibTeX:
    @inproceedings{intermemory98goldberg,
      author = {A. V. Goldberg and P. N. Yianilos},
      title = {Towards an Archival Intermemory},
      booktitle = {ADL '98: Proceedings of the Advances in Digital Libraries Conference},
      publisher = {IEEE Computer Society},
      year = {1998},
      pages = {147}
    }
    
    Gramoli, V., Kermarrec, A.-M., Mostefaoui, A., Raynal, M. & Seric, B. Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime 2006 (PI 1799)  techreport URL 
    Abstract: Distributed systems are now both very large and highly dynamic. Peer to peer overlay networks have been proven efficient to cope with this new deal that traditional approaches can no longer accommodate. While organizing peers in an overlay network have generated a lot of interest leading to a large number of solutions, maintaining critical data in such a network remains an open issue. In this paper, we are interested in defining the portion of nodes and frequency one has to probe, given the churn observed in the system in order to achieve a given probability of maintaining the persistence of some critical data. More specifically, we provide a clear result relating the size and the frequency of the probing set along with its proof as well as an analysis of the way of leveraging such an information in a large scale dynamic distributed system.
    BibTeX:
    @techreport{Gramoli2006p2pstorage,
      author = {Vincent Gramoli and Anne-Marie Kermarrec and Achour Mostefaoui and Michel Raynal and Bruno Seric},
      title = {Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime},
      year = {2006},
      number = {PI 1799},
      url = {http://hal.inria.fr/inria-00001261/fr/}
    }
    
    Gummadi, K.P., Dunn, R.J., Saroiu, S., Gribble, S.D., Levy, H.M. & Zahorjan, J. Measurement, modeling, and analysis of a peer-to-peer file-sharing workload 2003 SOSP '03: Proceedings of the nineteenth ACM symposium on Operating Systems PrinciplesSOSP '03: Proceedings of the nineteenth ACM symposium on Operating systems principles, pp. 314-329  inproceedings DOI URL 
    BibTeX:
    @inproceedings{Gumm03Measurement,
      author = {Gummadi, Krishna P. and Dunn, Richard J. and Saroiu, Stefan and Gribble, Steven D. and Levy, Henry M. and Zahorjan, John },
      title = {Measurement, modeling, and analysis of a peer-to-peer file-sharing workload},
      booktitle = {SOSP '03: Proceedings of the nineteenth ACM symposium on Operating systems principles},
      journal = {SOSP '03: Proceedings of the nineteenth ACM symposium on Operating Systems Principles},
      publisher = {ACM Press},
      year = {2003},
      pages = {314--329},
      url = {http://dx.doi.org/10.1145/945445.945475},
      doi = {http://dx.doi.org/10.1145/945445.945475}
    }
    
    Gummadi, K.P., Saroiu, S. & Gribble, S.D. A measurement study of Napster and Gnutella as examples of peer-to-peer file sharing systems 2002 SIGCOMM Computer Communication Review (Poster Session)
    Vol. 32(1), pp. 82-82 
    article DOI URL 
    BibTeX:
    @article{Gummadi2002Measurement,
      author = {Gummadi, Krishna P. and Saroiu, Stefan and Gribble, Steven D. },
      title = {A measurement study of Napster and Gnutella as examples of peer-to-peer file sharing systems},
      journal = {SIGCOMM Computer Communication Review (Poster Session)},
      publisher = {ACM Press},
      year = {2002},
      volume = {32},
      number = {1},
      pages = {82--82},
      url = {http://dx.doi.org/10.1145/510726.510756},
      doi = {http://dx.doi.org/10.1145/510726.510756}
    }
    
    Gupta, I., Birman, K., Linga, P., Demers, A. & van Renesse, R. Kelips: Building an Efficient and Stable P2P DHT Through Increased Memory and Background Overhead 2003 Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03)  inproceedings URL 
    Abstract: A peer-to-peer (p2p) distributed hash table (DHT) system allows hosts to join and fail silently (or leave), as well as to insert and retrieve files (objects). This paper explores a new point in design space in which increased memory usage and constant background communication overheads are tolerated to reduce file lookup times and increase stability to failures and churn. Our system, called Kelips, uses peer-to-peer gossip to partially replicate file index information. In Kelips, (a) under...
    BibTeX:
    @inproceedings{kelips2003Gupta,
      author = {Gupta, Indranil and Birman, Ken and Linga, Prakash and Demers, Al and van Renesse, Robbert },
      title = {Kelips: Building an Efficient and Stable P2P DHT Through Increased Memory and Background Overhead},
      booktitle = {Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03)},
      year = {2003},
      url = {http://citeseer.ist.psu.edu/570786.html}
    }
    
    Haeberlen, A., Mislove, A. & Druschel, P. Glacier: highly durable, decentralized storage despite massive correlated failures 2005 NSDI'05: Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation, pp. 143-158  inproceedings  
    BibTeX:
    @inproceedings{glacier05haeb,
      author = {Andreas Haeberlen and Alan Mislove and Peter Druschel},
      title = {Glacier: highly durable, decentralized storage despite massive correlated failures},
      booktitle = {NSDI'05: Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation},
      publisher = {USENIX Association},
      year = {2005},
      pages = {143--158}
    }
    
    Hasan, R., Anwar, Z., Yurcik, W., Brumbaugh, L. & Campbell, R. A Survey of Peer-to-Peer Storage Techniques for Distributed File Systems 2005 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II, pp. 205-213  inproceedings  
    BibTeX:
    @inproceedings{Hasan2005surveyp2p,
      author = {Ragib Hasan and Zahid Anwar and William Yurcik and Larry Brumbaugh and Roy Campbell},
      title = {A Survey of Peer-to-Peer Storage Techniques for Distributed File Systems},
      booktitle = {Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II},
      year = {2005},
      pages = {205--213}
    }
    
    He, Q., Ammar, M., Riley, G., Raj, H. & Fujimoto, R. Mapping peer behavior to packet-level details: a framework for packet-level simulation of peer-to-peer systems 2003 Proc. 11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems MASCOTS 2003, pp. 71-78  inproceedings DOI  
    BibTeX:
    @inproceedings{gnutellasim2003He,
      author = {He, Q. and Ammar, M. and Riley, G. and Raj, H. and Fujimoto, R. },
      title = {Mapping peer behavior to packet-level details: a framework for packet-level simulation of peer-to-peer systems},
      booktitle = {Proc. 11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems MASCOTS 2003},
      year = {2003},
      pages = {71--78},
      doi = {http://dx.doi.org/10.1109/MASCOT.2003.1240644}
    }
    
    Heidemann, J., Bulusu, N., Elson, J., Intanagonwiwat, C., Lan, K., Xu, Y., Ye, W., Estrin, D. & Govindan, R. Effects of detail in wireless network simulation 2001 Proceedings of the SCS Multiconference on Distributed Simulation, pp. 3-11  inproceedings  
    BibTeX:
    @inproceedings{detail,
      author = {J. Heidemann and N. Bulusu and J. Elson and C. Intanagonwiwat and K. Lan and Y. Xu and W. Ye and D. Estrin and and R. Govindan},
      title = {Effects of detail in wireless network simulation},
      booktitle = {Proceedings of the SCS Multiconference on Distributed Simulation},
      year = {2001},
      pages = {3--11}
    }
    
    Hildebrandt, D., Bischofs, L. & Hasselbring, W. RealPeer -- A Framework for Simulation-Based Development of Peer-to-Peer Systems 2007 Proceedings of 15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP '07), pp. 490-497  inproceedings URL 
    Abstract: In the process of developing P2P systems simulation has proved to be an essential tool for the evaluation of existing and conceived P2P systems. So far, in practice there has been a clear separation between a simulation model of a P2P system and a real P2P system that operates on a real physical network. This separation hinders the transition of models to real systems and the evaluation of already deployed systems by means of simulation. This work tries to bridge this gap by proposing a methodology and a framework for the simulation-based development of P2P systems. In this approach, an initial model of a P2P system is iteratively transformed into the intended real P2P system. The presented framework effectively supports a developer in modelling, simulating and ultimately developing P2P systems. The authors demonstrate the validity of the approach and the framework by constructing an example P2P application. This application is simulated in a series of experiments as well as deployed in a large-scale Internet based P2P system
    BibTeX:
    @inproceedings{Hildebrandt2007realpeer,
      author = {Hildebrandt, Dieter and Bischofs, Ludger and Hasselbring, Wilhelm},
      title = {RealPeer -- A Framework for Simulation-Based Development of Peer-to-Peer Systems},
      booktitle = {Proceedings of 15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP '07)},
      year = {2007},
      pages = {490--497},
      url = {http://ieeexplore.ieee.org/search/srchabstract.jsp?arnumber=4135315&isnumber=4135240&punumber=4135239&k2dockey=4135315@ieeecnfs&query=%28+p2p%3Cin%3Emetadata+%29&pos=15}
    }
    
    Hildebrandt, D. & Hasselbring, W. Simulation-based development of Peer-to-Peer systems with the RealPeer methodology and framework 2008 Journal of System Archit.
    Vol. 54(9), pp. 849-860 
    article DOI  
    BibTeX:
    @article{realpeer2008Hild,
      author = {Dieter Hildebrandt and Wilhelm Hasselbring},
      title = {Simulation-based development of Peer-to-Peer systems with the RealPeer methodology and framework},
      journal = {Journal of System Archit.},
      publisher = {Elsevier North-Holland, Inc.},
      year = {2008},
      volume = {54},
      number = {9},
      pages = {849--860},
      doi = {http://dx.doi.org/10.1016/j.sysarc.2008.01.010}
    }
    
    Information Sciences Institute, E. The NAB (Network in A Box) wireless network simulator 2004 http://nab.epfl.ch  inproceedings  
    BibTeX:
    @inproceedings{nab,
      author = {Information Sciences Institute, EPFL},
      title = {The NAB (Network in A Box) wireless network simulator},
      booktitle = {http://nab.epfl.ch},
      year = {2004}
    }
    
    Ivkovic, I. Improving Gnutella Protocol: Protocol Analysis and Research Proposals 2001   techreport  
    BibTeX:
    @techreport{Ivkovic2001gnutellareport,
      author = {Igor Ivkovic},
      title = {Improving Gnutella Protocol: Protocol Analysis and Research Proposals},
      year = {2001}
    }
    
    Joseph, S. An Extendible Open Source P2P Simulator 2003 P2P Journal
    Vol. 0, pp. 1-15 
    article URL 
    Abstract: A large number of peer-to-peer (p2p) systems have been developed in recent years. Many of these new approaches to p2p networks have been developed in parallel with a simulator of one sort or another. Other authors have already started to call for standardization in the area of p2p simulation (Schlosser et al., 2002), and this paper supports that call. It also goes further to suggest that an extendible open source simulator is required. This paper also tries to summarize some of the desirable features of a p2p simulator by looking at the different existing simulators. We then present the NeuroGrid simulator, an extendible open source p2p simulator, and outline a number of ongoing projects that have been implemented by extending from this architectural base.
    BibTeX:
    @article{neurogrid2003Joseph,
      author = {Sam Joseph},
      title = {An Extendible Open Source P2P Simulator},
      journal = {P2P Journal},
      year = {2003},
      volume = {0},
      pages = {1-15},
      url = {http://www.neurogrid.net/php/P2PSimulator3.pdf}
    }
    
    Kaashoek, F.M. & Karger, D.R. Koorde: A Simple Degree-Optimal Distributed Hash Table 2003 Lecture Notes in Computer Science : Peer-to-Peer Systems II, pp. 98-107  book URL 
    BibTeX:
    @book{koorde03Kaashoek,
      author = {Kaashoek, Frans M. and Karger, David R. },
      title = {Koorde: A Simple Degree-Optimal Distributed Hash Table},
      booktitle = {Lecture Notes in Computer Science : Peer-to-Peer Systems II},
      publisher = {Springer},
      year = {2003},
      pages = {98--107},
      url = {http://www.springerlink.com/content/unmqcqy0yxpu32xp

    } }

    Karlsson, M., Mahalingam, M., Karlsson, M. & Mahalingam, M. Do We Need Replica Placement Algorithms in Content Delivery Networks 2002 7th International Workshop on Web Content Caching and Distribution (WCW)  inproceedings URL 
    Abstract: Numerous replica placement algorithms have been proposed in the literature for use in content delivery networks. However, little has been done to compare the various placement algorithms against each other and against caching. This paper debates whether we need replica placement algorithms in content delivery networks or not.
    BibTeX:
    @inproceedings{Karlsson02placementcdn,
      author = {Karlsson, Magnus and Mahalingam, Mallik and Karlsson, Magnus and Mahalingam, Mallik },
      title = {Do We Need Replica Placement Algorithms in Content Delivery Networks},
      booktitle = {7th International Workshop on Web Content Caching and Distribution (WCW)},
      year = {2002},
      url = {http://citeseer.ist.psu.edu/537897.html}
    }
    
    Killian, C.E., Anderson, J.W., Braud, R., Jhala, R. & Vahdat, A. Mace: language support for building distributed systems 2007 PLDI, pp. 179-188  inproceedings URL 
    BibTeX:
    @inproceedings{mace2007Killian,
      author = {Charles Edwin Killian and James W. Anderson and Ryan Braud and Ranjit Jhala and Amin Vahdat},
      title = {Mace: language support for building distributed systems},
      booktitle = {PLDI},
      year = {2007},
      pages = {179-188},
      url = {http://doi.acm.org/10.1145/1250734.1250755}
    }
    
    Kleinberg, J. The small-world phenomenon: an algorithmic perspective 2000 32nd ACM Symposium on the Theory of Computing  inproceedings  
    BibTeX:
    @inproceedings{Kleinberg00smallworld,
      author = { J. Kleinberg},
      title = {The small-world phenomenon: an algorithmic perspective},
      booktitle = {32nd ACM Symposium on the Theory of Computing},
      year = {2000}
    }
    
    Kotilainen, N., Vapa, M., Keltanen, T., Auvinen, A. & Vuori, J. P2PRealm - peer-to-peer network simulator 2006 11th Intenational Workshop on Computer-Aided Modeling, Analysis and Design of Communication Links and Networks , pp. 93-99  inproceedings DOI  
    BibTeX:
    @inproceedings{p2prealm2006Kotilainen,
      author = {Kotilainen, N. and Vapa, M. and Keltanen, T. and Auvinen, A. and Vuori, J.},
      title = {P2PRealm - peer-to-peer network simulator},
      booktitle = {11th Intenational Workshop on Computer-Aided Modeling, Analysis and Design of Communication Links and Networks },
      year = {2006},
      pages = {93-99},
      doi = {http://dx.doi.org/10.1109/CAMAD.2006.1649724}
    }
    
    Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C. & Zhao, B. OceanStore: An architecture for global-scale persistent store 2000 Proceedings of the 9th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS'2000)  inproceedings  
    BibTeX:
    @inproceedings{oceanstore00kubASPLOS,
      author = {John Kubiatowicz and David Bindel and Yan Chen and Steven Czerwinski and Patrick Eaton and Dennis Geels and Ramakrishna Gummadi and Sean Rhea and Hakim Weatherspoon and Westley Weimer and Chris Wells and Ben Zhao},
      title = {OceanStore: An architecture for global-scale persistent store},
      booktitle = {Proceedings of the 9th Intl. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS'2000)},
      year = {2000}
    }
    
    Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Wells, C. & others OceanStore: an architecture for global-scale persistent storage 2000 ACM SIGARCH Computer Architecture News
    Vol. 28(5), pp. 190-201 
    article  
    BibTeX:
    @article{oceanstore00kubACM,
      author = {Kubiatowicz, J. and Bindel, D. and Chen, Y. and Czerwinski, S. and Eaton, P. and Geels, D. and Gummadi, R. and Rhea, S. and Weatherspoon, H. and Wells, C. and others},
      title = {OceanStore: an architecture for global-scale persistent storage},
      journal = {ACM SIGARCH Computer Architecture News},
      publisher = {ACM New York, NY, USA},
      year = {2000},
      volume = {28},
      number = {5},
      pages = {190--201}
    }
    
    Kulbak, Y. & Bickson, D. The eMule protocol specification 2005   booklet URL 
    BibTeX:
    @booklet{emule05,
      author = {Kulbak, Yoram and Bickson, Danny},
      title = {The eMule protocol specification},
      year = {2005},
      url = {http://www.cs.huji.ac.il/labs/danss/presentations/emule.pdf}
    }
    
    Kun, W., Han, D., Zhang, Y., Lu, S., Chen, D. & Xie, L. NDP2PSim: A NS2-Based Platform for Peer-to-Peer Network Simulations 2005
    Vol. 3759Proceedings of Parallel and Distributed Processing and Applications (ISPA'05 Workshops), pp. 520-529 
    inproceedings URL 
    Abstract: Nowadays simulation is the major method to evaluate and analyze the performance of peer-to-peer systems. With the development of the research, more and more researchers point out that the underlying network highly impacts the performance of peer-to-peer systems. But most existing simulators are still based on some simplified models without considering the underlying network. Meanwhile, most simulators can only simulate some specific protocols on small scales. We designed and developed an integrated and generic simulation platform, NDP2PSim, built on NS2 to overcome these weaknesses. This platform can provide a realistic and generic simulation environment for almost all kinds of existing P2P protocols on large scales. And some common functions of P2P systems are also abstracted and provided as modules in order to make the platform easy to use. In this paper, we describe the structure of NDP2PSim in detail and compare it with other existing simulators.
    BibTeX:
    @inproceedings{ndp2psim2005Kun,
      author = {Wu Kun and Dai Han and Yang Zhang and Sanglu Lu and Daoxu Chen and and Li Xie},
      title = {NDP2PSim: A NS2-Based Platform for Peer-to-Peer Network Simulations},
      booktitle = {Proceedings of Parallel and Distributed Processing and Applications (ISPA'05 Workshops)},
      publisher = {Springer Berlin / Heidelberg},
      year = {2005},
      volume = {3759},
      pages = {520--529},
      url = {http://www.springerlink.com/content/b751v2320351433g/}
    }
    
    Kunzmann, G., Nagel, R., Hossfeld, T., Binzenhofer, A. & Eger, K. Efficient Simulation of Large-Scale P2P Networks: Modeling Network Transmission Times 2007 Proceedings of 15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing, pp. 475-481  inproceedings DOI URL 
    Abstract: The ongoing process of globalization leads to a huge demand for highly scalable applications that are able to deal with millions of participants distributed all over the world. Peer-to-peer (P2P) technology enables an arbitrary large number of users to participate in distributed services like content distribution or collaboration tools. In order to verify a new protocol's performance and scalability simulation is a commonly used tool. First, predicting the network and peer behavior in the real world is only feasible if the simulation, i.e. all applied models as well as the peer state, is as realistic as possible. Second, many properties of the system only become observable when the number of participants is sufficiently large. Therefore, verifying the scalability of a system requires simulating huge worldwide networks. Due to limited processing power, central memory and availabe time, both requirements can only be fullfilled if the applied models are very efficient. In this paper we take a closer look at the network layer. We compare the most commonly-used network models and present a very efficient model for applying real-world network transmission times in large scale simulations
    BibTeX:
    @inproceedings{Kunzmann2007largescale,
      author = {Kunzmann, Gerald and Nagel, Robert and Hossfeld, Tobias and Binzenhofer, Andreas and Eger, Kolja},
      title = {Efficient Simulation of Large-Scale P2P Networks: Modeling Network Transmission Times},
      booktitle = {Proceedings of 15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing},
      publisher = {IEEE Computer Society},
      year = {2007},
      pages = {475--481},
      url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4135313},
      doi = {http://doi.ieeecomputersociety.org/10.1109/PDP.2007.42}
    }
    
    Kurkowski, S., Camp, T. & Colagrosso, M. MANET simulation studies: the incredibles 2005 SIGMOBILE Mob. Comput. Commun. Rev.
    Vol. 9(4), pp. 50-61 
    article URL 
    Abstract: Simulation is the research tool of choice for a majority of the mobile ad hoc network (MANET) community. However, while the use of simulation has increased, the credibility of the simulation results has decreased. To determine the state of MANET simulation studies, we surveyed the 2000-2005 proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). From our survey, we found significant shortfalls. We present the results of our survey in this paper. We then summarize common simulation study pitfalls found in our survey. Finally, we discuss the tools available that aid the development of rigorous simulation studies. We offer these results to the community with the hope of improving the credibility of MANET simulation-based studies.
    BibTeX:
    @article{Kurkowski2005incredibles,
      author = {Stuart Kurkowski and Tracy Camp and Michael Colagrosso},
      title = {MANET simulation studies: the incredibles},
      journal = {SIGMOBILE Mob. Comput. Commun. Rev.},
      publisher = {ACM},
      year = {2005},
      volume = {9},
      number = {4},
      pages = {50--61},
      url = {http://doi.acm.org/10.1145/1096166.1096174}
    }
    
    Kurtz, T. Approximation of Population Processes 1981   book  
    BibTeX:
    @book{kur81,
      author = {Kurtz, T.G.},
      title = {Approximation of Population Processes},
      publisher = {Society for Industrial Mathematics},
      year = {1981}
    }
    
    Li, J., Stribling, J., Morris, R., Kaashoek, M. & Gil, T. A performance vs. cost framework for evaluating DHT design tradeoffs under churn 2005
    Vol. 1Proceedings of IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'05), pp. 225-236 vol. 1 
    inproceedings DOI  
    Abstract: Protocols for distributed hash tables (DHTs) incorporate features to achieve low latency for lookup requests in the face of churn, continuous changes in membership. These protocol features can include a directed identifier space, parallel lookups, pro-active flooding of membership changes, and stabilization protocols for maintaining accurate routing. In addition, DHT protocols have parameters that can be tuned to achieve different tradeoffs between lookup latency and communication cost due to maintenance traffic. The relative importance of the features and parameters is not well understood, because most previous work evaluates protocols on static networks. This paper presents a performance versus cost framework (PVC) that allows designers to compare the effects of different protocol features and parameter values. PVC views a protocol as consuming a certain amount of network bandwidth in order to achieve a certain lookup latency, and helps reveal the efficiency with which protocols use additional network resources to improve latency. To demonstrate the value of PVC, this paper simulates Chord, Kademlia, Kelips, OneHop, and Tapestry under different workloads and uses PVC to understand which features are more important under churn. PVC analysis shows that the key to efficiently using additional bandwidth is for a protocol to adjust its routing table size. It also shows that routing table stabilization is wasteful and can be replaced with opportunistic learning through normal lookup traffic. These insights combined demonstrate that PVC is a valuable tool for DHT designers.
    BibTeX:
    @inproceedings{p2psim2005Li,
      author = {Jinyang Li and J. Stribling and R. Morris and M.F. Kaashoek and T.M. Gil},
      title = {A performance vs. cost framework for evaluating DHT design tradeoffs under churn},
      booktitle = {Proceedings of IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'05)},
      year = {2005},
      volume = {1},
      pages = { 225-236 vol. 1},
      doi = {http://dx.doi.org/10.1109/INFCOM.2005.1497894}
    }
    
    Li, J., Stribling, J., Morris, R. & Kaashoek, M.F. Bandwidth-efficient management of DHT routing tables 2005 Proceedings of the 2nd USENIX Symposium on Networked Systems Design and Implementation (NSDI '05)  inproceedings  
    BibTeX:
    @inproceedings{accordion2005Li,
      author = {Jinyang Li and Jeremy Stribling and Robert Morris and M. Frans Kaashoek},
      title = {Bandwidth-efficient management of DHT routing tables},
      booktitle = {Proceedings of the 2nd USENIX Symposium on Networked Systems Design and Implementation (NSDI '05)},
      year = {2005}
    }
    
    Lian, Q., Chen, W. & Zhang, Z. On the Impact of Replica Placement to the Reliability of Distributed Brick Storage Systems 2005 International Conference on Distributed Computing Systems (ICSCS'05), pp. 187-196  inproceedings DOI  
    BibTeX:
    @inproceedings{Lian2005placement,
      author = {Qiao Lian and Wei Chen and Zheng Zhang},
      title = {On the Impact of Replica Placement to the Reliability of Distributed Brick Storage Systems},
      booktitle = {International Conference on Distributed Computing Systems (ICSCS'05)},
      publisher = {IEEE Computer Society},
      year = {2005},
      pages = {187-196},
      doi = {http://doi.ieeecomputersociety.org/10.1109/ICDCS.2005.56}
    }
    
    Liang, J., Kumar, R. & Ross, K. Understanding KaZaA 2004 http://citeseer.ist.psu.edu/liang04understanding.html  misc URL 
    Abstract: Both in terms of number of participating users and in traffic volume, KaZaA is one of the most important applications in the Internet today. Nevertheless, because KaZaA is proprietary and uses encryption, little is understood about KaZaA's protocol, architecture and signaling traffic. We have built a measurement platform for collecting and measuring KaZaA's signaling traffic. These measurements provide insight on KaZaA's architecture, protocol, and overlay behavior. The reader should take away...
    BibTeX:
    @misc{kazaa2004Liang,
      author = {Liang, J. and Kumar, R. and Ross, K.},
      title = {Understanding KaZaA},
      year = {2004},
      url = {http://citeseer.ist.psu.edu/liang04understanding.html}
    }
    
    Liben-Nowell, D., Balakrishnan, H. & Karger, D. Analysis of the evolution of peer-to-peer systems 2002 Proceedings of the 21st Annual Symposium on Principles of Distributed Computing (PODC'02), pp. 233-242  inproceedings URL 
    BibTeX:
    @inproceedings{Karger02chordanalysis,
      author = {David Liben-Nowell and Hari Balakrishnan and David Karger},
      title = {Analysis of the evolution of peer-to-peer systems},
      booktitle = {Proceedings of the 21st Annual Symposium on Principles of Distributed Computing (PODC'02)},
      year = {2002},
      pages = {233--242},
      url = {citeseer.ist.psu.edu/liben-nowell02analysis.html}
    }
    
    Lin, W., Chiu, D. & Lee, Y. Erasure code replication revisited 2004 Peer-to-Peer Computing, 2004. Proceedings. Proceedings. Fourth International Conference on, pp. 90-97  conference  
    BibTeX:
    @conference{Lin04ecc,
      author = {Lin, WK and Chiu, DM and Lee, YB},
      title = {Erasure code replication revisited},
      booktitle = {Peer-to-Peer Computing, 2004. Proceedings. Proceedings. Fourth International Conference on},
      year = {2004},
      pages = {90--97}
    }
    
    Lua, E.K., Crowcroft, J., Pias, M., Sharma, R. & Lim, S. A Survey and Comparison of Peer-to-Peer Overlay Network Schemes 2005 IEEE COMMUNICATIONS SURVEY AND TUTORIAL
    Vol. 7(2), pp. 72-93 
    article URL 
    Abstract: Over the Internet today, computing and communications environments are significantly more complex and chaotic than classical distributed systems, lacking any centralized organization or hierarchical control. There has been much interest in emerging Peer-to-Peer (P2P) network overlays because they provide a good substrate for creating large-scale data sharing, content distribution, and application-level multicast applications. These P2P overlay networks attempt to provide a long list of features, such as: selection of nearby peers, redundant storage, efficient search/location of data items, data permanence or guarantees, hierarchical naming, trust and authentication, and anonymity. P2P networks potentially offer an efficient routing architecture that is self-organizing, massively scalable, and robust in the wide-area, combining fault tolerance, load balancing, and explicit notion of locality. In this article we present a survey and comparison of various Structured and Unstructured P2P overlay networks. We categorize the various schemes into these two groups in the design spectrum, and discuss the application-level network performance of each group.
    BibTeX:
    @article{Lua2005survey,
      author = {Eng Keong Lua and Jon Crowcroft and Marcelo Pias and Ravi Sharma and Steven Lim},
      title = {A Survey and Comparison of Peer-to-Peer Overlay Network Schemes},
      journal = {IEEE COMMUNICATIONS SURVEY AND TUTORIAL},
      year = {2005},
      volume = {7},
      number = {2},
      pages = {72--93},
      url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1610546}
    }
    
    Luby, M., Mitzenmacher, M., Shokrollahi, M., Spielman, D. & Stemann, V. Practical loss-resilient codes 1997 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pp. 150-159  conference  
    BibTeX:
    @conference{LMSSS97,
      author = {Luby, M.G. and Mitzenmacher, M. and Shokrollahi, M.A. and Spielman, D.A. and Stemann, V.},
      title = {Practical loss-resilient codes},
      booktitle = {Proceedings of the twenty-ninth annual ACM symposium on Theory of computing},
      year = {1997},
      pages = {150--159}
    }
    
    López, P.G., Pairot, C., Mondéjar, R., Ahulló, J.P., Tejedor, H. & Rallo, R. PlanetSim: A New Overlay Network Simulation Framework. 2004
    Vol. 3437SEM, pp. 123-136 
    inproceedings URL 
    Abstract: Current research in peer to peer systems is lacking appropriate environments for simulation and experimentation of large scale overlay services. This has led to a plethora of custom made simulators that waste development resources and hinder fair comparisons between different approaches. In this paper we present a new simulation / ex- perimentation framework for large scale overlay services with three main contributions: i) provide a unifying approach to simulation/ experimentation that eases the transition from simulation to network testbeds, ii) it clearly distinguish between the design of overlay algorithms (key based routing), and the applications and services built on top of them, iii) offer a layered and modular architecture with clear hotspots, and pervasive use of design patterns. We have used PlanetSim to implement and evaluate overlay networks such as Chord and Symphony, and overlay services such as Scribe application level multicast, and keyword query systems over distributed hash tables.
    BibTeX:
    @inproceedings{planetSim2004lopez,
      author = {Pedro García López and Carles Pairot and Rubén Mondéjar and Jordi Pujol Ahulló and Helio Tejedor and Robert Rallo},
      title = {PlanetSim: A New Overlay Network Simulation Framework.},
      booktitle = {SEM},
      publisher = {Springer},
      year = {2004},
      volume = {3437},
      pages = {123--136},
      url = {http://dblp.uni-trier.de/db/conf/sem/sem2004.html#GarciaPMPTR04}
    }
    
    Mahanta, A. & Theeramunkong, T. A Comparative Simulation Analysis of P2P System Architectures 2005 4th International Symposium on Parallel and Distributed Computing (ISPDC 2005), pp. 51-57  inproceedings URL 
    Abstract: This paper gives a comparative study on multilayer file sharing mechanisms in peer-to-peer (P2P) systems. Based on a well-known P2P system named Gnutella, two system architectures, 1-layer and 2-layer Ngnu architectures are proposed in order to reduce network traffic and to gain better scalability. These architectures can be applied to large-scale systems, such as e-government, e-office and e-library, which need an efficient file-sharing mechanism. To examine the efficiency and effectiveness of the proposed methods, a number of simulations are made with respect to three factors: time-to-lives (TTLs), the number of nodes and the number of queries. To compare these systems, the number of messages and the mean query hit are measured and compared with the original flat Gnutella system
    BibTeX:
    @inproceedings{Mahanta2005p2psims,
      author = {Anjan Mahanta and Thanaruk Theeramunkong},
      title = {A Comparative Simulation Analysis of P2P System Architectures},
      booktitle = {4th International Symposium on Parallel and Distributed Computing (ISPDC 2005)},
      year = {2005},
      pages = {51-57},
      url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1609953}
    }
    
    Markov, A. On the problem of representability of matrices 1958 Z. Math. Logik Grundlagen Math
    Vol. 4, pp. 157-168 
    article  
    BibTeX:
    @article{Mar58,
      author = {Markov, A.},
      title = {On the problem of representability of matrices},
      journal = {Z. Math. Logik Grundlagen Math},
      year = {1958},
      volume = {4},
      pages = {157--168}
    }
    
    Maymounkov, P. & Mazières, D. Kademlia: A Peer-to-Peer Information System Based on the XOR Metric 2002 Revised Papers from the First International Workshop on Peer-to-Peer Systems (IPTPS), pp. 53-65  inproceedings URL 
    BibTeX:
    @inproceedings{kademlia2002Maymo,
      author = {Maymounkov, Petar and Mazières, David },
      title = {Kademlia: A Peer-to-Peer Information System Based on the XOR Metric},
      booktitle = {Revised Papers from the First International Workshop on Peer-to-Peer Systems (IPTPS)},
      publisher = {Springer-Verlag},
      year = {2002},
      pages = {53--65},
      url = {http://portal.acm.org/citation.cfm?id=646334.687801}
    }
    
    Merz, P., Priebe, M. & Wolf, S. A Simulation Framework for Distributed Super-Peer Topology Construction Using Network Coordinates 2008 Proc. 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing PDP 2008, pp. 491-498  inproceedings DOI  
    BibTeX:
    @inproceedings{netsim2008Merz,
      author = {Merz, P. and Priebe, M. and Wolf, S. },
      title = {A Simulation Framework for Distributed Super-Peer Topology Construction Using Network Coordinates},
      booktitle = {Proc. 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing PDP 2008},
      year = {2008},
      pages = {491--498},
      doi = {http://dx.doi.org/10.1109/PDP.2008.47}
    }
    
    Moreton, T.D., Pratt, I.A. & Harris, T.L. Storage, Mutability and Naming in Pasta 2002
    Vol. 2376Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing, pp. 215-219 
    conference URL 
    Abstract: We outline the design and operation of Pasta, a peer-to-peer storage system that provides traditional file system semantics while offering the wide-spread caching and distribution required for publishing networks. Pasta allows users to manipulate shared files and folders with strong consistency semantics and to collaboratively organize them in unmanaged decentralized namespaces. Storage quotas regulate consumption and allow the network to offer permanence of content.
    BibTeX:
    @conference{Moreton2002pasta,
      author = {Tim D. Moreton and Ian A. Pratt and Timothy L. Harris},
      title = {Storage, Mutability and Naming in Pasta},
      booktitle = {Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing},
      publisher = {Springer-Verlag},
      year = {2002},
      volume = {2376},
      pages = {215--219},
      url = {http://www.springerlink.com/content/he60yanw3c9jduut/}
    }
    
    Muthitacharoen, A., Morris, R., Gil, T.M. & Chen, B. Ivy: A Read/Write Peer-to-Peer File System 2002 Proceedings of 5th Symposium on Operating Systems Design and Implementation (OSDI 2002), pp. 31-44  inproceedings  
    BibTeX:
    @inproceedings{ivy02Muth,
      author = {Athicha Muthitacharoen and Robert Morris and Thomer M. Gil and Benjie Chen},
      title = {Ivy: A Read/Write Peer-to-Peer File System},
      booktitle = {Proceedings of 5th Symposium on Operating Systems Design and Implementation (OSDI 2002)},
      year = {2002},
      pages = {31--44}
    }
    
    Naicken, S., Basu, A., Livingston, B. & Rodhetbhai, S. A Survey of Peer-to-Peer Network Simulators 2006 Proceedings of The Seventh Annual Postgraduate Symposium, Liverpool,UK  inproceedings URL 
    BibTeX:
    @inproceedings{Naicken2006survey,
      author = {Naicken, S. and Basu, A. and Livingston, B. and Rodhetbhai, S.},
      title = {A Survey of Peer-to-Peer Network Simulators},
      booktitle = {Proceedings of The Seventh Annual Postgraduate Symposium, Liverpool,UK},
      year = {2006},
      url = {http://www.stephennaicken.com/wp-content/uploads/2007/05/paper-pgnet2006_p2psimsurvey.pdf}
    }
    
    Naicken, S., Basu, A., Livingston, B., Rodhetbhai, S. & Wakeman, I. Towards Yet Another Peer-to-Peer Simulator 2006 Proceedings of The Fourth International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET-NETs), Ilkley, UK  inproceedings URL 
    Abstract: There are a number of P2P overlay simulators developed by various research groups for use by the P2P academic community, however many still opt to use their own custom-built simulator. Having surveyed the area of Peer-to-Peer simulators in previous work, we believe that this is due to the simulators lacking key functionality such as mechanisms to gather statistical data from simulation runs. The use of custom built simulators gives rise to a number of problems that include an increase in the difficulty to reproduce and validate results and comparison of similar simulated systems and their associated results. In this paper, we discuss the current situation with respect to simulation usage in P2P research and our work towards creating a new simulator that will meet the requirements of P2P researchers. It is our hope that this paper will give rise to further discussion and knowledge sharing among those of the P2P and simulation research communities, so that a simulator that meets the needs of the P2P community can be developed.
    BibTeX:
    @inproceedings{Naicken2006yap2psim,
      author = {Naicken, S. and Basu, A. and Livingston, B. and Rodhetbhai, S. and Wakeman, I.},
      title = {Towards Yet Another Peer-to-Peer Simulator},
      booktitle = {Proceedings of The Fourth International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET-NETs), Ilkley, UK},
      year = {2006},
      url = {http://www.stephennaicken.com/wp-content/uploads/2007/05/paper-hetnets2006_yapps.pdf}
    }
    
    Naicken, S., Livingston, B., Basu, A., Rodhetbhai, S., Wakeman, I. & Chalmers, D. The state of peer-to-peer simulators and simulations 2007 SIGCOMM Computer Communication Review
    Vol. 37(2), pp. 95-98 
    article URL 
    Abstract: In this paper, we discuss the current situation with respect to simulation usage in P2P research, testing the available P2P simulators against a proposed set of requirements, and surveying over 280 papers to discover what simulators are already being used. We found that no simulator currently meets all our requirements, and that simulation results are generally reported in the literature in a fashion that precludes any reproduction of results. We hope that this paper will give rise to further discussion and knowledge sharing among those of the P2P and network simulation research communities, so that a simulator that meets the needs of rigorous P2P research can be developed
    BibTeX:
    @article{Naicken2007soa,
      author = {Naicken, S. and Livingston, B. and Basu, A. and Rodhetbhai, S. and Wakeman, I. and Chalmers, D.},
      title = {The state of peer-to-peer simulators and simulations},
      journal = {SIGCOMM Computer Communication Review},
      publisher = {ACM},
      year = {2007},
      volume = {37},
      number = {2},
      pages = {95--98},
      url = {http://doi.acm.org/10.1145/1232919.1232932}
    }
    
    Naoumov, V. & Gross, T. Simulation of large ad hoc networks 2003 MSWIM '03: Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems, pp. 50-57  inproceedings DOI  
    BibTeX:
    @inproceedings{941001,
      author = {Valeri Naoumov and Thomas Gross},
      title = {Simulation of large ad hoc networks},
      booktitle = {MSWIM '03: Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems},
      publisher = {ACM Press},
      year = {2003},
      pages = {50--57},
      doi = {http://doi.acm.org/10.1145/940991.941001}
    }
    
    Nicol, D.M., Liu, J., Liljenstam, M. & Yan, G. Simulation of Large-Scale networks using SSF 2003 Proceedings of the 2003 Winter Simulation Conference  inproceedings  
    Abstract: Some applications of simulation require that the model state be advanced in simulation time faster than the wall-clock time advances as the simulation executes. This faster than real-time requirement is crucial, for instance, when a simulation is used as part of a real-time control system, working through the consequences of contemplated control actions, in order to identify feasible (or even optimal) decisions. This paper considers the issue of faster than real-time simulation of very large communication networks, and how this is accomplished using our implementation (in C++) of the Scalable Simulation Framework (SSF). Our tool (called iSSF) uses hierarchical levels of abstraction, and parallelism, to achieve speedups of nearly four orders of magnitude, enabling real-time execution rates on large network models. We quantify the effects that choice of hierarchical abstraction has on the simulation time advance rate, and show empirically how changing the abstraction mix affects the execution rate on a large network example.
    BibTeX:
    @inproceedings{Nicol03Simulation,
      author = {Nicol, David M. and Liu, Jason and Liljenstam, Michael and Yan, Guanhua },
      title = {Simulation of Large-Scale networks using SSF},
      booktitle = {Proceedings of the 2003 Winter Simulation Conference},
      year = {2003}
    }
    
    Patterson, D.A., Gibson, G. & Katz, R.H. A case for redundant arrays of inexpensive disks (RAID) 1988 Proceedings of ACM International Conference on Management of Data (SIGMOD '88), pp. 109-116  inproceedings DOI  
    BibTeX:
    @inproceedings{Patterson1988raid,
      author = {Patterson,, David A. and Gibson,, Garth and Katz,, Randy H.},
      title = {A case for redundant arrays of inexpensive disks (RAID)},
      booktitle = {Proceedings of ACM International Conference on Management of Data (SIGMOD '88)},
      publisher = {ACM},
      year = {1988},
      pages = {109--116},
      doi = {http://doi.acm.org/10.1145/50202.50214}
    }
    
    Patterson, D., Brown, A., Broadwell, P., Candea, G., Chen, M., Cutler, J., Enriquez, P., Fox, A., Kiciman, E., Merzbacher, M., Oppenheimer, D., Sastry, N., Tetzlaff, W., Traupamn, J. & Treuhaft, N. Recovery Oriented Computing (ROC): Motivation, Definition, Techniques, and Case Studies 2002 Computer Science Technical Report UCB//CSD-02-1175  techreport URL 
    BibTeX:
    @techreport{Patterson2002roc,
      author = {Patterson, David and Brown, Aaron and Broadwell, Pete and Candea, George and Chen, Mike and Cutler, James and Enriquez, Patricia and Fox, Armando and Kiciman, Emere and Merzbacher, Matthew and Oppenheimer, David and Sastry, Naveen and Tetzlaff, William and Traupamn, Jonathan and Treuhaft, Noah },
      title = {Recovery Oriented Computing (ROC): Motivation, Definition, Techniques, and Case Studies},
      journal = {Computer Science Technical Report UCB//CSD-02-1175},
      year = {2002},
      url = {http://research.microsoft.com/emrek/pubs/ROCTR02-1175.pdf}
    }
    
    Peterson, L., Anderson, T., Culler, D. & Roscoe, T. A Blueprint for Introducing Disruptive Technology into the Internet 2002 Proceedings of the 1st ACM Workshop on Hot Topics in Networks (HotNets-I)  inproceedings URL 
    BibTeX:
    @inproceedings{planetlab2002Peterson,
      author = {Larry Peterson and Tom Anderson and David Culler and Timothy Roscoe},
      title = {A Blueprint for Introducing Disruptive Technology into the Internet},
      booktitle = {Proceedings of the 1st ACM Workshop on Hot Topics in Networks (HotNets-I)},
      year = {2002},
      url = {http://www.cs.princeton.edu/nsg/papers/planetlab_hotnets_02/}
    }
    
    Piccolo, F.L., Bianchi, G. & Cassella, S. Efficient Simulation of Bandwidth Allocation Dynamics in P2P Networks 2006 Proc. IEEE Global Telecommunications Conference GLOBECOM '06, pp. 1-6  inproceedings DOI  
    BibTeX:
    @inproceedings{Piccolo2006effsim,
      author = {Piccolo, Francesca Lo and Bianchi, Giuseppe and Cassella, Stefano},
      title = {Efficient Simulation of Bandwidth Allocation Dynamics in P2P Networks},
      booktitle = {Proc. IEEE Global Telecommunications Conference GLOBECOM '06},
      year = {2006},
      pages = {1--6},
      doi = {http://dx.doi.org/10.1109/GLOCOM.2006.433}
    }
    
    Picconi, F., Baynat, B. & Sens, P. An Analytical Estimation of Durability in DHTs 2007 4th International Conference on Distributed Computing and Internet Technology (ICDCIT'07), pp. 184-196  inproceedings  
    BibTeX:
    @inproceedings{Picconi07analyticaldht,
      author = {Fabio Picconi and Bruno Baynat and Pierre Sens},
      title = {An Analytical Estimation of Durability in DHTs},
      booktitle = {4th International Conference on Distributed Computing and Internet Technology (ICDCIT'07)},
      year = {2007},
      pages = {184-196}
    }
    
    Picconi, F., Baynat, B. & Sens, P. Predicting durability in DHTs using Markov chains 2007
    Vol. 22nd International Conference on Digital Information Management (ICDIM'07), pp. 532-538 
    inproceedings DOI  
    BibTeX:
    @inproceedings{Picconi07durabilitydht,
      author = {Picconi, Fabio and Baynat, Bruno and Sens, Pierre},
      title = {Predicting durability in DHTs using Markov chains},
      booktitle = {2nd International Conference on Digital Information Management (ICDIM'07)},
      year = {2007},
      volume = {2},
      pages = {532-538},
      doi = {http://dx.doi.org/10.1109/ICDIM.2007.4444278}
    }
    
    Picconi, F., Busca, J.-M. & Sens, P. Exploiting Network Locality in a Decentralized Read-Write Peer-to-Peer File System 2004 10th International Conference on Parallel and Distributed Systems (ICPADS 2004), pp. 289-296  inproceedings  
    BibTeX:
    @inproceedings{Picc04local,
      author = {Fabio Picconi and Jean-Michel Busca and Pierre Sens},
      title = {Exploiting Network Locality in a Decentralized Read-Write Peer-to-Peer File System},
      booktitle = {10th International Conference on Parallel and Distributed Systems (ICPADS 2004)},
      publisher = {IEEE Computer Society},
      year = {2004},
      pages = {289-296}
    }
    
    Picconi, F. & Sens, P. Using incentives to increase availability in a DHT 2006 Third Intenational Workshop on Hot Topics in P2P Systems (Hot-P2P), In conjunction with: IPDPS IEEE International Parallel & Distributed Processing Symposium, Rhodes Island, Greece  inproceedings  
    BibTeX:
    @inproceedings{Picconi06dht,
      author = {Fabio Picconi and Pierre Sens},
      title = {Using incentives to increase availability in a DHT},
      booktitle = {Third Intenational Workshop on Hot Topics in P2P Systems (Hot-P2P), In conjunction with: IPDPS IEEE International Parallel & Distributed Processing Symposium, Rhodes Island, Greece},
      year = {2006}
    }
    
    Plaxton, C.G., Rajaraman, R. & Richa, A.W. Accessing nearby copies of replicated objects in a distributed environment 1997 Proceedings of the 9th annual ACM symposium on Parallel algorithms and architectures (SPAA'97), pp. 311-320  inproceedings DOI  
    BibTeX:
    @inproceedings{Plaxton1997,
      author = {Plaxton,, C. Greg and Rajaraman,, Rajmohan and Richa,, Andréa W.},
      title = {Accessing nearby copies of replicated objects in a distributed environment},
      booktitle = {Proceedings of the 9th annual ACM symposium on Parallel algorithms and architectures (SPAA'97)},
      publisher = {ACM},
      year = {1997},
      pages = {311--320},
      doi = {http://doi.acm.org/10.1145/258492.258523}
    }
    
    Pouwelse, J.A., Garbacki, P., Epema, D.H.J. & Sips, H.J. The Bittorrent P2p File-Sharing System: Measurements And Analysis 2005 4th International Workshop on Peer-to-Peer Systems (IPTPS)4th International Workshop on Peer-to-Peer Systems (IPTPS)  inproceedings URL 
    Abstract: Of the many P2P file-sharing prototypes in existence, BitTorrent is one of the few that has managed to attract millions of users. BitTorrent relies on other (global) components for file search, employs a moderator system to ensure the integrity of file data, and uses a bartering technique for downloading in order to prevent users from freeriding. In this paper we present a measurement study of BitTorrent in which we focus on four issues, viz. availability, integrity, flashcrowd handling, and...
    BibTeX:
    @inproceedings{bittorrent05perf,
      author = {Pouwelse, J. A. and Garbacki, P. and Epema, D. H. J. and Sips, H. J. },
      title = {The Bittorrent P2p File-Sharing System: Measurements And Analysis},
      booktitle = {4th International Workshop on Peer-to-Peer Systems (IPTPS)},
      journal = {4th International Workshop on Peer-to-Peer Systems (IPTPS)},
      year = {2005},
      url = {http://citeseer.ist.psu.edu/725723.html}
    }
    
    Ramabhadran, S. & Pasquale, J. Durability of replicated distributed storage systems 2008 Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS'08), pp. 447-448  inproceedings DOI  
    BibTeX:
    @inproceedings{Ramabhadran08durability,
      author = {Sriram Ramabhadran and Joseph Pasquale},
      title = {Durability of replicated distributed storage systems},
      booktitle = {Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS'08)},
      publisher = {ACM},
      year = {2008},
      pages = {447--448},
      doi = {http://doi.acm.org/10.1145/1375457.1375514}
    }
    
    Ramabhadran, S. & Pasquale, J. Analysis of the Durability of Replicated Distributed Storage Systems 2007 (CS2007-0900)  techreport  
    BibTeX:
    @techreport{Ramabhadran2007durability,
      author = {Sriram Ramabhadran and Joseph Pasquale},
      title = {Analysis of the Durability of Replicated Distributed Storage Systems},
      year = {2007},
      number = {CS2007-0900}
    }
    
    Ramabhadran, S. & Pasquale, J. A Resource Allocation Problem in Replicated Peer-to-Peer Storage Systems 2007 Proceedings of IEEE International Symposium on Parallel and Distributed Processing (IPDPS'07), pp. 1-8  inproceedings DOI  
    BibTeX:
    @inproceedings{Ramabhadran2007resource,
      author = {Sriram Ramabhadran and Joseph Pasquale},
      title = {A Resource Allocation Problem in Replicated Peer-to-Peer Storage Systems},
      booktitle = {Proceedings of IEEE International Symposium on Parallel and Distributed Processing (IPDPS'07)},
      year = {2007},
      pages = {1-8},
      doi = {http://dx.doi.org/10.1109/IPDPS.2007.370651}
    }
    
    Ramabhadran, S. & Pasquale, J. Analysis of Long-Running Replicated Systems 2006 Proceedings of 25th IEEE International Conference on Computer Communications (INFOCOM'06), pp. 1-9  inproceedings DOI  
    BibTeX:
    @inproceedings{Ramabhadran06repl,
      author = {Sriram Ramabhadran and Joseph Pasquale},
      title = {Analysis of Long-Running Replicated Systems},
      booktitle = {Proceedings of 25th IEEE International Conference on Computer Communications (INFOCOM'06)},
      year = {2006},
      pages = {1-9},
      doi = {http://dx.doi.org/10.1109/INFOCOM.2006.130}
    }
    
    Randriamaro, C., Soyez, O. & Utard, G. Us : Prototype de stockage pair 'a pair 2003   techreport  
    BibTeX:
    @techreport{LaRIA-2003-09,
      author = {Cyril Randriamaro and Olivier Soyez and Gil Utard},
      title = {Us : Prototype de stockage pair 'a pair},
      year = {2003}
    }
    
    Randriamaro, C., Soyez, O., Utard, G. & Wlazinski, F. Structured data mapping in a Peer to Peer storage system 2006 NOTERE 2006, France, Toulouse  inproceedings  
    BibTeX:
    @inproceedings{NOTERE06,
      author = {Cyril Randriamaro and Olivier Soyez and Gil Utard and Francis Wlazinski},
      title = {Structured data mapping in a Peer to Peer storage system},
      booktitle = {NOTERE 2006, France, Toulouse},
      year = {2006}
    }
    
    Randriamaro, C., Soyez, O., Utard, G. & Wlazinski, F. Data distribution in a peer to peer storage system 2006 Journal of Grid Computing (JoGC), Special issue on Global and Peer-to-Peer Computing, LNCS
    Vol. 4(3), pp. 311-321 
    article  
    BibTeX:
    @article{Rand06datadist,
      author = {Cyril Randriamaro and Olivier Soyez and Gil Utard and Francis Wlazinski},
      title = {Data distribution in a peer to peer storage system},
      journal = {Journal of Grid Computing (JoGC), Special issue on Global and Peer-to-Peer Computing, LNCS},
      year = {2006},
      volume = {4},
      number = {3},
      pages = {311-321}
    }
    
    Randriamaro, C., Soyez, O., Utard, G. & Wlazinski, F. Data distribution in a peer to peer storage system 2005 GP2PC05 2005, UK, Cardiff  inproceedings  
    BibTeX:
    @inproceedings{GP2PC05,
      author = {Cyril Randriamaro and Olivier Soyez and Gil Utard and Fancis Wlazinski},
      title = {Data distribution in a peer to peer storage system},
      booktitle = {GP2PC05 2005, UK, Cardiff},
      year = {2005}
    }
    
    Randriamaro, C., Soyez, O., Utard, G. & Wlazinski, F. Data distribution for failure correlation management in a Peer to Peer Storage 2005 ISPDC 2005, France, Lille  inproceedings  
    BibTeX:
    @inproceedings{ISPDC05,
      author = {Cyril Randriamaro and Olivier Soyez and Gil Utard and Francis Wlazinski},
      title = {Data distribution for failure correlation management in a Peer to Peer Storage},
      booktitle = {ISPDC 2005, France, Lille},
      year = {2005}
    }
    
    Randriamaro, C., Soyez, O., Utard, G. & Wlazinski, F. On the load sharing in P2P data reconstruction process 2005   techreport  
    BibTeX:
    @techreport{LaRIA-2005-01,
      author = {Cyril Randriamaro and Olivier Soyez and Gil Utard and Francis Wlazinski},
      title = {On the load sharing in P2P data reconstruction process},
      year = {2005}
    }
    
    Randriamaro, C., Soyez, O., Utard, G. & Wlazinski, F. Data distribution in a peer to peer storage system 2004   techreport  
    BibTeX:
    @techreport{LaRIA-2004-08,
      author = {Cyril Randriamaro and Olivier Soyez and Gil Utard and Francis Wlazinski},
      title = {Data distribution in a peer to peer storage system},
      year = {2004}
    }
    
    Ratnasamy, S., Francis, P., Handley, M., Karp, R. & Shenker, S. A Scalable Content-Addressable Network 2001 Proceedings of ACM SIGCOMM  inproceedings  
    BibTeX:
    @inproceedings{can01ratnasamy,
      author = {Sylvia Ratnasamy and Paul Francis and Mark Handley and Richard Karp and Scott Shenker},
      title = {A Scalable Content-Addressable Network},
      booktitle = {Proceedings of ACM SIGCOMM},
      year = {2001}
    }
    
    van Renesse, R. Efficient Reliable Internet Storage 2004 Workshop on Dependable Distributed Data Management  inproceedings  
    BibTeX:
    @inproceedings{Renesse2004,
      author = {Robbert van Renesse},
      title = {Efficient Reliable Internet Storage},
      booktitle = {Workshop on Dependable Distributed Data Management},
      year = {2004}
    }
    
    van Renesse, R. & Schneider, F.B. Chain replication for supporting high throughput and availability 2004 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation (OSDI'04), pp. 7-7  inproceedings URL 
    BibTeX:
    @inproceedings{Renesse2004chain,
      author = {Robbert van Renesse and Fred B. Schneider},
      title = {Chain replication for supporting high throughput and availability},
      booktitle = {Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation (OSDI'04)},
      publisher = {USENIX Association},
      year = {2004},
      pages = {7--7},
      url = {http://www.usenix.org/events/osdi04/tech/full_papers/renesse/renesse.pdf}
    }
    
    Rhea, S., Eaton, P., Geels, D., Weatherspoon, H., Zhao, B. & Kubiatowicz, J. Pond: The OceanStore Prototype 2003 Proceedings of USENIX Conference on File and Storage Technologies (FAST '03), pp. 1-14  inproceedings  
    BibTeX:
    @inproceedings{Rhea2003pond,
      author = {Sean Rhea and Patrick Eaton and Dennis Geels and Hakim Weatherspoon and Ben Zhao and John Kubiatowicz},
      title = {Pond: The OceanStore Prototype},
      booktitle = {Proceedings of USENIX Conference on File and Storage Technologies (FAST '03)},
      publisher = {USENIX Association},
      year = {2003},
      pages = {1--14}
    }
    
    Rieche, S., Wehrle, K., Landsiedel, O., Gotz, S. & Petrak, L. Reliability of data in structured peer-to-peer systems 2004 International Workshop on Hot Topics in Peer-to-Peer Systems (HotP2P'04), pp. 108-113  inproceedings URL 
    Abstract: Peer-to-peer (P2P) systems are very useful for managing large amounts of widely distributed data. For this purpose distributed hash tables (DHT) offer a highly scalable and self-organizing paradigm for efficient distribution and retrieval of data. Thereby a common assumption of P2P systems is, that the participating nodes are unreliable and may fail at any time. Since many of research goes into the design of DHT lookup services, these systems aim to provide a stable global addressing structure. But to storage data reliable in a DHT only few techniques were already developed. However since data has to be stored persistent in the network, it should be retrieved anytime, even if nodes fail. In this work we discuss possibilities to store data fault tolerant in a structured peer-to-peer system.
    BibTeX:
    @inproceedings{Rieche04reliability,
      author = {Rieche, S. and Wehrle, K. and Landsiedel, O. and Gotz, S. and Petrak, L. },
      title = {Reliability of data in structured peer-to-peer systems},
      booktitle = {International Workshop on Hot Topics in Peer-to-Peer Systems (HotP2P'04)},
      year = {2004},
      pages = {108--113},
      url = {http://ieeexplore.ieee.org/xpls/absall.jsp?arnumber=1376623}
    }
    
    Riley, G. & Ammar, M. Simulating Large Networks: How Big is Big Enough? 2002 Proceedings of First International Conference on Grand Challenges for Modeling and Simulation  inproceedings  
    BibTeX:
    @inproceedings{bigenough,
      author = {George Riley and Mostafa Ammar},
      title = {Simulating Large Networks: How Big is Big Enough?},
      booktitle = {Proceedings of First International Conference on Grand Challenges for Modeling and Simulation},
      year = {2002}
    }
    
    Riley, G.F., Fujimoto, R.M. & Ammar, M.H. A Generic Framework for Parallelization of Network Simulations 1999 MASCOTS '99: Proceedings of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp. 128  inproceedings  
    BibTeX:
    @inproceedings{pdns,
      author = {George F. Riley and Richard M. Fujimoto and Mostafa H. Ammar},
      title = {A Generic Framework for Parallelization of Network Simulations},
      booktitle = {MASCOTS '99: Proceedings of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems},
      publisher = {IEEE Computer Society},
      year = {1999},
      pages = {128}
    }
    
    Rodrigues, R. & Liskov, B. High Availability in DHTs: Erasure Coding vs. Replication 2005 Peer-to-Peer Systems IV, pp. 226-239  incollection DOI URL 
    Abstract: High availability in peer-to-peer DHTs requires data redundancy. This paper compares two popular redundancy schemes: replication and erasure coding. Unlike previous comparisons, we take the characteristics of the nodes that comprise the overlay into account, and conclude that in some cases the benefits from coding are limited, and may not be worth its disadvantages.
    BibTeX:
    @incollection{Rodrigues2005,
      author = {Rodrigues, Rodrigo and Liskov, Barbara},
      title = {High Availability in DHTs: Erasure Coding vs. Replication},
      booktitle = {Peer-to-Peer Systems IV},
      publisher = {LNCS},
      year = {2005},
      pages = {226--239},
      url = {http://dx.doi.org/10.1007/1155898921},
      doi = {http://dx.doi.org/10.1007/11558989\_21}
    }
    
    Rodriguez, A., Killian, C., Bhat, S., Kostic, D. & Vahdat, A. MACEDON: methodology for automatically creating, evaluating, and designing overlay networks 2004 NSDI'04: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation, pp. 267-280  inproceedings URL 
    Abstract: Currently, researchers designing and implementing large-scale overlay services employ disparate techniques at each stage in the production cycle: design, implementation, experimentation, and evaluation. As a result, complex and tedious tasks are often duplicated leading to ineffective resource use and difficulty in fairly comparing competing algorithms. In this paper, we present MACEDON, an infrastructure that provides facilities to: i) specify distributed algorithms in a concise domain-specific language; ii) generate code that executes in popular evaluation infrastructures and in live networks; iii) leverage an overlay-generic API to simplify the interoperability of algorithm implementations and applications; and iv) enable consistent experimental evaluation. We have used MACEDON to implement and evaluate a number of algorithms, including AMMO, Bullet, Chord, NICE, Overcast, Pastry, Scribe, and SplitStream, typically with only a few hundred lines of MACEDON code. Using our infrastructure, we are able to accurately reproduce or exceed published results and behavior demonstrated by current publicly available implementations.
    BibTeX:
    @inproceedings{macedon2004Rodriguez,
      author = {Rodriguez, Adolfo and Killian, Charles and Bhat, Sooraj and Kostic, Dejan and Vahdat, Amin },
      title = {MACEDON: methodology for automatically creating, evaluating, and designing overlay networks},
      booktitle = {NSDI'04: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation},
      publisher = {USENIX Association},
      year = {2004},
      pages = {267--280},
      url = {http://portal.acm.org/citation.cfm?id=1251195}
    }
    
    Rowstron, A. & Druschel, P. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems 2001 Lecture Notes In Computer Science
    Vol. 2218IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pp. 329-350 
    inproceedings  
    BibTeX:
    @inproceedings{pastry01rowstron,
      author = {Rowstron, A. and Druschel, P.},
      title = {Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems},
      booktitle = {IFIP/ACM International Conference on Distributed Systems Platforms (Middleware)},
      journal = {Lecture Notes In Computer Science},
      publisher = {Springer},
      year = {2001},
      volume = {2218},
      pages = {329--350}
    }
    
    Rowstron, A. & Druschel, P. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility 2001 Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01), pp. 188-201  inproceedings URL 
    BibTeX:
    @inproceedings{Rowstron2001past,
      author = {Antony Rowstron and Peter Druschel},
      title = {Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility},
      booktitle = {Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01)},
      publisher = {ACM Press},
      year = {2001},
      pages = {188--201},
      url = {http://doi.acm.org/10.1145/502034.502053}
    }
    
    Saito, Y., Karamanolis, C., Karlsson, M. & Mahalingam, M. Taming aggressive replication in the Pangaea wide-area file system 2002 SIGOPS Operating Systems Review
    Vol. 36(SI), pp. 15-30 
    article DOI  
    BibTeX:
    @article{pangaea02saito,
      author = {Yasushi Saito and Christos Karamanolis and Magnus Karlsson and Mallik Mahalingam},
      title = {Taming aggressive replication in the Pangaea wide-area file system},
      journal = {SIGOPS Operating Systems Review},
      publisher = {ACM},
      year = {2002},
      volume = {36},
      number = {SI},
      pages = {15--30},
      doi = {http://doi.acm.org/10.1145/844128.844131}
    }
    
    Schlosser, M., Condie, T. & Kamvar, S. Simulating a File-Sharing P2P Network 2003 1st Workshop on Semantics in P2P and Grid Computing  inproceedings  
    BibTeX:
    @inproceedings{Schlo2003simp2p,
      author = {Schlosser, M. and Condie, T. and Kamvar, S. },
      title = {Simulating a File-Sharing P2P Network},
      booktitle = {1st Workshop on Semantics in P2P and Grid Computing},
      year = {2003}
    }
    
    Schollmeier, Rü. A Definition of Peer-to-Peer Networking for the Classification of Peer-to-Peer Architectures and Applications 2001 Peer-to-Peer Computing, pp. 101-102  inproceedings URL 
    BibTeX:
    @inproceedings{p2pdef2001Schollmeier,
      author = {Rüdiger Schollmeier},
      title = {A Definition of Peer-to-Peer Networking for the Classification of Peer-to-Peer Architectures and Applications},
      booktitle = {Peer-to-Peer Computing},
      year = {2001},
      pages = {101-102},
      url = {http://csdl.computer.org/comp/proceedings/p2p/2001/1503/00/15030101.pdf}
    }
    
    Schroeder, B. & Gibson, G. Disk Failures in the Real World: What Does an MTTF of 1,000,000 Hours Mean to You? 2007 Proc. of the FAST'07 Conference on File and Storage Technologies  conference  
    BibTeX:
    @conference{SG07,
      author = {Schroeder, B. and Gibson, G.A.},
      title = {Disk Failures in the Real World: What Does an MTTF of 1,000,000 Hours Mean to You?},
      booktitle = {Proc. of the FAST'07 Conference on File and Storage Technologies},
      year = {2007}
    }
    
    Shen, H. EAD: An Efficient and Adaptive Decentralized File Replication Algorithm in P2P File Sharing Systems 2008
    Vol. 0IEEE International Conference on Peer-to-Peer Computing, pp. 99-108 
    inproceedings DOI  
    BibTeX:
    @inproceedings{Shen2008ead,
      author = {Haiying Shen},
      title = {EAD: An Efficient and Adaptive Decentralized File Replication Algorithm in P2P File Sharing Systems},
      booktitle = {IEEE International Conference on Peer-to-Peer Computing},
      year = {2008},
      volume = {0},
      pages = {99-108},
      doi = {http://doi.ieeecomputersociety.org/10.1109/P2P.2008.37}
    }
    
    Shudo, K., Tanaka, Y. & Sekiguchi, S. Overlay Weaver: An overlay construction toolkit 2008 Computer Communications
    Vol. 31(2), pp. 402 - 412 
    article DOI URL 
    Abstract: A layered model of structured overlays has been proposed and it enabled development of a routing layer independently of higher-level services such as DHT and multicast. The routing layer has to include other part than a routing algorithm, which is essential for routing. It is routing process, which is common to various routing algorithms and can be decoupled from a routing algorithm. We demonstrated the decomposition by implementing an overlay construction toolkit Overlay Weaver. It facilitates implementation of routing algorithms and we could multiple well-known algorithms just in hundreds of lines of code with the toolkit. The decomposition also enables multiple implementations of the common routing process. Two implementations the toolkit provides perform iterative and recursive routing, respectively. Additionally, to our knowledge, the toolkit is the first feasibility proof of the layered model by supporting multiple algorithms and the higher-level services. Such modular design contributes to our goal, which is facilitation of rapid development of realistic routing algorithms and their application. We demonstrates that Overlay Weaver supports the goal by conducting large-scale tests and comparisons of algorithms on a single computer. The resulting algorithm implementations work on a real TCP/IP network as it is.
    BibTeX:
    @article{overlayweaver2008Shudo,
      author = {Kazuyuki Shudo and Yoshio Tanaka and Satoshi Sekiguchi},
      title = {Overlay Weaver: An overlay construction toolkit},
      journal = {Computer Communications},
      year = {2008},
      volume = {31},
      number = {2},
      pages = {402 - 412},
      note = {Special Issue: Foundation of Peer-to-Peer Computing},
      url = {http://www.sciencedirect.com/science/article/B6TYP-4PDSBPN-1/2/3f964b6301dea77ff4bf68eb9af67c3a},
      doi = {DOI: 10.1016/j.comcom.2007.08.002}
    }
    
    Soyez, O. Us : Prototype de stockage pair 'a pair 2003 RENPAR 2003, la Colle sur Loup, France, pp. 214-218  inproceedings  
    BibTeX:
    @inproceedings{RENPAR2003,
      author = {Olivier Soyez},
      title = {Us : Prototype de stockage pair 'a pair},
      booktitle = {RENPAR 2003, la Colle sur Loup, France},
      year = {2003},
      pages = {214-218}
    }
    
    Stirling, A.B. & Stirling, M.K. Tools for Peer-to-Peer Network Simulation 2006 Internet Draft IRTF P2PRG  booklet URL 
    BibTeX:
    @booklet{Stirling2006p2prg,
      author = {A. Brown Stirling and M. Kolberg Stirling},
      title = {Tools for Peer-to-Peer Network Simulation},
      year = {2006},
      url = {http://tools.ietf.org/html/draft-irtf-p2prg-core-simulators-00}
    }
    
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F. & Balakrishnan, H. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications 2003 IEEE ACM Transactions on Networking
    Vol. 11(1), pp. 17-31  
    article  
    BibTeX:
    @article{chord03stoica,
      author = {I. Stoica and R. Morris and D. Karger and M. F. Kaashoek and H. Balakrishnan},
      title = {Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications },
      journal = {IEEE ACM Transactions on Networking },
      year = {2003},
      volume = {11},
      number = {1},
      pages = {17--31 }
    }
    
    Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, F.F., Dabek, F. & Balakrishnan, H. Chord: a scalable peer-to-peer lookup protocol for internet applications 2003 IEEE/ACM Transactions on Networking
    Vol. 11(1), pp. 17-32 
    article DOI URL 
    BibTeX:
    @article{Stoica2003chord,
      author = {Stoica, Ion and Morris, Robert and Liben-Nowell, David and Karger, David R. and Kaashoek, Frans F. and Dabek, Frank and Balakrishnan, Hari},
      title = {Chord: a scalable peer-to-peer lookup protocol for internet applications},
      journal = {IEEE/ACM Transactions on Networking},
      publisher = {ACM Press},
      year = {2003},
      volume = {11},
      number = {1},
      pages = {17--32},
      url = {http://dx.doi.org/10.1109/TNET.2002.808407},
      doi = {http://dx.doi.org/10.1109/TNET.2002.808407}
    }
    
    Stribling, J., Hildrum, K. & Kubiatowicz, J.D. Optimizations for Locality-Aware Structured Peer-to-Peer Overlays 2003 (UCB/CSD-03-1266)  techreport  
    BibTeX:
    @techreport{stribtr03localopt,
      author = {Jeremy Stribling and Kirsten Hildrum and John D. Kubiatowicz},
      title = {Optimizations for Locality-Aware Structured Peer-to-Peer Overlays},
      year = {2003},
      number = {UCB/CSD-03-1266}
    }
    
    Tati, K., Tati, K. & Voelker, G.M. On Object Maintenance in Peer-to-Peer Systems 2006 In Proc. of the 5th International Workshop on Peer-to-Peer Systems (IPTPS)  inproceedings  
    BibTeX:
    @inproceedings{tati06onobject,
      author = {Kiran Tati And and Kiran Tati and Geoffrey M. Voelker},
      title = {On Object Maintenance in Peer-to-Peer Systems},
      booktitle = {In Proc. of the 5th International Workshop on Peer-to-Peer Systems (IPTPS)},
      year = {2006}
    }
    
    Theotokis, S.A. & Spinellisa, D. A survey of peer-to-peer content distribution technologies 2004 ACM Computing Surveys (CSUR)
    Vol. 36(4), pp. 335-371 
    article DOI URL 
    Abstract: Distributed computer architectures labeled "peer-to-peer" are designed for the sharing of computer resources (content, storage, CPU cycles) by direct exchange, rather than requiring the intermediation or support of a centralized server or authority. Peer-to-peer architectures are characterized by their ability to adapt to failures and accommodate transient populations of nodes while maintaining acceptable connectivity and performance. Content distribution is an important peer-to-peer application on the Internet that has received considerable research attention. Content distribution applications typically allow personal computers to function in a coordinated manner as a distributed storage medium by contributing, searching, and obtaining digital content. In this survey, we propose a framework for analyzing peer-to-peer content distribution technologies. Our approach focuses on nonfunctional characteristics such as security, scalability, performance, fairness, and resource management potential, and examines the way in which these characteristics are reflected in--and affected by--the architectural design decisions adopted by current peer-to-peer systems. We study current peer-to-peer systems and infrastructure technologies in terms of their distributed object location and routing mechanisms, their approach to content replication, caching and migration, their support for encryption, access control, authentication and identity, anonymity, deniability, accountability and reputation, and their use of resource trading and management schemes.
    BibTeX:
    @article{Theotokis2004p2psurvey,
      author = {Theotokis, Stephanos A. and Spinellisa, Diomidis },
      title = {A survey of peer-to-peer content distribution technologies},
      journal = {ACM Computing Surveys (CSUR)},
      publisher = {ACM Press},
      year = {2004},
      volume = {36},
      number = {4},
      pages = {335--371},
      url = {http://dx.doi.org/10.1145/1041680.1041681},
      doi = {http://dx.doi.org/10.1145/1041680.1041681}
    }
    
    Ting, N.S. Simulating Peer-to-Peer Networks 2006 School: University of Saskatchewan Library  mastersthesis URL 
    BibTeX:
    @mastersthesis{Ting2006p2psim,
      author = {Ting, Nyik San},
      title = {Simulating Peer-to-Peer Networks},
      school = {University of Saskatchewan Library},
      year = {2006},
      url = {http://library2.usask.ca/theses/available/etd-08242006-232052/}
    }
    
    Ting, N.S. A Generic Peer-to-Peer Network Simulator 2003 Proceedings of the 2002-2003 Grad Symposium, CS Dept, University of Saskatchewan  inproceedings  
    BibTeX:
    @inproceedings{genericp2p2003Ting,
      author = {Nyik San Ting},
      title = {A Generic Peer-to-Peer Network Simulator},
      booktitle = {Proceedings of the 2002-2003 Grad Symposium, CS Dept, University of Saskatchewan},
      year = {2003}
    }
    
    Ting, N.S. & Deters, R. 3LS---A Peer-to-Peer Network Simulator 2003 Proceedings of the 3rd International Conference on Peer-to-Peer Computing (P2P'03), pp. 212  inproceedings DOI  
    BibTeX:
    @inproceedings{3ls2003Ting,
      author = {Nyik San Ting and Ralph Deters},
      title = {3LS---A Peer-to-Peer Network Simulator},
      booktitle = { Proceedings of the 3rd International Conference on Peer-to-Peer Computing (P2P'03)},
      publisher = {IEEE Computer Society},
      year = {2003},
      pages = {212},
      doi = {http://doi.ieeecomputersociety.org/10.1109/PTP.2003.1231530}
    }
    
    Utard, G. Perennité dans les systèmes de stockage pair à pair 2002 Ecole GRID 2002  inproceedings  
    BibTeX:
    @inproceedings{Aussois,
      author = {Gil Utard},
      title = {Perennité dans les systèmes de stockage pair à pair},
      booktitle = {Ecole GRID 2002},
      year = {2002}
    }
    
    Utard, G. & Vernois, A. Data Durability in Peer to Peer Storage Systems 2004 4th IEEE Workshop on Global and Peer to Peer Computing  inproceedings  
    BibTeX:
    @inproceedings{UtaVer04,
      author = {Gil Utard and Antoine Vernois},
      title = {Data Durability in Peer to Peer Storage Systems},
      booktitle = {4th IEEE Workshop on Global and Peer to Peer Computing},
      year = {2004}
    }
    
    Utard, G. & Vernois, A. Data durability in peer to peer storage systems 2004 CCGRID '04: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid, pp. 90-97  inproceedings  
    BibTeX:
    @inproceedings{UtVe04,
      author = {G. Utard and A. Vernois},
      title = {Data durability in peer to peer storage systems},
      booktitle = {CCGRID '04: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid},
      year = {2004},
      pages = {90--97}
    }
    
    Varga, A. OMNet++: Discrete Event Simulation Systems http://www.omnetpp.org/  misc  
    BibTeX:
    @misc{omnetUrl,
      author = {András Varga},
      title = {OMNet++: Discrete Event Simulation Systems},
      note = {Last accessed: Nov. 2008}
    }
    
    Vernois, A. Pérennité dans les système de stockage pair à pair 2003 15ieme~Rencontres Francophones en Parallelisme, La Colle sur Loup, France  inproceedings  
    BibTeX:
    @inproceedings{Ver03,
      author = {Antoine Vernois},
      title = {Pérennité dans les système de stockage pair à pair},
      booktitle = {15ieme~Rencontres Francophones en Parallelisme, La Colle sur Loup, France},
      year = {2003}
    }
    
    Vernois, A. Etude quantitative de la pérennité dans les systèmes de stockage pair-à-pair 2002 School: école Normale Supérieure de Lyon  mastersthesis  
    BibTeX:
    @mastersthesis{Ver02,
      author = {Antoine Vernois},
      title = {Etude quantitative de la pérennité dans les systèmes de stockage pair-à-pair},
      school = {école Normale Supérieure de Lyon},
      year = {2002}
    }
    
    Walsh, K. & Sirer, E.G. Staged simulation: A general technique for improving simulation scale and performance 2004 ACM Trans. Model. Comput. Simul.
    Vol. 14(2), pp. 170-195 
    article DOI  
    BibTeX:
    @article{stagedsim,
      author = {Kevin Walsh and Emin G&252;n Sirer},
      title = {Staged simulation: A general technique for improving simulation scale and performance},
      journal = {ACM Trans. Model. Comput. Simul.},
      publisher = {ACM Press},
      year = {2004},
      volume = {14},
      number = {2},
      pages = {170--195},
      doi = {http://doi.acm.org/10.1145/985793.985797}
    }
    
    Weatherspoon, H. Design and evaluation of distributed wide-area on-line archival storage systems 2006 School: University of California at Berkeley  phdthesis  
    BibTeX:
    @phdthesis{Weatherspoon2006phdthesis,
      author = {Weatherspoon,, Hakim},
      title = {Design and evaluation of distributed wide-area on-line archival storage systems},
      publisher = {University of California at Berkeley},
      school = {University of California at Berkeley},
      year = {2006},
      note = {Adviser-Kubiatowicz,, John}
    }
    
    Weatherspoon, H. & Kubiatowicz, J. Erasure coding vs. replication: A quantitative comparison 2002
    Vol. 2Proc. of IPTPS, pp. 328-338 
    conference  
    BibTeX:
    @conference{WeKu02,
      author = {Weatherspoon, H. and Kubiatowicz, J.},
      title = {Erasure coding vs. replication: A quantitative comparison},
      booktitle = {Proc. of IPTPS},
      year = {2002},
      volume = {2},
      pages = {328--338}
    }
    
    Wells, C. The OceanStore Archive: Goals, Structures, and Self-Repair 2001 School: University of California, Berkeley  mastersthesis  
    BibTeX:
    @mastersthesis{Wells2001oceanstore,
      author = {Chris Wells},
      title = {The OceanStore Archive: Goals, Structures, and Self-Repair},
      school = {University of California, Berkeley},
      year = {2001}
    }
    
    Yang, W. & Abu-Ghazaleh, N. GPS: a general peer-to-peer simulator and its use for modeling BitTorrent 2005 Proceedings of 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS'05), pp. 425-432  inproceedings URL 
    Abstract: Peer-to-Peer (P2P) systems have become popular over the past few years. However, their large scale and the open nature of the system makes studying them challenging. This paper presents an extensible framework for simulating P2P networks efficiently and accurately. Efficiency is accomplished by using message level simulation rather than packet level simulation. Moreover, accuracy is maintained by tracking the network infrastructure and using a flow model to accomplish accurate estimate of the message behavior. A second contribution of the paper is to model the BitTorrent (BT) protocol. BT is a widely-used protocol that is significantly more complex than other P2P protocols because file download occurs in chunks from many other peers concurrently. Thus, contrary to models of other P2P systems such as Gnutella or Freenet, which focus on finding the location of a file in the network, BT's complexity occurs in downloading files (locating files in fact occurs out of band using Websites that host the Torrent files). We validate the model against a packet level simulator and also using a real, but small scale, BitTorrent experiment. The simulator is object oriented and extensible for simulating other P2P protocols and applications.
    BibTeX:
    @inproceedings{gps2005Yang,
      author = {Yang, W. and Abu-Ghazaleh, N},
      title = {GPS: a general peer-to-peer simulator and its use for modeling BitTorrent},
      booktitle = {Proceedings of 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS'05)},
      year = {2005},
      pages = {425--432},
      url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1521163}
    }
    
    Yianilos, P.N. & Sobti, S. The Evolving Field of Distributed Storage 2001 IEEE Internet Computing
    Vol. 5(5), pp. 35-39 
    article DOI  
    BibTeX:
    @article{survey,
      author = {Peter N. Yianilos and Sumeet Sobti},
      title = {The Evolving Field of Distributed Storage},
      journal = {IEEE Internet Computing},
      publisher = {IEEE Computer Society},
      year = {2001},
      volume = {5},
      number = {5},
      pages = {35-39},
      doi = {http://doi.ieeecomputersociety.org/10.1109/4236.957893}
    }
    
    Zegura, E.W., Calvert, K.L. & Bhattacharjee, S. How to Model an Internetwork 1996 INFOCOM, pp. 594-602  inproceedings  
    BibTeX:
    @inproceedings{Zegura1996model,
      author = {Ellen W. Zegura and Kenneth L. Calvert and Samrat Bhattacharjee},
      title = {How to Model an Internetwork},
      booktitle = {INFOCOM},
      year = {1996},
      pages = {594-602}
    }
    
    Zeigler, B.P., Praehofer, H. & Kim, T.G. Theory of Modeling and Simulation 2000   book  
    BibTeX:
    @book{Zeigler00sim,
      author = {Zeigler, Bernard P. and Praehofer, Herbert and Kim, Tag Gon},
      title = {Theory of Modeling and Simulation},
      publisher = {Academic Press},
      year = {2000},
      edition = {2nd}
    }
    
    Zeng, X., Bagrodia, R. & Gerla, M. GloMoSim: A Library for Parallel Simulation of Large-Scale Wireless Networks 1998 Workshop on Parallel and Distributed Simulation, pp. 154-161  inproceedings  
    BibTeX:
    @inproceedings{glomosim,
      author = {Xiang Zeng and Rajive Bagrodia and Mario Gerla},
      title = {GloMoSim: A Library for Parallel Simulation of Large-Scale Wireless Networks},
      booktitle = {Workshop on Parallel and Distributed Simulation},
      year = {1998},
      pages = {154--161}
    }
    
    Zhang, H., Neglia, G., Towsley, D. & Lo Presti, G. On Unstructured File Sharing Networks 2007 Proc. INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE, pp. 2189-2197  inproceedings DOI  
    BibTeX:
    @inproceedings{Zhang2007unstruc,
      author = {Honggang Zhang and Neglia, G. and Towsley, D. and Lo Presti, G. },
      title = {On Unstructured File Sharing Networks},
      booktitle = {Proc. INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE},
      year = {2007},
      pages = {2189--2197},
      doi = {http://dx.doi.org/10.1109/INFCOM.2007.253}
    }
    
    Zhang, H., Neglia, G., Towsley, D. & Presti, G. Stability and Efficiency of Unstructured File Sharing Networks 2008 IEEE Journal on Selected Areas in Communications
    Vol. 26(7), pp. 1284-1294 
    article DOI  
    BibTeX:
    @article{Zhang2008effic,
      author = {Honggang Zhang and Neglia, G. and Towsley, D. and Presti, G. },
      title = {Stability and Efficiency of Unstructured File Sharing Networks},
      journal = {IEEE Journal on Selected Areas in Communications},
      year = {2008},
      volume = {26},
      number = {7},
      pages = {1284--1294},
      doi = {http://dx.doi.org/10.1109/JSAC.2008.080925}
    }
    
    Zhang, Z., Lin, S., Lian, Q. & Jin, C. RepStore: A Self-Managing and Self-Tuning Storage Backend with Smart Bricks 2004 International Conference on Autonomic Computing
    Vol. 0, pp. 122-129 
    article DOI  
    BibTeX:
    @article{Lian2004repstore,
      author = {Zheng Zhang and Shiding Lin and Qiao Lian and Chao Jin},
      title = {RepStore: A Self-Managing and Self-Tuning Storage Backend with Smart Bricks},
      journal = {International Conference on Autonomic Computing},
      publisher = {IEEE Computer Society},
      year = {2004},
      volume = {0},
      pages = {122-129},
      doi = {http://doi.ieeecomputersociety.org/10.1109/ICAC.2004.50}
    }
    
    Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D. & Kubiatowicz, J. Tapestry: A resilient global-scale overlay for service deployment 2004 IEEE Journal on Selected Areas in Communications
    Vol. 22(1), pp. 41-53 
    article  
    BibTeX:
    @article{tapestry04zhao,
      author = { Ben Y. Zhao and Ling Huang and Jeremy Stribling and Sean C. Rhea and Anthony D. Joseph and John Kubiatowicz},
      title = {Tapestry: A resilient global-scale overlay for service deployment},
      journal = {IEEE Journal on Selected Areas in Communications},
      year = {2004},
      volume = {22},
      number = {1},
      pages = {41--53}
    }
    
    Zhao, B.Y., Kubiatowicz, J.D. & Joseph, A.D. Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing 2001 (UCB/CSD-01-1141)  techreport URL 
    Abstract: In today's chaotic network, data and services are mobile and replicated widely for availability, durability, and locality. Components within this infrastructure interact in rich and complex ways, greatly stressing traditional approaches to name service and routing. This paper explores an alternative to traditional approaches called Tapestry. Tapestry is an overlay location and routing infrastructure that provides location-independent routing of messages directly to the closest copy of an object or service using only point-to-point links and without centralized resources. The routing and directory information within this infrastructure is purely soft state and easily repaired. Tapestry is self-administering, faulttolerant, and resilient under load. This paper presents the architecture and algorithms of Tapestry and explores their advantages through a number of experiments.
    BibTeX:
    @techreport{Zhao2001tapestry,
      author = {Zhao, Ben Y. and Kubiatowicz, John D. and Joseph, Anthony D.},
      title = {Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing},
      publisher = {University of California at Berkeley},
      year = {2001},
      number = {UCB/CSD-01-1141},
      url = {http://portal.acm.org/citation.cfm?id=894116}
    }
    
    Recent Advances in Modeling and Simulation Tools for Communication Networks and Services 2007 , pp. 466  book  
    BibTeX:
    @book{Ince2007modelsim,,
      title = {Recent Advances in Modeling and Simulation Tools for Communication Networks and Services},
      publisher = {Springer},
      year = {2007},
      pages = {466}
    }
    
    BOINC project http://boinc.berkeley.edu/  misc  
    BibTeX:
    @misc{boincUrl,,
      title = {BOINC project},
      note = {Last accessed: Nov. 2008}
    }
    
    DHTSim - Distributed Hash Table Peering Simulators http://www.quarl.org/projects/  misc URL 
    BibTeX:
    @misc{dhtsimUrl,,
      title = {DHTSim - Distributed Hash Table Peering Simulators},
      note = {Last accessed: Nov. 2008},
      url = {http://www.quarl.org/projects/}
    }
    
    FreePastry http://freepastry.org/FreePastry/  misc  
    BibTeX:
    @misc{freepastryUrl,,
      title = {FreePastry},
      note = {Last accessed: Dec. 2008}
    }
    
    GnutellaSim http://www.cc.gatech.edu/computing/compass/gnutella/  misc  
    BibTeX:
    @misc{gnutellasimUrl,,
      title = {GnutellaSim},
      note = {Last accessed: Nob. 2008}
    }
    
    Limewire -- Open Source P2P File Sharing http://www.limewire.org/  misc  
    BibTeX:
    @misc{limewireUrl,,
      title = {Limewire -- Open Source P2P File Sharing},
      note = {Last accessed: Nov 2008}
    }
    
    The MACEDON project http://macedon.ucsd.edu/  misc  
    BibTeX:
    @misc{macedonUrl,,
      title = {The MACEDON project},
      note = {Last accessed: Dec. 2008}
    }
    
    The Mace project http://mace.ucsd.edu/  misc  
    BibTeX:
    @misc{maceUrl,,
      title = {The Mace project},
      note = {Last accessed: Dec. 2008}
    }
    
    The Network Simulator -- NS2 http://nsnam.isi.edu/nsnam/  misc  
    BibTeX:
    @misc{ns2Url,,
      title = {The Network Simulator -- NS2},
      note = {Last accessed: Nov. 2008}
    }
    
    The NS3 Network Simulator http://www.nsnam.org/  misc  
    BibTeX:
    @misc{ns3Url,,
      title = {The NS3 Network Simulator},
      note = {Last accessed: May 2009}
    }
    
    Overlay Weaver - An Overlay Construction Toolkit http://overlayweaver.sourceforge.net/  misc  
    BibTeX:
    @misc{overlayweaverUrl,,
      title = {Overlay Weaver - An Overlay Construction Toolkit},
      note = {Last accessed: Nov. 2008}
    }
    
    The OverSim Simulation Framework http://www.oversim.org/  misc  
    BibTeX:
    @misc{oversimUrl,,
      title = {The OverSim Simulation Framework},
      note = {Last accessed: Dec. 2008}
    }
    
    P2PSim - A Simulator for Peer-to-Peer (P2P) Protocols http://pdos.csail.mit.edu/p2psim/  misc  
    BibTeX:
    @misc{p2psimUrl,,
      title = {P2PSim - A Simulator for Peer-to-Peer (P2P) Protocols},
      note = {Last accessed: Nov. 2008}
    }
    
    PeerSim: A Peer-to-Peer Simulator http://peersim.sourceforge.net/  misc  
    BibTeX:
    @misc{peersimUrl,,
      title = {PeerSim: A Peer-to-Peer Simulator},
      note = {Last accessed: Nov. 2008}
    }
    
    PlanetLab http://www.planet-lab.org/  misc URL 
    BibTeX:
    @misc{planetlabUrl,,
      title = {PlanetLab},
      note = {Last accessed: Nov. 2008},
      url = {http://www.planet-lab.org/}
    }
    
    Seti@Home http://setiathome.berkeley.edu/  misc  
    BibTeX:
    @misc{setihomeUrl,,
      title = {Seti@Home},
      note = {Last accessed: Nov. 2008}
    }
    
    Skype.com http://www.skype.com  misc  
    BibTeX:
    @misc{skypeUrl,,
      title = {Skype.com},
      note = {Last accessed: Dec. 2008}
    }
    
    XtremWeb: the Open Source Platform for Desktop Grids http://www.xtremweb.net/  misc  
    BibTeX:
    @misc{xtremwebUrl,,
      title = {XtremWeb: the Open Source Platform for Desktop Grids},
      note = {Last accessed: Nov. 2008}
    }
    

    Created by JabRef on 13/10/2009.