Token Bucket Request Admission Calculator
Simulate continuous token replenishment and immediate accept/reject decisions for your chronological request sequence.
YOUR CALCULATION
Result
—
Calculation steps
Work through one step at a time or reveal the complete calculation. The steps use your current inputs.
How to calculate
Replenish tokens by elapsed time up to capacity. In entered order, admit a whole request when enough tokens are available; otherwise reject without consuming tokens.
Available=min(capacity,previous tokens+rate×elapsed time); accept when cost≤available
Worked example
With capacity 10, initial 10 and refill 2/s, three requests costing four tokens at time zero admit the first two and reject the third. A two-token request at time one then succeeds.
Assumptions and input details
Single continuous-refill bucket, immediate policing and no waiting queue. Equal-time requests follow entered row order. Token costs may be fractional; no traffic is actually sent. Requests larger than capacity are rejected. This illustrates token-bucket arithmetic, not the complete two-bucket three-color marker of RFC 2697. Up to 200 requests.
References: IETF RFC 2697: token-bucket metering background
Using this calculator
Can I enter my own problem?
Yes. Replace the example values with your own inputs. The result, calculation steps, tables and applicable diagrams update from those inputs. Blank or invalid values clear the result; example values are never silently substituted for missing inputs.
Are the results exact?
Results use floating-point arithmetic and displayed rounding. Read the formula, assumptions and any stated data precision before interpreting the result.
Is my input uploaded?
The calculation runs in your browser. No account, file upload or external AI service is required. Inputs are not saved between page reloads.
Estimate steady-state waiting time and queue length for one shared queue feeding identical parallel servers.
Estimate in-flight data and a receive-window throughput ceiling using entered path bandwidth and round-trip time.
Plan capped exponential retry delays, attempt starts and bounded jitter finish times without sending requests.
Reserved advertising space.