{
  "aliases": [
    "Timeliness-aware Adaptive Replica Selection"
  ],
  "status": "research",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-21",
  "slug": "tars",
  "term": "Tars replica selection",
  "definition": "Tars is a replica-selection scheme that adapts ranking and rate control to the timeliness of server feedback.",
  "note": "The client tracks time since feedback receipt separately from transport delay. Ranking changes after a 100 ms receive-to-use interval; this is a design threshold, not a universal expiry time. The stale branch still uses stored quantities, so it is not wholly feedback-free. Server completion rate is measured separately from individual service duration. [tars-v1]\n\nThe arXiv evaluation uses simulated Poisson arrivals, exponential service and four parallel service slots by default, with 600,000 requests per run and five seeds. Its comparisons do not establish a production speedup. [tars-v1]",
  "related": [
    "adaptive-replica-selection",
    "feedback-age",
    "tail-latency"
  ],
  "citations": [
    {
      "id": "tars-v1",
      "title": "Jiang et al. Tars: Timeliness-aware Adaptive Replica Selection for Key-Value Stores. arXiv:1702.08172v1 (2017), sections III-V.",
      "url": "https://arxiv.org/html/1702.08172v1",
      "accessed": "2026-11-21"
    }
  ],
  "provenance": [
    "Reviewed arXiv v1, sections III-V and Algorithms 1-2; no implementation reproduction claimed."
  ]
}
