This study examines the use of Chernoff bounds in the context of backoff algorithms.
This study explores the use standard Chernoff bounds and illustrates simplicity of this approach by re-analyzing some well-known backoff algorithms. Backoff algorithms are used in many distributed systems where multiple devices contend for a shared resource. For the classic balls-into-bins problem, the number of singletons—those bins with a single ball—is important to the analysis of several backoff algorithms; however, existing analyses employ advanced probabilistic tools. (Published Abstract Provided)
Downloads
Related Datasets
Similar Publications
- "It's the Best Thing in the World Around Here": The Potential for Protective Places in a High Crime Neighborhood
- Implementation of Electronic Health Record Integration and Clinical Decision Support to Improve Emergency Department Prescription Drug Monitoring Program Use
- Mixed Methods Evaluation of a Jail Diversion Program: Impact on Arrests and Functioning