Token transfer in a faulty network

DOI10.1051/ita/1995290503831zbMath0838.68007OpenAlexW1494393249MaRDI QIDQ4858837

Andrzej Pelc, Adam Malinowski, Krzysztof Diks

Publication date: 27 May 1996

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92514

zbMATH Keywords

token transfer algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Unnamed Item
• A guided tour of Chernoff bounds
• Optimal and near-optimal broadcast in random graphs
• Broadcasting with random faults
• Fast gossiping with short unreliable messages
• On Gossiping with Faulty Telephone Lines
• Telephone Problems with Failures
• A survey of gossiping and broadcasting in communication networks
• Tighter time bounds on fault-tolerant broadcasting and gossiping
• Almost Safe Gossiping in Bounded Degree Networks
• Optimal Linear Broadcast
• Fast diagnosis of multiprocessor systems with random faults
• Linear broadcast routing

This page was built for publication: Token transfer in a faulty network