Www.intel.com/research Bridging Router Performance and Queuing Theory Dina Papagiannaki, Intel Research Cambridge with Nicolas Hohn, Darryl Veitch and.

Slides:



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

1 IK1500 Communication Systems IK1330 Lecture 3: Networking Anders Västberg
TELE202 Lecture 8 Congestion control 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »X.25 »Source: chapter 10 ¥This Lecture »Congestion control »Source:
Playback-buffer Equalization for Streaming Media using Stateless Transport Prioritization Dan Tan, HPL, Palo Alto Weidong Cui, UC Berkeley John Apostolopoulos,
Enabling Flow-level Latency Measurements across Routers in Data Centers Parmjeet Singh, Myungjin Lee Sagar Kumar, Ramana Rao Kompella.
Priority Scheduling and Buffer Management for ATM Traffic Shaping Authors: Todd Lizambri, Fernando Duran and Shukri Wakid Present: Hongming Wu.
Fair queueing and congestion control Jim Roberts (France Telecom) Joint work with Jordan Augé Workshop on Congestion Control Hamilton Institute, Sept 2005.
Router Architecture : Building high-performance routers Ian Pratt
Point-to-Point Network Switching Advanced Computer Networks.
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.
Supporting Stored Video: Reducing Rate Variability and End-toEnd Resource Requirements through Optimal Smoothing By James D. salehi, Zhi-Li Zhang, James.
End-to-End Analysis of Distributed Video-on-Demand Systems Padmavathi Mundur, Robert Simon, and Arun K. Sood IEEE Transactions on Multimedia, February.
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.
Chapter 4 Network Layer slides are modified from J. Kurose & K. Ross CPE 400 / 600 Computer Communication Networks Lecture 14.
10 - Network Layer. Network layer r transport segment from sending to receiving host r on sending side encapsulates segments into datagrams r on rcving.
High Performance Networking with Little or No Buffers Yashar Ganjali on behalf of Prof. Nick McKeown High Performance Networking Group Stanford University.
Bridging Router Performance and Queuing Theory N. Hohn*, D. Veitch*, K. Papagiannaki, C. Diot *: University of Melbourne.
Modeling TCP in Small-Buffer Networks
Traffic Characterization Dr. Abdulaziz Almulhem. Almulhem©20012 Agenda Traffic characterization Switching techniques Internetworking, again.
1 Active Probing for Available Bandwidth Estimation Sridhar Machiraju UC Berkeley OASIS Retreat, Jan 2005 Joint work with D.Veitch, F.Baccelli, A.Nucci,
THE TITLE OF YOUR PAPER Your Name Communication Networks Laboratory School of Engineering Science Simon Fraser University.
Copyright © 2005 Department of Computer Science CPSC 641 Winter LAN Traffic Measurements Some of the first network traffic measurement papers were.
Ningning HuCarnegie Mellon University1 A Measurement Study of Internet Bottlenecks Ningning Hu (CMU) Joint work with Li Erran Li (Bell Lab) Zhuoqing Morley.
Point-to-Point Network Switching Computer Networks Computer Networks Spring 2012 Spring 2012.
Routers with Small Buffers Yashar Ganjali High Performance Networking Group Stanford University
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.
Bridging Router Performance and Queuing Theory N. Hohn*, D. Veitch*, K. Papagiannaki, C. Diot *: University of Melbourne This work appeared at ACM Sigmetrics.
Data Communications and Networking
A Machine Learning-based Approach for Estimating Available Bandwidth Ling-Jyh Chen 1, Cheng-Fu Chou 2 and Bo-Chun Wang 2 1 Academia Sinica 2 National Taiwan.
Alok Shriram and Jasleen Kaur Presented by Moonyoung Chung Empirical Evaluation of Techniques for Measuring Available Bandwidth.
QoS Support in High-Speed, Wormhole Routing Networks Mario Gerla, B. Kannan, Bruce Kwan, Prasasth Palanti,Simon Walton.
ECEN4533 Data Communications Lecture #2125 February 2013 Dr. George Scheets n Read 11.4 n Problems: Chapter 11.2, 4, & 5 n Quiz #2, 25 March (Live) < 1.
Router Architecture Overview
Role and Mechanism of Queue Internet Engineering.
1 Slides used in class may be different from slides in student pack Chapter 5 Process Analysis  Process Analysis  Process Flowcharting  Categories of.
Univ. of TehranAdv. topics in Computer Network1 Advanced topics in Computer Networks University of Tehran Dept. of EE and Computer Engineering By: Dr.
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,
Outlines Received due 13 March 30 %. NO CLASS Week of March (Spring Break)
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 Performance Guarantees for Internet Routers ISL Affiliates Meeting April 4 th 2002 Nick McKeown Professor of Electrical Engineering and Computer Science,
Detection of Routing Loops and Analysis of Its Causes Sue Moon Dept. of Computer Science KAIST Joint work with Urs Hengartner, Ashwin Sridharan, Richard.
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.
N. Hu (CMU)L. Li (Bell labs) Z. M. Mao. (U. Michigan) P. Steenkiste (CMU) J. Wang (AT&T) Infocom 2005 Presented By Mohammad Malli PhD student seminar Planete.
Forwarding.
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429 Introduction to Computer Networks Lecture 18: Quality of Service Slides used with.
We used ns-2 network simulator [5] to evaluate RED-DT and compare its performance to RED [1], FRED [2], LQD [3], and CHOKe [4]. All simulation scenarios.
Buffered Crossbars With Performance Guarantees Shang-Tse (Da) Chuang Cisco Systems EE384Y Thursday, April 27, 2006.
Chapter 11.4 END-TO-END ISSUES. Optical Internet Optical technology Protocol translates availability of gigabit bandwidth in user-perceived QoS.
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.
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.
Computer Networks Chapter 8 – Circuit Switching versus Packet Switching.
An End-to-End Service Architecture r Provide assured service, premium service, and best effort service (RFC 2638) Assured service: provide reliable service.
1 Monitoring: from research to operations Christophe Diot and the IP Sprintlabs ipmon.sprintlabs.com.
Tango1 Considering End-to-End QoS Constraints in IP Network Design and Planning M.Ajmone Marsan, M. Garetto, E. Leonardi. M. Mellia, E. Wille Dipartimento.
Network layer (addendum) Slides adapted from material by Nick McKeown and Kevin Lai.
scheduling for local-area networks”
Topics discussed in this section:
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
EE 122: Lecture 7 Ion Stoica September 18, 2001.
Computer Networks: Switching and Queuing
Chapter 4: Network Layer
Presentation transcript:

Bridging Router Performance and Queuing Theory Dina Papagiannaki, Intel Research Cambridge with Nicolas Hohn, Darryl Veitch and Christophe Diot

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  Modeling  Delay Performance: Understanding and Reporting  Causes of microcongestion

Intel Research 4 Measurement Environment

Intel Research 5 Full Router Monitoring  Gateway router  2 backbone links (OC-48), 2 domestic customer links (OC- 3, OC-12), 2 Asian customer links (OC-3)  13 hours of trace collection on Aug. 14, 2003  7.3 billion packets – 3 TeraBytes of IP traffic  Monitor more than 99.9% of all through traffic  μs timestamp precision

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

Intel Research 7 Packet matching (cntd)

Intel Research 8 Overview

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 Delays: 1 minute summary

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

Intel Research 12 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 13 Overview

Intel Research 14 Modeling

Intel Research 15 Modeling

Intel Research 16 Model Validation

Intel Research 17 Model validation

Intel Research 18 Error as a function of time

Intel Research 19 Modeling results  Our crude model performs well  Use effective link bandwidth (account for encapsulation)  The front end Δ only matters when the output queue is empty  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 20 Overview

Intel Research 21 Delay Performance  Packet delays cannot be inferred from output link utilization  Source of large delays: queue build-ups in output buffer  Busy Period structures contain all delay information  Busy Period durations and idle duration contain all utilization information

Intel Research 22 Reporting BP Amplitude

Intel Research 23 Reporting BP Duration

Intel Research 24 Report BP joint distribution

Intel Research 25 Busy periods have a common shape

Intel Research 26 Reporting Busy Periods  Answer performance related questions directly  How long will a given level of congestion last?  Method:  Report partial busy period statistics A and D  Use “triangular shape”

Intel Research 27 Understanding Busy Periods

Intel Research 28 Reporting Busy Periods

Intel Research 29 Summary of modeling part  Results  Full router empirical study  Delay modeling  Reporting performance metrics

Intel Research 30 Overview

Intel Research 31 Causes of microcongestion

Intel Research 32 Stretching and merging Queue Buildup!

Intel Research 33 Causes of microcongestion

Intel Research 34 Multiplexing

Intel Research 35 Causes of microcongestion

Intel Research 36 Traffic Burstiness  Duration and amplitude of busy periods depends on the spacing of packets at the input.  Highly clustered packets at the input are more likely to form busy periods.

Intel Research 37 Busy periods Maximum amplitude: 5 ms Maximum duration: 15 ms 120,000 busy periods > 1 ms tsts D A tAtA

Intel Research 38 Methodology  Run semi-experiments  Simulate busy periods and measure their amplitude A(S, μ) under two different traffic scenarios, one that contains the effect studied and one that does not  Define a metric to quantitatively capture the studied effect

Intel Research 39 Reduction in Bandwidth

Intel Research 40 Amplification factor  Reference stream:  S T : traffic from a single OC-48 link  Output link rate: μ i  Test stream:  S s : traffic from a single OC-48 link  Output link rate: μ o

Intel Research 41 Amplification factor (2)

Intel Research 42 Link multiplexing

Intel Research 43 Link multiplexing  Reference stream:  S T : output link traffic  Output link rate: μ o  Test stream:  S i : traffic from a single OC-48 link  Output link rate: μ o

Intel Research 44 Link multiplexing (2)

Intel Research 45 Flow burstiness Non-bursty flow Bursty flow

Intel Research 46 Flow Burstiness  Reference stream:  S T : input traffic stream from a single OC-48 link  Output link rate: μ o  Test stream:  S j : top 5-tuple flow OR the set of ALL bursty flows  Output link rate: μ o

Intel Research 47 Flow burstiness

Intel Research 48 Summary  Methodology (and metrics) to investigate impact of different congestion mechanisms  In today’s access networks:  Reduction in link bandwidth plays a significant role  Multiplexing has a definite impact since individual links would not have led to similar delays  Flow burstiness does NOT significantly impact delay (bottleneck bandwidths too small to dominate the backbone)  Congestion may be the outcome of network design!

Thank you!

Intel Research 50 References  K. Papagiannaki, S. Moon, C. Fraleigh, P.Thiran, F. Tobagi, C. Diot. Analysis of Measured Single-Hop Delay from an Operational Backbone Network. In IEEE Infocom, New York, U.S.A., June,  N. Hohn, D. Veitch, K. Papagiannaki, C. Diot. Bridging router performance and queuing theory. To appear in ACM Sigmetrics, New York, U.S.A., June,  K. Papagiannaki, D. Veitch, and N. Hohn. Origins of Microcongestion in an Access Router. In Passive & Active Measurement Workshop, Antibes, France, April, 2004.

Intel Research 51 Busy Period Construction