ProFID: Practical frequent items discovery in peer-to-peer networks

Future Generation Computer Systems

Volumn 29, Issue 6, 2013, Pages 1544-1560

  Çem, Emrah ^a   Özkasap, Öznur ^b  

^a The University of Texas at Dallas   (United States)

^b KOÇ UNIVERSITY   (Turkey)

Author keywords

Distributed computing; Frequent items; Gossip based (epidemic) protocol; Peer to peer

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; EFFICIENCY; OPTIMIZATION; SCALABILITY;

CONVERGENCE SPEED; DISTRIBUTED PROTOCOLS; DISTRIBUTED SERVICE; FREQUENT ITEMS; PAIRWISE AVERAGING; PEER TO PEER; QUERY REFINEMENT; UNSTRUCTURED P2P NETWORK;

PEER TO PEER NETWORKS;

EID: 84886948110     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.future.2012.10.002     Document Type: Article

References (45)

1. M. Li, W.C. Lee, Identifying frequent items in P2P systems, in: Distributed Computing Systems, 2008, ICDCS '08, 28th International Conference on, 2008.
2. M. Jelasity, A. Montresor, Epidemic-style proactive aggregation in large overlay networks, in: ICDCS, 2004, pp. 102-109.
3. R. Keralapura, G. Cormode, J. Ramamirtham, Communication-efficient distributed monitoring of thresholded counts, in: SIGMOD Conference, 2006, pp. 289-300.
4. A. Manjhi, V. Shkapenyuk, K. Dhamdhere, C. Olston, Finding (recently) frequent items in distributed data streams, in: Proceedings of ICDE, 2005, pp. 767-778.
5. G.S. Manku, R. Motwani, Approximate frequency counts over data streams, in: VLDB, 2002, pp. 346-357.
6. G. Cormode, M. Hadjieleftheriou, Finding the frequent items in streams of data, Communications of the ACM 52 (10) (2009) 97-105.
7. C. Olston, J. Jiang, J. Widom, Adaptive filters for continuous queries over distributed data streams, in: SIGMOD Conference, 2003, pp. 563-574.
8. R.M. Karp, S. Shenker, C.H. Papadimitriou, A simple algorithm for finding frequent elements in streams and bags, ACM Transactions on Database Systems 28 (2003) 51-55.
9. The ProFID implementation, https://sites.google.com/a/ku.edu.tr/emrahcem/ projects/profid.
10. The Peersim simulator, http://peersim.sf.net.
11. Planetlab. http://www.planet-lab.org/.
12. K. Birman, The promise, and limitations, of gossip protocols, Operating Systems Review 41 (5) (2007) 8-13.
13. D. Kempe, A. Dobra, J. Gehrke, Gossip-based computation of aggregate information, in: Proceedings of Symposium on Foundation of Computer Scienece, FOCS, 2003, pp. 482-491.
14. S.R. Kashyap, S. Deb, K.V.M. Naidu, R. Rastogi, A. Srinivasan, Efficient gossip-based aggregate computation, in: Proceedings of ACM Symposium on Principles of Database Systems, PODS, 2006, pp. 308-317.
15. M. Jelasity, A. Montresor, Ö Babaoglu, Gossip-based aggregation in large dynamic networks, ACM Transactions on Computer Systems 23 (3) (2005) 219-252.
16. S.P. Boyd, A. Ghosh, B. Prabhakar, D. Shah, Gossip algorithms: design, analysis and applications, in: INFOCOM, 2005, pp. 1653-1664.
17. M. Mehyar, D. Spanos, J. Pongsajapan, S.H. Low, R.M. Murray, Asynchronous distributed averaging on communication networks, IEEE/ACM Transactions on Networking 15 (3) (2007) 512-520.
18. A. Montresor, A. Ghodsi, Towards robust peer counting, in: 9th International Conference on Peer-to-Peer, P2P09, 2009, pp. 143-146.
19. J.-Y. Chen, G. Pandurangan, D. Xu, Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis, IEEE Transactions on Parallel and Distributed Systems 17 (9) (2006) 987-1000.
20. N. Bicocchi, M. Mamei, F. Zambonelli, Handling dynamics in diffusive aggregation schemes: an evaporative approach, Future Generation Computer Systems 26 (6) (2010) 877-889.
21. P.C. Kokkinos, E.A. Varvarigos, Scheduling efficiency of resource information aggregation in grid networks, Future Generation Computer Systems 28 (1) (2012) 9-23.
22. I. Rodero, F. Guim, J. Corbalan, L. Fong, S.M. Sadjadi, Grid broker selection strategies using aggregated resource information, Future Generation Computer Systems 26 (1) (2010) 72-86.
23. L. Chitnis, A. Dobra, S. Ranka, Aggregation methods for large-scale sensor networks, ACM Transactions on Sensor Networks 4 (2) (2008) 1-36.
24. B. Lahiri, S. Tirthapura, Computing frequent elements using gossip, in: SIROCCO, 2008, pp. 119-130.
25. J. Misra, D. Gries, Finding repeated elements, Science of Computer Programming 2 (2) (1982) 143-152.
26. E. Cem, O. Ozkasap, Profid: practical frequent item set discovery in peer-topeer networks, in: Proceedings of ISCIS (25th International Symposium on Computer and Information Sciences), London, 2010, pp. 199-202.
27. B. Ford, Network address translation and peer-to-peer applications (natp2p), internet draft, http://pdos.csail.mit.edu/baford/nat/draft-ford- natp2p-00.txt.
28. D. Kegel, Nat and peer-to-peer networking, http://alumnus.caltech.edu/ dank/peer-nat.html.
29. D.K. Bryan Ford, Pyda Srisuresh, Peer-to-peer communication across network address translators, http://www.brynosaurus.com/pub/net/p2pnat/.
30. E.M. Airoldi, X. Bai, K.M. Carley, Network sampling and classification: an investigation of network model representations, Decision Support Systems 51 (3) (2011) 506-518.
31. G.P. Jesi, A. Montresor, M. van Steen, Secure peer sampling, Computer Networks 54 (12) (2010) 2086-2098.
32. D. Stutzbach, R. Rejaie, N.G. Duffield, S. Sen, W. Willinger, On unbiased sampling for unstructured peer-to-peer networks, IEEE/ACM Transactions on Networking 17 (2) (2009) 377-390.
33. J. Leskovec, C. Faloutsos, Sampling from large graphs, in: KDD, 2006, pp. 631-636.
34. L. Massoulié, E.L. Merrer, A.-M. Kermarrec, A.J. Ganesh, Peer counting and sampling in overlay networks: random walk methods, in: PODC, 2006, pp. 123-132.
35. D. Kostoulas, D. Psaltoulis, I. Gupta, K. Birman, A.J. Demers, Decentralized schemes for size estimation in large and dynamic groups, in: NCA, 2005, pp. 41-48.
36. E.L. Merrer, A.-M. Kermarrec, L. Massoulié, Peer to peer size estimation in large and dynamic networks: a comparative study, in: HPDC, 2006, pp. 7-17.
37. Z. Xiang, Q. Zhang, W. Zhu, Z. Zhang, Y.-Q. Zhang, Peer-to-peer based multimedia distribution service, IEEE Transactions on Multimedia 6 (2) (2004) 343-355.
38. D. Stutzbach, S. Zhao, R. Rejaie, Characterizing files in the modern gnutella network, Multimedia Systems 13 (1) (2007) 35-50.
39. A.L. Barabasi, R. Albert, Emergence of scaling in random networks, Science 286 (5439) (1999) 509-512. (New York, NY), [Online], Available: http://view.ncbi.nlm.nih.gov/pubmed/10521342.
40. M. Ripeanu, A. Iamnitchi, I.T. Foster, Mapping the gnutella network, IEEE Internet Computing 6 (1) (2002) 50-57.
41. Q. Lv, S. Ratnasamy, S. Shenker, Can heterogeneity make gnutella scalable? in: IPTPS, 2002, pp. 94-103.
42. B. Pittel, On spreading a rumor, SIAM Journal on Applied Mathematics 47 (1) (1987) 213-223.
43. O. Ozkasap, M. Caglar, E.S. Yazici, S. Kucukcifci, An analytical framework for self-organizing peer-to-peer anti-entropy algorithms, Performance Evaluation 67 (2010) 141-159. [Online], Available: http://dx.doi.org/10.1016/j. peva.2009.09.009.
44. E. Fernández-Casado, M.S. Artigas, P.G. López, Affluenza: towards universal churn generation, in: Peer-to-Peer Computing, 2010, pp. 1-2.
45. Z. Yao, D. Leonard, X. Wang, D. Loguinov, Modeling heterogeneous user churn and local resilience of unstructured P2P networks, in: ICNP, 2006, pp. 32-41.