{
  "aliases": [],
  "advantages": [],
  "limitations": [],
  "status": "shipping",
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-20",
  "slug": "arrival-curve",
  "term": "Arrival curve",
  "definition": "An arrival curve bounds the amount of traffic that can enter a system over every interval of a given duration.",
  "note": "Interval constraint: cumulative input A obeys A(t) - A(s) <= alpha(t-s) for every 0 <= s <= t. A token-bucket envelope is alpha(u) = b + r*u for u > 0, with alpha(0) = 0. A long-run mean alone supplies no finite burst allowance. [netcal-book]\n\nDelay scope: an arrival envelope restricts offered work, not delivered service. A finite delay guarantee also requires a lower bound on service across the path. [rfc2212]",
  "related": [
    "token-bucket",
    "rate-latency-service-curve",
    "tail-latency"
  ],
  "citations": [
    {
      "id": "netcal-book",
      "title": "Le Boudec and Thiran, Network Calculus, online edition 2022, sections 1.2-1.4",
      "url": "https://leboudec.github.io/netcal/latex/netCalBook.pdf",
      "accessed": "2026-11-20"
    },
    {
      "id": "rfc2212",
      "title": "Shenker, Partridge and Guerin, RFC 2212 (1997), Motivation and Network Element Data Handling",
      "url": "https://www.rfc-editor.org/rfc/rfc2212.html",
      "accessed": "2026-11-20"
    }
  ],
  "provenance": [
    "Deterministic traffic constraint, not an empirical distribution or a fitted percentile. The same accounting unit must be used for traffic and service."
  ]
}
