Publication:
A chain-binomial model for pull and push-based information diffusion

dc.contributor.departmentDepartment of Mathematics
dc.contributor.departmentDepartment of Computer Engineering
dc.contributor.kuauthorÇağlar, Mine
dc.contributor.kuauthorÖzkasap, Öznur
dc.contributor.kuprofileFaculty Member
dc.contributor.kuprofileFaculty Member
dc.contributor.yokid105131
dc.contributor.yokid113507
dc.date.accessioned2024-11-09T23:36:24Z
dc.date.issued2006
dc.description.abstractWe compare pull and push-based epidemic paradigms for information diffusion in large scale networks. Key benefits of these approaches are that they are fully distributed, utilize local information only via pair-wise interactions, and provide eventual consistency, scalability and communication topology-independence, which make them suitable for peer-to-peer distributed systems. We develop a chain-Binomial epidemic probability model for these algorithms. Our main contribution is the exact computation of message delivery latency observed by each peer, which corresponds to a first passage time of the underlying Markov chain. Such an analytical tool facilitates the comparison of pull and push-based spread for different group sizes, initial number of infectious peers and fan-out values which are also accomplished in this study. Via our analytical stochastic model, we show that push-based approach is expected to facilitate faster information spread both for the whole group and as experienced by each member.
dc.description.indexedbyWoS
dc.description.openaccessNO
dc.description.publisherscopeInternational
dc.description.sponsoredbyTubitakEuN/A
dc.description.sponsorshipTUBITAK(the Scientific and Technical Research Council of Turkey) under CaREER award [104E064] This work is supported in part by TUBITAK(the Scientific and Technical Research Council of Turkey) under CaREER award Grant 104E064.
dc.identifier.doiN/A
dc.identifier.isbn978-1-4244-0354-7
dc.identifier.issn1550-3607
dc.identifier.quartileN/A
dc.identifier.scopus2-s2.0-42549105614
dc.identifier.uriN/A
dc.identifier.urihttps://hdl.handle.net/20.500.14288/12652
dc.identifier.wos287032701003
dc.keywordsChain-binomial
dc.keywordsEpidemic algorithms
dc.keywordsAnti-entropy
dc.keywordsPeer-to-peer
dc.languageEnglish
dc.publisherIEEE
dc.source2006 IEEE International Conference on Communications, Vols 1-12
dc.subjectComputer science, hardware and architecture
dc.subjectEngineering, electrical and electronic
dc.subjectTelecommunications
dc.titleA chain-binomial model for pull and push-based information diffusion
dc.typeConference proceeding
dspace.entity.typePublication
local.contributor.authorid0000-0001-9452-5251
local.contributor.authorid0000-0003-4343-0986
local.contributor.kuauthorÇağlar, Mine
local.contributor.kuauthorÖzkasap, Öznur
local.publication.orgunit1College of Sciences
local.publication.orgunit1College of Engineering
local.publication.orgunit2Department of Mathematics
local.publication.orgunit2Department of Computer Engineering
relation.isOrgUnitOfPublication2159b841-6c2d-4f54-b1d4-b6ba86edfdbe
relation.isOrgUnitOfPublication89352e43-bf09-4ef4-82f6-6f9d0174ebae
relation.isOrgUnitOfPublication.latestForDiscovery2159b841-6c2d-4f54-b1d4-b6ba86edfdbe

Files