Subject: [tsvwg] Fwd: New Version Notification for draft-finzi-priority-switching-scheduler-02.txt

From: Emmanuel Lochin <[email-masked]>
Date: Wed, 30 May 2018 16:37:40 +0200

Dear group members,

Please find an update of draft-finzi-priority-switching-scheduler 
following reviews from Nicolas Kuhn and David Black.

EL

-------- Forwarded Message --------
Subject: 	New Version Notification for 
draft-finzi-priority-switching-scheduler-02.txt
Date: 	Wed, 30 May 2018 07:31:15 -0700
From: 	[email-masked]
To: 	Ahlem Mifdaoui <[email-masked]>, Fred Baker 
<[email-masked]>, Fabrice Frances 
<[email-masked]>, Anais Finzi 
<[email-masked]>, Fred Baker <[email-masked]>, 
Emmanuel Lochin <[email-masked]>

A new version of I-D, draft-finzi-priority-switching-scheduler-02.txt
has been successfully submitted by Emmanuel Lochin and posted to the
IETF repository.

Name:		draft-finzi-priority-switching-scheduler
Revision:	02
Title:		Priority Switching Scheduler
Document date:	2018-05-30
Group:		Individual Submission
Pages:		13
URL:            https://www.ietf.org/internet-drafts/draft-finzi-priority-switching-scheduler-02.txt
Status:         https://datatracker.ietf.org/doc/draft-finzi-priority-switching-scheduler/
Htmlized:       https://tools.ietf.org/html/draft-finzi-priority-switching-scheduler-02
Htmlized:       https://datatracker.ietf.org/doc/html/draft-finzi-priority-switching-scheduler
Diff:           https://www.ietf.org/rfcdiff?url2=draft-finzi-priority-switching-scheduler-02

Abstract:
    We detail the implementation of a network scheduler that aims at
    isolating time constrained and elastic traffic flows from best-effort
    traffic.  This scheduler inherits from the priority scheduler (PS)
    but dynamically changes the priority of one or several queues.  Usual
    implementations of rate scheduler schemes (such as WRR, DRR, ...) do
    not allow to efficiently guarantee the capacity dedicated to both AF
    and BE classes as they mostly provide soft bounds.  This means
    excessive margin is used to ensure the capacity requested and this
    impacts the number of additional users that could be accepted in the
    network.  To cope with this issue, this memo presents a credit based
    scheduler mechanism called Priority Switching Scheduler (PSS) that
    allows a more predictable output rate per traffic class.

Please note that it may take a couple of minutes from the time of submission
until the htmlized version and diff are available at tools.ietf.org.

The IETF Secretariat