Gossiping with Message Splitting on Structured Networks
Gossiping of a single source with multiple messages (by splitting information into pieces) has been treated only for complete graphs, shown to considerably reduce the completion time, that is, the first time at which all network nodes are informed, compared with single-message gossiping. In this pap...
Main Authors: | Wenxiang Dong, Ying Yang, Wenyi Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi - SAGE Publishing
2015-01-01
|
Series: | International Journal of Distributed Sensor Networks |
Online Access: | https://doi.org/10.1155/2015/504581 |
Similar Items
-
On the Selection of Information Sources for Gossip Spreading
by: Wenxiang Dong, et al.
Published: (2015-04-01) -
Network gossip algorithms
by: Shah, Devavrat
Published: (2011) -
Plutus : measuring message gossiping in P2P networks and providing incentives in cryptocurrencies
by: Hemo, Rotem
Published: (2018) -
The ethics of gossiping: an objection against a Kantian account of gossip
by: Ong, Si Ying
Published: (2024) -
Distribution of the Age of Gossip in Networks
by: Mohamed A. Abd-Elmagid, et al.
Published: (2023-02-01)