Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
Journal of the ACM (JACM)
Analysis of backoff protocols for multiple access channels
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
IEEE Transactions on Information Theory
Stability of binary exponential backoff
Journal of the ACM (JACM)
Reliable scheduling in a TMR database system
ACM Transactions on Computer Systems (TOCS)
Adaptive backoff synchronization techniques
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Journal of Computer and System Sciences
Efficient PRAM simulation on a distributed memory machine
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Efficient optical communication in parallel computers
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A methodology for implementing highly concurrent data objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
sendmail
Transactional memory: architectural support for lock-free data structures
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
On the self-similar nature of Ethernet traffic
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Randomized algorithms
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
Analysis of practical backoff protocols for contention resolution with multiple servers
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
An Optical Simulation of Shared Memory
SIAM Journal on Computing
Contention resolution with constant expected delay
Journal of the ACM (JACM)
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Journal of the ACM (JACM)
Transactional lock-free execution of lock-based programs
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Log-logarithmic protocols for resolving ethernet and semaphore conflicts
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Obstruction-Free Synchronization: Double-Ended Queues as an Example
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification
Software transactional memory for dynamic-sized data structures
Proceedings of the twenty-second annual symposium on Principles of distributed computing
The blocker tag: selective blocking of RFID tags for consumer privacy
Proceedings of the 10th ACM conference on Computer and communications security
Adversarial queuing on the multiple-access channel
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Contention resolution with heterogeneous job sizes
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A jamming-resistant MAC protocol for single-hop wireless networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Zero pre-shared secret key establishment in the presence of jammers
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and 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
Consensus and mutual exclusion in a multiple access channel
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Deterministic broadcast on multiple access channels
INFOCOM'10 Proceedings of the 29th conference on Information communications
Contention resolution under selfishness
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Contention resolution in multiple-access channels: k-selection in radio networks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
A jamming-resistant MAC protocol for multi-hop wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Distributed coloring in Õ (√log n) Bit Rounds
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Unbounded contention resolution in multiple-access channels
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On the robustness of IEEE 802.11 rate adaptation algorithms against smart jamming
Proceedings of the fourth ACM conference on Wireless network security
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)
Unbounded contention resolution in multiple-access channels
DISC'11 Proceedings of the 25th international conference on Distributed computing
On the capacity of rate-adaptive packetized wireless communication links under jamming
Proceedings of the fifth ACM conference on Security and Privacy in Wireless and Mobile Networks
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
Dynamic contention resolution in multiple-access channels
WWIC'12 Proceedings of the 10th international conference on Wired/Wireless Internet Communication
Modeling and stability analysis of hybrid multiple access in the IEEE 802.15.4 protocol
ACM Transactions on Sensor Networks (TOSN)
Counter-jamming using mixed mechanical and software interference cancellation
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
An efficient and fair MAC protocol robust to reactive interference
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
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), and more generally, for any constant r, r-exponential backoff has makespan Θ(nloglgr n). Quadratic backoff has makespan Θ((n/lg n)3/2), and more generally, for r1, r-polynomial backoff has makespan Θ((n/lg n)1+1/r). Thus, for batched inputs, both exponential and polynomial backoff are highly sensitive to backoff constants. We exhibit a monotone superpolynomial subexponential backoff algorithm, called loglog-iterated backoff, that achieves makespan Θ(nlglg n/lglglg n). We provide a matching lower bound showing that this strategy is optimal among all monotone backoff algorithms. Of independent interest is that this lower bound was proved with a delay sequence argument.In the adversarial-queuing model, we present the following stability and instability results for exponential backoff and loglog-iterated backoff. Given a (λ,T)-stream, in which at most n=λT packets arrive in any interval of size T, exponential backoff is stable for arrival rates of λ=O(1/lgn) and unstable for arrival rates of λ=Ω(lglgn/lgn); loglog-iterated backoff is stable for arrival rates of λ=O(1/(lglgn\lgn)) and unstable for arrival rates of λ=Ω(1/lgn). Our instability results show that bursty input is close to being worst-case for exponential backoff and variants and that even small bursts can create instabilities in the channel.