2011
DOI: 10.1016/j.comcom.2010.10.001
|View full text |Cite
|
Sign up to set email alerts
|

Modeling gossip-based content dissemination and search in distributed networking

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
7
2
1

Relationship

0
10

Authors

Journals

citations
Cited by 23 publications
(20 citation statements)
references
References 14 publications
0
20
0
Order By: Relevance
“…The exchange of samples is random to certain degree but other more intelligent policies can be applied as well. Gossiping information is spread in an epidemic fashion within a network [36,35]. Furthermore, gossiping is able to prevent clustering of a network by cascading failures of its hosts.…”
Section: 1mentioning
confidence: 99%
“…The exchange of samples is random to certain degree but other more intelligent policies can be applied as well. Gossiping information is spread in an epidemic fashion within a network [36,35]. Furthermore, gossiping is able to prevent clustering of a network by cascading failures of its hosts.…”
Section: 1mentioning
confidence: 99%
“…The exchange of samples is random to certain degree but other more intelligent policies can be applied as well. Gossiping information is spread in an epidemic fashion within a network [Van Mieghem et al, 2009, Tang et al, 2011. Furthermore, gossiping is able to prevent clustering of a network by cascading failures of its hosts.…”
Section: The Discovery Levelmentioning
confidence: 99%
“…Large complex network have stimulated the research on local computations, where only a certain surrounding of a node is taken into account, instead of the global topology information. Examples are "gossiping" algorithms [79], breath-first search of social networks and web-crawling. The massive growth in data and network sizes has headed to a fresh kind of "sublinear" algorithms that only consider part of the input and consequently run in sub-linear time complexity.…”
Section: Complex Network Algorithms and Computationsmentioning
confidence: 99%