Bankrupting DoS attackers
From MaRDI portal
Cites work
- A calculus for network delay. I. Network elements in isolation
- Adversarial queuing theory
- Algorithms with Predictions
- Bankrupting Sybil despite churn
- Broadcasting in ad hoc multiple access channels
- Conflict on a communication channel
- Contention Resolution with Predictions
- Fully energy-efficient randomized backoff: slow feedback loops yield fast contention resolution
- How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 708802 (Why is no real title available?)
- scientific article; zbMATH DE number 2009963 (Why is no real title available?)
- scientific article; zbMATH DE number 1844585 (Why is no real title available?)
- scientific article; zbMATH DE number 7829346 (Why is no real title available?)
- Internet Traffic Tends Toward Poisson and Independent as the Load Increases
- Introduction to mathematical probability.
- Jensen’s inequality
- Local queuing under contention
- Making evildoers pay, resource-competitive broadcast in sensor networks
- Maximum throughput of multiple access channels in adversarial environments
- On von Neumann's minimax theorem
- Online Scheduling via Learned Weights
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- reCAPTCHA: human-based character recognition via web security measures
- Resource Burning for Permissionless Systems (Invited Paper)
- Some refinements of Jensen's inequality
- Stable memoryless queuing under contention
- Theory of BAR games
- Traffic model and performance evaluation of Web servers
This page was built for publication: Bankrupting DoS attackers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294937)