queue_sizing
Calculate required consumers and concurrency with Little’s law and Erlang C to estimate utilization, wait probability, and backlog drain time for queue workloads.
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).
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"arrivalsPerSecond": "<arrivalsPerSecond>",
"serviceTimeMs": "<serviceTimeMs>",
"consumers": "<consumers>"
},
"name": "queue_sizing"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| consumers | Yes | ||
| serviceTimeMs | Yes | ||
| backlogMessages | No | ||
| arrivalsPerSecond | Yes | ||
| targetUtilizationPercent | No | ||
| maxConcurrencyPerConsumer | No |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| kind | No | ||
| inputs | No | ||
| stable | No | ||
| sources | No | ||
| formulas | No | ||
| warnings | No | ||
| validated | No | ||
| limitation | No | ||
| limitations | No | ||
| meanInSystem | No | ||
| totalCapacity | No | ||
| waitProbability | No | ||
| offeredLoadErlangs | No | ||
| utilizationPercent | No | ||
| backlogDrainSeconds | No | ||
| visibilityTimeoutHintSeconds | No | ||
| consumersForTargetUtilization | No |