Uniform sampling for directed P2P networks

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

Volumn 5704 LNCS, Issue , 2009, Pages 511-522

  Hall, Cyrus ^a   Carzaniga, Antonio ^a  

^a UNIVERSITY OF LUGANO   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

CURRENT TECHNIQUES; DATA REPLICATION; DOUBLY STOCHASTIC; MINIMAL SAMPLE; MONITORING ALGORITHMS; P2P NETWORK; PEER-TO-PEER NETWORKS; RANDOM WALK; SAMPLE BIAS; SAMPLING ALGORITHM; SIMULATION STUDIES; TRANSITION MATRICES; UNIFORM SAMPLING;

AD HOC NETWORKS; ARTIFICIAL INTELLIGENCE; BIOINFORMATICS; CLIENT SERVER COMPUTER SYSTEMS; LEARNING ALGORITHMS; PROBABILITY; STOCHASTIC SYSTEMS; TOPOLOGY;

SAMPLING;

EID: 70350627363     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03869-3_49     Document Type: Conference Paper

References (17)

1. Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: Proceedings of the 23rd Conference of the IEEE Communications Society, INFOCOM (2004)
2. Stutzbach, D., Rejaie, R., Duffield, N., Sen, S., Willinger, W.: On unbiased sampling for unstructured peer-to-peer networks. In: Proceedings of the 6th Internet Measurement Conference, IMC (2006)
3. Awan, A., Ferreira, R.A., Jagannathan, S., Grama, A.: Distributed uniform sampling in unstructured peer-to-peer networks. In: Proceedings of the 39th Annual Hawaii International Conference on System Sciences, HICSS (2006)
4. Datta, S., Kargupta, H.: Uniform data sampling from a peer-to-peer network. In: Proceedings of the 27th International Conference on Distributed Computing Systems, ICDCS (2007)
5. Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.M., van Steen, M.: Gossip-based peer sampling. ACM Transactions on Computing Systems 25(3) (2007)
6. King, V., Saia, J.: Choosing a random peer. In: Proceedings of the 23rd Symposium on Principles of Distributed Computing, PODC (2004)
7. Bhagwan, R., Savage, S., Voelker, G.: Understanding availability. In: Proceedings of the 2nd International Workshop on Peer-To-Peer Systems, IPTPS (2003)
8. Stutzbach, D., Rejaie, R.: Understanding churn in peer-to-peer networks. In: Proceedings of the 6th Internet Measurement Conference, IMC (2006)
9. Zhong, M., Shen, K., Seiferas, J.: The convergence-guaranteed random walk and its applications in peer-to-peer networks. ACM Transactions on Computers 57(5) (2008)
10. Jelasity, M., Babaoglu, O.: T-man: Gossip-based overlay topology management. In: Brueckner, S.A., Di Marzo Serugendo, G., Hales, D., Zambonelli, F. (eds.) ESOA 2005. LNCS, vol. 3910, pp. 1-15. Springer, Heidelberg (2006)
11. Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proceedings of the 44th Symposium on Foundations of Computer Science, FOCS (2003)
12. Hall, C., Carzaniga, A.: Doubly stochastic converge: Uniform sampling for directed P2P networks. Technical report, University of Lugano, Lugano, Switzerland (2009)
13. Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, p. 329. Springer, Heidelberg (2001)
14. Kleinberg, J.: The small-world phenomenon: an algorithm perspective. In: Proceedings of the 32nd Symposium on Theory of Computing, STOC (2000)
15. Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Reviews of Modern Physics 74(1) (2002)
16. Sinclair, A.: Improved bounds for mixing rates of marked chains and multicommodity flow. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583. Springer, Heidelberg (1992)
17. Boyd, S., Diaconis, P., Xiao, L.: Fastest mixing markov chain on a graph. SIAM Review 46(4) (2004)