Unformatted text preview:

CS 152 Computer Architecture and Engineering Lecture 21 Networks and Routers 2006 11 9 John Lazzaro www cs berkeley edu lazzaro TAs Udam Saini and Jue Sun www inst eecs berkeley edu cs152 CS 152 L21 Networks and Routers UC Regents Fall 2006 UCB 1 Last Time NAND Flash Idea Disk Replacement Presents memory to the CPU as a set of pages Chip remembers for 10 years Page format 2048 Bytes user data 64 Bytes meta data Note NOR Flash is another flash product for software code NOR Flash read interface is just like SRAM CS 152 L21 Networks and Routers NAND Flash has better cost bit than NOR UC Regents Fall 2006 UCB 2 Last Time Making the Mac Mini G4 Size fixed by the form factor physical size of desktop DIMMS Laptop DRAM is smaller but too expensive for 499 price CS 152 L21 Networks and Routers UC Regents Fall 2006 UCB 3 Why are networks different from buses Serial Data is sent bit by bit over one logical wire Network Primary purpose is to connect computers to computers CS 152 L21 Networks and Routers USB FireWire Primary purpose is to connect devices to a computer UC Regents Fall 2006 UCB 4 Today Networks Link layers Using physics to send bits from place to place Internet A network of networks Routing Inside the cloud CS 152 L21 Networks and Routers UC Regents Fall 2006 UCB 5 Today Router Design Router architecture What s inside the box Forwarding engine How a router knows the next hop for a packet Switch fabric When buses are too slow replace it with a switch CS 152 L21 Networks and Routers UC Regents Fall 2006 UCB 6 Networking bottom up Link two endpoints Q1 How far away are the endpoints Japan US undersea cable network Physical media optical fiber photonics Distance WiFi wireless mobility from hotel bandwidth bed to influences access point choice of medium Physical media unlicensed radio spectrum CS 152 L21 Networks and Routers UC Regents Fall 2006 UCB 7 Networking bottom up Link two endpoints Q2 Initial investment cost for the link 1B USD A ship lays cable on ocean floor For expensive media much of the price goes to pay off loans The price of the WiFi laptop card the base station Unlicensed radio no fee to the FCC CS 152 L21 Networks and Routers UC Regents Fall 2006 UCB 8 Networking bottom up Link two endpoints Q3 How is the link imperfect A steady bitstream circuit No packets to lose Only one bit flips per 10 000 000 000 000 sent Undersea failure is catastrophic Someone walks by and the network stops working fading CS 152 L21 Networks and Routers Solution Short packets spaced in time to escape the fade If lost do retransmits UC Regents Fall 2006 UCB 9 Networking bottom up Link two endpoints Q4 How does link perform BW 640 Gb s ping irt1 ge1 1 tdc noc sony co jp CA JP cable Latency PING irt1 ge1 1 tdc noc sony co jp 211 125 132 198 56 data bytes 64 bytes from 211 125 132 198 icmp seq 0 ttl 242 time 114 571 ms round trip Compare Light speed in vacuum SFOTokyo 63ms RT In general risky to halve the round trip time for oneway latency paths are often different each direction BW In theory 801 11b offers 11 Mb s Users are lucky to see 3 5 Mb s in practice Latency If there is no fading quite good I ve measured 2 ms RTT on a short hop CS 152 L21 Networks and Routers UC Regents Fall 2006 UCB 10 There are dozens of link networks Protocol Complexity email WWW phone SMTP HTTP RTP TCP UDP IP Ethernet Wi Fi Link networks CSMA async sonet copper fiber radio Diagram Credit Steve Deering CS 152 L21 Networks and Routers The undersea cable the hotel WiFi and many others DSL Ethernet UC Regents Fall 2006 UCB 11 Web browsers do not know about link nets Protocol Complexity Applications email WWW phone SMTP HTTP RTP TCP UDP IP Ethernet Wi Fi CSMA async sonet Link networks copper fiber radio Diagram Credit Steve Deering CS 152 L21 Networks and Routers App authors do not want to add support for N different network types The undersea cable the hotel WiFi and many others DSL Ethernet UC Regents Fall 2006 UCB 12 The Internet A Network of Networks Protocol Complexity Internet Protocol IP An abstraction for applications to target and for link networks to support Very simple very successful email WWW phone SMTP HTTP RTP TCP UDP IP Ethernet Wi Fi CSMA async sonet copper fiber radio IP presents link network errors losses in an abstract way not a link specific way Link layer is not expected to be perfect Diagram Credit Steve Deering CS 152 L21 Networks and Routers UC Regents Fall 2006 UCB 13 The Internet interconnects hosts IP4 number for this computer 198 211 61 22 Every directly connected host has a unique IP number Upper limit of 2 32 IP4 numbers some are reserved for other purposes Next generation IP IP6 limit 2 128 198 211 61 22 A user friendly form of the 32 bit unsigned value 3335732502 which is 198 2 24 211 2 16 61 2 8 22 CS 152 L21 Networks and Routers UC Regents Fall 2006 UCB 14 Internet Sends Packets Between Hosts IP4 IP6 etc How the destination should interpret the payload data 2 0 1 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 Version IHL Type of Service Total Length Identification Flags Fragment Offset Time to Live Protocol Header Checksum From IP number Source Address Note Could be a lie To IP number Destination Address Payload data size implied by Total Length header field Bitfield numbers Header Data IHL field of words in header The typical header IHL 5 words is shown Longer headers code add extra fields after the destination address CS 152 L21 Networks and Routers UC Regents Fall 2006 UCB 15 Link networks transport IP packets ISO Layer Names IP packet Layer 3 WiFi and Cable Modem packets Layer 2 Radio cable waveforms Layer 1 801 11b WiFi packet IP Packet For this hop IP packet sent inside of a wireless 801 11b packet CS 152 L21 Networks and Routers Cable modem packet IP Packet For this hop IP packet sent inside of a cable modem DOCSIS packet UC Regents Fall 2006 UCB 16 Link layers maximum packet size vary Maximum IP packet size 64K bytes Maximum Transmission Unit MTU generalized packet size of link networks may be much less often 2K bytes or less Efficient uses of IP3sense MTU 0 1 2 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 Version IHL Type of Service Total Length Identification Flags Fragment Offset Time to Live Protocol Header Checksum Source Address Destination Address Payload …


View Full Document

Berkeley COMPSCI 152 - Lecture 21 – Networks and Routers

Documents in this Course
Quiz 5

Quiz 5

9 pages

Memory

Memory

29 pages

Quiz 5

Quiz 5

15 pages

Memory

Memory

29 pages

Memory

Memory

35 pages

Memory

Memory

15 pages

Quiz

Quiz

6 pages

Midterm 1

Midterm 1

20 pages

Quiz

Quiz

12 pages

Memory

Memory

33 pages

Quiz

Quiz

6 pages

Homework

Homework

19 pages

Quiz

Quiz

5 pages

Memory

Memory

15 pages

Load more
Loading Unlocking...
Login

Join to view Lecture 21 – Networks and Routers and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Lecture 21 – Networks and Routers and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?