Document
type: Class

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
type: Journal
type: Collection
type: Document
type: Continuant
type: Entity
type: Generically Dependent Continuant
publication venue for: Topology-sensitive epidemic algorithm for information spreading in large-scale systems
type: Periodical
type: Thing
type: Information Content Entity

Continuant
type: Class

Entity
type: Class

Generically Dependent Continuant
type: Class

RDF description of Topology-sensitive epidemic algorithm for information spreading in large-scale systems - http://orbis.uaslp.mx/vivo/individual/scopus8354
rights: termsOfUse
date: 2026-08-25T13:54:48
publisher: vivo
type: Document

Article
type: Class

Topology-sensitive epidemic algorithm for information spreading in large-scale systems
abstract: Epidemic algorithms are an emerging technique that has recently gained popularity as a potentially effective solution for disseminating information in large-scale network systems. For some application scenarios, efficient and reliable data dissemination to all or a group of nodes in the network is necessary to provide with the communication services within the system. These studies may have a large impact in communication networks where epidemic-like protocols become a practice for message delivery, collaborative peer-to-peer applications, distributed database systems, routing in Mobile Ad Hoc networks, etc. In this paper we present, through various simulations, that an epidemic spreading process can be highly influenced by the network topology. We also provide a comparative performance analysis of some global parameters performance such as network diameter and degree of connectivity. Based on this analysis, we propose a new epidemic strategy that takes into account the topological structure in the network. The results show that the proposed epidemic algorithm outperform a classical timestamped anti-entropy epidemic algorithm in terms of the number of sessions required to reach a consistent state in the network system. © Springer-Verlag Berlin Heidelberg 2006.
page start: 439
most specific type: Conference Paper
type: Entity
type: Document
estado: published
freetext keyword: Distributed computer systems; Distributed database systems; Epidemiology; Fault tolerant computer systems; Information dissemination; Large scale systems; Mobile ad hoc networks; Topology; Application scenario; Communication service; Comparative performance analysis; Degree of connectivity; Information spreading; Large-scale network; Peer-to-peer application; Topological structure; Peer to peer networks
type: Article
type: Thing
EI dscopus: 2-s2.0-84904616354
related by: authorship_54196
type: Conference Paper
origen: scopus
volume: 4330
related by: authorship_54195
type: Information Content Entity
doi: 10.1007/11946441_43
related by: authorship_54194
type: Continuant
crisid: 8355
related by: authorship_54193
page end: 450
has publication venue: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
most specific type: Document
date time value: conference paper date 8355
type: Generically Dependent Continuant
related by: authorship_54197

Information Content Entity
type: Class

Conference Paper
type: Class