Token transfer in a faulty network

DOI10.1051/ITA/1995290503831MaRDI QIDQ4858837zbMATH OpenOpenAlexFDO

Authors Krzysztof Diks, Adam Malinowski, Andrzej Pelc

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)

Recommendations

• Efficient Gossiping by Packets in Networks with Random Faults
• Reliable broadcasting in hypercubes with random link and node failures
• Broadcasting in complete networks with faulty nodes using unreliable calls
• Reliable communication in networks with Byzantine link failures
• Fault-tolerant broadcasting in radio networks

Cites work

• scientific article; zbMATH DE number 751136 (Why is no real title available?)
• A guided tour of Chernoff bounds
• A survey of gossiping and broadcasting in communication networks
• Almost Safe Gossiping in Bounded Degree Networks
• Broadcasting with random faults
• Fast diagnosis of multiprocessor systems with random faults
• Fast gossiping with short unreliable messages
• Linear broadcast routing
• On Gossiping with Faulty Telephone Lines
• Optimal Linear Broadcast
• Optimal and near-optimal broadcast in random graphs
• Telephone Problems with Failures
• Tighter time bounds on fault-tolerant broadcasting and gossiping

Cited in

(1)

• The meaning of frozen tokens in live nets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4858837)