Results 161 to 170 of about 2,151,378 (190)
Some of the next articles are maybe not open access.
Adversarial contention resolution for simple channels
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, 2005This paper analyzes the worst-case performance of randomized backoff on simple multiple-access channels. Most previous analysis of backoff has assumed a statistical arrival model.For batched arrivals, in which all n packets arrive at time 0, we show the following tight high-probability bounds. Randomized binary exponential backoff has makespan Θ(nlgn),
Michael A. Bender +4 more
openaire +2 more sources
Contention Resolution, Matrix Scaling and Fair Allocation
2021A contention resolution (CR) scheme is a basic algorithmic primitive, that deals with how to allocate items among a random set S of competing players, while maintaining various properties. We consider the most basic setting where a single item must be allocated to some player in S.
N. Bansal (Nikhil), I.R. Cohen (Ilan)
openaire +3 more sources
An analysis of a contention resolution algorithm
Acta Informatica, 1987A single multiaccess channel is studied with the outcome of a transmission being either 'idle', 'success', or 'collision' (ternary channel). Packets involved in a collision must be retransmitted, and an efficient way to solve a collision is known in the literature as Gallager-Tsybakov-Mikhailov algorithm.
openaire +3 more sources
Distributed Contention Resolution in Wireless Networks
2010We present and analyze simple distributed contention resolution protocols for wireless networks. In our setting, one is given n pairs of senders and receivers located in a metric space. Each sender wants to transmit a signal to its receiver at a prespecified power level, e.
Thomas Kesselheim, Berthold Vöcking
openaire +2 more sources
On contention resolution protocols and associated probabilistic phenomena
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94, 1994Consider an on-line scheduling problem in which a set of abstract processes are competing for the use of a number of resources. Further assume that it is either prohibitively expensive or impossible for any two of the processes to directly communicate with one another.
Philip D. MacKenzie +2 more
openaire +1 more source
Delay Analysis of 0.487 Contention Resolution Algorithms
IEEE Transactions on Communications, 1986We derive upper and lower bounds to the curve of expected delay versus throughput for the delay-enhanced version of the celebrated 0.487 multiple access contention resolution algorithm. The key to the derivation is a technique for generating upper and lower bounds to monotonic functions of the transmission lag via corresponding bounds on the kernel of ...
Jian-Cheng Huang, Toby Berger
openaire +1 more source
Dynamic Content Adaptive Super-Resolution
2004We propose an automatic adaptive approach to enhance the spatial resolution of an image sequence that allows different regions of the scene to be treated differently based on the content. Experimental results have shown its promise to avoid artifacts that otherwise might result from treating all regions of the scene in the same way during the ...
openaire +2 more sources
Stationary Online Contention Resolution Schemes
<div> Online contention resolution schemes (OCRSs) are a central tool in Bayesian online selection and resource allocation: they convert fractional ex-ante relaxations into feasible online policies while preserving each marginal probability up to a constant factor.Mohammad Reza Aminian +2 more
openaire +2 more sources
Online Contention Resolution Schemes With Applications to Bayesian Selection Problems
SIAM Journal on Computing, 2021Moran Feldman +2 more
exaly
A Review of Contention Resolution Algorithms for IEEE 802.14 Networks
IEEE Communications Surveys and Tutorials, 1999Nada Golmie
exaly