Identifying frequent items in P2P systems

Proceedings - The 28th International Conference on Distributed Computing Systems, ICDCS 2008

Volumn , Issue , 2008, Pages 36-44

  Li, Mei ^a   Lee, Wang Chien ^b  

^a MICROSOFT   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATES; DISTRIBUTED COMPUTER SYSTEMS;

APPLICATIONS.; DATA ITEMS; DISTRIBUTED COMPUTING SYSTEMS; FREQUENT ITEMS; FUNDAMENTAL PROBLEMS; IN-NETWORK PROCESSING; INFREQUENT ITEMS; INTERNATIONAL CONFERENCES; NETFILTER; NETWORK FILTERING; O PTIMAL SETTING; P2P SYSTEMS; PEER-TO-PEER SYSTEMS; TWO PHASES;

COMPUTER SYSTEMS;

EID: 51849158219     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2008.78     Document Type: Conference Paper

References (15)

1. BitTorrent website. http://www.bittorrent.com.
2. Gnutella website. http://gnutella.wego.com.
3. Napster website. http://www.napster.com.
4. W.-T. Balke, W. Nejdl, W. Siberski, and U. Thaden. Progressive distributed top k retrieval in peer-to-peer networks. In Proceedings of International Conference on Data Engineering (ICDE), pages 174-185, April 2005.
5. C. Estan and G. Varghese. New directions in traffic measurement and accounting. In Proceedings of SIGCOMM, pages 323-336, August 2002.
6. M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, and J. D. Ullman. Computing iceberg queries efficiently. In Proceedings of International Conference on Very Large Data Bases (VLDB), pages 299-310, August 1998.
7. S. Kashyap, S. Deb, K. Naidu, R. Rastogi, and A. Srinivasan. Efficient gossip-based aggregate computation. In Proceedings of ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS), June 2006.
8. D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate infoimation. In Proceedings of Symposium on Foundations of Computer Science (FOCS), pages 482-491, October 2003.
9. R. Keralapura, G. Cormode, and J. Ramamirtham. Communication efficient distributed monitoring of thresholded counts. In Proceedings of ACM SIGM0D, pages 289-300, June 2006.
10. H.-A. Kim and B. Karp. Autograph: Toward automated, distributed worm signature detection. In Proceedings of USENIX Security Symposium, pages 271-286, August 2004.
11. M. Li and W.-C. Lee. Identifying frequent items in peer-to-peer systems. Technical report, Pennsylvania State University, July 2006.
12. A. Manjhi, V. Shkapenyuk, K. Dhamdhere, and C. Olston. Finding (recently) frequent items in distributed data streams. In Proceedings of International Conference on Data Engineering (ICDE), pages 767-778, April 2005.
13. S. Nath, P. B. Gibbons, S. Seshan, and Z. R. Anderson. Synopsis diffusion for robust aggregation in sensor networks. In Proceedings of International Conference on Embedded Networked Sensor Systems (SenSys), pages 250-262, November 2004.
14. C. Tang, M. J. Buco, R. N. Chang, S. Dwarkadas, L. Z. Luan, E. So, and C. Ward. Low traffic overlay networks with large routing tables. In Proceedings of ACM SIGMETRICS, pages 14-25, June 2005.
15. M. Zaharia and S. Keshav. Gossip-based search selection in hybrid peerto-peer networks. In Proceedings of the Fifth International Workshop on Peer-to-Peer Systems (IPTPS), February 2006.