Is AVB really much better than classic IEEE 802.1Q queuing?

Slides:



Advertisements
Similar presentations
Achieving Quality of Service in Wireless Networks A simulation comparison of MAC layer protocols. CS444N Presentation By: Priyank Garg Rushabh Doshi.
Advertisements

EECB 473 Data Network Architecture and Electronics Lecture 3 Packet Processing Functions.
Differentiated Services. Service Differentiation in the Internet Different applications have varying bandwidth, delay, and reliability requirements How.
In-Band Flow Establishment for End-to-End QoS in RDRN Saravanan Radhakrishnan.
G Robert Grimm New York University Receiver Livelock.
Distributed Multimedia March 19, Distributed Multimedia What is Distributed Multimedia?  Large quantities of distributed data  Typically streamed.
1 (6TiSCH) Applying PCE to (IPv6-based) Deterministic Networks (in IoT) Pascal Thubert Cisco Systems March 23rd, 2015 Leveraging PCE For Deterministic.
CONGESTION CONTROL and RESOURCE ALLOCATION. Definition Resource Allocation : Process by which network elements try to meet the competing demands that.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
Modeling and Simulating Time- Sensitive Networking Harri Laine.
Mr. Mark Welton.  Quality of Service is deployed to prevent data from saturating a link to the point that other data cannot gain access to it  QoS allows.
Efficient Gigabit Ethernet Switch Models for Large-Scale Simulation Dong (Kevin) Jin David Nicol Matthew Caesar University of Illinois.
Queue Scheduling Disciplines
© 2006 Cisco Systems, Inc. All rights reserved. 3.2: Implementing QoS.
04/02/08 1 Packet Scheduling IT610 Prof. A. Sahoo KReSIT.
© Airspan Networks Inc. Automatic QoS Testing over IEEE Standard.
Ethernet Packet Filtering – Part 2 Øyvind Holmeide 10/28/2014 by.
ETTC 2015-Guaranteed end-to-end latency through Ethernet Øyvind Holmeide 02/01/2015 by.
William Stallings Data and Computer Communications
Internet Quality of Service
Rami Neiman & Yaron Perry
Pedro Moreira CERN BE-CO-HT
Congestion Control in Data Networks and Internets
Instructor Materials Chapter 6: Quality of Service
Chapter 9 Optimizing Network Performance
Corelite Architecture: Achieving Rated Weight Fairness
Khiem Lam Jimmy Vuong Andrew Yang
QoS & Queuing Theory CS352.
Topics discussed in this section:
Reference distribution
Top-Down Network Design Chapter Thirteen Optimizing Your Network Design Copyright 2010 Cisco Press & Priscilla Oppenheimer.
Klara Nahrstedt Spring 2012
Automotive Ethernet Testing and Development
Empirically Characterizing the Buffer Behaviour of Real Devices
Buffer Management in a Switch
Congestion Control and Resource Allocation
Round Robin vs. Fair Queuing
Network Components.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 6: Quality of Service Connecting Networks.
Gates vs. Windows and Scheduled Traffic
Advanced Computer Networks
Overview What is Multimedia? Characteristics of multimedia
QoS Guarantees introduction call admission traffic specification
THE IEEE MAC SUB-LAYER – chapter 14
NT2640 Unit 9 Activity 1 Handout
Provision of Multimedia Services in based Networks
Fair Queueing.
OPNET Simulation of Different Queuing Mechanisms
Kevin Lee & Adam Piechowicz 10/10/2009
On-time Network On-chip
CPU SCHEDULING.
Virtual-Time Round-Robin: An O(1) Proportional Share Scheduler
EE 122: Lecture 18 (Differentiated Services)
Congestion Control, Quality of Service, & Internetworking
Subject Name: Adhoc Networks Subject Code: 10CS841
Lightweight but Powerful QoS Solution for Embedded Systems
Interworking with 802.1Qat Stream Reservation Protocol
XRAN (eCPRI) S-Plane Sync Update
Enhanced-DCF Wireless MAC Protocol: Some Simulation Results
The Network Layer Congestion Control Algorithms & Quality-of-Service
Introduction to Packet Scheduling
ITIS 6167/8167: Network and Information Security
Congestion Control and Resource Allocation
DetNet Bounded Latency-02
How MAC interacts with Capacity of Ad-hoc Networks – Interference problem Capacity of Wireless Networks – Part Page 1.
Dr. John P. Abraham Professor UTPA
DetNet Bounded Latency-04
Use Cases and Requirements for Managed LAN as a Service (MLaaS)
Use Cases and Requirements for Managed LAN as a Service (MLaaS)
Introduction to Packet Scheduling
Presentation transcript:

Is AVB really much better than classic IEEE 802.1Q queuing? Alon Regev, Ixia Bogdan Tenea, Ixia 2016-09-21

Ethernet, best effort and quality of service Original Ethernet was best effort – no guarantees with regards to delivery of datagrams IEEE 802.1p (later 802.1Q) added support for provisions for quality of service (QoS) in 1998 IEEE 802.1BA (and others from the same standards suite), or Audio Video Bridging (AVB), was created in 2011 to enhance usability of Ethernet for media streaming Some parts of AVB were later integrated in 802.1Q-2014 Benefits of AVB over “classic” 802.1Q queueing are unclear to many users

Purpose of this presentation In February 2016 a group of people set out to analyze differences between AVB and QoS. Contributors included: Kevin Stanton, Intel Hugo Savino, Extreme Networks Alon Regev, Ixia Anand Ram, Calnex Kulin Shah, Arista Bogdan Tenea, Ixia Michael Francini, Arista Christopher Hall, Intel Michael Johas Teener, Broadcom Chun Zhang, Extreme Networks Nestor Amaya, Coveloz David Moser, ESPN Nikhil Kallat, Arista Eric Craig, Calnex Robert Welch, Arista Plus several others Results focused on measuring traffic throughput and latency and time sync quality Tests were conduced at Ixia’s iSimCity and results shared in this presentation were measured using Ixia’s IxNetwork AVB tester This presentation will: Shed some light on the technical details of QoS and AVB Show results comparing AVB with classic QoS

Introduction to QoS and AVB

Quality of service with Strict Priority Packets with higher priority always get forwarded first Make changes to animation to schedule packets as others come in

Quality of service with Strict Priority Packets with higher priority always get forwarded first Packets from lower priority classes may be delayed/dropped

Quality of service with Strict Priority Packets with higher priority always get forwarded first Packets from lower priority classes may be delayed/dropped With two types of priority traffic second priority may not get guarantees

Quality of service with Weighted Round Robin A certain percent of packets or bytes get forwarded from each queue This guarantees minimum bandwidth but there’s no way to put a limit on maximum bandwidth per each queue If other queues are empty a single queue can use all the bandwidth W=3 W=2 W=1

Quality of service with AVB Credit Based Shaper CBS divides traffic into multiple (configurable) classes of reserved traffic AVB guarantees a maximum bandwidth where stream/class gets priority A stream/class cannot exceed the reserved limit Traffic from a class can only be sent when that class has positive credit, and credit is accumulated when traffic is not sent by that class This has the effect of spacing out packets so as not to create bursts This behavior is also required from well behaved Talker end-nodes Spacing out packets means not starving other classes of traffic Shaping Per Class Cls BW = 𝑠𝑡𝑟𝑒𝑎𝑚 𝑏𝑤=1 𝑛 Stream BW n Per Class Shaper 0T 1T 0.2T 0.4T 0.6T 0.8T 0.5T 1 2 3 4 5 6 T – time Period Spacing

AVB Credit Based Shaper Source: Christian Boiger, Deggendorf University of Applied Sciences, IEEE 802 Tutorial http://www.ieee802.org/1/files/public/docs2012/tutorial-Deterministic-Ethernet-1112.ppt

Other things that IEEE AVB brings Automated stream reservation through MSRP, and thus the possibility to say no Less important for automotive as it generally uses static configuration Common time for all the elements in a system, so that all Listeners (speakers, screens) can playback the synchronized content Achieved through gPTP, an adapted version of Precision Time Protocol (PTP) gPTP achieves fast synchronization and allows using lower quality oscillators Classic PTP clock chain using Phase Locked Loops When starting up each clock is physically adjusting its oscillator based on input from master, which is doing the same from it’s master, tending to have cascading amplification of error and of settling time Each clock measures the frequency ratio to it’s neighbor (NRR) and receives cumulative ratio (RR) to Grandmaster from it’s master. Global clock is generated from a local clock that is free-running and ratio to Grandmaster mathematically gPTP chain using residence time adjustment and neighbor rate ratio (NRR) measurement NRR2to1=1.1 RR2 = RR1 * NRR2to1 = 1 * 1.1 RR1 = 1 NRR3to2=1.2 NRR4to3=1.3 RR3 = RR2 * NRR3to2 = 1.1 * 1.2 RR4 = RR3 * NRR4to3 = 1.1 * 1.2 * 1.3

Test Scenarios & Results Tests for classic QoS vs AVB

Each video talker takes 5% of the bandwidth Chained switches with video (highest), audio (medium) and other traffic (low) Switch #1 U1 Background 1 2 Video 12 U2 5% #2 Video 21 Video 22 #3 Video 31 Video 32 #4 Video 41 Video 42 #5 Video 51 Video 52 #6 Video 61 Video 62 4 Audio (VoIP) 10% 3 Video 11 90% 80% 70% 60% 50% 40% Listener Back ground 110% Each video talker takes 5% of the bandwidth 1G: 30 fps, 1230 byte packets, 49.9 Mbps 10G: 60 fps, 848 byte packets, 499 Mbps Each “frame” may have a burst of packets Frames are evenly spaced out for AVB

Max Packet loss % per stream QoS Results and issues Speed Max Packet loss % per stream Max latency per stream AVB Strict Priority WRR 1G 0% 5% 7% ~350 us ~50000 us ~35000 us 10G 0.2% 0.3% ~15 us ~9000 us Strict Priority issues: latency for 2nd priority traffic can be very high Burst behavior can cause buffers to overflow and drop packets even when average traffic rate (per second) is within bounds Weighted Round Robin issues: If background traffic is stopped it can cause buffers in switch 1-5 to empty quickly and overflow buffers in switch 6, leading to packet loss

Interpretation of results Strict priority is not fair, and does not work well in many scenarios - Only performance of the highest priority is guaranteed WFQ max delay depends on interaction between the queues - Delay grows as lower priority traffic increases QoS can generate bursts rather than spacing packets equally - If/when lower priority traffic is dropped → A wave of higher priority traffic washes over the last switch Buffers can overflow leading to high-priority traffic loss This can lead to delays that are beyond the requirements AVB traffic is shaped/smoothed, so less susceptible to this effect

As opposed to traditional QoS, AVB: Marketing take-away Guaranteed bandwidth & latency As opposed to traditional QoS, AVB: guarantees bandwidth and latency for critical streams of different priorities and requirements supports dynamic addition and removal of streams no need to overprovision and ultimately delivers high quality audio and video that does not break-up when you least expect it… like VoIP or video over the Internet vs. Packet loss & delays

Test Scenarios & Results Tests for classic PTP and gPTP

Tests for classic PTP vs gPTP Initially set out to test: Time synchronization quality Time error: measure the difference between the time on a device and a reference, at the same instant Multiple measurement points along a chain of switches, reference is Ixia emulated GM (compare first & last hop) GM fail scenarios / network reconfiguration Comparison with SMPTE 2059-2 broadcast profile

Measure time error at different points along the chain, from the GM. AVB gPTP on same topology classic PTP with Boundary or Transparent Clocks Switch #1 U1 1 2 Slave 12 U2 5% 15% #2 Slave 21 Slave 22 30% #3 Slave 31 Slave 32 45% #4 Slave 41 Slave 42 60% #5 Slave 51 Slave 52 75% #6 Slave 61 Slave 62 4 Slave A 3 GM Sec. GM 3 Same traffic patterns running as for the AVB vs Strict Priority vs WRR scenarios. Measure time error at different points along the chain, from the GM.

Classic PTP with Transparent and Boundary Clock and AVB gPTP compared

Time sync results and issues Maximum Time Error PTP with low volume traffic PTP with heavy traffic PTP with Boundary Clocks PTP with Transparent Clocks AVB gPTP 1st hop 24 ns 1 000 ns 35 ns 6th hop 10 000 ns 2 500 000 ns 4 500 ns 4 000 ns 63 ns Classic PTP default profile has unacceptable time errors for audio/video media synchronization, if used without PTP-enabled switches gPTP time error is very low, even with 6 hops in between, two orders of magnitude better than PTP with Boundary or Transparent clock support Even with PTP enabled switches it might not be enough for large enough networks or for networks with high or varying traffic loads gPTP stabilizes and locks to GM in seconds, whereas PTP with Boundary clock was still “locking” after 3+ minutes

As opposed to classic PTP, gPTP guarantees: Marketing take-away As opposed to classic PTP, gPTP guarantees: a maximum time error over a specified number of hops, that satisfies A/V and even control applications fast sync lock time on network startup fast reconfiguration on topology changes and ultimately allows high quality time synchronization for audio and video such that different media sources are always in sync

Questions? Alon Regev aregev [at] ixiacom com Bogdan Tenea btenea [at] ixiacom com