{
  "status": "unknown",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-11",
  "slug": "retry-rendezvous",
  "term": "Retry rendezvous",
  "aliases": [],
  "definition": "Retry rendezvous ensures that a repeated request reaches the completion record needed to recognize its earlier execution.",
  "note": "Migration: RIFL associates a completion record with a designated object; both must move together. The receiving server rebuilds the request lookup before serving retries. [rifl]\n\nResult: A duplicate returns the saved result, not a new result inferred from the object's current value. [rifl]\n\nExample: Hesela's constructed five-case illustration distinguishes missing history, an unrestored lookup, a substituted reply, delayed admission and restored history; it is not a deployed-system measurement. [example]",
  "related": [
    "retry-deduplication",
    "idempotency",
    "incarnation-identifier"
  ],
  "citations": [
    {
      "id": "rifl",
      "title": "Lee et al. Implementing Linearizability at Large Scale and Low Latency. SOSP 2015. DOI 10.1145/2815400.2815416; sections 3, 4.1 and 4.4.",
      "url": "https://web.stanford.edu/~ouster/cgi-bin/papers/rifl.pdf",
      "accessed": "2026-11-10"
    },
    {
      "id": "example",
      "title": "Hesela: retry rendezvous, constructed event-order model",
      "url": "https://hesela.dev/research/retry-rendezvous.mjs",
      "accessed": "2026-11-11"
    },
    {
      "id": "analysis",
      "title": "Storage timeouts: retry state must travel with the data",
      "url": "https://hesela.com/analyses/storage-timeouts-uncertain-completion/#retry-rendezvous",
      "accessed": "2026-11-11"
    }
  ],
  "provenance": [
    "Primary-source synthesis and an explicitly hypothetical model. No implementation or performance replication."
  ]
}