Problems / RAG and retrieval, medium
Multi-hop questions traverse a knowledge graph: 10 ms of CPU each on 8 vCPUs, at 1,200 questions a second.
Free to open. Runs in your browser, no sign-up.
Success ≥ 99%, p99 ≤ 5 s.
1,200 requests a second for 30 seconds: 100% request (reads).
What each component does in this design, and what calls it. The simulator mimics each one from these settings.
| Component | Its job here | Settings |
|---|---|---|
| Load balancerLoad balancer | Traffic enters here.Calls AI app.Layer 4 balancers route by IP and port; layer 7 balancers read HTTP and can route by path or header. | – |
| AI appApp service | Load balancer forwards to it.Calls GraphRAG index, GPU serving pool.Little's law: throughput ≈ concurrency ÷ latency. 200 slots at 50 ms serve about 4,000 req/s. | 3 replicas × 500 slots · timeout 30 s |
| GraphRAG indexGraphRAG index | AI app calls it.GraphRAG builds a knowledge graph from documents so multi-hop questions can follow relationships. | 64 slots |
| GPU serving poolSelf-hosted serving pool | AI app calls it.GPU servers batch requests together; throughput rises with batch size until memory runs out. | 4000 slots |
Try it first. Open one hint at a time if you get stuck.
CPU needed = 1,200 × 10 ms = 12 vCPUs.
Follow one question through each retrieval stage; the stage that turns red is the one to fix first.
Give the GraphRAG index more capacity and vCPU.