gossip-paper
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| gossip-paper [2016/04/28 12:39] – [Resources] gdangelo | gossip-paper [2020/01/17 10:33] (current) – gda | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| + | ====== Highly intensive data dissemination in complex networks ====== | ||
| + | ====== Authors ====== | ||
| + | |||
| + | * [[http:// | ||
| + | * [[http:// | ||
| + | |||
| + | ====== Abstract ====== | ||
| + | |||
| + | //This paper presents a study on data dissemination in unstructured Peer-to-Peer (P2P) network overlays. The absence of a structure in unstructured overlays eases the network management, at the cost of non-optimal mechanisms to spread messages in the network. Thus, dissemination schemes must be employed that allow covering a large portion of the network with a high probability (e.g.~gossip based approaches). We identify principal metrics, provide a theoretical model and perform the assessment evaluation using a high performance simulator that is based on a parallel and distributed architecture. A main point of this study is that our simulation model considers implementation technical details, such as the use of caching and Time To Live (TTL) in message dissemination, | ||
| + | |||
| + | ====== Keywords ====== | ||
| + | |||
| + | * Data dissemination, | ||
| + | |||
| + | ====== Status ====== | ||
| + | |||
| + | * Published in the Journal of Parallel and Distributed Computing, Volume 99, January 2017, Pages 28-50, ISSN 0743-7315, | ||
| + | |||
| + | ====== Paper ====== | ||
| + | |||
| + | * A pre-peer reviewed version of the article can be found on {{https:// | ||
| + | * The publisher version is available at {{http:// | ||
| + | |||
| + | ====== Resources ====== | ||
| + | |||
| + | * The LUNES source code is part of the [[pads: | ||
| + | * Raw data obtained by the experiments, | ||
