{"$schema":"https://wellknown.network/schemas/agent-record-v1.json","schemaVersion":"1","id":"ag_65aj6dxkk9v3","handle":"queuesim","url":"https://wellknown.network/agents/queuesim","links":{"self":"https://wellknown.network/agents/queuesim/record.json","html":"https://wellknown.network/agents/queuesim","markdown":"https://wellknown.network/agents/queuesim/record.md","api":"https://wellknown.network/api/v1/agents/queuesim","status":"https://wellknown.network/api/v1/agents/queuesim/status","claim":"https://wellknown.network/agents/queuesim/claim","claimApi":"https://wellknown.network/api/v1/claims","badge":"https://wellknown.network/agents/queuesim/badge.svg","openapi":"https://wellknown.network/openapi.json"},"ard":{"identifier":"urn:air:queuesim.com:server:queuesim","type":"application/mcp-server-card+json"},"kind":"mcp_server","declared":{"name":"QueueSim","summary":"Run M/M/c queue simulations and four scenarios (call center, ER, coffee shop, single server).","description":"Run M/M/c queue simulations and four scenarios (call center, ER, coffee shop, single server).","publisher":{"name":"com.queuesim","url":null},"homepage":null,"repository":"https://github.com/chiaha-ai/queuesim-site","version":"1.0.0","license":null,"protocols":["mcp"],"tags":[],"pricing":null,"endpoints":[{"url":"https://queuesim.com/mcp/v1","type":"mcp_streamable_http","auth":null,"probeable":true}],"skills":null,"tools":null,"extra":{"updatedAt":"2026-04-25T23:01:32.226181Z","publishedAt":"2026-04-25T23:01:32.226181Z","registryName":"com.queuesim/public"},"attribution":{"kind":"mcp_registry","name":"mcp_registry","repoUrl":"mcp_registry","summary":"mcp_registry","version":"mcp_registry","description":"mcp_registry","publisherName":"mcp_registry"}},"derived":{"capabilities":[{"slug":"commerce.payments","name":"Payments","confidence":0.525,"provenance":"derived"}],"categories":["commerce"]},"observed":{"status":"live","statusReason":"Responded 2h ago.","lastOkAt":"2026-09-05T23:27:59.906Z","lastProbedAt":"2026-09-05T23:27:59.906Z","statusComputedAt":"2026-09-05T23:29:14.037Z","reliability30d":{"probes":1,"successRate":1,"p50Ms":176},"latestObservations":[{"at":"2026-09-05T23:27:59.906Z","kind":"mcp_initialize","ok":true,"httpStatus":200,"latencyMs":176,"error":null,"detail":{"tools":[{"name":"simulate_mmc","description":"Run a generic M/M/c queue simulation. Provide an arrival rate (λ, arrivals/hour), a service rate per server (μ, customers/hour each server can finish), and a se"},{"name":"list_scenarios","description":"List the four pre-built QueueSim scenarios. Returns key, title, and one-line description for each (Single Server, Coffee Shop, Grocery Checkout, Call Center). C"},{"name":"describe_scenario","description":"Return full details for one preset scenario: title, description, teaching note, peak parameters, and per-hour arrival + staffing arrays. Use this before simulat"},{"name":"simulate_scenario","description":"Run one of the four preset scenarios (single, coffee, grocery, callcenter) with optional overrides. Overrides apply UNIFORMLY across open hours — e.g. setting s"},{"name":"simulate_schedule","description":"Run a queueing simulation against an arbitrary 24-hour staffing schedule. Take this when the user describes a custom day shape that doesn't match a preset (e.g."},{"name":"compare_separate_vs_pooled","description":"Run the classic operations-research teaching demo: pooled queueing (one shared queue, c servers) vs separate queues (c independent queues, one server each, λ/c "},{"name":"explain_queueing_theory","description":"Return a ~500-word educational explainer of M/M/c queueing theory: Little's Law, utilization, why averages mislead, how simulation relates to Erlang-C. No input"},{"name":"explain_advanced_patterns","description":"Return a textbook-level description of six queueing complexity patterns beyond basic M/M/c: abandonment/reneging, priority tiers, overflow routing, skills-based"},{"name":"recommend_staffing","description":"INVERSE of simulate_mmc — given an arrival rate, service rate, and a target average wait time, returns the SMALLEST number of servers needed to meet the target."},{"name":"interpret_result","description":"Given an M/M/c configuration (arrivalRate, serviceRate, servers) and optionally an observed average wait, returns a queueing-theory framed interpretation: where"},{"name":"compare_analytical_vs_simulated","description":"Run the same M/M/c configuration through BOTH the closed-form Erlang-C formula AND the discrete-event simulator, returning a side-by-side comparison with deltas"}],"toolCount":11,"serverName":"queuesim-v1","capabilities":["tools"],"serverVersion":"1.0.1","protocolVersion":"2025-06-18"}}],"tools":[{"name":"simulate_mmc","description":"Run a generic M/M/c queue simulation. Provide an arrival rate (λ, arrivals/hour), a service rate per server (μ, customers/hour each server can finish), and a se"},{"name":"list_scenarios","description":"List the four pre-built QueueSim scenarios. Returns key, title, and one-line description for each (Single Server, Coffee Shop, Grocery Checkout, Call Center). C"},{"name":"describe_scenario","description":"Return full details for one preset scenario: title, description, teaching note, peak parameters, and per-hour arrival + staffing arrays. Use this before simulat"},{"name":"simulate_scenario","description":"Run one of the four preset scenarios (single, coffee, grocery, callcenter) with optional overrides. Overrides apply UNIFORMLY across open hours — e.g. setting s"},{"name":"simulate_schedule","description":"Run a queueing simulation against an arbitrary 24-hour staffing schedule. Take this when the user describes a custom day shape that doesn't match a preset (e.g."},{"name":"compare_separate_vs_pooled","description":"Run the classic operations-research teaching demo: pooled queueing (one shared queue, c servers) vs separate queues (c independent queues, one server each, λ/c "},{"name":"explain_queueing_theory","description":"Return a ~500-word educational explainer of M/M/c queueing theory: Little's Law, utilization, why averages mislead, how simulation relates to Erlang-C. No input"},{"name":"explain_advanced_patterns","description":"Return a textbook-level description of six queueing complexity patterns beyond basic M/M/c: abandonment/reneging, priority tiers, overflow routing, skills-based"},{"name":"recommend_staffing","description":"INVERSE of simulate_mmc — given an arrival rate, service rate, and a target average wait time, returns the SMALLEST number of servers needed to meet the target."},{"name":"interpret_result","description":"Given an M/M/c configuration (arrivalRate, serviceRate, servers) and optionally an observed average wait, returns a queueing-theory framed interpretation: where"},{"name":"compare_analytical_vs_simulated","description":"Run the same M/M/c configuration through BOTH the closed-form Erlang-C formula AND the discrete-event simulator, returning a side-by-side comparison with deltas"}],"package":null},"verification":{"claimed":false,"claimedAt":null,"proofs":[]},"provenance":{"sources":[{"source":"mcp_registry","key":"com.queuesim/public","url":"https://registry.modelcontextprotocol.io/v0/servers/com.queuesim%2Fpublic","firstSeenAt":"2026-09-05T20:18:55.325Z","fetchedAt":"2026-09-05T20:18:55.325Z","normalizedAt":"2026-09-05T20:18:55.325Z"}]},"firstSeenAt":"2026-09-05T20:18:55.325Z","updatedAt":"2026-09-05T23:29:19.421Z"}