Www.intel.com/research Bridging Router Performance and Queuing Theory N. Hohn*, D. Veitch*, K. Papagiannaki, C. Diot *: University of Melbourne.

Slides:



Advertisements
Similar presentations
Advanced Technology Laboratories page 1 Network Performance Monitoring at Small Time Scales Dina Papagiannaki, Rene Cruz, Christophe Diot.
Advertisements

1 Maintaining Packet Order in Two-Stage Switches Isaac Keslassy, Nick McKeown Stanford University.
1 IK1500 Communication Systems IK1330 Lecture 3: Networking Anders Västberg
Chabot College Chapter 2 Review Questions Semester IIIELEC Semester III ELEC
Analytical Modeling and Evaluation of On- Chip Interconnects Using Network Calculus M. BAkhouya, S. Suboh, J. Gaber, T. El-Ghazawi NOCS 2009, May 10-13,
Nick McKeown CS244 Lecture 6 Packet Switches. What you said The very premise of the paper was a bit of an eye- opener for me, for previously I had never.
Routers with a Single Stage of Buffering Sundar Iyer, Rui Zhang, Nick McKeown High Performance Networking Group, Stanford University,
Bridging Router Performance and Queuing Theory Dina Papagiannaki, Intel Research Cambridge with Nicolas Hohn, Darryl Veitch and.
A Scalable Switch for Service Guarantees Bill Lin (University of California, San Diego) Isaac Keslassy (Technion, Israel)
4-1 Network layer r transport segment from sending to receiving host r on sending side encapsulates segments into datagrams r on rcving side, delivers.
1 Input Queued Switches: Cell Switching vs. Packet Switching Abtin Keshavarzian Joint work with Yashar Ganjali, Devavrat Shah Stanford University.
High-Speed Router Design. Content Classes of Routers Components of a Router High-Speed Router Lookup Advances in Switching Fabrics Speeding Up Output.
10 - Network Layer. Network layer r transport segment from sending to receiving host r on sending side encapsulates segments into datagrams r on rcving.
Katz, Stoica F04 EECS 122: Introduction to Computer Networks Performance Modeling Computer Science Division Department of Electrical Engineering and Computer.
1 Architectural Results in the Optical Router Project Da Chuang, Isaac Keslassy, Nick McKeown High Performance Networking Group
1 OR Project Group II: Packet Buffer Proposal Da Chuang, Isaac Keslassy, Sundar Iyer, Greg Watson, Nick McKeown, Mark Horowitz
The Crosspoint Queued Switch Yossi Kanizo (Technion, Israel) Joint work with Isaac Keslassy (Technion, Israel) and David Hay (Politecnico di Torino, Italy)
Traffic Characterization Dr. Abdulaziz Almulhem. Almulhem©20012 Agenda Traffic characterization Switching techniques Internetworking, again.
Lecture Internet Overview: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit switching,
1 Achieving 100% throughput Where we are in the course… 1. Switch model 2. Uniform traffic  Technique: Uniform schedule (easy) 3. Non-uniform traffic,
Router Architectures An overview of router architectures.
Localized Asynchronous Packet Scheduling for Buffered Crossbar Switches Deng Pan and Yuanyuan Yang State University of New York Stony Brook.
4: Network Layer4b-1 Router Architecture Overview Two key router functions: r run routing algorithms/protocol (RIP, OSPF, BGP) r switching datagrams from.
1 IP routers with memory that runs slower than the line rate Nick McKeown Assistant Professor of Electrical Engineering and Computer Science, Stanford.
CS 6401 Routing, Routers, Switching Fabrics Outline Link state routing Link weights Router Design / Switching Fabrics.
Bridging Router Performance and Queuing Theory N. Hohn*, D. Veitch*, K. Papagiannaki, C. Diot *: University of Melbourne This work appeared at ACM Sigmetrics.
An Integrated IP Packet Shaper and Scheduler for Edge Routers MSEE Project Presentation Student: Yuqing Deng Advisor: Dr. Belle Wei Spring 2002.
Router Architecture Overview
Sami Al-wakeel 1 Data Transmission and Computer Networks The Switching Networks.
Univ. of TehranAdv. topics in Computer Network1 Advanced topics in Computer Networks University of Tehran Dept. of EE and Computer Engineering By: Dr.
Designing Packet Buffers for Internet Routers Friday, October 23, 2015 Nick McKeown Professor of Electrical Engineering and Computer Science, Stanford.
11 Experimental and Analytical Evaluation of Available Bandwidth Estimation Tools Cesar D. Guerrero and Miguel A. Labrador Department of Computer Science.
Engineering Jon Turner Computer Science & Engineering Washington University Coarse-Grained Scheduling for Multistage Interconnects.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 4 Switching Concepts.
A Forward end-to-end delays Analysis for packet switched networks Georges Kemayo, Frédéric Ridouard, Henri Bauer, Pascal Richard LIAS, Université de Poitiers,
Routers. These high-end, carrier-grade 7600 models process up to 30 million packets per second (pps).
Computer Networks: Switching and Queuing Ivan Marsic Rutgers University Chapter 4 – Switching and Queuing Delay Models.
Packet Forwarding. A router has several input/output lines. From an input line, it receives a packet. It will check the header of the packet to determine.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 3 v3.0 Module 4 Switching Concepts.
1 Performance Guarantees for Internet Routers ISL Affiliates Meeting April 4 th 2002 Nick McKeown Professor of Electrical Engineering and Computer Science,
Detecting the Long-Range Dependence in the Internet Traffic with Packet Trains Péter Hága, Gábor Vattay Department Of Physics of Complex Systems Eötvös.
Stress Resistant Scheduling Algorithms for CIOQ Switches Prashanth Pappu Applied Research Laboratory Washington University in St Louis “Stress Resistant.
Forwarding.
What is the Speed of the Internet? Internet Computing KUT Youn-Hee Han.
Buffered Crossbars With Performance Guarantees Shang-Tse (Da) Chuang Cisco Systems EE384Y Thursday, April 27, 2006.
Queuing Delay 1. Access Delay Some protocols require a sender to “gain access” to the channel –The channel is shared and some time is used trying to determine.
Delay in packet switched network. Circuit switching In Circuit switched networks the resources needed along a path (buffers and link transmission rate)
Packet Switch Architectures The following are (sometimes modified and rearranged slides) from an ACM Sigcomm 99 Tutorial by Nick McKeown and Balaji Prabhakar,
CCNA3 Module 4 Brierley Module 4. CCNA3 Module 4 Brierley Topics LAN congestion and its effect on network performance Advantages of LAN segmentation in.
Block-Based Packet Buffer with Deterministic Packet Departures Hao Wang and Bill Lin University of California, San Diego HSPR 2010, Dallas.
Indian Institute of Technology Bombay 1 Communication Networks Prof. D. Manjunath
A Load Balanced Switch with an Arbitrary Number of Linecards I.Keslassy, S.T.Chuang, N.McKeown ( CSL, Stanford University ) Some slides adapted from authors.
Network Layer4-1 Chapter 4 Network Layer All material copyright J.F Kurose and K.W. Ross, All Rights Reserved Computer Networking: A Top Down.
Application Layer 2-1 Chapter 4 Network Layer Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March 2012 A.
Univ. of TehranIntroduction to Computer Network1 An Introduction to Computer Networks University of Tehran Dept. of EE and Computer Engineering By: Dr.
Network Processing Systems Design
scheduling for local-area networks”
CS 5565 Network Architecture and Protocols
Queuing Theory and Traffic Analysis
Empirically Characterizing the Buffer Behaviour of Real Devices
Packet Forwarding.
Addressing: Router Design
Tapping Into The Unutilized Router Processing Power
Chapter 4: Network Layer
Packet Switch Architectures
EE 122: Lecture 7 Ion Stoica September 18, 2001.
Chapter 3 Part 3 Switching and Bridging
Computer Networks: Switching and Queuing
Chapter 4: Network Layer
Packet Switch Architectures
Presentation transcript:

Bridging Router Performance and Queuing Theory N. Hohn*, D. Veitch*, K. Papagiannaki, C. Diot *: University of Melbourne

Intel Research 2 Motivation  End-to-end packet delay is an important metric for performance and SLAs  Building block of end-to-end delay is through router delay  We measure the delays incurred by all packets crossing a single router

Intel Research 3 Overview  Full Router Monitoring  Delay Analysis and Modeling  Delay Performance: Understanding and Reporting

Intel Research 4 Measurement Environment

Intel Research 5 Packet matching SetLink Matched pkts % traffic C2-out C4In % C1In % BB1In % BB2In % C2out %

Intel Research 6 Overview

Intel Research 7 Store & Forward Datapath  Store: storage in input linecard’s memory  Forwarding decision  Storage in dedicated Virtual Output Queue (VOQ)  Decomposition into fixed-size cells  Transmission through switch fabric cell by cell  Packet reconstruction  Forward: Output link scheduler Not part of the system

Intel Research 8 Delays: 1 minute summary

Intel Research 9 Store & Forward Datapath  Store: storage in input linecard’s memory  Forwarding decision  Storage in dedicated Virtual Output Queue (VOQ)  Decomposition into fixed-size cells  Transmission through switch fabric cell by cell  Packet reconstruction  Forward: Output link scheduler Not part of the system Δ

Intel Research 10 Minimum Transit Time Packet size dependent minimum delay Δ(L), specific to router architecture and linecard technology

Intel Research 11 Store & Forward Datapath  Store: storage in input linecard’s memory  Forwarding decision  Storage in dedicated Virtual Output Queue (VOQ)  Decomposition into fixed-size cells  Transmission through switch fabric cell by cell  Packet reconstruction  Forward: Output link scheduler Not part of the system Δ(L) FIFO queue

Intel Research 12 Modeling

Intel Research 13 Modeling Fluid queue with a delay element at the front

Intel Research 14 Model Validation

Intel Research 15 Error as a function of time

Intel Research 16 Modeling results  Our crude model performs well  Use effective link bandwidth (account for encapsulation)  Small gap between router performance and queueing theory!  The model defines Busy Periods:  The model defines Busy Periods: time between the arrival of a packet to the empty system and the time when the system becomes empty again.

Intel Research 17 Overview

Intel Research 18 On the Delay Performance  Model allows for router performance evaluation when arrival patterns are known  Goal: metrics that  Capture operational-router performance  Can answer performance questions directly  Busy Period structures contain all delay information

Intel Research 19 Busy periods metrics tsts D A

Intel Research 20 Property of significant BPs

Intel Research 21 Triangular Model

Intel Research 22 Issues  Report (A,D) measurements  There are millions of busy periods even on a lightly utilized router  Interesting episodes are rare and last for a very small amount of time

Intel Research 23 Report BP joint distribution

Intel Research 24 Duration of Congestion Level-L

Intel Research 25 Conclusion  Results  Full router empirical study  Delay modeling  Reporting performance metrics  Future work  Fine tune reporting scheme  Empirical evidence of large deviations theory

Thank you!