Shared-state sampling

Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC

Volumn , Issue , 2006, Pages 1-14

  Raspall, Frederic ^a   Sallent, Sebastia ^a   Yufera, Josep ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Per flow measurements; Scalability

Indexed keywords

MEMORY TECHNOLOGY; SCALABLE SOLUTIONS; SHARED-STATE SAMPLING;

ALGORITHMS; DYNAMIC RANDOM ACCESS STORAGE; FLOW MEASUREMENT; SAMPLING; SCALABILITY; SIGNAL FILTERING AND PREDICTION;

HIGH SPEED NETWORKS;

EID: 34547446535     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1177080.1177082     Document Type: Conference Paper

References (43)

1. D. Achlioptas, A. Clauset, D. Kempe, and C. Moore. On the Bias of Traceroute Sampling; or, Power-law Degree Distributions in Regular Graphs. In Symposium on Theory of Computing, 2005.
2. A. Awan, R. A. Ferreira, S. Jagannathan, and A. Grama. Distributed Uniform Sampling in Unstructured Peer-to-Peer Networks. In Hawaii International Conference on System Sciences, 2006.
3. Z. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, and D. Weitz. Approximating Aggregate Queries about Web Pages via Random Walks. In International Conference on Very Large Databases, 2000.
4. R. Bhagwan, S. Savage, and G. Voelker. Understanding Availability. In International Workshop on Peer-to-Peer Systems, 2003.
5. B. Bollobás. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. European Journal of Combinatorics, 1, 1980.
6. F. E. Bustamante and Y. Qiao. Friendships that last: Peer lifespan and its role in P2P protocols. In International Workshop on Web Content Caching and Distribution, 2003.
7. Y. Chawathe, S. Ratnasamy, and L. Breslau. Making Gnutella-like P2P Systems Scalable. In SIGCOMM, 2003.
8. S. Chib and E. Greenberg. Understanding the Metropolis-Hastings Algorithm. The Americian Statistician, 49(4), 1995.
9. C. Cooper, M. Dyer, and C. Greenhill. Sampling regular graphs and a peer-to-peer network. In Symposium on Discrete Algorithms, 2005.
10. H. Dämpfung. Gnutella Web Caching System: Version 2 Specifications Client Developers' Guide. http://www.gnucleus.com/gwebcache/newgwc.html, 2003.
11. C. Gkantsidis, M. Mihail, and A. Saberi. Random Walks in Peer-to-Peer Networks. In INFOCOM, 2004.
12. K. P. Gummadi, R. J. Dunn, S. Saroiu, S. D. Gribble, H. M. Levy, and J. Zahorjan. Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload. In SOSP, 2003.
13. K. P. Gummadi, S. Saroiu, and S. D. Gribble. King: Estimating Latency between Arbitrary Internet End Hosts. In Internet Measurement Workshop, 2002.
14. W. Hastings. Monte Carlo Sampling Methods Using Markov Chains and Their Applications. Biometrika, 57, 1970.
15. M. Henzinger, A. Heydon, M. Mitzenmaeher, and M. Najork. On Near-Uniform URL Sampling. In International World Wide Web Conference, 2001.
16. M. Izal, G. Urvoy-Keller, E. W. Biersack, P. A. Felber, A. A. Hamra, and L. Garces-Erice. Dissecting BitTorrent: Five Months in a Torrent's Lifetime. In PAM, 2004.
17. M. Jerrum and A. Sinclair. Fast uniform generation of regular graphs. Theoretical Computer Science, 73, 1990.
18. P. Karbhari, M. Ammar, A. Dhamdhere, H. Raj, G. Riley, and E. Zegura. Bootstrapping in Gnutella: A Measurement Study. In PAM, 2004.
19. V. Krishnamurthy, M. Faloutsos, M. Chrobak, L. Lao, J.-H. Cui, and A. G. Percus. Reducing Large Internet Topologies for Faster Simulations. In IFIP Networking, 2005.
20. V. Krishnamurthy, J. Sun, M. Faloutsos, and S. Tauro. Sampling Internet Topologies: How Small Can We Go? In International Conference on Internet Computing, 2003.
21. A. Lakhina, J. W. Byers, M. Crovella, and P. Xie. Sampling Biases in IP Topology Measurements. In INFOCOM, 2003.
22. D. Leonard, V. Rai, and D. Loguinov. On Lifetime-Based Node Failure and Stochastic Resilience of Decentralized Peer-to-Peer Networks. In SIGMETRICS, 2005.
23. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over Time: Densification Laws, Shrinking Diameters and Possible Explanations. In KDD, 2005.
24. J. Li, J. Stribling, F. Kaashoek, R. Morris, and T. Gil. A Performance vs. Cost Framework for Evaluating DHT Design Tradeoffs under Churn. In INFOCOM, 2005.
25. D. Liben-Nowell, H. Balakrishnan, and D. Karger. Analysis of the Evolution of Peer-to-Peer Systems. In Principles of Distributed Computing, 2002.
26. L. Lovász. Random walks on graphs: A survey. Combinatorics: Paul Erdös is Eighty, 2, 1993.
27. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and Replication in Unstructured Peer-to-Peer Networks. In International Conference on Supercomputing, 2002.
28. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller. Equations of State Calculations by Fast Computing Machines. Journal of Chemical Physics, 21, 1953.
29. J. Pouwelse, P. Garbacki, D. Epema, and H. Sips. The Bittorrent P2P File-sharing System: Measurements and Analysis. In International Workshop on Peer-to-Peer Systems (IPTPS), 2005.
30. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In SIGCOMM, 2001.
31. S. Rhea, D. Geels, and J. Kubiatowicz. Handling Churn in a DHT. In USENIX, 2004.
32. P. Rusmevichientong, D. M. Pennock, S. Lawrence, and C. L. Giles. Methods for Sampling Pages Uniformly from the World Wide Web. In AAAI Fall Symposium on Using Uncertainty Within Computation, 2001.
33. S. Saroiu, P. K. Gummadi, and S. D. Gribble. Measuring and Analyzing the Characteristics of Napster and Gnutella Hosts. Multimedia Systems Journal, 9(2), 2003.
34. S. Sen and J. Wang. Analyzing Peer-To-Peer Traffic Across Large Networks. IEEE/ACM Transactions on Networking, 12(2), 2004.
35. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications. IEEE/ACM Transactions on Networking, 2002.
36. M. P. H. Stumpf, C. Wiuf, and R. M. May. Subnets of scale-free networks are not scale-free: Sampling properties of networks. Proceedings of the National Academy of Sciences, 102(12), 2005.
37. D. Stutzbach and R. Rejaie. Capturing Accurate Snapshots of the Gnutella Network. In Global Internet Symposium, 2005.
38. D. Stutzbach and R. Rejaie. Improving Lookup Performance over a Widely-Deployed DHT. In INFOCOM, 2006.
39. D. Stutzbach and R. Rejaie. Understanding Churn in Peer-to-Peer Networks. In Internet Measurement Conference, 2006.
40. D. Stutzbach, R. Rejaie, N. Duffield, S. Sen, and W. Willinger. Sampling Techniques for Large, Dynamic Graphs. In Global Internet Symposium, 2006.
41. D. Stutzbach, R. Rejaie, and S. Sen. Characterizing Unstructured Overlay Topologies in Modern P2P File-Sharing Systems. In Internet Measurement Conference, 2005.
42. A. A. Tsay, W. S. Lovejoy, and D. R. Karger. Random Sampling in Cut, Flow, and Network Design Problems. Mathematics of Operations Research, 24(2), 1999.
43. V. Vishnumurthy and P. Francis. On Heterogeneous Overlay Construction and Random Node Selection in Unstructured P2P Networks. In INFOCOM, 2006.