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
- Comparing Individuals Who Engage in Violent Extremism and Similar Acts: What Research Sponsored by the National Institute of Justice Tells Us
- Switch-on Near Infrared Emission in Albumin Behind Dark Fabric: Toward Application in Forensic Latent Bloodstain Detection
- A New Measure of Prevalence for the National Crime Victimization Survey