Performing work in broadcast networks

DOI10.1007/S00446-005-0153-4zbMath1266.68207OpenAlexW2088952479MaRDI QIDQ2375307

Andrzej Lingas, Dariusz R. Kowalski, Bogdan S. Chlebus

Publication date: 13 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-005-0153-4

zbMATH Keywords

distributed algorithmmultiple-access channelindependent tasksadversaryfail-stop failure

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (6)

Maximum throughput of multiple access channels in adversarial environments ⋮ Adversarial multiple access channels with individual injection rates ⋮ Doing-it-all with bounded work and communication ⋮ Ordered and delayed adversaries and how to work against them on a shared channel ⋮ Monitoring churn in wireless networks ⋮ A robust randomized algorithm to perform independent tasks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient parallel algorithms can be made robust
• Broadcasting spanning forests on a multiple-access channel
• The Do-All problem with Byzantine processor failures
• Performing work with asynchronous processors: Message-delay-sensitive bounds
• The Wakeup Problem in Synchronous Broadcast Systems
• Knowledge and common knowledge in a distributed environment
• Development of the ALOHANET
• A perspective on multiaccess channels
• Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
• A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
• Performing Work Efficiently in the Presence of Faults
• Stochastic Contention Resolution With Short Delays
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• Randomization helps to perform independent tasks reliably
• A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols
• Analysis of Backoff Protocols for Multiple Access Channels
• Efficient algorithms for leader election in radio networks
• On selection problem in radio networks
• An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
• Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
• Time-optimal message-efficient work performance in the presence of faults
• Contention resolution with constant expected delay
• A better wake-up in radio networks
• Distributed Computing

This page was built for publication: Performing work in broadcast networks