Publication: Energy efficient hierarchical epidemics in peer-to-peer systems
dc.contributor.coauthor | N/A | |
dc.contributor.department | Department of Computer Engineering | |
dc.contributor.kuauthor | Özkasap, Öznur | |
dc.contributor.kuauthor | Çem, Emrah | |
dc.contributor.kuauthor | Koç, Tuğba | |
dc.contributor.kuprofile | Faculty Member | |
dc.contributor.kuprofile | PhD Student | |
dc.contributor.kuprofile | Master Student | |
dc.contributor.other | Department of Computer Engineering | |
dc.contributor.schoolcollegeinstitute | College of Engineering | |
dc.contributor.schoolcollegeinstitute | Graduate School of Sciences and Engineering | |
dc.contributor.schoolcollegeinstitute | Graduate School of Sciences and Engineering | |
dc.contributor.yokid | 113507 | |
dc.contributor.yokid | N/A | |
dc.contributor.yokid | N/A | |
dc.date.accessioned | 2024-11-09T23:43:38Z | |
dc.date.issued | 2011 | |
dc.description.abstract | Epidemic or gossip-based mechanisms are preferred in several distributed protocols for their ease of deployment, simplicity, robustness against failures, load-balancing and limited resource usage. In flat neighborhood epidemics, peers have similar responsibilities and all participate in gossiping via neighboring peers. We have proposed an energy cost model for a generic peer using flat neighborhood epidemics, and examined the effect of protocol parameters to characterize energy consumption. Although it has been shown that a peers power consumption amount is independent of population size, peers always need to be active to process incoming gossip messages. In this study, we consider power awareness features of flat and hierarchical epidemics in peer-to-peer (P2P) systems, and propose a power-aware hierarchical epidemic approach with its energy cost model and analysis. In this adaptive approach, only a subset of peer population is active in gossiping by forming an overlay, so that the other peers can switch to idle state. It also allows data aggregation that can be utilized to reduce gossip message size. As a case study for epidemic protocol, we use our approach and simulation model for frequent item set discovery in unstructured P2P networks. | |
dc.description.indexedby | WoS | |
dc.description.indexedby | Scopus | |
dc.description.openaccess | YES | |
dc.description.publisherscope | International | |
dc.description.sponsoredbyTubitakEu | TÜBİTAK | |
dc.description.sponsorship | COST | |
dc.identifier.doi | 10.1109/ICEAC.2011.6136685 | |
dc.identifier.isbn | 9781-4673-0465-8 | |
dc.identifier.link | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84856932872anddoi=10.1109%2fICEAC.2011.6136685andpartnerID=40andmd5=48b799fd601c209ae301f9cd5e6606d6 | |
dc.identifier.quartile | N/A | |
dc.identifier.scopus | 2-s2.0-84856932872 | |
dc.identifier.uri | http://dx.doi.org/10.1109/ICEAC.2011.6136685 | |
dc.identifier.uri | https://hdl.handle.net/20.500.14288/13530 | |
dc.identifier.wos | 318034100012 | |
dc.keywords | Dominating sets | |
dc.keywords | Energy cost | |
dc.keywords | Epidemic | |
dc.keywords | Gossip-based | |
dc.keywords | Peer to peer | |
dc.keywords | Computer simulation | |
dc.keywords | Cost benefit analysis | |
dc.keywords | Distributed computer systems | |
dc.keywords | Energy efficiency | |
dc.keywords | Energy utilization | |
dc.keywords | Hierarchical systems | |
dc.keywords | Peer to peer networks | |
dc.keywords | Population statistics | |
dc.keywords | Epidemiology | |
dc.language | English | |
dc.publisher | IEEE | |
dc.source | 2011 International Conference on Energy Aware Computing, ICEAC 2011 | |
dc.subject | Computer engineering | |
dc.title | Energy efficient hierarchical epidemics in peer-to-peer systems | |
dc.type | Journal Article | |
dspace.entity.type | Publication | |
local.contributor.authorid | 0000-0003-4343-0986 | |
local.contributor.authorid | N/A | |
local.contributor.authorid | N/A | |
local.contributor.kuauthor | Özkasap, Öznur | |
local.contributor.kuauthor | Çem, Emrah | |
local.contributor.kuauthor | Koç, Tuğba | |
relation.isOrgUnitOfPublication | 89352e43-bf09-4ef4-82f6-6f9d0174ebae | |
relation.isOrgUnitOfPublication.latestForDiscovery | 89352e43-bf09-4ef4-82f6-6f9d0174ebae |