Results 251 to 260 of about 239,561 (285)
Some of the next articles are maybe not open access.

Contention Resolution under Selfishness

Algorithmica, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
George Christodoulou 0001   +2 more
openaire   +4 more sources

Towards an Optimal Contention Resolution Scheme for Matchings

open access: yesLecture Notes in Computer Science, 2023
33 ...
Pranav Nuti, Jan Vondrák
exaly   +3 more sources

Stochastic Contention Resolution With Short Delays

SIAM Journal on Computing, 1995
Summary: We study contention resolution protocols under a stochastic model of continuous request generation from a set of contenders. The performance of such a protocol is characterized by two parameters: the maximum arrival rate for which the protocol is stable and the expected delay of a request from arrival to service.
Prabhakar Raghavan, Eli Upfal
openaire   +2 more sources

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.   +2 more
openaire   +2 more sources

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.
Akihiro Takagi   +2 more
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   +4 more
openaire   +1 more source

An analysis of a contention resolution algorithm

Acta Informatica, 1987
A 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   +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, 1994
Consider 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, 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 ...
Jian-Cheng Huang, Toby Berger
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

Home - About - Disclaimer - Privacy