sroute · research

sRoute

sRoute is a research storage architecture that uses programmable sSwitches to change I/O paths and destinations.

It builds on IOFlow and supports endpoint, waypoint and scatter routing. Per-I/O rule consistency keeps a request on one configuration; per-flow consistency additionally concerns the relationship between operations. [1]

Forwarding rules created by delegates must be recoverable. The default design stores them with forwarded data. The paper warns that unverified control applications can cause data loss. [1]

A routing experiment therefore needs a value-correctness oracle as well as timing. Preserve the expected data version, operation ordering and recovery conditions when comparing destinations.

Relations

related
IOFlow, Adaptive replica selection, Write off-loading, Tail latency

Advantages

  • Routing policy can be changed without modifying applications or VMs. [1]

Limitations

  • The prototype does not verify arbitrary control-program correctness. [1]

Citations

  1. Stefanovici, Schroeder, O'Shea and Thereska. sRoute: Treating the Storage Stack Like a Network. FAST 2016, sections 2, 3.5-3.7 and 5.1, pp. 197-212. (accessed 2026-11-19)

Further reading

  1. Hesela: storage tail slowdowns and routing correctness (accessed 2026-11-19)
Sources & caveats
  • FAST 2016 primary-paper review; no reproduction or modern-device speedup claim.

JSON: /data/terms/sroute.json

Published by Hesela team · Updated

Report a correction · Editorial standards · Reuse guidance

Cite this page
Hesela team. sRoute. Hesela. 2026-11-19. https://hesela.dev/terms/sroute/