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
- Understanding School Climate for American Indian Youth: A CBPR Case Study Approach
- Dual Pathways of Concealed Gun Carrying and Use from Adolescence to Adulthood over a 25-year Era of Change
- Improving and Evaluating Computed Tomography and Magnetic Resonance Imaging in the Investigation of Fatalities Involving Suspected Head Trauma