✦ LIBER ✦

Messy broadcasting — Decentralized broadcast schemes with limited knowledge

✍ Scribed by Hovhannes A. Harutyunyan; Pavol Hell; Arthur L. Liestman

Book ID: 108112910
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 229 KB
Volume: 159
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2010.12.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Meteor burst broadcast systems with repe

Meteor burst broadcast systems with repeating scheme

✍ Masashi Nagasawa; Kaiji Mukumoto; Akira Fukuda 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 817 KB

Real time stochastic scheduling in broad

Real time stochastic scheduling in broadcast systems with decentralized data storage

✍ Rinku Dewri; Indrakshi Ray; Indrajit Ray; Darrell Whitley 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 955 KB

Interval routing schemes allow broadcast

Interval routing schemes allow broadcasting with linear message-complexity

✍ Pierre Fraigniaud; Cyril Gavoille; Bernard Mans 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 222 KB

Automorphisms of broadcasting schemes wi

Automorphisms of broadcasting schemes with respect to start rounds

✍ Yoshihide Igarashi; Shingo Osawa; Walter Unger 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 579 KB

Identity-based conference key broadcast

Identity-based conference key broadcast schemes with user authentication

✍ Jau Liang Chen; Tzonelih Hwang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 389 KB

Deterministic broadcasting time with par

Deterministic broadcasting time with partial knowledge of the network

✍ Gianluca De Marco; Andrzej Pelc 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 143 KB

We consider the time of deterministic broadcasting in networks whose nodes have limited knowledge of network topology. Each node v knows only the part of the network within knowledge radius r from it, i.e., it knows the graph induced by all nodes at distance at most r from v. Apart from that, each n