048866: Packet Switch Architectures Dr. Isaac Keslassy Electrical Engineering, Technion Introduction.

Slides:



Advertisements
Similar presentations
Router Internals CS 4251: Computer Networking II Nick Feamster Spring 2008.
Advertisements

Router Internals CS 4251: Computer Networking II Nick Feamster Fall 2008.
IP Router Architectures. Outline Basic IP Router Functionalities IP Router Architectures.
© Jörg Liebeherr ECE 1545 Packet-Switched Networks.
Based on slides from Dave Andersen and Nick Feamster
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 High Speed Router Design Shivkumar Kalyanaraman Rensselaer Polytechnic Institute
Router Architecture : Building high-performance routers Ian Pratt
What's inside a router? We have yet to consider the switching function of a router - the actual transfer of datagrams from a router's incoming links to.
MEMS and its Applications Optical Routing, an example Shashi Mysore Computer Science UCSB.
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.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 High Speed Router Design Shivkumar Kalyanaraman Rensselaer Polytechnic Institute
1 Circuit Switching in the Core OpenArch April 5 th 2003 Nick McKeown Professor of Electrical Engineering and Computer Science, Stanford University
10 - Network Layer. Network layer r transport segment from sending to receiving host r on sending side encapsulates segments into datagrams r on rcving.
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
Sizing Router Buffers (Summary)
Sizing Router Buffers Nick McKeown Guido Appenzeller & Isaac Keslassy SNRC Review May 27 th, 2004.
1 Internet Routers Stochastics Network Seminar February 22 nd 2002 Nick McKeown Professor of Electrical Engineering and Computer Science, Stanford University.
EE 122: Router Design Kevin Lai September 25, 2002.
IEE, October 2001Nick McKeown1 High Performance Routers Slides originally by Nick McKeown Professor of Electrical Engineering and Computer Science, Stanford.
Nick McKeown 1 Memory for High Performance Internet Routers Micron February 12 th 2003 Nick McKeown Professor of Electrical Engineering and Computer Science,
1 Trend in the design and analysis of Internet Routers University of Pennsylvania March 17 th 2003 Nick McKeown Professor of Electrical Engineering and.
Katz, Stoica F04 EECS 122: Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering.
Introduction to High-Performance Internet Switches and Routers
1 Growth in Router Capacity IPAM, Lake Arrowhead October 2003 Nick McKeown Professor of Electrical Engineering and Computer Science, Stanford University.
Router Architectures An overview of router architectures.
Router Architectures An overview of router architectures.
Router Design (Nick Feamster) February 11, Today’s Lecture The design of big, fast routers Partridge et al., A 50 Gb/s IP Router Design constraints.
Chapter 4 Queuing, Datagrams, and Addressing
Computer Networks Switching Professor Hui Zhang
Professor Yashar Ganjali Department of Computer Science University of Toronto
INF5050 – Protocols and Routing in Internet (Friday ) Presented by Tor Skeie Subject: IP-router architecture.
Router Architecture Overview
Advance Computer Networking L-8 Routers Acknowledgments: Lecture slides are from the graduate level Computer Networks course thought by Srinivasan Seshan.
L11: Link and Network layer Dina Katabi Spring Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek,
Department of Computer and IT Engineering University of Kurdistan Computer Networks II Router Architecture By: Dr. Alireza Abdollahpouri.
1 Processing packets in packet switches CS343 May 7 th 2003 Nick McKeown Professor of Electrical Engineering and Computer Science, Stanford University.
Designing Packet Buffers for Internet Routers Friday, October 23, 2015 Nick McKeown Professor of Electrical Engineering and Computer Science, Stanford.
Nick McKeown1 Building Fast Packet Buffers From Slow Memory CIS Roundtable May 2002 Nick McKeown Professor of Electrical Engineering and Computer Science,
1 Performance Guarantees for Internet Routers ISL Affiliates Meeting April 4 th 2002 Nick McKeown Professor of Electrical Engineering and Computer Science,
1 Router Design Bruce Davie with help from Hari Balakrishnan & Nick McKeown.
CS 4396 Computer Networks Lab Router Architectures.
Winter 2006EE384x Handout 11 EE384x: Packet Switch Architectures Handout 1: Logistics and Introduction Professor Balaji Prabhakar
IEE, October 2001Nick McKeown1 High Performance Routers IEE, London October 18 th, 2001 Nick McKeown Professor of Electrical Engineering and Computer Science,
Lecture Note on Switch Architectures. Function of Switch.
1 A quick tutorial on IP Router design Optics and Routing Seminar October 10 th, 2000 Nick McKeown
1 How scalable is the capacity of (electronic) IP routers? Nick McKeown Professor of Electrical Engineering and Computer Science, Stanford University
Packet Switch Architectures The following are (sometimes modified and rearranged slides) from an ACM Sigcomm 99 Tutorial by Nick McKeown and Balaji Prabhakar,
L11: Protocols and Network layer Frans Kaashoek Spring Some slides are from lectures by Nick Mckeown, Ion Stoica,Dina.
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.
Univ. of TehranIntroduction to Computer Network1 An Introduction to Computer Networks University of Tehran Dept. of EE and Computer Engineering By: Dr.
Univ. of TehranComputer Network1 Computer Networks Computer Networks (Graduate level) University of Tehran Dept. of EE and Computer Engineering By: Dr.
Network layer (addendum) Slides adapted from material by Nick McKeown and Kevin Lai.
Graciela Perera Department of Computer Science and Information Systems Slide 1 of 18 INTRODUCTION NETWORKING CONCEPTS AND ADMINISTRATION CSIS 3723 Graciela.
INF5050 – Protocols and Routing in Internet (Friday )
Weren’t routers supposed
IP Forwarding Covers the principles of end-to-end datagram delivery in IP networks.
Addressing: Router Design
Reference Router on NetFPGA 1G
Lecture 11 Switching & Forwarding
IP Forwarding Relates to Lab 3.
Advance Computer Networking
IP Forwarding Relates to Lab 3.
Packet Switch Architectures
Chapter 4 Network Layer Computer Networking: A Top Down Approach 5th edition. Jim Kurose, Keith Ross Addison-Wesley, April Network Layer.
Network Layer: Control/data plane, addressing, routers
IP Forwarding Relates to Lab 3.
Techniques and problems for
Reference Router on NetFPGA 1G
Packet Switch Architectures
Presentation transcript:

048866: Packet Switch Architectures Dr. Isaac Keslassy Electrical Engineering, Technion Introduction

Spring – Packet Switch Architectures2 Course Content  Most of the results in the course are less than 10 years old!  Material is new and still changing…  No reference book available yet…  Uses slides by Profs. Nick McKeown and Balaji Prabahakar (Stanford)

Spring – Packet Switch Architectures3 Outline  Background  What is a router?  Why do we need faster routers?  Why are they hard to build?  Architectures and techniques  The evolution of router architecture.  IP address lookup.  Packet buffering.  Switching.

Spring – Packet Switch Architectures4 What is Routing? R3 A B C R1 R2 R4D E F R5 F R3E D Next HopDestination D

Spring – Packet Switch Architectures5 What is Routing? R3 A B C R1 R2 R4D E F R5 F R3E D Next HopDestination D Data Options (if any) Destination Address Source Address Header ChecksumProtocolTTL Fragment Offset Flags Fragment ID Total Packet LengthT.ServiceHLenVer 20 bytes

Spring – Packet Switch Architectures6 What is Routing? A B C R1 R2 R3 R4D E F R5

Spring – Packet Switch Architectures7 Points of Presence (POPs) A B C POP1 POP3 POP2 POP4 D E F POP5 POP6 POP7 POP8

Spring – Packet Switch Architectures8 Where High Performance Routers are Used R10 R11 R4 R13 R9 R5 R2 R1 R6 R3 R7 R12 R16 R15 R14 R8 (10 Gb/s)

Spring – Packet Switch Architectures9 What a Router Looks Like Cisco GSR 12416Juniper M160 6ft 19 ” 2ft Capacity: 160Gb/s Power: 4.2kW Full rack 3ft 2.5ft 19 ” Capacity: 80Gb/s Power: 2.6kW Half-a-rack

Spring – Packet Switch Architectures10 Core Router Market  Estimates cover different parameters  Dell’Oro (Feb. 17, 2005):  $1.2 billion in 2004 (up 66%)  Includes high-end (10Gbps) router market  Dell’Oro (Feb. 21, 2006):  $4.4 billion in 2005  Includes “worldwide service provider router market”  Infonetics (Feb. 21, 2006):  $5.2 billion in 2005 (up 31%)  Includes core/edge routers  Core router market  Relatively small (in comparison to enterprise market), but brings expertise to company  Vendors: Cisco, Juniper, Avici, Nortel, Lucent, Alcatel, Huawei, etc.

Spring – Packet Switch Architectures11 Router Market Source: Infonetics (Nov. 2004)

Spring – Packet Switch Architectures12 Basic Architectural Components of an IP Router Control Plane Datapath per-packet processing Switching Forwarding Table Routing Table Routing Protocols

Spring – Packet Switch Architectures13 Per-packet processing in an IP Router 1. Accept packet arriving on an incoming link. 2. Lookup: lookup packet destination address in the forwarding table, to identify outgoing port(s). 3. Header Processing: Manipulate packet header: e.g., decrement TTL, update header checksum. 4. Switching: Send packet to the outgoing port(s). 5. Buffering: Buffer packet in the queue. 6. Transmit packet onto outgoing link.

Spring – Packet Switch Architectures14 Generic Router Architecture Lookup IP Address Update Header Header Processing DataHdrDataHdr ~1M prefixes Off-chip DRAM Address Table Address Table IP AddressNext Hop Queue Packet Buffer Memory Buffer Memory ~1M packets Off-chip DRAM

Spring – Packet Switch Architectures15 Lookup IP Address Update Header Header Processing Address Table Address Table Lookup IP Address Update Header Header Processing Address Table Address Table Generic Router Architecture Lookup IP Address Update Header Header Processing Address Table Address Table DataHdrDataHdrDataHdr Buffer Manager Buffer Memory Buffer Memory Buffer Manager Buffer Memory Buffer Memory Buffer Manager Buffer Memory Buffer Memory DataHdrDataHdrDataHdr

Spring – Packet Switch Architectures16 Outline  Background  What is a router?  Why do we need faster routers?  Why are they hard to build?  Architectures and techniques  The evolution of router architecture.  IP address lookup.  Packet buffering.  Switching.

Spring – Packet Switch Architectures17 Why Do We Need Faster Routers? 1. To prevent routers from becoming the bottleneck in the Internet. 2. To increase POP capacity, and to reduce cost, size and power.

Spring – Packet Switch Architectures18 Why We Need Faster Routers 1: To prevent routers from being the bottleneck Packet Processing Power 2x / 18 months Source: SPEC95Int & Coffman and Odlyzko. Single Fiber Capacity (commercial) ≥ 2x / year

Spring – Packet Switch Architectures19 POP with smaller routers Why we Need Faster Routers 2: To reduce cost, power & complexity of POPs POP with large routers  Ports: Price >$50k, Power > 400W.  It is common for 50-60% of ports to be for interconnection.

Spring – Packet Switch Architectures20 Why are Fast Routers Difficult to Make? 1. It’s hard to keep up with Moore’s Law:  The bottleneck is memory speed.  Memory speed is not keeping up with Moore’s Law.

Spring – Packet Switch Architectures21 Why are Fast Routers Difficult to Make? Speed of Commercial DRAM 1. It’s hard to keep up with Moore’s Law:  The bottleneck is memory speed.  Memory speed is not keeping up with Moore’s Law. Moore’s Law 2x / 18 months 1.1x / 18 months

Spring – Packet Switch Architectures22 Why are Fast Routers Difficult to Make? 1. It’s hard to keep up with Moore’s Law:  The bottleneck is memory speed.  Memory speed is not keeping up with Moore’s Law. 2. Moore’s Law is too slow:  Routers need to improve faster than Moore’s Law.

Spring – Packet Switch Architectures23 Router Performance Exceeds Moore’s Law Growth in capacity of commercial routers:  Capacity 1992 ~ 2Gb/s  Capacity 1995 ~ 10Gb/s  Capacity 1998 ~ 40Gb/s  Capacity 2001 ~ 160Gb/s  Capacity 2003 ~ 640Gb/s Average growth rate: 2.2x / 18 months.

Spring – Packet Switch Architectures24 Outline Background  What is a router?  Why do we need faster routers?  Why are they hard to build? Architectures and techniques  The evolution of router architecture.  IP address lookup.  Packet buffering.  Switching.

Spring – Packet Switch Architectures25 Route Table CPU Buffer Memory Line Interface MAC Line Interface MAC Line Interface MAC Typically <0.5Gb/s aggregate capacity Shared Backplane Line Interface CPU Memory First-Generation Routers

Spring – Packet Switch Architectures26 Route Table CPU Line Card Buffer Memory Line Card MAC Buffer Memory Line Card MAC Buffer Memory Fwding Cache Fwding Cache Fwding Cache MAC Buffer Memory Typically <5Gb/s aggregate capacity Second-Generation Routers

Spring – Packet Switch Architectures27 Line Card MAC Local Buffer Memory CPU Card Line Card MAC Local Buffer Memory Switched Backplane Line Interface CPU Memory Fwding Table Routing Table Fwding Table Typically <50Gb/s aggregate capacity Third-Generation Routers

Spring – Packet Switch Architectures28 Switch Core Linecards Optical links 100s of metres Tb/s routers Fourth-Generation Routers Multi-Racks, Optical Links

Spring – Packet Switch Architectures29 Optical Switch Core Linecards Optical links 100s of metres Tb/s routers, in project (Future) Fifth-Generation Routers Optical Switch Core

Spring – Packet Switch Architectures30 Optical Switch Core Optical Linecards Optical links 100s of metres Tb/s routers, in the far future (Future) Sixth-Generation Routers All-Optical Routers

Spring – Packet Switch Architectures31 Outline Background  What is a router?  Why do we need faster routers?  Why are they hard to build? Architectures and techniques  The evolution of router architecture.  IP address lookup.  Packet buffering.  Switching.

Spring – Packet Switch Architectures32 Generic Router Architecture Lookup IP Address Update Header Header Processing Address Table Address Table Lookup IP Address Update Header Header Processing Address Table Address Table Lookup IP Address Update Header Header Processing Address Table Address Table Buffer Manager Buffer Memory Buffer Memory Buffer Manager Buffer Memory Buffer Memory Buffer Manager Buffer Memory Buffer Memory Lookup IP Address Address Table Address Table Lookup IP Address Address Table Address Table Lookup IP Address Address Table Address Table

Spring – Packet Switch Architectures33 IP Address Lookup  Why it’s thought to be hard:  It’s not an exact match: it’s a longest prefix match.  The table is large: about 150,000 entries today, and growing.  The lookup must be fast: about 30ns for a 10Gb/s line.

Spring – Packet Switch Architectures34 IP Lookups find Longest Prefixes / / / / / / Routing lookup: Find the longest matching prefix (aka the most specific route) among all prefixes that match the destination address.

Spring – Packet Switch Architectures35 IP Addressing Classless Interdomain Routing (CIDR)  The IP address space is broken into line segments.  Each line segment is described by a prefix.  A prefix is of the form x/y where x indicates the prefix of all addresses in the line segment, and y indicates the length of the segment.  e.g. The prefix 128.9/16 represents the line segment containing addresses in the range: … / /

Spring – Packet Switch Architectures36 IP Addressing Classless Interdomain Routing (CIDR) / / =2^7 9=2^3+2^0 16=2^4 14=2^3+2^2+2^ /16 = xxxxxxxx.xxxxxxxx  =

Spring – Packet Switch Architectures37 IP Address Lookup  Why it’s thought to be hard:  It’s not an exact match: it’s a longest prefix match.  The table is large: about 150,000 entries today, and growing.  The lookup must be fast: about 30ns for a 10Gb/s line.

Spring – Packet Switch Architectures38 Address Tables are Large Source:

Spring – Packet Switch Architectures39 IP Address Lookup  Why it’s thought to be hard:  It’s not an exact match: it’s a longest prefix match.  The table is large: about 150,000 entries today, and growing.  The lookup must be fast: about 30ns for a 10Gb/s line.

Spring – Packet Switch Architectures40 Lookups Must be Fast 12540Gb/s Gb/s Gb/s Mb/s B packets (Mpkt/s) LineYear Gb/s2005?

Spring – Packet Switch Architectures41 Outline Background  What is a router?  Why do we need faster routers?  Why are they hard to build? Architectures and techniques  The evolution of router architecture.  IP address lookup.  Packet buffering.  Switching.

Spring – Packet Switch Architectures42 Generic Router Architecture Lookup IP Address Update Header Header Processing Address Table Address Table Lookup IP Address Update Header Header Processing Address Table Address Table Lookup IP Address Update Header Header Processing Address Table Address Table Queue Packet Buffer Memory Buffer Memory Queue Packet Buffer Memory Buffer Memory Queue Packet Buffer Memory Buffer Memory Buffer Manager Buffer Memory Buffer Memory Buffer Manager Buffer Memory Buffer Memory Buffer Manager Buffer Memory Buffer Memory

Spring – Packet Switch Architectures43 Fast Packet Buffers Example: 40Gb/s packet buffer Size = RTT*BW = 10Gb; 40 byte packets Write Rate, R 1 packet every 8 ns Read Rate, R 1 packet every 8 ns Buffer Manager Buffer Memory Use SRAM? + fast enough random access time, but - too low density to store 10Gb of data. Use SRAM? + fast enough random access time, but - too low density to store 10Gb of data. Use DRAM? + high density means we can store data, but - too slow (50ns random access time). Use DRAM? + high density means we can store data, but - too slow (50ns random access time).

Spring – Packet Switch Architectures44 Outline Background  What is a router?  Why do we need faster routers?  Why are they hard to build? Architectures and techniques  The evolution of router architecture.  IP address lookup.  Packet buffering.  Switching.

Spring – Packet Switch Architectures45 Generic Router Architecture Lookup IP Address Update Header Header Processing Address Table Address Table Lookup IP Address Update Header Header Processing Address Table Address Table Lookup IP Address Update Header Header Processing Address Table Address Table Queue Packet Buffer Memory Buffer Memory Queue Packet Buffer Memory Buffer Memory Queue Packet Buffer Memory Buffer Memory DataHdr DataHdr DataHdr 1 2 N 1 2 N N times line rate

Spring – Packet Switch Architectures46 Generic Router Architecture Lookup IP Address Update Header Header Processing Address Table Address Table Lookup IP Address Update Header Header Processing Address Table Address Table Lookup IP Address Update Header Header Processing Address Table Address Table Queue Packet Buffer Memory Buffer Memory Queue Packet Buffer Memory Buffer Memory Queue Packet Buffer Memory Buffer Memory DataHdr DataHdr DataHdr 1 2 N 1 2 N DataHdr DataHdr DataHdr Scheduler

Spring – Packet Switch Architectures47 Current Internet Router Technology Summary  There are three potential bottlenecks:  Address lookup,  Packet buffering, and  Switching. Most difficult – and focus of this course!