Distributed uniform sampling in unstructured peer-to-peer networks

Proceedings of the Annual Hawaii International Conference on System Sciences

Volumn 9, Issue , 2006, Pages

  Awan, Asad ^a   Ferreira, Ronaldo A ^a   Jagannathan, Suresh ^a   Grama, Ananth ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NON-UNIFORM NETWORKS; PERFORMANCE PARAMETERS; RANDOMIZED ALGORITHMS; UNIFORM SAMPLING;

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GRAPH THEORY; LEARNING ALGORITHMS; RANDOM PROCESSES; SAMPLING; TELECOMMUNICATION LINKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33749593067     PISSN: 15301605     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HICSS.2006.126     Document Type: Conference Paper

References (31)

1. A. Awan, R. A. Ferreira, S. Jagannathan, and A. Grama. Unstructured Peer-to-Peer Networks for Sharing Processor Cycles. In Parallel Computing (to apear). 2005.
2. Z. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, and D. Weitz. Approximating Aggregate Queries about Web Pages via Random Walks. In VLDB '00: Proceedings of the 26th International Conference on Very Large Data Bases, pages 535-544, San Francisco, CA, USA, 2000.
3. B. A. Bash, J. W. Byers, and J. Considine. Approximately uniform random sampling in sensor networks. In Proceedings of the International Workshop on Data Management for Sensor Networks (DMSN 2004), Toronto, Canada, August 2004.
4. S. Boyd, P. Diaconis, and L. Xiao. Fastest Mixing Markov Chain on a Graph. SIAM Review, problems and techniques section, 46(4):667-689, December 2004.
5. P. Brémaud. Markov Chains Gibs Fields, Monte Carlo Simulation, and Queues. Springer-Verlag, 1999.
6. R. A. Ferreira, M. K. Ramanathan, A. Awan, A. Grama, and S. Jagannathan. Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks. In Proceedings of Fifth IEEE International Conference on Peer-to-Peer Computing (P2P 2005), Konstanz, Germany, August 2005.
7. R. A. Ferreira, M. K. Ramanathan, A. Grama, and S. Jagannathan. Randomized Protocols for Duplicate Elimination in Unstructured Networks. In Proceedings of Fifth IEEE International Conference on Peer-to-Peer Computing (P2P 2005), Konstanz, Germany, August 2005.
8. D. Ganesan, S. Ratnasamy, H. Wang, and D. Estrin. Coping with irregular spatio-temporal sampling in sensor networks. In Proceedings of HotNets-II, Cambridge, MA, USA, November 2003.
9. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks. In Proceedings of the 23rd IEEE Infocom 2004, Hong Kong, March 2004.
10. W. Hastings. Monte carlo sampling methods using Markov chains and their applications. Biometrika, 57:97-109, 1970.
11. M. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork. On near-uniform URL sampling. In Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications networking, pages 295-308, Amsterdam, Netherlands, May 2000.
12. K. Horowitz and D. Malkhi. Estimating network size from local information. The Information Processing Letters journal, 88(5):237-243, December 2003.
13. D. Karger and M. Ruhl. Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems. In Proceedings of the Fourth International Workshop on Peer-to-Peer Systems (IPTPS 2004), San Diego, CA, USA, February 2004.
14. V. King and J. Saia. Choosing a Random Peer. In Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC'04), pages 125-130, Newfoundland, Canada, July 2004.
15. S. Lewis and J. Saia. Scalable Byzantine Agreement. Technical Report Technical Report, University of New Mexico, 2004.
16. Limewire. http://www.limewire.com/english/content/glossary.shtml.
17. L. Lovasz. Random walks on graphs: A survey. Combinatorics, Paul Erdos is Eighty, 2:1-46, 1993.
18. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-peer networks. In ACM ICS'02 Conference, New York, NY, USA, June 2002.
19. D. Malkhi, M. Naor, and et al. Viceroy: A Scalable and Dynamic Emulation of the Butterfly. In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC'02), Monterey, CA, July 2002.
20. D. Malkhi, M. Reiter, and R. Wright. Probabilistic quorum systems. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing (PODC'97), pages 267-273, Santa Barbara, CA, USA, August 1997.
21. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller. Equations of state calculations byfast computing machines. J. Chem. Phys., 21:1087-101, 1953.
22. R. Motwani and P. Raghavan. Cambridge University Press, 1995.
23. J. Propp and D. Wilson. Exact sampling with coupled markov chains and applications to statistical mechanics. In Proceedings of the seventh international conference on Random structures and algorithms, pages 223-252, Atlanta, GA, USA, 1996. John Wiley & Sons, Inc.
24. M. K. Ramanathan, R. A. Ferreira, S. Jagannathan, and A. Grama. Randomized Leader Election. Technical Report CSD-TR-04-028, Depratment of Computer Sciences, Purdue University, October 2004.
25. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In Proceedings of the 2001 ACM SIGCOMM, pages 247-254, San Diego, CA, USA, August 2001.
26. A. Rowstron and P. Druschel. Pastry: Scalable, Decentralized Object Location and Routing for Large-Scale Peer-to-Peer Systems. In Proceedings of the 2001 ACM SIGCOMM, pages 247-254, San Diego, CA, USA, August 2001.
27. P. Rusmevichientong, D. M. Pennock, S. Lawrence, and C. L. Giles. Methods for Sampling Pages Uniformly from the World Wide Web. In Proceedings of the AAAI Fall Symposium on Using Uncertainty Within Computation, pages 121-128, Cape Cod, MA, USA, November 2001.
28. S. Saroiu, K. P. Gummadi, and S. D. Gribble. Measuring and Analyzing the Characteristics of Napster and Gnutella Hosts. Multimedia Systems, 9(2):170-184, 2003.
29. S. Saroiu, P. K. Gummadi, and S. D. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems. In Proceedings of Multimedia Computing and Networking 2002 (MMCN '02), San Jose, CA, USA, January 2002.
30. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In Proceedings of the 2001 ACM SIGCOMM, pages 149-160, San Diego, CA, USA, August 2001.
31. B. Y. Zhao, J. Kubiatowicz, and A. D. Joseph. Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing. Technical Report UCB/CSD-0101141, UC Berkeley, Computer Science Division, April 2001.