gossip-paper
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionLast revisionBoth sides next revision | ||
gossip-paper [2015/12/11 07:43] – [Abstract] gdangelo | gossip-paper [2020/01/17 08:23] – 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 ====== | ||
+ | |||
+ | * Gabriele D’Angelo, Stefano Ferretti, Highly intensive data dissemination in complex networks, Journal of Parallel and Distributed Computing, Volume 99, January 2017, Pages 28-50, ISSN 0743-7315, [[http:// | ||
+ | |||
+ | ====== Resources ====== | ||
+ | |||
+ | * Draft version of the paper available on [[https:// | ||
+ | * The LUNES source code is part of the [[pads: | ||
+ | * Raw data obtained by the experiments, |
gossip-paper.txt · Last modified: 2020/01/17 10:33 by gda