Analysis of Backoff Protocols for Mulitiple AccessChannels
SIAM Journal on Computing
Stochastic Contention Resolution With Short Delays
SIAM Journal on Computing
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
A Bound on the Capacity of Backoff and Acknowledgment-Based Protocols
SIAM Journal on Computing
Performance analysis of exponential backoff
IEEE/ACM Transactions on Networking (TON)
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
Routing and scheduling in multihop wireless networks with time-varying channels
ACM Transactions on Algorithms (TALG)
Performance analysis of contention based medium access control protocols
IEEE Transactions on Information Theory
CSMA/CA performance under high traffic conditions: throughput and delay analysis
Computer Communications
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Performance analysis of IEEE 802.11e contention-based channel access
IEEE Journal on Selected Areas in Communications
Medium access control for adversarial channels with jamming
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Adversarial Queuing on the Multiple Access Channel
ACM Transactions on Algorithms (TALG)
Distributed online and stochastic queuing on a multiple access channel
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.00 |
We study broadcasting on multiple access channels by deterministic distributed protocols. Data arrivals are governed by an adversary. The power of the adversary is constrained by the average rate of data injection and a bound on the number of different packets that can be injected in one round. The injection rate is at most 1, which forbids the adversary from overloading the channel. We consider a number of deterministic protocols. For each of them we give an upper bound on the worst-case packet latency, as a function of the constraints imposed on the adversary. We present results of experiments by simulations to compare packet latency of the deterministic protocols and of backoff-type randomized protocols. The experiments are carried out in a simulation environment that captures the burstiness of data injection and the resulting traffic by admissibility condition defined by the fraction of active stations and the rate of changing the status of active versus passive among the stations.