@techreport{joung-detnet-stateless-fair-queuing-09,
    number =    {draft-joung-detnet-stateless-fair-queuing-09},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-joung-detnet-stateless-fair-queuing/09/},
    author =    {Jinoo Joung and Jeong-dong Ryoo and Taesik Cheung and Yizhou Li and Peng Liu},
    title =     {{Latency Guarantee with Stateless Fair Queuing}},
    pagetotal = 20,
    year =      2026,
    month =     mar,
    day =       30,
    abstract =  {This document specifies the implementation details for the framework specified in ITU-T Y.3129 {[}Y.3129{]} and ITU-T Y.3148 {[}Y.3148{]}. The framework guarantees end-to-end (E2E) latency bounds to flows. The schedulers in core nodes do not need to maintain flow states. Instead, the entrance node of a flow marks an ideal service completion time according to a fluid model, called Finish Time (FT), of a packet in the packet header. The subsequent core nodes update the FT by adding a delay factor, which is a function of the flow and the nodes. The packets in the queue of the scheduler are served in the ascending order of FT. This mechanism is called the stateless fair queuing. The result is that flows are isolated from each other almost perfectly. The latency bound of a flow depends only on the flow's intrinsic parameters such as the maximum burst size and the service rate, except the link capacities and the maximum packet length among other flows sharing each output link with the flow. This document specifies the metadata, formats of metadata, the admission control procedure, and an approximation of stateless fair queuing implemented via a strict priority (SP) scheduler.},
}