Performance analysis of peer-to-peer storage systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4516 LNCS, Issue , 2007, Pages 642-653

  Alouf, Sara ^a   Dandoush, Abdulhalim ^a   Nain, Philippe ^a  

^a INRIA   (France)

Author keywords

Absorbing Markov chain; Mean field approximation; Peer to Peer systems; Performance evaluation

Indexed keywords

INFORMATION MANAGEMENT; MARKOV PROCESSES; MEAN FIELD THEORY; NUMERICAL METHODS; PARAMETER ESTIMATION; SERVERS;

ABSORBING MARKOV CHAIN; MEAN FIELD APPROXIMATION; PERFORMANCE EVALUATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 38149127146     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72990-7_57     Document Type: Conference Paper

References (18)

1. Bhagwan, R., Tati, K., Cheng, Y., Savage, S., Voelker, G.M.: Total Recall: System support for automated availability management. In: Proc. of ACM/USENIX NSDI '04, pp. 337-350. San Francisco, California, (March 2004)
2. Blake, C., Rodrigues, R.: High availability, scalable storage, dynamic peer networks: Pick two. In: Proc. of HotOS-IX, Lihue, Hawaii (May 2003)
3. Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 46-66. Springer, Heidelberg (2001)
4. Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: Proc. of ACM SOSP '01, pp. 202-215. Banff, Canada (October 2001)
5. Farsite: Federated, available, and reliable storage for an incompletely trusted environment (2006) http://research.microsoft.com/Farsite/
6. Goldberg, A.V., Yianilos, P.N.: Towards an archival Intermemory. In: Proc. of ADL '98, pp. 147-156. Santa Barbara, California (April 1998)
7. Grinstead, C., Laurie Snell, J.: Introduction to Probability. American Math. Soc. (1997)
8. Kleinrock, L.: Queueing Systems, vol. 1. J. Wiley, New York (1975)
9. Kurtz, T.G.: Solutions of ordinary differential equations as limits of pure jump markov processes. Journal of Applied Probability 7(1), 49-58 (1970)
10. Lin, W.K., Chiu, D.M., Lee, Y.B.: Erasure code replication revisited. In: Proc. of IEEE P2P '04, Zurich, pp. 90-97. Switzerland, (August 2004)
11. Neuts, M.F.: Matrix Geometric Solutions in Stochastic Models. An Algorithmic Approach. John Hopkins University Press, Baltimore (1981)
12. Nurmi, D., Brevik, J., Wolski, R.: Modeling machine availability in enterprise and wide-area distributed computing environments. Technical Report CS2003-28, University of California Santa Barbara (2003)
13. The OceanStore project: Providing global-scale persistent data (2005), http://oceanstore.cs.berkeley.edu/
14. Ramabhadran, S., Pasquale, J.: Analysis of long-running replicated systems. In: Proc. of IEEE INFOCOM '06, Barcelona, Spain (April 2006)
15. Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. Journal of SIAM 8(2), 300-304 (June 1960)
16. Rowstron, A., Druschel, P.: Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In: Proc. of ACM SOSP '01, pp. 188-201. Banff, Canada (October 2001)
17. Utard, G., Vernois, A.: Data durability in peer to peer storage systems. In: Proc. of IEEE GP2PC '04, Chicago, Illinois (April 2004)
18. Weatherspoon, H., Kubiatowicz, J.: Erasure coding vs. replication: A quantitative comparison. In: Proc. of IPTPS '02, Cambridge, Massachusetts (March 2002)