1 / 70

INF5050 – Protocols and Routing in Internet ( Friday 7.2.2014)

INF5050 – Protocols and Routing in Internet ( Friday 7.2.2014). Subject: IP-router architecture. Presented by Tor Skeie. High Performance Routers IEE, London October 18 th , 2001. (with updates). Nick McKeown Professor of Electrical Engineering and Computer Science, Stanford University

jeremy-pitts
Télécharger la présentation

INF5050 – Protocols and Routing in Internet ( Friday 7.2.2014)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

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

  2. High Performance Routers IEE, London October 18th, 2001 (with updates) Nick McKeown Professor of Electrical Engineering and Computer Science, Stanford University nickm@stanford.edu www.stanford.edu/~nickm Stanford High Performance Networking group: http://klamath.stanford.edu 2

  3. 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. The Future 3

  4. D D R3 R1 R4 D A B E R2 C R5 Destination Next Hop F D R3 E R3 F R5 What is Routing? 4

  5. R3 R1 R4 D D A D D 1 4 16 32 D Ver HLen T.Service Total Packet Length Fragment ID Flags Fragment Offset B E TTL Protocol Header Checksum 20 bytes Source Address R2 C R5 Destination Address Destination Next Hop F D R3 Options (if any) E R3 Data F R5 What is Routing? 5

  6. POP3 POP2 POP1 D POP4 A B E POP5 POP6 C POP7 POP8 F Points of Presence (POPs) 6

  7. Where High Performance Routers are Used (140 Gb/s) R2 (140 Gb/s) (2.5 Gb/s) R1 R6 R5 R4 R7 R3 R9 R10 R8 R11 R12 R14 R13 R16 R15 (140 Gb/s) (140 Gb/s) 7

  8. Cisco CRS-3 (CRS-1 16 slot single-shelf on picture) Juniper M320 (M160 on picture) 0.60m 0.44m Capacity: 4.48Tb/sPower: 12.3kWWeight: 723kg Capacity: 160Gb/sPower: 3.5kW 2.14m 0.88m 0.91m 0.65m What a Router Looks Like Capacity is sum of rates of linecards 8

  9. A fully configured CRS-3 has the capacity of 322 Tb/s "The Cisco CRS-3 triples the capacity of its predecessor, the Cisco CRS-1 Carrier Routing System, with up to 322 Terabits per second, which enables the entire printed collection of the Library of Congress to be downloaded in just over one second; every man, woman and child in China to make a video call, simultaneously; and every motion picture ever created to be streamed in less than four minutes.” 9

  10. Some Multi-rack Routers Juniper TX8/T640 Alcatel 7670 RSP TX8 Avici TSR Chiaro

  11. Data Hdr Data Hdr IP Address Next Hop Address Table Buffer Memory Generic Router Architecture Header Processing Lookup IP Address Update Header Queue Packet 1M prefixes Off-chip DRAM 1M packets Off-chip DRAM 11

  12. Data Data Data Hdr Hdr Hdr Header Processing Header Processing Header Processing Lookup IP Address Lookup IP Address Lookup IP Address Update Header Update Header Update Header Address Table Address Table Address Table Data Data Hdr Hdr Data Hdr Generic Router Architecture Buffer Manager Buffer Memory Buffer Manager Buffer Memory Buffer Manager Buffer Memory 12

  13. Why do we Need Faster Routers? • To prevent routers becoming the bottleneck in the Internet. • To increase POP capacity, and to reduce cost, • size and • power. 13

  14. Why we Need Faster Routers 1: To prevent routers from being the bottleneck Packet processing Power Link Speed 10000 1000 2x / 18 months 2x / 7 months 100 Fiber Capacity (Gbit/s) 10 1 1985 1990 1995 2000 0,1 TDM DWDM Source: SPEC95Int & David Miller, Stanford. 14

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

  16. Why are Fast Routers Difficult to Make? • 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. 16

  17. 1.1x / 18 months Moore’s Law 2x / 18 months Why are Fast Routers Difficult to Make?Speed of Commercial DRAM • 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. 1.1x / 18 months Moore’s Law 2x / 18 months 17

  18. Why are Fast Routers Difficult to Make? • 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 is too slow: • Routers need to improve faster than Moore’s Law. 18

  19. 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 • Capacity 2008 ~ 100Tb/s Average growth rate: 2.2x / 18 months. 2010:The Cisco CRS-3 multishelf router has a capacity of 322Tb/s (1150 ports) 19

  20. 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. The Future 20

  21. CPU Buffer Memory Route Table CPU Line Interface Line Interface Line Interface Memory MAC MAC MAC Typically <0.5Gb/s aggregate capacity First Generation Routers Shared Backplane Line Interface 21

  22. Fwding Cache Second Generation Routers CPU Buffer Memory Route Table Line Card Line Card Line Card Buffer Memory Buffer Memory Buffer Memory Fwding Cache Fwding Cache MAC MAC MAC Typically <5Gb/s aggregate capacity 22

  23. Fwding Table Third Generation Routers Switched Backplane Line Card CPU Card Line Card Local Buffer Memory Local Buffer Memory Line Interface CPU Routing Table Memory Fwding Table MAC MAC Typically <50Gb/s aggregate capacity 23

  24. Fourth Generation Routers/SwitchesOptics inside a router for the first time Optical links 100s of metres Switch Core Linecards 100-500 Tb/s routers in development 24

  25. 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. The Future 25

  26. Header Processing Header Processing Lookup IP Address Lookup IP Address Update Header Update Header Address Table Address Table Lookup IP Address Lookup IP Address Lookup IP Address Address Table Address Table Address Table Generic Router Architecture Buffer Manager Buffer Memory Header Processing Buffer Manager Lookup IP Address Update Header Buffer Memory Address Table Buffer Manager Buffer Memory 26

  27. 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 500,000 entries today, and growing. • The lookup must be fast: about 2ns for a 140Gb/s line. 27

  28. Longest Prefix Match is Harder than Exact Match • The destination address of an arriving packet does not carry with it the information to determine the length of the longest matching prefix • Hence, one needs to search among the space of all prefix lengths; as well as the space of all prefixes of a given length 28

  29. 128.9.16.14 IP Lookups find Longest Prefixes 128.9.176.0/24 128.9.16.0/21 128.9.172.0/21 142.12.0.0/19 65.0.0.0/8 128.9.0.0/16 0 232-1 Routing lookup:Find the longest matching prefix (aka the most specific route) among all prefixes that match the destination address. 29

  30. Address Tables are Large 30

  31. Lookups Must be Fast 31

  32. IP Address LookupBinary tries Example Prefixes: 0 1 a) 00001 b) 00010 0 c) 00011 d) 001 0 e) 0101 g f d f) 011 1 g) 100 h i h) 1010 e 1 i) 1100 j) 11110000 a b c j 32

  33. Multi-ary trie W/k Depth = W/k Degree = 2k Stride = k bits Multi-bit Tries Binary trie W Depth = W Degree = 2 Stride = 1 bit Time ~ W/k Storage ~ NW/k * 2k-1 W = longest prefix N = #prefixes 33

  34. Prefix Length Distribution Source: Geoff Huston, Oct 2001 99.5% prefixes are 24-bits or shorter 34

  35. 24-8 Direct Lookup Trie 0000……0000 1111……1111 24 bits 0 224-1 8 bits 0 28-1 • When pipelined, allows one lookup per memory access. • Inefficient use of memory, though. 35

  36. 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. The Future 38

  37. Line cardshostingone or moreports Bi-directional ports Bi-directional ports Arbitration/Control Conceptual architecture Non-blockingswitchingcore(s) 40

  38. Input buffering Bi-directional ports Bi-directional ports Arbitration/Control Conceptual Packet Buffering Non-blockingswitchingcore(s) 41

  39. Data Data Data Data Data Data Hdr Hdr Hdr Hdr Hdr Hdr Header Processing Header Processing Header Processing Lookup IP Address Lookup IP Address Lookup IP Address Update Header Update Header Update Header 1 1 Address Table Address Table Address Table 2 2 N N Arbitration Queue Packet Buffer Memory Queue Packet Buffer Memory Arbitration Queue Packet Buffer Memory 43

  40. Head of Line Blocking 44

  41. A Router with Input QueuesHead of Line Blocking The best that any queueing system can achieve. 45

  42. The Best Performance The best that any queueing system can achieve. 46

  43. Central buffer Bi-directional ports Bi-directional ports Arbitration/Control Conceptual Packet Buffering Non-blockingswitchingcore(s) 47

  44. Fast Packet Buffers(http://yuba.stanford.edu/fastbuffers/) Example: 40Gb/s packet buffer Size = RTT*BW = 10Gb; 40 byte packets Write Rate, R Read Rate, R Buffer Manager 1 packet every 8 ns 1 packet every 8 ns Buffer Memory 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 (40ns random access time). 48

  45. 54 53 52 51 50 10 9 8 7 6 5 95 94 93 92 91 90 89 88 87 86 15 14 13 12 11 10 9 8 7 6 Small ingress SRAM Small ingress SRAM cache of FIFO tails cache of FIFO heads 86 85 84 83 82 11 10 9 8 7 1 1 1 55 60 59 58 57 56 2 97 96 2 Q Q 87 88 91 90 89 DRAM Buffer Memory Packet Caches Buffer Manager SRAM 1 4 3 2 Arriving Departing 2 Packets Packets 2 1 4 3 5 Q 6 5 4 3 2 1 b>>1 packets at a time DRAM Buffer Memory 49

  46. Output buffering Bi-directional ports Bi-directional ports Arbitration/Control Conceptual Packet Buffering Non-blockingswitchingcore(s) 50

  47. Data Data Data Hdr Hdr Hdr Header Processing Header Processing Header Processing Lookup IP Address Lookup IP Address Lookup IP Address Update Header Update Header Update Header Address Table Address Table Address Table Data Data Hdr Hdr Data Hdr Output buffering Buffer Manager Buffer Memory Buffer Manager Buffer Memory Buffer Manager Buffer Memory 51

  48. Data Data Data Hdr Hdr Hdr Header Processing Header Processing Header Processing Lookup IP Address Lookup IP Address Lookup IP Address Update Header Update Header Update Header Address Table Address Table Address Table N times line rate Speed-up 1 1 Queue Packet Buffer Memory 2 2 Queue Packet Buffer Memory N times line rate N N Queue Packet Buffer Memory 54

  49. Input buffering with a virtual output queue Bi-directional ports Bi-directional ports Arbitration/Control Conceptual Packet Buffering Non-blockingswitchingcore(s) 55

  50. Virtual Output Queues 56

More Related