Faster Gossiping on Butterflies
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Broadcasting in Generalized de Bruijn Digraphs
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Faster gossiping on butterfly networks
Theoretical Computer Science - Automata, languages and programming
Bridging the digital divide: storage media + postal network = generic high-bandwidth communication
ACM Transactions on Storage (TOS)
D2B: a de Bruijn based content-addressable network
Theoretical Computer Science - Complex networks
| Hi-index | 0.00 |
Communication schemes based on store and forward routing, in which a processor can communicate simultaneously with all its neighbors (in parallel) are considered. Moreover, the authors assume that sending a message of length $L$ from a node to a neighbor takes time $\beta + L \tau$. The authors give efficient broadcasting and gossiping protocols for the de Bruijn networks. To do this, arc-disjoint spanning trees of small depth rooted at a given vertex in de Bruijn digraphs are constructed.