Network layer (addendum) Slides adapted from material by Nick McKeown and Kevin Lai

Similar documents
EE 122: Router Design

EECS 122: Introduction to Computer Networks Switch and Router Architectures. Today s Lecture

Generic Architecture. EECS 122: Introduction to Computer Networks Switch and Router Architectures. Shared Memory (1 st Generation) Today s Lecture

TOC: Switching & Forwarding

Routers: Forwarding EECS 122: Lecture 13

TOC: Switching & Forwarding

Routers: Forwarding EECS 122: Lecture 13

CSE 123A Computer Networks

Sample Routers and Switches. High Capacity Router Cisco CRS-1 up to 46 Tb/s thruput. Routers in a Network. Router Design

Network Performance: Queuing

TOC: Switching & Forwarding

Network Performance: Queuing

Packet Switch Architectures Part 2

Lecture 16: Router Design

Topics for Today. Network Layer. Readings. Introduction Addressing Address Resolution. Sections 5.1,

Announcements. Network Performance: Queuing. Goals of Today s Lecture. Window Scaling. Window Scaling, con t. Window Scaling, con t

Routers Technologies & Evolution for High-Speed Networks

The Network Layer and Routers

Network Superhighway CSCD 330. Network Programming Winter Lecture 13 Network Layer. Reading: Chapter 4

Professor Yashar Ganjali Department of Computer Science University of Toronto.

Lecture 17: Router Design

ECE 697J Advanced Topics in Computer Networks

Multi-gigabit Switching and Routing

The IP Data Plane: Packets and Routers

Lecture 17: Router Design

Lecture 5: Router Architecture. CS 598: Advanced Internetworking Matthew Caesar February 8, 2011

CSCD 330 Network Programming

CSE398: Network Systems Design

CMPE 150/L : Introduction to Computer Networks. Chen Qian Computer Engineering UCSC Baskin Engineering Lecture 11

Router Architectures

Topic 4a Router Operation and Scheduling. Ch4: Network Layer: The Data Plane. Computer Networking: A Top Down Approach

Computer Networks. Instructor: Niklas Carlsson

CSE 3214: Computer Network Protocols and Applications Network Layer

Chapter 4 Network Layer: The Data Plane

Chapter 4 Network Layer

INF5050 Protocols and Routing in Internet (Friday ) Subject: IP-router architecture. Presented by Tor Skeie

Scaling routers: Where do we go from here?

Chapter 4. Computer Networking: A Top Down Approach 5 th edition. Jim Kurose, Keith Ross Addison-Wesley, sl April 2009.

CSC 401 Data and Computer Communications Networks

Key Network-Layer Functions

Router Architecture Overview

Cisco IOS Switching Paths Overview

A distributed architecture of IP routers

Router Construction. Workstation-Based. Switching Hardware Design Goals throughput (depends on traffic model) scalability (a function of n) Outline

Router Design: Table Lookups and Packet Scheduling EECS 122: Lecture 13

Buffer Sizing in a Combined Input Output Queued (CIOQ) Switch

CMSC 332 Computer Networks Network Layer

CSCE 463/612 Networks and Distributed Processing Spring 2018

Outline. The demand The San Jose NAP. What s the Problem? Most things. Time. Part I AN OVERVIEW OF HARDWARE ISSUES FOR IP AND ATM.

Lecture 24: Scheduling and QoS

CSC 4900 Computer Networks: Network Layer

Lecture 3. The Network Layer (cont d) Network Layer 1-1

LS Example 5 3 C 5 A 1 D

Themes. The Network 1. Energy in the DC: ~15% network? Energy by Technology

fair-queue aggregate-limit

Parallelism in Network Systems

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

The Network Layer. Antonio Carzaniga. April 22, Faculty of Informatics University of Lugano Antonio Carzaniga

Computer Networks 1 (Mạng Máy Tính 1) Lectured by: Dr. Phạm Trần Vũ

COMP211 Chapter 4 Network Layer: The Data Plane

QoS Services with Dynamic Packet State

1-1. Switching Networks (Fall 2010) EE 586 Communication and. October 25, Lecture 24

PARALLEL ALGORITHMS FOR IP SWITCHERS/ROUTERS

Introduction. Router Architectures. Introduction. Introduction. Recent advances in routing architecture including

IV. PACKET SWITCH ARCHITECTURES

Introduction. Introduction. Router Architectures. Introduction. Recent advances in routing architecture including

Introduction to ATM Technology

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

CSCI Computer Networks

Sizing Router Buffers

Chapter 4: network layer. Network service model. Two key network-layer functions. Network layer. Input port functions. Router architecture overview

Cell Format. Housekeeping. Segmentation and Reassembly AAL 3/4

Cell Switching (ATM) Commonly transmitted over SONET other physical layers possible. Variable vs Fixed-Length Packets

Chapter 6 Medium Access Control Protocols and Local Area Networks

Chapter 1. Introduction

Switching Hardware. Spring 2015 CS 438 Staff, University of Illinois 1

Multicast and Quality of Service. Internet Technologies and Applications

Network Processors and their memory

Ethernet Hub. Campus Network Design. Hubs. Sending and receiving Ethernet frames via a hub

Internet Routers Past, Present and Future

Network Layer: Control/data plane, addressing, routers

Network Layer: Router Architecture, IP Addressing

The Evolution Path from Frames to Services

Chair for Network Architectures and Services Prof. Carle Department of Computer Science Technische Universität München.

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

Frame Relay IP RTP Priority

Table of Contents. Cisco Quality of Service Options on GRE Tunnel Interfaces

Routing, Routers, Switching Fabrics

Student ID: CS457: Computer Networking Date: 3/20/2007 Name:

Switch Fabric. Switch Fabric Overview

CSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca

Computer Networks LECTURE 10 ICMP, SNMP, Inside a Router, Link Layer Protocols. Assignments INTERNET CONTROL MESSAGE PROTOCOL

Lecture 16: Network Layer Overview, Internet Protocol

Configuring QoS CHAPTER

Efficient Queuing Architecture for a Buffered Crossbar Switch

CSCI-1680 Link Layer Wrap-Up Rodrigo Fonseca

Quality of Service (QoS)

Routers with a Single Stage of Buffering * Sigcomm Paper Number: 342, Total Pages: 14

A Four-Terabit Single-Stage Packet Switch with Large. Round-Trip Time Support. F. Abel, C. Minkenberg, R. Luijten, M. Gusat, and I.

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

Transcription:

Network layer (addendum) Slides adapted from material by Nick McKeown and Kevin Lai

Routers.. A router consists - A set of input interfaces at which packets arrive - A set of output interfaces from which packets depart - Some form of interconnect connecting inputs to outputs Router implements two main functions - Forward packet to corresponding output interface - Manage bandwidth and buffer space resources CS640, UW-Madison 2

Cisco GSR 12416 19 What a Router Looks Like Juniper M160 19 Capacity: 160Gb/s Power: 4.2kW Capacity: 80Gb/s Power: 2.6kW 6ft 3ft 2ft 2.5ft Slide by Nick McKeown CS640, UW-Madison 3

Why Understand Router Design Many companies make switches and routers - e.g., Cisco, Juniper, Nortel Many other devices have a similar structure - e.g., PC s internal interconnect, multi-processor interconnect Switch design dictates what can be done at higher layers - e.g., per flow state is expensive,the need to minimize per packet processing time CS640, UW-Madison 4

Why Do We Need Faster Routers? 1. To prevent routers becoming the bottleneck in the Internet. 2. To increase POP capacity, and to reduce cost, size and power. CS640, UW-Madison 5

Requirements Power - generates heat, costs money - < 5kW Size - space costs money - < 2m 3 Bandwidth Ports - number of external links Price Some customers want - Multicast - Quality of Service CS640, UW-Madison 6

Generic Router Architecture Input and output interfaces are connected through an interconnect A interconnect can be implemented by - Shared memory low capacity routers (e.g., PC-based routers) - Shared bus Medium capacity routers - Point-to-point (switched) bus High capacity routers input interface Interconnect output interface CS640, UW-Madison 7

First Generation Routers Shared Backplane CPU Route Table Buffer Memory CPU Memory Line Interface Line Interface Line Interface Line Interface MAC MAC MAC Typically <0.5Gb/s aggregate capacity Slide by Nick McKeown CS640, UW-Madison 8

Second Generation Routers CPU Route Table Buffer Memory Line Card Line Card Line Card Buffer Memory Fwding Cache MAC Buffer Memory Fwding Cache MAC Buffer Memory Fwding Cache MAC Slide by Nick McKeown Typically <5Gb/s aggregate capacity CS640, UW-Madison 9

Third Generation Routers Switched Backplane Line Card CPU Card Line Card Line Interface CPU Local Buffer Memory Routing Table Local Buffer Memory Memory Fwding Table Fwding Table MAC MAC Typically <50Gb/s aggregate capacity Slide by Nick McKeown CS640, UW-Madison 10

Speedup C input/output link capacity R I maximum rate at which an input interface can send data into interconnect R O maximum rate at which an output can read data from interconnect B maximum aggregate interconnect transfer rate Interconnect speedup: B/C Input speedup: R I /C Output speedup: R O /C C input interface R I Interconnect B output interface R O C CS640, UW-Madison 11

Typical Functions Performed by Input Interface on Data Path Packet forwarding: decide to which output interface to forward each packet based on the information in packet header - examine packet header - lookup in forwarding table - update packet header CS640, UW-Madison 12

Typical Functions Performed by Output Interface Buffer management: decide when and which packet to drop Scheduler: decide when and which packet to transmit Buffer Scheduler 1 2 CS640, UW-Madison 13

Typical Functions Performed by Output Interface (cont d) Packet classification: map each packet to a predefined flow/connection (for datagram forwarding) - use to implement more sophisticated services (e.g., QoS) flow 1 1 Classifier flow 2 Scheduler 2 flow n Buffer management Flow: a subset of packets between any two endpoints in CS640, UW-Madison 14 the network

Interconnect Point-to-point switch allows to simultaneously transfer a packet between any two disjoint pairs of input-output interfaces Goal: come-up with a schedule that - Provide Quality of Service - Maximize router throughput Challenges: - Address head-of-line blocking at inputs - Resolve input/output speedups contention - Avoid packet dropping at output if possible Note: packets are fragmented in fix sized cells at inputs and reassembled at outputs CS640, UW-Madison 15

Output Queued (OQ) Routers Only output interfaces store packets Advantages - Easy to design algorithms: only one congestion point Disadvantages - Requires an output speedup of N, where N is the number of interfaces not feasible input interface output interface Backplane R O C CS640, UW-Madison 16

Input Queueing (IQ) Routers Only input interfaces store packets Advantages - Easy to built Store packets at inputs if contention at outputs - Relatively easy to design algorithms Only one congestion point, but not output need to implement backpressure Disadvantages - Hard to achieve utilization 1 (due to output contention, head-of-line blocking) However, theoretical and simulation results show that for realistic traffic an input/output speedup of 2 is enough to achieve utilizations close to 1 input interface Backplane output interface R O CS640, UW-Madison 17 C

Head-of-line Blocking The cell at the head of an input queue cannot be transferred, thus blocking the following cells Cannot be transferred because is blocked by red cell Input 1 Input 2 Input 3 Cannot be transferred because output buffer overflow Output 1 Output 2 Output 3 CS640, UW-Madison 18

A Router with Input Queues Head of Line Blocking Delay The best that any queueing system can achieve. 0% 20% 40% 60% 80% 100% CS640, UW-Madison 19 Load 2 2 ᄏ 58% Slide by Nick McKeown

Solution to Avoid Head-of-line Blocking Maintain at each input N virtual queues, i.e., one per output Input 1 Input 2 Output 1 Output 2 Output 3 Input 3 CS640, UW-Madison 20

Combined Input-Output Queueing (CIOQ) Routers Both input and output interfaces store packets Advantages - Easy to built Utilization 1 can be achieved with limited input/output speedup (<= 2) Disadvantages - Harder to design algorithms Two congestion points Need to design flow control input interface output interface Backplane R O C CS640, UW-Madison 21