queue_sizing
Size queue consumers and concurrency with Little's law and Erlang C to estimate utilization, wait probability, backlog drain time, and target consumer count.
Instructions
Size consumers with Little's law and stable Erlang C: utilization, wait probability, backlog drain time and target consumers. At most 100,000 total concurrent slots (consumers × concurrency).
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| consumers | Yes | ||
| serviceTimeMs | Yes | ||
| backlogMessages | Yes | ||
| arrivalsPerSecond | Yes | ||
| targetUtilizationPercent | Yes | ||
| maxConcurrencyPerConsumer | Yes |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| kind | No | ||
| inputs | No | ||
| stable | No | ||
| formulas | No | ||
| warnings | No | ||
| limitations | No | ||
| meanInSystem | No | ||
| totalCapacity | No | ||
| waitProbability | No | ||
| offeredLoadErlangs | No | ||
| utilizationPercent | No | ||
| backlogDrainSeconds | No | ||
| visibilityTimeoutHintSeconds | No | ||
| consumersForTargetUtilization | No |