Synchronous concurrent broadcasts for intermittent channels with bounded capacities

DOI10.1007/978-3-030-79527-6_17OpenAlexW3175429546MaRDI QIDQ2117736FDOQ2117736

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)

Cites Work

• Distributed Computing: A Locality-Sensitive Approach
• The shortest-path problem for graphs with random arc-lengths
• Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
• Stateless Information Dissemination Algorithms
• On Termination of a Flooding Process
• Amnesiac flooding: synchronous stateless information dissemination
• Probabilistic Analysis of Rumor-Spreading Time

Cited In (4)

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

   Recommendations

• An Overview of Capacity Results for Synchronization Channels 👍 👎
• Title not available (Why is that?) 👍 👎
• Broadcasting in synchronous networks with dynamic faults 👍 👎
• Capacity bounds for a channel with synchronization errors 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)