Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
Journal of the ACM (JACM)
IEEE Transactions on Information Theory
Efficient optical communication in parallel computers
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Simple, efficient shared memory simulations
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Analysis of Backoff Protocols for Mulitiple AccessChannels
SIAM Journal on Computing
Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers
SIAM Journal on Computing
On contention resolution protocols and associated probabilistic phenomena
Journal of the ACM (JACM)
Stochastic Contention Resolution With Short Delays
SIAM Journal on Computing
An Optical Simulation of Shared Memory
SIAM Journal on Computing
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
The do-all problem in broadcast networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
On selection problem in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Adversarial contention resolution for simple channels
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Adversarial queuing on the multiple-access channel
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
A jamming-resistant MAC protocol for single-hop wireless networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Adversarial Multiple Access Channel with Individual Injection Rates
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Stability of the multiple-access channel under maximum broadcast loads
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Contention resolution under selfishness
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Theory of communication networks
Algorithms and theory of computation handbook
A jamming-resistant MAC protocol for multi-hop wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Adversarial Queuing on the Multiple Access Channel
ACM Transactions on Algorithms (TALG)
Dynamic packet scheduling in wireless networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Competitive and fair throughput for co-existing networks under adversarial interference
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
On the optimality and the stability of backoff protocols
NEW2AN'07 Proceedings of the 7th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
Hi-index | 0.00 |
We study contention resolution in a multiple-access channel such as the Ethernet channel. In the model that we consider, n users generate messages for the channel according to a probability distribution. Raghavan and Upfal have given a protocol in which the expected delay (time to get serviced) of every message is O(log n) when messages are generated according to a Bernoulli distribution with generation rate up to about 1/10. Our main results are the following protocols: (a) one in which the expected average message delay is O(1) when messages are generated according to a Bernoulli distribution with a generation rate smaller than 1/e, and (b) one in which the expected delay of any message is O(1) for an analogous model in which users are synchronized (i.e., they agree about the time), there are potentially an infinite number of users, and messages are generated according to a Poisson distribution with generation rate up to 1/e. (Each message constitutes a new user.)To achieve (a), we first show how to simulate (b) using n synchronized users, and then show how to build the synchronization into the protocol.