Telephone Problems with Failures

DOI10.1137/0607002MaRDI QIDQ3699732zbMATH OpenOpenAlexFDO

Authors Kenneth A. Berman, Michael Hawrylycz

Publication date 1986

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0607002

zbMATH Keywords

communicationcommunication networkk-failure-safemultigraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 4158677
• scientific article; zbMATH DE number 1487731
• On Gossiping with Faulty Telephone Lines
• Interacting with the telephone
• On the problem of re-attempted calls in teletraffic
• scientific article; zbMATH DE number 3106165
• Telecommunication services and service mangament challenges

Cites work

• A Cure for the Telephone Disease
• A Problem with Telephones
• Further gossip problems
• Gossips and telephones
• scientific article; zbMATH DE number 3358479 (Why is no real title available?)
• The communication problem on graphs

Cited in

(17)

• Rapid almost-complete broadcasting in faulty networks
• Broadcasting in complete networks with faulty nodes using unreliable calls
• Communication complexity of fault-tolerant information diffusion
• Graph theoretical issues in computer networks
• Reliable broadcasting
• Broadcasting with linearly bounded transmission faults
• Verifiable broadcasting and gossiping in communication networks
• Lossy gossip and composition of metrics
• Reliable broadcasting in hypercubes with random link and node failures
• On Gossiping with Faulty Telephone Lines
• Improved bounds for minimum fault-tolerant gossip graphs
• FAST BROADCASTING WITH BYZANTINE FAULTS
• scientific article; zbMATH DE number 4158677 (Why is no real title available?)
• Sparse networks supporting efficient reliable broadcasting
• Token transfer in a faulty network
• New bounds on the minimum number of calls in failure‐tolerant gossiping
• Robust gossiping with an application to consensus

This page was built for publication: Telephone Problems with Failures

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