[Detnet] Re: I-D Action: draft-joung-detnet-stateless-fair-queuing-08.txt

[Jinoo Joung <[e-mail]>]

Hello WG,

The C-SCORE draft is updated to now have a new section, 9. Relationship to
ITU-T standards;
which briefly describes the overview of ITU-T Y.3129 and Y.3148, and their
relationships to the C-SCORE draft.

Best regards,
Jinoo (on behalf of authors)

On Sat, Feb 28, 2026 at 6:23 PM <[e-mail]> wrote:

> Internet-Draft draft-joung-detnet-stateless-fair-queuing-08.txt is now
> available. It is a work item of the Deterministic Networking (DETNET) WG of
> the IETF.
>
>    Title:   Latency Guarantee with Stateless Fair Queuing
>    Authors: Jinoo Joung
>             Jeong-dong Ryoo
>             Taesik Cheung
>             Yizhou Li
>             Peng Liu
>    Name:    draft-joung-detnet-stateless-fair-queuing-08.txt
>    Pages:   24
>    Dates:   2026-02-28
>
> Abstract:
>
>    This document specifies the framework and the operational procedure
>    for deterministic networking with a set of rate based work conserving
>    packet schedulers.  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 the 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.  Furthermore, this document specifies an
>    approximation of stateless fair queuing implemented via a strict
>    priority (SP) scheduler.  This approach maintains a guaranteed end-
>    to-end (E2E) latency bound.
>
> The IETF datatracker status page for this Internet-Draft is:
> https://datatracker.ietf.org/doc/draft-joung-detnet-stateless-fair-queuing/
>
> There is also an HTMLized version available at:
>
> https://datatracker.ietf.org/doc/html/draft-joung-detnet-stateless-fair-queuing-08
>
> A diff from the previous version is available at:
>
> https://author-tools.ietf.org/iddiff?url2=draft-joung-detnet-stateless-fair-queuing-08
>
> Internet-Drafts are also available by rsync at:
> rsync.ietf.org::internet-drafts
>
>
> _______________________________________________
> detnet mailing list -- [e-mail]
> To unsubscribe send an email to [e-mail]
>