Synchronous concurrent broadcasts for intermittent channels with bounded capacities

DOI10.1007/978-3-030-79527-6_17MaRDI QIDQ2117736zbMATH OpenOpenAlexFDO

Authors Volker Turau

Publication date 22 March 2022

Full work available at URL https://arxiv.org/abs/2011.05772

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Recommendations

• An Overview of Capacity Results for Synchronization Channels
• scientific article; zbMATH DE number 3884101
• Broadcasting in synchronous networks with dynamic faults
• Capacity bounds for a channel with synchronization errors
• scientific article; zbMATH DE number 3946031
• On the Capacity of Channels With Timing Synchronization Errors
• Broadcasting in conflict-aware multi-channel networks
• Scheduling for Stable and Reliable Communication Over Multiaccess Channels and Degraded Broadcast Channels

Cites work

• Amnesiac flooding: synchronous stateless information dissemination
• Deterministic computations in time-varying graphs: broadcasting under unstructured mobility
• Distributed Computing: A Locality-Sensitive Approach
• On Termination of a Flooding Process
• Probabilistic Analysis of Rumor-Spreading Time
• Stateless Information Dissemination Algorithms
• The shortest-path problem for graphs with random arc-lengths

Cited in

(4)

• An Interleaving Structure for Guaranteed QoS in Real-Time Broadcasting Systems
• Upper bounds and constructions of complete asynchronous channel hopping systems
• The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels
• Termination of amnesiac flooding

This page was built for publication: Synchronous concurrent broadcasts for intermittent channels with bounded capacities

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