𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Periodic Gossiping in Commuted Networks

✍ Scribed by Dominique Barth; Pascal Berthomé

Book ID
105914788
Publisher
Springer
Year
2004
Tongue
English
Weight
693 KB
Volume
37
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Periodic gossiping in back-to-back trees
Periodic gossiping in back-to-back trees
✍ Roger Labahn; André Raspaud 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 840 KB

The d-ary back-to-back tree of height k, BBT~, consists of two complete d-ary trees of height k the leaves of which are identified. For a proper coloring of the edges of BK$ with c > d + 1 colors, we consider periodic gossiping, i.e. full-duplex all-to-all broadcasting in the l-port model where comm

Gossiping and broadcasting versus comput
Gossiping and broadcasting versus computing functions in networks
✍ Martin Dietzfelbinger 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 346 KB

In the theory of dissemination of information in interconnection networks (gossiping and broadcasting) one assumes that a message consists of a set of distinguishable, atomic pieces of information, and that one communication pattern is used for solving a task. In this paper, a close connection is es

A randomized algorithm for gossiping in
A randomized algorithm for gossiping in radio networks
✍ Marek Chrobak; Leszek Ga̧sieniec; Wojciech Rytter 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

## Abstract We present an __O__(__n__ log^4^__n__)‐time randomized algorithm for gossiping in radio networks with unknown topology. This is the first algorithm for gossiping in this model whose running time is only a polylogarithmic factor away from the optimum. The fastest previously known (determ

Gossiping and routing in undirected trip
Gossiping and routing in undirected triple-loop networks
✍ Alison Thomson; Sanming Zhou 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

Given integers n ≥ 7 and a, b, c with 1 ≤ a, b, c ≤ n -1 such that a, na, b, nb, c, nc are pairwise distinct, the (undirected) triple-loop network TL n (a, b, c) is the degree-six graph with vertices 0, 1, 2, . . . , n -1 such that each vertex x is adjacent to x ± a, x ± b, and x ± c, where the oper