Efficient communication in unknown networks

DOI10.1002/net.1022zbMath1014.90014OpenAlexW1992432313MaRDI QIDQ2747804

Stéphane Pérennes, Andrzej Pelc, Ugo Vaccaro, Luisa Gargano

Publication date: 14 October 2001

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00073069/file/RR-3609.pdf

zbMATH Keywords

algorithmgraphbroadcastingtimeunknown network

Mathematics Subject Classification ID

Trees (05C05) Communication networks in operations research (90B18) Communication theory (94A05)

Related Items

Deterministic broadcasting time with partial knowledge of the network., Messy broadcasting - decentralized broadcast schemes with limited knowledge, Time-Efficient Broadcast in Radio Networks

Cites Work

• Unnamed Item
• Unnamed Item
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Perfect broadcasting in unlabeled networks
• Distributed algorithms. 8th international workshop, WDAG 1994, Terschelling, The Netherlands, September 29 -- October 1, 1994. Proceedings
• Broadcasting in unlabeled hypercubes with a linear number of messages.
• Resource discovery in distributed networks
• Randomized broadcast in networks
• Distributed network protocols
• A trade-off between information and communication in broadcast protocols
• A survey of gossiping and broadcasting in communication networks
• Exploring Unknown Undirected Graphs
• Assigning labels in unknown anonymous networks (extended abstract)
• Fault-tolerant broadcasting and gossiping in communication networks