Publication:
ProFID: practical frequent items discovery in peer-to-peer networks

dc.contributor.coauthorCem, Emrah
dc.contributor.departmentDepartment of Computer Engineering
dc.contributor.kuauthorÖzkasap, Öznur
dc.contributor.schoolcollegeinstituteCollege of Engineering
dc.date.accessioned2024-11-09T23:19:57Z
dc.date.issued2013
dc.description.abstractWe address the problem of discovering frequent items in unstructured P2P networks which is relevant for several distributed services such as cache management, data replication, query refinement, topology optimization and security. This study makes the following contributions to the current state of the art. First, we propose and develop a fully distributed Protocol for Frequent Items Discovery (ProFID) where the result is produced at every peer. ProFID uses gossip-based (epidemic) communication, a novel pairwise averaging function and system size estimation together to discover frequent items in an unstructured P2P network. We also propose a practical rule for convergence of the algorithm. In contrast to the previous works, each peer gives a local decision for convergence based on the change of updated local state. We developed a model of ProFID in PeerSim and performed various experiments to compare and evaluate its efficiency, scalability, and applicability. The protocol's resilience under realistic churn models was studied. For evaluating the effect of network dynamics, we deployed our protocol on the Internet-scale real network PlanetLab. We also compared the accuracy and scalability of ProFID with the adaptive Push-Sum algorithm. Our results confirm the practical nature, ease of deployment and efficiency of our approach, and also show that it outperforms adaptive Push-Sum in terms of accuracy, convergence speed and message overhead.
dc.description.indexedbyWOS
dc.description.indexedbyScopus
dc.description.issue6
dc.description.openaccessNO
dc.description.publisherscopeInternational
dc.description.sponsoredbyTubitakEuN/A
dc.description.sponsorshipTUBITAK[104E064, 109M761] This work was supported by TUBITAKunder CAREER Award Grant 104E064 and Grant 109M761. A preliminary version of this work appeared in [26]. We thank Tugba Koc for protocol deployment on the PlanetLab.
dc.description.volume29
dc.identifier.doi10.1016/j.future.2012.10.002
dc.identifier.eissn1872-7115
dc.identifier.issn0167-739X
dc.identifier.quartileQ1
dc.identifier.scopus2-s2.0-84886948110
dc.identifier.urihttps://doi.org/10.1016/j.future.2012.10.002
dc.identifier.urihttps://hdl.handle.net/20.500.14288/10640
dc.identifier.wos319235600021
dc.keywordsPeer-to-peer
dc.keywordsDistributed computing
dc.keywordsGossip-based (epidemic) protocols
dc.keywordsFrequent items
dc.language.isoeng
dc.publisherElsevier
dc.relation.ispartofFuture Generation Computer Systems-The International Journal of Escience
dc.subjectComputer science
dc.titleProFID: practical frequent items discovery in peer-to-peer networks
dc.typeJournal Article
dspace.entity.typePublication
local.contributor.kuauthorÖzkasap, Öznur
local.publication.orgunit1College of Engineering
local.publication.orgunit2Department of Computer Engineering
relation.isOrgUnitOfPublication89352e43-bf09-4ef4-82f6-6f9d0174ebae
relation.isOrgUnitOfPublication.latestForDiscovery89352e43-bf09-4ef4-82f6-6f9d0174ebae
relation.isParentOrgUnitOfPublication8e756b23-2d4a-4ce8-b1b3-62c794a8c164
relation.isParentOrgUnitOfPublication.latestForDiscovery8e756b23-2d4a-4ce8-b1b3-62c794a8c164

Files