[Detnet] Fwd: New Version Notification for draft-joung-detnet-stateless-fair-queuing-02.txt

Jinoo Joung <jjoung@smu.ac.kr> Thu, 29 February 2024 11:43 UTC

MIME-Version: 1.0
References: <170920603648.22351.2677165137231715936@ietfa.amsl.com>
In-Reply-To: <170920603648.22351.2677165137231715936@ietfa.amsl.com>
From: Jinoo Joung <jjoung@smu.ac.kr>
Date: Thu, 29 Feb 2024 20:43:10 +0900
Message-ID: <CA+8ZkcSV18C828sezwBmgSkhwyrOUXeqJdM1SsvdZEh2Urmg6A@mail.gmail.com>
To: DetNet WG <detnet@ietf.org>
Content-Type: multipart/alternative; boundary="000000000000384703061283c4a0"
Archived-At: <https://mailarchive.ietf.org/arch/msg/detnet/0M4-N8hQeHz-p30HQ_5wireLiBM>
Subject: [Detnet] Fwd: New Version Notification for draft-joung-detnet-stateless-fair-queuing-02.txt
Precedence: list

Dear WG members,

The C-SCORE draft has been updated to include Section 6.4 Characteristics.
According to the Taxonomy draft, the strengths of C-SCORE and the
categories it falls into are described.

Its strengths are threefold.
Flow isolation capability, statistical multiplexing gain, and simple
admission condition check process.

Please take a look and share your thoughts.

Best,
Jinoo (on behalf of authors)

---------- Forwarded message ---------
From: <internet-drafts@ietf.org>
Date: Thu, Feb 29, 2024 at 8:27 PM
Subject: New Version Notification for
draft-joung-detnet-stateless-fair-queuing-02.txt
To: Jeong-dong Ryoo <ryoo@etri.re.kr>, Jinoo Joung <jjoung@smu.ac.kr>, Peng
Liu <liupengyjy@chinamobile.com>, Taesik Cheung <cts@etri.re.kr>, Yizhou Li
<liyizhou@huawei.com>


A new version of Internet-Draft
draft-joung-detnet-stateless-fair-queuing-02.txt has been successfully
submitted by Jinoo Joung and posted to the
IETF repository.

Name:     draft-joung-detnet-stateless-fair-queuing
Revision: 02
Title:    Latency Guarantee with Stateless Fair Queuing
Date:     2024-02-29
Group:    Individual Submission
Pages:    15
URL:
https://www.ietf.org/archive/id/draft-joung-detnet-stateless-fair-queuing-02.txt
Status:
https://datatracker.ietf.org/doc/draft-joung-detnet-stateless-fair-queuing/
HTMLized:
https://datatracker.ietf.org/doc/html/draft-joung-detnet-stateless-fair-queuing
Diff:
https://author-tools.ietf.org/iddiff?url2=draft-joung-detnet-stateless-fair-queuing-02

Abstract:

   This document specifies the framework and the operational procedure
   for deterministic networking with work conserving packet schedulers
   that guarantee end-to-end latency bounds to flows.  Schedulers in
   core nodes of the network do not need to maintain flow states.
   Instead, the entrance node of a flow marks an ideal service
   completion time, called Finish Time (FT), of a packet in the packet
   header.  The subsequent core nodes update FT by adding a delay
   factor, which is a function of the flow and upstream nodes.  The
   packets in the queue are served in the ascending order of the FT.
   This technique is called Fair Queuing (FQ).  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, except the
   link capacities and the maximum packet lengths among other flows
   sharing each output link with the flow.



The IETF Secretariat

[Detnet] Fwd: New Version Notification for draft-… Jinoo Joung