{
  "aliases": [
    "Rate-latency server"
  ],
  "advantages": [],
  "limitations": [],
  "status": "shipping",
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-20",
  "slug": "rate-latency-service-curve",
  "term": "Rate-latency service curve",
  "definition": "A rate-latency service curve gives a minimum-service guarantee with rate R and latency parameter T through beta(u) = R*max(0,u-T).",
  "note": "Guarantee: cumulative output D satisfies D(t) >= inf over 0 <= s <= t of A(s) + beta(t-s). This does not promise service while no work is available. R is a guaranteed share, not necessarily the physical transmission rate. [packet-bound]\n\nFluid bound: a FIFO lossless flow constrained by burst b and rate r <= R has delay at most T + b/R and backlog at most b + r*T. A general service curve bounds virtual delay; individual request delay additionally needs an ordering or scheduling guarantee. [netcal-book]\n\nPacket boundary: fixed-rate, non-preemptive transmission and known packet length can tighten the FIFO response-time bound. That packet model is not automatically a storage-device model. [packet-bound]",
  "related": [
    "arrival-curve",
    "token-bucket",
    "tail-latency",
    "strict-service-curve",
    "leftover-service-curve"
  ],
  "citations": [
    {
      "id": "packet-bound",
      "title": "Mohammadpour, Stai and Le Boudec (2019), Improved Delay Bound for a Service Curve Element, sections II-IV",
      "url": "https://arxiv.org/pdf/1905.04956v2",
      "accessed": "2026-11-20"
    },
    {
      "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"
    }
  ],
  "provenance": [
    "Theory and worked examples, not a measured storage reservation. An average benchmark cannot establish a minimum-service guarantee."
  ]
}
