Results 181 to 190 of about 254 (215)

Contention Resolution on a Fading Channel

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fineman, Jeremy T., Gilbert, Seth, Kuhn, Fabian, Newport, Calvin   +3 more
openaire   +3 more sources

Distributed multicast contention resolution using content addressable FIFOs

Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications, 2002
Space switches suffer from external blocking because of output port contention. The authors review contention resolution methods used to avoid external blocking, and choose a solution based on ring reservation, resulting in an elegant and efficient mechanism requiring only nearest-neighbor communications.
K.J. Schultz, P.G. Gulak
openaire   +1 more source

Deterministic Contention Resolution on a Shared Channel

2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS), 2019
A shared communication channel (also known as a multiple access channel) is among the most popular and widely studied models of communication and distributed computing. In this model, stations are able to communicate by transmitting and listening to a shared channel.
De Marco G., Kowalski D. R., Stachowiak G.   +2 more
openaire   +2 more sources

Compressed Screen Content Image Super Resolution

ACM Transactions on Multimedia Computing, Communications, and Applications, 2023
Screen content has become one of the prominent mediums in the increasingly connected world. With the prevalence of remote collaboration and communication such as virtual conferences and online education, recent years have witnessed a dramatic increase in the data volume of the screen content.
Meng Wang, Jizheng Xu, Li Zhang, Junru Li, Kai Zhang, Shiqi Wang, Siwei Ma   +6 more
openaire   +1 more source

Delay Analysis of 0.487 Contention Resolution Algorithms

IEEE Transactions on Communications, 1986
We 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 ...
Huang, Jian-Cheng, Berger, Toby
openaire   +1 more source

Contention Resolution in OBS Networks

2009
OBS networks using the JET/JIT reservation mechanism, which is a one-way and unacknowledged reservation mechanism, provide connectionless switching. Due to this feature, the bursts may contend with one another at the core nodes. Contention among two bursts occurs due to the overlap of two or more bursts (in time) that arrive simultaneously on two ...
T. Venkatesh, C. Siva Ram Murthy
openaire   +1 more source

CSMA/CD with Deterministic Contention Resolution

IEEE Journal on Selected Areas in Communications, 1983
This paper presents a novel media access protocol CSMA/CD with deterministic contention resolution (DCR) for a local area network. It usually operates as CSMA/CD, but once a collision occurs it resolves the collision using a kind of implicit token passing.
A. Takagi, S. Yamada, S. Sugawara
openaire   +1 more source

Adversarial contention resolution for simple channels

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, 2005
This 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, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson   +4 more
openaire   +1 more source

Dynamic Content Adaptive Super-Resolution

2004
We 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   +1 more source

Distributed Contention Resolution in Wireless Networks

2010
We 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   +1 more source