Sciweavers

436 search results - page 3 / 88
» On generalized gossiping and broadcasting
Sort
View
PODC
2010
ACM
13 years 4 months ago
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the go...
Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowals...
DSN
2003
IEEE
13 years 11 months ago
Adaptive Gossip-Based Broadcast
This paper presents a novel adaptation mechanism that allows every node of a gossip-based broadcast algorithm to adjust the rate of message emission 1) to the amount of resources ...
Luís Rodrigues, Sidath B. Handurukande, Jos...
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
13 years 7 months ago
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...
David Liben-Nowell
WASA
2009
Springer
132views Algorithms» more  WASA 2009»
14 years 11 days ago
Minimum-Latency Schedulings for Group Communications in Multi-channel Multihop Wireless Networks
Abstract. This paper is motivated by exploring the impact of the number of channels on the achievable communication latency for a specific communication task. We focus on how to u...
Peng-Jun Wan, Zhu Wang, Zhiyuan Wan, Scott C.-H. H...
GC
2004
Springer
13 years 11 months ago
BGP-Based Clustering for Scalable and Reliable Gossip Broadcast
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...
M. Brahami, Patrick Th. Eugster, Rachid Guerraoui,...