Results 11 to 20 of about 239,561 (285)
Online Contention Resolution Schemes [PDF]
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2015 We introduce a new rounding technique designed for online optimization problems, which is related to contention resolution schemes, a technique initially introduced in the context of submodular function maximization. Our rounding technique, which we call
Feldman, Moran +2 more
core +2 more sources
Submodular Optimization with Contention Resolution Extensions [PDF]
, 2019 This paper considers optimizing a submodular function subject to a set of downward closed constraints. Previous literature on this problem has often constructed solutions by (1) discovering a fractional solution to the multi-linear extension and (2 ...
Moseley, Benjamin, Sviridenko, Maxim
core +4 more sources
Contention Resolution with Predictions [PDF]
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, 2021 In this paper, we consider contention resolution algorithms that are augmented with predictions about the network. We begin by studying the natural setup in which the algorithm is provided a distribution defined over the possible network sizes that predicts the likelihood of each size occurring.
Seth Gilbert +3 more
openaire +2 more sources
Contention resolution on a restrained channel [PDF]
2020 IEEE 26th International Conference on Parallel and Distributed Systems (ICPADS), 2020 9 ...
Elijah Hradovich +2 more
openaire +2 more sources
Contention resolution without collision detection [PDF]
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020 This paper focuses on the contention resolution problem on a shared communication channel that does not support collision detection. A shared communication channel is a multiple access channel, which consists of a sequence of synchronized time slots. Players on the channel may attempt to broadcast a packet (message) in any time slot.
Bender, Michael A. +3 more
openaire +3 more sources
OBS contention resolution performance [PDF]
Performance Evaluation, 2007 In this paper, a performance comparison of resolution policies specific to optical burst switching is presented. A framework, based on a reduced-load approximation, is developed to estimate path blocking probabilities in an optical burst switched network of arbitrary topology, in which any combination of the following resolution policies is applied in ...
Andrew Zalesky +4 more
openaire +2 more sources
Contention resolution with bounded delay [PDF]
Proceedings of IEEE 36th Annual Foundations of Computer Science, 2002 When distributed processes contend for a shared resource, we need a good distributed contention resolution protocol, e.g., for multiple-access channels (ALOHA, Ethernet), PRAM emulation, and optical routing. Under a stochastic model of request generation from n synchronous processes, Raghavan & Upfal (1995) have shown a protocol which is stable for a ...
Mike Paterson, Aravind Srinivasan
openaire +1 more source
Hidden Terminal-Aware Contention Resolution with an Optimal Distribution [PDF]
, 2011 Achieving low-power operation in wireless sensor networks with high data load or bursty traffic is challenging. The hidden terminal problem is aggravated with increased amounts of data in which traditional backoff-based contention resolution mechanisms ...
Ghadimi, Euhanna +4 more
core +2 more sources
On Adaptive Contention Resolution Schemes for IEEE 802.16 BWA Systems
EURASIP Journal on Wireless Communications and Networking, 2009 According to the latest version of the IEEE 802.16 standard, the mandatory contention resolution method is the truncated binary exponential backoff, with the initial window size and the maximum window size controlled by the base station.
Deng Der-Jiunn, Ke Chih-Heng
doaj +2 more sources
Contention Resolution for Coded Radio Networks
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 2022 12 ...
Michael A. Bender +4 more
openaire +3 more sources