DetNet Bounded Latency-01

Slides:



Advertisements
Similar presentations
1 CNPA B Nasser S. Abouzakhar Queuing Disciplines Week 8 – Lecture 2 16 th November, 2009.
Advertisements

1 CONGESTION CONTROL. 2 Congestion Control When one part of the subnet (e.g. one or more routers in an area) becomes overloaded, congestion results. Because.
1.  Congestion Control Congestion Control  Factors that Cause Congestion Factors that Cause Congestion  Congestion Control vs Flow Control Congestion.
THE SYSTEM THEORY OF NETWORK CALCULUS J.-Y. Le Boudec EPFL WoNeCa, 2012 Mars 21 1.
Priority Scheduling and Buffer Management for ATM Traffic Shaping Authors: Todd Lizambri, Fernando Duran and Shukri Wakid Present: Hongming Wu.
Recent Progress on a Statistical Network Calculus Jorg Liebeherr Department of Computer Science University of Virginia.
CIS679: Scheduling, Resource Configuration and Admission Control r Review of Last lecture r Scheduling r Resource configuration r Admission control.
1 (6TiSCH) Applying PCE to (IPv6-based) Deterministic Networks (in IoT) Pascal Thubert Cisco Systems March 23rd, 2015 Leveraging PCE For Deterministic.
CS640: Introduction to Computer Networks Aditya Akella Lecture 20 - Queuing and Basics of QoS.
© 2006 Cisco Systems, Inc. All rights reserved. 3.2: Implementing QoS.
Providing QoS in IP Networks
Chapter 10 Congestion Control in Data Networks and Internets 1 Chapter 10 Congestion Control in Data Networks and Internets.
Tel Hai Academic College Department of Computer Science Prof. Reuven Aviv Markov Models for data flow In Computer Networks Resource: Fayez Gebali, Analysis.
04/02/08 1 Packet Scheduling IT610 Prof. A. Sahoo KReSIT.
Ethernet Packet Filtering – Part 2 Øyvind Holmeide 10/28/2014 by.
IETF DetNet and IEEE Time-Sensitive Networking
Goals and objectives Project(s): MBH IA Phase 4 Transport for 5G Networks Purpose of the contribution: Input to MBH IA Phase 4 Abstract: Overview on the.
Congestion Control in Data Networks and Internets
Instructor Materials Chapter 6: Quality of Service
Chapter 9 Optimizing Network Performance
QoS & Queuing Theory CS352.
Topics discussed in this section:
Top-Down Network Design Chapter Thirteen Optimizing Your Network Design Copyright 2010 Cisco Press & Priscilla Oppenheimer.
DetNet Data Plane Discussion
Routing and Switching Fabrics
IEEE Time-Sensitive Networking (TSN)
IEEE Time-Sensitive Networking (TSN)
Buffer Management in a Switch
DetNet Service Model draft-varga-detnet-service-model-01
IEEE Time-Sensitive Networking (TSN)
DetNet Data Plane Discussion
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Quality of Service Connecting Networks.
CONGESTION CONTROL.
DetNet Data Plane Protection Implementation Report
Authors Mach Chen (Huawei) Xuesong Geng (Huawei) Zhenqiang Li (CMCC)
Time Sensitive Networking for 5G
DetNet WG Chairs: Lou Berger
Intro to Deterministic Analysis
Congestion Control in Data Networks and Internets
EE 122: Quality of Service and Resource Allocation
DetNet Bounded Latency
Congestion Control (from Chapter 05)
Computer Science Division
Congestion Control, Quality of Service, & Internetworking
Congestion Control (from Chapter 05)
Time-Aware shaping (802.1Qbv) support in the MAC
Network calculus ( system theory )
Advanced Computer Networks
Figure Areas in an autonomous system
Congestion Control (from Chapter 05)
Congestion Control Reasons:
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Quality-of-Service ECE1545.
The Network Layer Congestion Control Algorithms & Quality-of-Service
Congestion Control (from Chapter 05)
Routing and Switching Fabrics
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
DetNet Configuration YANG Model Update
DetNet Bounded Latency-02
IEEE Time-Sensitive Networking (TSN)
DetNet Bounded Latency-04
Editors: Bala’zs Varga, Jouni Korhonen
DetNet WG Chairs: Lou Berger
DetNet Data Plane Solutions draft-ietf-detnet-dp-sol-ip-02  draft-ietf-detnet-dp-sol-mpls-02  Bala’zs Varga, Jouni Korhonen, Janos Farkas, Lou Berger,
Large-Scale Deterministic Network Update
Wireless + TSN = Part of the Picture
DetNet Architecture Updates
Presentation transcript:

DetNet Bounded Latency-01 draft-finn-detnet-bounded-latency-01 Norman Finn, Jean-Yves Le Boudec, Ehsan Mohammadpour, János Farkas, Balázs Varga Huawei EPFL EPFL Ericsson Ericsson DetNet WG Montreal, 16th July, 2018 7/16/2018

A reminder to new attendees … DetNet is about an upper bound on end-to-end latency – not low average latency. Bounded latency  the ability to compute exactly how many buffers are required to achieve zero congestion loss. Feedback that slows down flows to avoid congestion is not an option for the application space of interest to DetNet. Mathematically sound assurances can be given on latency and congestion loss. 7/16/2018

4.3. Relay system model [updates] Output delay Link delay Preemption delay Processing delay Regulation delay Queuing delay 1 Queue Regulator DetNet relay node A DetNet relay node B 6 5 4 2,3 7/16/2018

Interleaved Regulators Interleaved regulator: Called Asynchronous Traffic Shaping (P802.1Qcr) in the context of IEEE 802.1 TSN. An interleaved regulator reshapes individual flows, while doing per-class queuing and not per- flow queuing. Addition of interleaved regulator makes the calculation of end-to-end latency tractable; as in every node, each flow can be treated as a fresh one 7/16/2018

Interleaved regulator is for free i. e Interleaved regulator is for free i.e. does not increase worst-case end-to-end latency! Define: 𝐶 𝐴𝐵 = sup ( 6 𝐴 + 1 𝐴 + 2 𝐴 + 3 𝐴 )+ 4 𝐵 + 5 𝐵 𝑆 𝐴 = sup 6 𝐴 + 1 𝐴 + 2 𝐴 + 3 𝐴 Directly From [Le boudec, 2018]: 𝐶 𝐴𝐵 = 𝑆 𝐴 1 Queue Regulator DetNet relay node A DetNet relay node B 6 5 4 2,3 𝑆 𝐴 7/16/2018 𝐶 𝐴𝐵

7.3. TSN with ATS- Queuing Model [added] (1) Two level of queuing: Interleaved regulators Class-Based FIFO System Contention occurs only at the output port Input ports and switching fabrics are modeled as variable delays with known bounds We focus on classes A and B which queues are using CBS and ATS All classes are non-preemptive Transmission Selection (strict priority) CBS … CDT A B BE0 Interleaved regulators Class-Based FIFO System Highest to lowest priority 7/16/2018 Ref: [Mohammadpour, Stai, Mohiuddin, Le boudec, 2018]

7.3. TSN with ATS- Queuing Model [added] (2) Queuing policy: two flows share the same interleave regulator queue, if: Going to the same output port, and Having the same class, and Coming from the same input port. Regulation: Types of Regulation: + Length Rate Quotient (LRQ) + Leaky Bucket (LB) 7/16/2018 Ref: [Mohammadpour, Stai, Mohiuddin, Le boudec, 2018]

5.1. Examples of Computations- TSN with ATS [added] End-to-end delay bound for flow 𝑓: 𝐷= 𝐶 1,2 + 𝐶 2,3 +…+ 𝐶 𝑘−2,𝑘−1 + 𝑆 𝑘−1 1 2 3 4 k-1 k 𝐶 1,2 𝐶 2,3 𝐶 3,4 𝐶 4,5 𝐶 𝑘−2,𝑘−1 𝑆 𝑘−1 𝑓 R Q R: Regulator Q: Queue 7/16/2018 Ref: [Mohammadpour, Stai, Mohiuddin, Le boudec, 2018]

Suboptimality of per-node E2E delay calculation 1 Queue Reg. 6 5 4 2,3 Define node delay bound: 𝑑 𝑖 = sup 4 𝑖 + 5 𝑖 + 6 𝑖 + 1 𝑖 + 2 𝑖 + 3 𝑖 Then: Latency Bound previous slide ≪ 𝑖=1 𝑘−1 𝑑 𝑖 𝑑 1 𝑑 2 1 2 3 4 k-1 k 𝐶 1,2 𝐶 2,3 𝐶 3,4 𝐶 4,5 𝐶 𝑘−2,𝑘−1 𝑆 𝑘−1 𝑓 R Q 𝑑 3 𝑑 4 𝑑 𝑘−1 R: Regulator Q: Queue 7/16/2018 Ref: [Mohammadpour, Stai, Mohiuddin, Le boudec, 2018]

References [1] J.-Y. Le Boudec, “A Theory of Traffic Regulators for Deterministic Networks with Application to Interleaved Regulators,” arXiv:1801.08477 [cs], Jan. 2018. [Online]. Available: http://arxiv.org/abs/1801.08477/, (Accessed:09/02/2018). [2] E. Mohammadpour, E. Stai, M. Mohiuddin, and J.-Y. Le Boudec, “ End-to-end Latency and Backlog Bounds in Time-Sensitive Networking with Credit Based Shapers and Asynchronous Traffic Shaping,” arXiv:1804.10608 [cs.NI], 2018. [Online]. Available: https: //arxiv.org/abs/1804.10608/ 7/16/2018

A New IEEE 802.1 TSN Project A Project Authorization Request (PAR) has been approved for IEEE P802.1DC Quality of Service Provision by Network Systems P802.1DC scope: This standard specifies procedures and managed objects for Quality of Service (QoS) features specified in IEEE Std 802.1Q, such as per-stream filtering and policing, queuing, transmission selection, flow control and preemption, in a network system which is not a bridge. The intention is that a host, router, label switch, firewall appliance, or any other system can call out the specifications in IEEE Std 802.1DC in order to obtain TSN Quality of Service features. 7/16/2018

Thank you 7/16/2018