ProFID: Practical Frequent Item Set Discovery in Peer-to-Peer Networks

  • Emrah Çem
  • Öznur Özkasap
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 62)

Abstract

This study addresses the problem of discovering frequent items in unstructured P2P networks. We propose a fully distributed Protocol for Frequent Item set Discovery (ProFID) where the result is produced at every peer. We also propose a practical rule for convergence of the algorithm. Finally, we evaluate the efficiency of our approach through an extensive simulation study on PeerSim.

Keywords

Topology Optimization Frequent Item Local Item Extensive Simulation Study Gossip Protocol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Li, M., Lee, W.C.: Identifying Frequent Items in P2P Systems. ICDCS. (2008) 36–44Google Scholar
  2. 2.
    Manjhi, A., Shkapenyuk, V., Dhamdhere, K., Olston, C.: Finding (Recently) Fre- quent Items in Distributed Data Streams. ICDE. (2005) 767–778Google Scholar
  3. 3.
    Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-Based Aggregation in Large Dy- namic Network. ACM Ttrans. Comput. Syst. 23 (2005) 219–252CrossRefGoogle Scholar
  4. 4.
    Lahiri, B., Tirthapura, S.: Computing Frequent Elements Using Gossip. SIROCCO. (2008) 119–130Google Scholar
  5. 5.
    Kempe, D., Dobra, A., Johannes., G.: Gossip-Based Computation of Aggregate Information. FOCS. (2003) 482–491Google Scholar
  6. 6.
    Çem, E., Özkasap, Ö.: ProFID: Practical Frequent Item Set Discovery in Peer-to- Peer Networks. Technical Report, Koç University, March 2010.Google Scholar
  7. 7.
    The Peersim simulator. http://peersim.sf.net.
  8. 8.
    Özkasap, Ö., Çaglar, M., Yazici, E. S., Küç ükçifçi, S.: An analytical framework for self-organizing peer-to-peer anti-entropy algorithms. Perform. Eval. 67 (2010) 141–159CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  • Emrah Çem
    • 1
  • Öznur Özkasap
    • 1
  1. 1.Koç UniversityIstanbulTurkey

Personalised recommendations