Universal-stability results and performance bounds for greedy contention-resolution protocols

DOI10.1145/363647.363677zbMath1320.68032OpenAlexW2160091270MaRDI QIDQ2947003

No author found.

Publication date: 20 September 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/363647.363677

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network protocols (68M12)

Related Items (33)

Moment conditions for a sequence with negative drift to be uniformly bounded in \(L^r\) ⋮ 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 ⋮ Maximum throughput of multiple access channels in adversarial environments ⋮ Stability in Heterogeneous Dynamic Multimedia Networks ⋮ The complexity of deciding stability under FFS in the adversarial queueing model ⋮ The network as a storage device: dynamic routing with bounded buffers ⋮ Adaptive packet scheduling over a wireless channel under constrained jamming ⋮ Routing and scheduling for energy and delay minimization in the powerdown model ⋮ Adversarial multiple access channels with individual injection rates ⋮ Optimal Packet-Oblivious Stable Routing in Multi-hop Wireless Networks ⋮ Stable scheduling in transactional memory ⋮ Universal stability in multi-hop radio networks ⋮ The Distributed Wireless Gathering Problem ⋮ Performance of scheduling policies in adversarial networks with non-synchronized clocks ⋮ The robustness of stability under link and node failures ⋮ Instability behaviour of heterogeneous multimedia networks under dynamic adversarial attacks ⋮ The Effects of Local Randomness in the Adversarial Queueing Model ⋮ Computing robust basestock levels ⋮ Adversarial models for priority‐based networks ⋮ The chilean highway problem ⋮ Stability bounds in networks with dynamic link capacities ⋮ Adversarial queueing model for continuous network dynamics ⋮ The increase of the instability of networks due to quasi-static link capacities ⋮ An adversarial queueing model for online server routing ⋮ Optimal Algorithms for Detecting Network Stability ⋮ Adversarial queuing theory with setups ⋮ UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS ⋮ Local queuing under contention ⋮ A note on models for non-probabilistic analysis of packet switching networks. ⋮ Broadcasting in ad hoc multiple access channels ⋮ Broadcasting in Ad Hoc Multiple Access Channels

This page was built for publication: Universal-stability results and performance bounds for greedy contention-resolution protocols