On the design of hybrid peer-to-peer systems

SIGMETRICS'08: Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems

Volumn 36, Issue 1 SPECIAL ISSUE, 2008, Pages 157-168

  Loannidis, Stratis ^a   Marbach, Peter ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Peer to peer; Scalability

Indexed keywords

COMPUTER NETWORKS; COMPUTER SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; NUMERICAL ANALYSIS; SCALABILITY; VIDEO STREAMING;

DISTRIBUTION OF DATUMS; NUMERICAL STUDIES; PEER-TO-PEER; PEER-TO-PEER NETWORKS; PEER-TO-PEER SYSTEMS; PROPAGATION MECHANISMS; QUERY LOADS; QUERY RESPONSE TIMES; RANDOM WALKS; SCALABILITY PROPERTIES;

CLIENT SERVER COMPUTER SYSTEMS;

EID: 57449112752     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375457.1375476     Document Type: Conference Paper

References (18)

1. D, Aldous and J. Fill. Reversible Markov Chains and Random Walks on Graphs. Monograph in preparation.
2. S. Annapurcddy and S. Guha and C. Gkantsidis and D. Gunawardcna and P. R. Rodriguez. Is high-quality VoD feasible using P2P swarming? In WWW, 903-912, 2007.
3. F. R. K. Chung. Spectral Graph Theory. American Mathematical Society, 1997.
4. E. Cohen and S. Shenker. Replication strategies in unstructured peer-to-peer networks. SIGCOMM Comput. Commun. Rev., 32(4):177-190, 2002.
5. J. Friedman. A proof of Alon's second eigenvalue conjecture. In STOC '03, pages 720-724, New York, NY, USA, 2003. ACM Press.
6. R. G. Gallager. Discrete Stochastic Processes. Kluwcr, Boston, 1996.
7. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks. In IEEE INFOCOM, volume 1, page 130, 2004.
8. S. Hoory, N. Linial, and A. Wigderson. Expander graphs and their applications. Bulletin of the AMS, 43(4):439-561, 2006.
9. C. Law and K.-Y. Siu. Distributed construction of random expander networks. In IEEE INFOCOM, volume 3, pages 2133-2143, 2003.
10. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-peer networks. In ICS '02, pages 84-95, New York, NY, USA, 2002. ACM Press.
11. D. Qiu and R. Srikant. Modeling and performance analysis of Bit Torrent-like peer-to-peer networks. In SIGCOMM. ACM Press, 2004.
12. A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location and routing for large-scale pecr-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms, 2001.
13. Skype explained, http://www.skype.com/products/explained.html. Accessed on 30/7/2007.
14. I. Stoica, R. Morris, D. Karger, M. F. Kaasfioek, and H. Balakrishnan. Chord: A scalable peer-to-pcer lookup service for internet applications. In SIGCOMM. ACM Press, 2001.
15. K. Sufi, C. Diot, J. Kurose, L. Massoulié, C. Neumann, D. F. Towsley, and M. Varvello. Push-to-Peer Video-on-Demand system: design and evaluation. IEEE Journal on Selected Areas in Communications, 25(9): 1706-1716, 2007.
16. S. Tewari and L. Kleinrock. Analysis of search and replication in unstructured pecr-to-peer networks. In SIGMETRICS, pages 404-405. ACM Press, 2005.
17. S. Tewari and L. Kleinrock. Optimal search performance in unstructured peer-to-peer networks with clustered demands. In ICC, June 2006.
18. D. R. West. Introduction to Graph Theory (2nd Edition) Prentice Hall, 2000.