1 IGP Data Plane Convergence Benchmarking draft-ietf-bmwg-igp-dataplane-conv-app-00.txt draft-ietf-bmwg-igp-dataplane-conv-term-00.txt draft -ietf-bmwg-igp-dataplane-conv-meth-00.txt.

Slides:



Advertisements
Similar presentations
1 Link-State IGP Data-Plane Convergence Benchmarking draft-ietf-bmwg-igp-dataplane-conv-meth-20 draft-ietf-bmwg-igp-dataplane-conv-term-20 S. Poretsky,
Advertisements

1 A. Sshaikh, A. Greenberg; Nov 01 UCSC Sigcomm IMW Experience in Black-box OSPF Measurement Aman Shaikh, UCSC Albert Greenberg, AT&T Labs-Research.
Link-State IGP Data-Plane Convergence Benchmarking draft-ietf-bmwg-igp-dataplane-conv-meth-17 draft-ietf-bmwg-igp-dataplane-conv-term-17 draft-ietf-bmwg-igp-dataplane-conv-app-167.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts – Chapter.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization –All routers are identical –Network is flat. Not true in Practice Hierarchical.
Routing and Routing Protocols Introduction to Static Routing.
RD-CSY /09 Distance Vector Routing Protocols.
Delivery, Forwarding, and Routing
COS 420 Day 13. Agenda Assignment 3 Posted Covers chapters Due March 23 2 Days till Daytona Beach Bike Week Midterm Exam is Due Today Today we will.
1 Semester 2 Module 6 Routing and Routing Protocols YuDa college of business James Chen
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Dynamic Routing Protocols  Function(s) of Dynamic Routing Protocols: – Dynamically share information between routers (Discover remote networks). – Automatically.
Slide /2009COMM3380 Routing Algorithms Distance Vector Routing Each node knows the distance (=cost) to its directly connected neighbors A node sends.
1 Routing Protocols and Configuration Instructor: Te-Lung Liu Program Associate Researcher NCHC, South Region Office.
Routing and Routing Protocols Routing Protocols Overview.
Introduction to Dynamic Routing Protocol
Code : STM#520-1 Samsung Electronics Co., Ltd. OfficeServ7400 Router Operation Distribution EnglishED01.
© 2002, Cisco Systems, Inc. All rights reserved. 1 Determining IP Routes.
1 Authors: Scott Poretsky, Quarry Technologies Shankar Rao, Qwest Communications Ray Piatt, Cable and Wireless 58th IETF Meeting – Minneapolis Accelerated.
Proposal for new Working Group Item: Core Router Software Accelerated Life Testing (draft-poretsky-routersalt-term-00.txt) Authors: Scott Poretsky, Avici.
24/10/2015draft-novak-bmwg-ipflow-meth- 03.txt 1 IP Flow Information Accounting and Export Benchmarking Methodology
1 BENCHMARKING IGP DATA PLANE ROUTE CONVERGENCE draft-ietf-bmwg-igp-dataplane-conv-app-08.txt draft-ietf-bmwg-igp-dataplane-conv-term-08.txt draft-ietf-bmwg-igp-dataplane-conv-meth-08.txt.
1 Routing Table  The seven fields Mask: for finding (sub)network address of the destination l Host-specific routing: (/32) l Default routing:
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Routing Protocols and Concepts Introduction to Dynamic Routing Protocol.
IGP Data Plane Convergence draft-ietf-bmwg-dataplane-conv-meth-14.txt draft-ietf-bmwg-dataplane-conv-term-14.txt draft-ietf-bmwg-dataplane-conv-app-14.txt.
More on Internet Routing A large portion of this lecture material comes from BGP tutorial given by Philip Smith from Cisco (ftp://ftp- eng.cisco.com/pfs/seminars/APRICOT2004.
A Measurement Study on the Impact of Routing Events on End-to-End Internet Path Performance Feng Wang 1, Zhuoqing Morley Mao 2 Jia Wang 3, Lixin Gao 1,
Institute of Technology Sligo - Dept of Computing Sem 2 Chapter 12 Routing Protocols.
TCOM 509 – Internet Protocols (TCP/IP) Lecture 06_a Routing Protocols: RIP, OSPF, BGP Instructor: Dr. Li-Chuan Chen Date: 10/06/2003 Based in part upon.
7400 Samsung Confidential & Proprietary Information Copyright 2006, All Rights Reserved. -0/35- OfficeServ 7x00 Enterprise IP Solutions Quick Install Guide.
© 2002, Cisco Systems, Inc. All rights reserved. 1 Routing Overview.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
Distance Vector Routing Protocols Dynamic Routing.
1 SIP Performance Benchmarking draft-poretsky-sip-bench-term-04.txt draft-poretsky-bmwg-sip-bench-meth-02.txt BMWG, IETF-70 Vancouver Dec 2007 Davids IIT.
Routing protocols. Static Routing Routes to destinations are set up manually Route may be up or down but static routes will remain in the routing tables.
An internet is a combination of networks connected by routers. When a datagram goes from a source to a destination, it will probably pass through many.
1 SIP Performance Benchmarking draft-poretsky-sip-bench-term-03.txt draft-poretsky-bmwg-sip-bench-meth-01.txt BMWG, IETF-69 Chicago July 2007 Poretsky,
Routing Protocols Brandon Wagner.
Describe basic routing concepts. Routers Interconnect Networks Router is responsible for forwarding packets from network to network, from the original.
IGP Data Plane Convergence draft-ietf-bmwg-dataplane-conv-meth-15.txt draft-ietf-bmwg-dataplane-conv-term-15.txt draft-ietf-bmwg-dataplane-conv-app-15.txt.
1 IGP Data Plane Convergence Benchmarking draft-ietf-bmwg-igp-dataplane-conv-app-01.txt draft-ietf-bmwg-igp-dataplane-conv-term-01.txt draft -ietf-bmwg-igp-dataplane-conv-meth-01.txt.
1 Scott Poretsky, Quarry Technologies Shankar Rao, Qwest Communications Jean-Louis Le Roux, France Telecom Rajiv Papneja, Isocore Rajesh Khanna, Avici.
7/11/0666th IETF1 QoS Enhancements to BGP in Support of Multiple Classes of Service Andreas Terzis Computer Science Department Johns Hopkins University.
1 Sub-IP Protection Methods of Measurement: Considerations Al Morton bmwg Chair IETF-72.
A Measurement Study on the Impact of Routing Events on End-to-End Internet Path Performance Feng Wang 1, Zhuoqing Morley Mao 2 Jia Wang 3, Lixin Gao 1,
RIP Routing Protocol. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
1 Authors: Scott Poretsky, Reef Point Systems Shankar Rao, Qwest Communications 64th IETF Meeting – Vancouver Accelerated Stress Benchmarking draft-ietf-bmwg-acc-bench-term-07.txt.
28 July BGP Data-Plane Benchmarking Applicable to Modern Routers Ilya Varlashkin Rajiv Papneja Bhavani Parise presented by Grégory CAUCHIE.
Extended procedures and Considerations for Loop Free Alternatives draft-chunduri-rtgwg-lfa-extended-procedures-01 Uma Chunduri Ericsson Inc. Jeff Tantsura.
23Mar BGP Data-Plane Benchmarking Applicable to Modern Routers Rajiv Papneja Ilya Varlashkin Bhavani Parise Dean Lee Sue Hares.
Prof. Alfred J Bird, Ph.D., NBCT Office – Science 3rd floor – S Office Hours – Monday and Thursday.
Sem 2 v2 Chapter 12: Routing. Routers can be configured to use one or more IP routing protocols. Two of these IP routing protocols are RIP and IGRP. After.
Prof. Alfred J Bird, Ph.D., NBCT Office – McCormick 3rd floor 607 Office Hours – Monday 3:00 to 4:00 and.
1 IGP Data Plane Convergence draft-ietf-bmwg-igp-dataplane-conv-meth-21 draft-ietf-bmwg-igp-dataplane-conv-term-21 BMWG, IETF-78 Maastricht, July 2010.
Sub-IP Layer Protection Mechanism Performance Benchmarking draft-ietf-bmwg-protection-term-04.txt draft-ietf-bmwg-protection-meth-03.txt BMWG, IETF-71.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Lec4: Introduction to Dynamic Routing Protocol
Working at a Small-to-Medium Business or ISP – Chapter 6
Configuring RIP.
Authors: Scott Poretsky, Quarry Technologies Brent Imhoff, LightCore
Authors: Scott Poretsky, Quarry Technologies Brent Imhoff, LightCore
Accelerated Stress Benchmarking
COMP 3270 Computer Networks
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Introduction to Dynamic Routing Protocol
ECE 544 Protocol Design Project 2016
Introduction to Dynamic Routing Protocol
Working at a Small-to-Medium Business or ISP – Chapter 6
IPFRR WITH FAST NOTIFICATION
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Presentation transcript:

1 IGP Data Plane Convergence Benchmarking draft-ietf-bmwg-igp-dataplane-conv-app-00.txt draft-ietf-bmwg-igp-dataplane-conv-term-00.txt draft -ietf-bmwg-igp-dataplane-conv-meth-00.txt Authors: Scott Poretsky, Avici Systems Brent Imhoff, WilTel Communications 57th IETF Meeting – Vienna

2 IGP Convergence has become the most heavily discussed Router Benchmark for the Internet Convergence events cause packet loss visible to the network user for most real-time applications Industry Goal <1sec (milliseconds) IGP Convergence – As stated at numerous NANOGs by Service Providers and router vendors. – Applies to IS-IS and OSPF. – Externally observable Black-Box event. Motivation for Draft

3 Convergence Methodologies Control Plane Convergence Data Plane Convergence DUT Update DUT Data Preferred Next-Hop 2 nd Best Next-Hop The point in time in which a single node updates its routing table and reroutes traffic to the new next-hop Data Plane Convergence is in the order of seconds Data Plane Convergence is the major problem to solve Addressed in draft-ietf-bmwg-igp-dataplane-conv-term, meth, and app The point in time in which a single node advertises the route table change to its peer in a route advertisement message Control Plane Convergence is in order of hundreds of milliseconds Addressed in draft-ietf-bmwg-ospfconv- terminology and methodology

4 Basic Test Methodology Test Configuration Tester_1 advertises simulated topology via routing protocol(s) Tester_2 sends traffic to DUT to all destinations in FIB DUT has two paths (via Link 1 and Link 2) to reach destinations DUT by default prefers lower cost path via Link 1 Network Event reroutes traffic to Link 2 Test Procedure Send maximum Throughput with fixed packet size to all destinations in the FIB Measure pps received at Tester Force a Network Event Observe loss of traffic forwarding Observe recovery to forwarding at line rate Calculate Convergence Time Test Setup NOTE: Different test cases Described in draft. DUT Tester Link 1 Link 2

5 Example Convergence Measurement Rate-Derived Convergence Time Route Convergence Recovery Transition Route Convergence Event Transition Packet Sampling Interval Convergence Start TimeConvergence End Time Packet Loss Convergence Time

6 Data Plane Convergence Calculation Calculation 1: –Rate-Derived Convergence Time = Time to converge 100% of the traffic to all routes in FIB after a Convergence Event Calculation 2: –Loss-Derived Convergence Time = (Number of Packets Lost)/(Offered Packet Load per Second) Applying Calculations –Loss-Derived Convergence Time > Rate-Derived Convergence Time –Rate-Derived Convergence Time is Preferred –Loss-Derived Convergence Time must be used when Packet Sampling Interval >100msec.

7 Next Steps – Terminology Draft 01 Add global statement that metrics are externally observable Add new terms: Packet Sampling Interval, Convergence Start Time, Convergence End Time (as shown in Slide 5) Change terms to match those suggested on mailing list (and used in slides 5 and 6): –Full Convergence Time -> Rate-Derived Convergence Time –Average Convergence Time -> Loss-Derived Convergence Time –Route Convergence Event Slope -> Route Convergence Event Transition –Route Convergence Recovery Slope -> Route Convergence RecoveryTransition –Reroute Convergence Time -> Route Convergence Time (Definitions are not changing – only terms) … the ready for Last Call for IESG Review?

8 Next Steps – Methodology Draft 01 Add Reporting Format with Packet Sampling Interval, IGP Timer values, fixed packet size, and FIB size used and results for Rate-Derived Convergence Time and Loss-Derived Convergence Time. Add suggested values for IGP Timers to “Test Considerations” section Add “Guidelines for Packet Sampling Interval” to “Test Considerations” section as discussed in slide 6 … then ready for Last Call for IESG Review?