Maximum throughput of multiple access channels in adversarial environments

DOI10.1007/S00446-009-0086-4zbMath1267.68049arXiv1801.00194OpenAlexW2031077032MaRDI QIDQ2377132

Dariusz R. Kowalski, Bogdan S. Chlebus, Mariusz A. Rokicki

Publication date: 28 June 2013

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

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

zbMATH Keywords

stabilitythroughputmultiple access channeldeterministic protocolpacket latencyadversarial queuingdistributed broadcasting

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Network protocols (68M12)

Related Items (15)

Maria Serna's contributions to adversarial queuing theory ⋮ Packet latency of deterministic broadcasting in adversarial multiple access channels ⋮ Stable routing scheduling algorithms in multi-hop wireless networks ⋮ Adversarial multiple access channels with individual injection rates ⋮ Stable scheduling in transactional memory ⋮ Restrained medium access control on adversarial shared channels ⋮ Universal stability in multi-hop radio networks ⋮ The distributed wireless gathering problem ⋮ Dynamic multiple-message broadcast: bounding throughput in the affectance model ⋮ Scalable wake-up of multi-channel single-hop radio networks ⋮ Instability behaviour of heterogeneous multimedia networks under dynamic adversarial attacks ⋮ Monitoring churn in wireless networks ⋮ Local queuing under contention ⋮ Broadcasting in ad hoc multiple access channels ⋮ Broadcasting in Ad Hoc Multiple Access Channels

Cites Work

• Unnamed Item
• Unnamed Item
• The impact of network structure on the stability of greedy protocols
• Adaptive packet routing for bursty adversarial traffic
• Broadcasting spanning forests on a multiple-access channel
• A note on models for non-probabilistic analysis of packet switching networks.
• Performing work in broadcast networks
• Adversarial queuing theory
• Universal-stability results and performance bounds for greedy contention-resolution protocols
• Development of the ALOHANET
• A perspective on multiaccess channels
• Stochastic Contention Resolution With Short Delays
• New Stability Results for Adversarial Queuing
• A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols
• A Characterization of Universal Stability in the Adversarial Queuing Model
• Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model
• Stability of Adaptive and Nonadaptive Packet Routing Policies in Adversarial Queueing Networks
• Analysis of Backoff Protocols for Multiple Access Channels
• Adversarial queuing on the multiple-access channel
• Probability and Computing
• Contention resolution with constant expected delay

This page was built for publication: Maximum throughput of multiple access channels in adversarial environments