Replica placement in p2p storage: Complexity and game theoretic analyses

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2010, Pages 599-609

  Rzadca, Krzysztof ^a   Datta, Anwitaman ^a   Buchegger, Sonja ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Distributed storage; Equitable optimization; Price of anarchy

Indexed keywords

AVERAGE CASE; CENTRALIZED SYSTEMS; COMPLEXITY ANALYSIS; DATA AVAILABILITY; DECENTRALIZED ALGORITHMS; DECENTRALIZED SYSTEM; DISTRIBUTED STORAGE; DIURNAL PATTERN; EQUITABLE OPTIMIZATION; HIGH PRICE; INFORMATION GATHERING; NP-HARD; OPTIMAL SOLUTIONS; PEER AVAILABILITY; PEER-TO-PEER STORAGE SYSTEMS; PRICE OF ANARCHY; RATIONAL BEHAVIOR; REPLICA PLACEMENT; THEORETIC ANALYSIS; THEORETICAL APPROACH; TIME SLOTS;

COSTS; DISTRIBUTED COMPUTER SYSTEMS; GAME THEORY; OPTIMIZATION;

PEER TO PEER NETWORKS;

EID: 77955881883     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2010.67     Document Type: Conference Paper

References (25)

1. S. Buchegger, D. Schiöberg, L. Vu, and A. Datta, "PeerSoN: P2P social networking: early experiences and insights," in ACM SNS, Proc., 2009.
2. M. Feldman, K. Lai, J. Chuang, and I. Stoica, "Quantifying disincentives in peer-to-peer networks," in P2P Econ, Proc., 2003.
3. M. Babaioff, J. Chuang, and M. Feldman, Algorithmic Game Theory. Cambridge, 2007, ch. Incentives in Peer-to-Peer Systems, pp. 593-611.
4. R. Bhagwan, S. Savage, and G. Voelker, "Understanding availability," in IPTPS, Proc., ser. LNCS, vol. 2735. Springer, 2003, pp. 256-267.
5. J. Douceur and R. Wattenhofer, "Competitive hill-climbing strategies for replica placement in a distributed file system," in DISC, Proc., ser. LNCS, vol. 2180. Springer, 2001, pp. 48-62.
6. S. Bernard and F. Le Fessant, "Optimizing peer-to-peer backup using lifetime estimations," in Damap Proc., 2009.
7. R. Bhagwan, K. Tati, Y. Cheng, S. Savage, and G. Voelker, "Total recall: System support for automated availability management," in NSDI, Proc., 2004.
8. J. Douceur, "Is remote host availability governed by a universal law?" ACM SIGMETRICS Performance Evaluation Review, vol. 31, no. 3, pp. 25-29, 2003.
9. M. Steiner, T. En-Najjary, and E. Biersack, "Long term study of peer behavior in the kad dht," IEEE/ACM Transactions on Networking, vol. 17, no. 6, 2009.
10. E. Koutsoupias and C. Papadimitriou, "Worst-case equilibria," in STACS, Proc., ser. LNCS, no. 1563. Springer, 1999, pp. 404-413.
11. R. Rodrigues and B. Liskov, "High availability in dhts: Erasure coding vs. replication," in IPTPS, Proc., ser. LNCS, vol. 3640. Springer, 2005.
12. F. Le Fessant, C. Sengul, and A. Kermarrec, "Pace-maker: Tracking peer availability in large networks," INRIA, Tech. Rep. RR-6594, 2008.
13. M. Kostreva, W. Ogryczak, and A. Wierzbicki, "Equitable aggregations and multiple criteria analysis," European Journal of Operational Research, vol. 158, no. 2, pp. 362-377, 2004.
14. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi, Complexity and approximation. Springer, 1999.
15. M. Osborne, An introduction to game theory. Oxford University Press, 2004.
16. M. Jelasity and O. Babaoglu, "T-man: Gossip-based overlay topology management," in ESOA, Proc., ser. LNCS, vol. 3910. Springer, 2006.
17. A. Rowstron and P. Druschel, "Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems," in Middleware Proc., ser. LNCS, vol. 2218. Springer, 2001, pp. 329-350.
18. A. Fabrikant, A. Luthra, E. Maneva, C. Papadimitriou, and S. Shenker, "On a network creation game," in PODC, Proc. ACM, 2003, pp. 347-351.
19. T. Moscibroda, S. Schmid, and R. Wattenhofer, "On the topologies formed by selfish peers," in Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing. ACM New York, NY, USA, 2006, pp. 133-142.
20. R. Bhagwan, S. Savage, and G. Voelker, "Replication strategies for highly available peer-to-peer storage systems," Proceedings of Fu-DiCo: Future directions in Distributed Computing, 2002.
21. L. Cox, C. Murray, and B. Noble, "Pastiche: Making backup cheap and easy," ACM Operating Systems Rev., vol. 36, pp. 285-298, 2002.
22. P. Michiardi and L. Toka, "Selfish neighbor selection in peer-to-peer backup and storage applications," in Euro-Par, Proc., ser. LNCS, vol. 5704, 2009.
23. L. Toka and P. Michiardi, "Analysis of user-driven peer selection in peer-to-peer backup and storage systems," Telecommunication Systems J. (to be published), 2009.
24. F. Giroire, J. Monteiro, and S. Pérennes, "P2p storage systems: How much locality can they tolerate?" INRIA, Tech. Rep. 7006, 2009.
25. B. Chun, F. Dabek, A. Haeberlen, E. Sit, H. Weatherspoon, M. Kaashoek, J. Kubiatowicz, and R. Morris, "Efficient replica maintenance for distributed storage systems," in NSDI, Proc., vol. 6, 2006.