Stateless Resource Sharing AND ATS

Similar documents
STateless Resource Sharing (SRS)

What Is Congestion? Computer Networks. Ideal Network Utilization. Interaction of Queues

EE 122: Differentiated Services

Congestion in Data Networks. Congestion in Data Networks

Lecture 4 Wide Area Networks - Congestion in Data Networks

Resource allocation in networks. Resource Allocation in Networks. Resource allocation

Questions about Asynchronous Traffic Shaping

What Is Congestion? Effects of Congestion. Interaction of Queues. Chapter 12 Congestion in Data Networks. Effect of Congestion Control

different problems from other networks ITU-T specified restricted initial set Limited number of overhead bits ATM forum Traffic Management

Lecture 22: Buffering & Scheduling. CSE 123: Computer Networks Alex C. Snoeren

Lesson 14: QoS in IP Networks: IntServ and DiffServ

Urgency Based Scheduler Scalability - How many Queues?!

ATM Quality of Service (QoS)

P802.1CM Simulation Results for. Profiles A &B. János Farkas and Balázs Varga.

UNIT IV TRANSPORT LAYER

Unit 2 Packet Switching Networks - II

TELE Switching Systems and Architecture. Assignment Week 10 Lecture Summary - Traffic Management (including scheduling)

Overview Computer Networking What is QoS? Queuing discipline and scheduling. Traffic Enforcement. Integrated services

Chapter 23 Process-to-Process Delivery: UDP, TCP, and SCTP

Application of Network Calculus to the TSN Problem Space

ETSF05/ETSF10 Internet Protocols. Performance & QoS Congestion Control

"Filling up an old bath with holes in it, indeed. Who would be such a fool?" "A sum it is, girl," my father said. "A sum. A problem for the mind.

Comparing the bandwidth and priority Commands of a QoS Service Policy

CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS

Priority Considerations for Fronthaul Traffic. Raghu M. Rao, Xilinx Inc.

Traffic Access Control. Hamid R. Rabiee Mostafa Salehi, Fatemeh Dabiran, Hoda Ayatollahi Spring 2011

Congestion Management in Lossless Interconnects: Challenges and Benefits

CSCD 433/533 Advanced Networks Spring Lecture 22 Quality of Service

Project Computer Networking. Resource Management Approaches. Start EARLY Tomorrow s recitation. Lecture 20 Queue Management and QoS

Configuring QoS. Understanding QoS CHAPTER

3. Quality of Service

Computer Networking. Queue Management and Quality of Service (QOS)

ETSF05/ETSF10 Internet Protocols. Performance & QoS Congestion Control

Frame Relay. Frame Relay: characteristics

Lecture Outline. Bag of Tricks

Kent State University

IT Certification Exams Provider! Weofferfreeupdateserviceforoneyear! h ps://

Network Model for Delay-Sensitive Traffic

Congestion Control Open Loop

Lecture 21. Reminders: Homework 6 due today, Programming Project 4 due on Thursday Questions? Current event: BGP router glitch on Nov.

Configuring QoS. Finding Feature Information. Prerequisites for QoS

Lecture 5: Performance Analysis I

Streaming Video and TCP-Friendly Congestion Control

Supporting Service Differentiation for Real-Time and Best-Effort Traffic in Stateless Wireless Ad-Hoc Networks (SWAN)

Communication Problems. Flow Control

Module objectives. Integrated services. Support for real-time applications. Real-time flows and the current Internet protocols

Routing Algorithm. How do I know where a packet should go? Topology does NOT determine routing (e.g., many paths through torus)

CSE 123b Communications Software

Scheduled queues, UBS, CQF, and Input Gates

Stream Metering for Guaranteed Low-Latency of Industrial Control-Data Streams

QUALITY of SERVICE. Introduction

IEEE Time-Sensitive Networking (TSN)

Problems with IntServ. EECS 122: Introduction to Computer Networks Differentiated Services (DiffServ) DiffServ (cont d)

Scheduling. Scheduling algorithms. Scheduling. Output buffered architecture. QoS scheduling algorithms. QoS-capable router

QoS support for Intelligent Storage Devices

Configuring QoS CHAPTER

Configuring QoS. Finding Feature Information. Prerequisites for QoS. General QoS Guidelines

Chapter 24 Congestion Control and Quality of Service Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

QoS for Real Time Applications over Next Generation Data Networks

Fairness, Queue Management, and QoS

Congestion Control and Resource Allocation

Understanding Queuing and Scheduling QoS on Catalyst 4000 Supervisor III and IV

CS 268: Integrated Services

Performance Analysis of Darwin: Transient State

Congestion Control in Communication Networks

Advanced Computer Networks

Toward a Reliable Data Transport Architecture for Optical Burst-Switched Networks

Analysis and modeling of asynchronous traffic shaping in time sensitive networks

Before configuring standard QoS, you must have a thorough understanding of these items:

Configuring QoS CHAPTER

Priority Traffic CSCD 433/533. Advanced Networks Spring Lecture 21 Congestion Control and Queuing Strategies

Advanced Mechanisms for Available Rate Usage in ATM and Differentiated Services Networks

15-744: Computer Networking. Overview. Queuing Disciplines. TCP & Routers. L-6 TCP & Routers

Lecture 21: Congestion Control" CSE 123: Computer Networks Alex C. Snoeren

CS519: Computer Networks. Lecture 5, Part 4: Mar 29, 2004 Transport: TCP congestion control

Activity-Based Congestion Management for Fair Bandwidth Sharing in Trusted Packet Networks

TSN FOR 802.3CG AN OVERVIEW WITH SOME SPECIFIC APPLICATIONS CRAIG GUNTHER

Configuring QoS CHAPTER

Lecture 24: Scheduling and QoS

Episode 5. Scheduling and Traffic Management

Week 7: Traffic Models and QoS

Integrated and Differentiated Services. Christos Papadopoulos. CSU CS557, Fall 2017

CS4700/CS5700 Fundamentals of Computer Networks

AVB Latency Math. v5 Nov, AVB Face to Face Dallas, TX Don Pannell -

CS519: Computer Networks. Lecture 5, Part 5: Mar 31, 2004 Queuing and QoS

Prof. Dr. Abdulmotaleb El Saddik. site.uottawa.ca mcrlab.uottawa.ca. Quality of Media vs. Quality of Service

Basics (cont.) Characteristics of data communication technologies OSI-Model

Real-Time Protocol (RTP)

CS 268: Computer Networking

Wireless Networks (CSC-7602) Lecture 8 (22 Oct. 2007) Seung-Jong Park (Jay) Fair Queueing

Scheduled queues, UBS, CQF, and Input Gates

CHAPTER 9: PACKET SWITCHING N/W & CONGESTION CONTROL

On Generalized Processor Sharing with Regulated Traffic for MPLS Traffic Engineering

MQC Hierarchical Queuing with 3 Level Scheduler

Introduction to Real-Time Communications. Real-Time and Embedded Systems (M) Lecture 15

QoS in Frame relay networks

DetNet. Flow Definition and Identification, Features and Mapping to/from TSN. DetNet TSN joint workshop IETF / IEEE 802, Bangkok

Principles. IP QoS DiffServ. Agenda. Principles. L74 - IP QoS Differentiated Services Model. L74 - IP QoS Differentiated Services Model

Baidu s Best Practice with Low Latency Networks

Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks. Congestion Control in Today s Internet

Transcription:

Stateless Resource Sharing AND ATS Putting together the Best of breads IEEE P802.1Qcr, 2016-09-14, York, UK Szilveszter Nádas, Balázs Varga (A), János Farkas

Introduction SRS Overview and Presentation Goal Stateless Resource Sharing (SRS) via per packet value (PPV) marking Basic concept was presented in Budapest Summary Unique characteristics SRS via PPV at-a-glance Link-to-contribution http://www.ieee802.org/1/ files/public/docs2016/ cr-varga-srs-ppv-0526-v02.pdf SRS essentials: Share of available BW between flows is encoded in the packets (i.e. shade of a packet) Shade based dropping in queues does not need traffic situation specific pre-configuration at the congestion point(s) BW share is automatically controlled by the shades of packets participating in congestion situation Accuracy of BW share depends on the number of shades used (Note: predefined ratio exactly ensured if drop level = border between shades) enb-1 enb-2 Marking of Packet Value PE P P Transport PE Site Goal of this presentation to show Combination of SRS and ATS Achievable advantages by such a combination Explicit feedback is possible for systems that need congestion notification (i.e. what level of congestion they will face during transport is known from the congestion shade) SRS Queuing Combining ATS and SRS IEEE P802.1Qcr York, UK 2016-09-14 Page 2

SRS Provides zero congestion loss and deterministic latency SRS can achieve zero congestion loss and deterministic latency Congestion results in packet drop: Darker packets kick-off brighter ones Congestion level: Can be defined by a congestion shade Note: All traffic having darker shades than the Congestion Threshold Value will experience zero loss and deterministic delay SRS shortcomings Congestion Threshold Value is not set in advance, it is rather the result of actual load and bottleneck capacity SRS (itself) does not protect against bad behaving nodes BUT: Congestion Threshold Value can be dimensioned by resource allocation and worst case delay calculation (by e.g. ATS) All packets dropped Congestion Threshold Value Congestion shade All packets forwarded Combining ATS and SRS IEEE P802.1Qcr York, UK 2016-09-14 Page 3

SRS Add-ons Deterministic Delay for lossless & lossy traffic It is possible to extend the ATS scenario with traffic that has the same delay guarantee as guaranteed TSN traffic, but some loss is allowed, i.e., it is lossy What does it mean in practice? Allows reservation of less resources for ATS flows which have a loss tolerant component but need in-order-delivery for all packets of a data-flow Additional loss tolerant flows that require the same deterministic delay can be served easily Other scenarios may also exist The positive effect It can highly increase link utilization when some flows do not use their reservation all the time Under the prerequisite that (some) lossy traffic has delay guarantee too This works hop-by-hop, not just for flows following the same path Combining ATS and SRS IEEE P802.1Qcr York, UK 2016-09-14 Page 4

SRS+ATS Use Cases Alarm traffic There is a wide range of different importance from good to know to critical Some alarms are loss critical, some also delay critical It is hard to dimension for, because it is rare and bursty Proposal: Control the priority of the alarm traffic by SRS. Allow less critical TSN traffic use this capacity when (typically) available. Layered video traffic Key frames and other critical frames are guarantees Other enhancement layers that are good to have are non-guaranted (can be lost, but delay is still bounded) Combining ATS and SRS IEEE P802.1Qcr York, UK 2016-09-14 Page 5

ATS and its SUB-Queues REMINDER We propose to extend the handling for sub-queues Sub-queue handling is detailed on following slides Number of the following is kept Sub-priorities Sub-queues State is the same as for ATS* * Except tuning variables for f and g (few per sub-queues) Combining ATS and SRS IEEE P802.1Qcr York, UK 2016-09-14 Page 6 Taken form slide 10 of http://www.ieee802.org/1/files/public/docs2015/new-tsn-specht-ubs-queues-0521-v0.pdf

Architecture Putting it All together Packets arriving to queue Ingress filtering -let guaranteed pass -drop/pass nonguaranteed g TBs Token Buckets (detailed) ATS sub-queue statistics Parameter tuning for f and g Interleaved shaping -delaying guaranteed packets -dropping/serving non-guaranteed packets f Packets leaving interleaved shaper TBs l is the length of the packet v is the shade/value of the packet l l is an effective packet length calculated by f or g functions Non-guaranteed eligible if at least l tokens in a ng TB space E.g. b i + l tokens in a sub-shaper per flow bucket TB i (till b i reserved for guaranteed) TB i TB i TB i TB ng TB i (per-flow) l =f(v,l) b ng Combining ATS and SRS IEEE P802.1Qcr York, UK 2016-09-14 Page 7 (Nr of tokens in bucket) b i

Architecture ALT2 A single excess bucket for non- Guaranteed A single excess bucket for non- Guaranteed traffic is also a possibility All/selected sub-shaper per flow buckets overflow into this bucket r 1 b 1 r i b i...... r n b n Token Buckets (detailed) Tokens overflow TBi TBi TBi TB ng l =f(v,l) b ng Combining ATS and SRS IEEE P802.1Qcr York, UK 2016-09-14 Page 8

outcome of combination Loss vs. Throughput A slightly larger bucket size The possibility of forwarding non-guaranteed packets results in a larger achievable flow rate The packet value determines Whether or not a packet is guaranteed Whether a non-guaranteed packet is dropped or forwarded (note: there can be more important and less important nonguaranteed packets) The size of the larger bucket is chosen based on a compromise between (1) delay, (2) allowed total guaranteed rate, and (3) allowing excess traffic The per hop delay remains bounded 1 Drop probability ATS SRS + ATS Larger achievable flow rate Flow throughput Combining ATS and SRS IEEE P802.1Qcr York, UK 2016-09-14 Page 9

Summary Further work This is an initial proposal to evolve ATS further Delay model and math to be discussed and verified in detail Further use cases Combining ATS and SRS IEEE P802.1Qcr York, UK 2016-09-14 Page 10

Combining ATS and SRS IEEE P802.1Qcr York, UK 2016-09-14 Page 11

Changed components for Combining SRS and ATS Need to be able to identify additional traffic (at all hops) Slightly larger bucket sizes are needed to allow excess traffic Interleaved shaping has to be able to drop excess packets read packet values, and based on that, influence whether a packet is dropped or not Interleaved shaping -delaying guaranteed packets -dropping/serving non-guaranteed packets f TBs Ingress filtering for excess packets is needed in order to avoid flooding the queues Slightly larger buffers are needed Ingress filtering -let guaranteed pass -drop/pass nonguaranteed g TBs g statistics Statistics from all boxes are needed to tune packet value aware dropping Combining ATS and SRS IEEE P802.1Qcr York, UK 2016-09-14 Page 12 Parameter tuning for f and g f