CS 3516: Computer Networks

Transcription

1 Welcome to CS 3516: Computer Networks Prof. Yanhua Li Time: 9:00am 9:50am M, T, R, and F Location: AK219 Fall 2018 A-term 1 Some slides are originally from the course materials of the textbook Computer Networking: A Top Down Approach, 7th edition, by Jim Kurose, Keith Ross, Addison-Wesley March Copyright J.F Kurose and K.W. Ross, All Rights Reserved.

2 Overview v Final Exam Review v Class Review Link Layer 5-2

3 Addressing: routing to another LAN walkthrough: send datagram from A to B via R focus on addressing at IP (datagram) and MAC layer (frame) assume A knows B s IP address (how?) assume A knows IP address of first hop router, R (how?) assume A knows R s MAC address (how?) A C-E8-FF CC-49-DE-D0-AB-7D R E6-E BB-4B A-23-F9-CD-06-9B B BD-D2-C7-56-2A B2-2F-54-1A-0F Link Layer 5-3

4 Overview v Final Exam Review v Class Review Link Layer 5-4

5 Final Review v (1) DHCP v (2) CSMA/CD v (3) LS and DV routing v (4) LS and DV routing v (5) IPv4 classful addressing v (6) LS and DV routing v (7) Inter-AS routing and BGP v (1) 7 questions v (2) 32 points + 2 bonus points v (3) Q1-4: Small v (4) Q5-7: bigger questions Link Layer 5-5

6 DHCP client-server scenario / DHCP server arriving DHCP client needs address in this network / /24 Network Layer 4-6

7 DHCP client-server scenario DHCP server: DHCP discover src : , 68 dest.: ,67 yiaddr: transaction ID: 654 Broadcast: is there a DHCP server out there? arriving client DHCP request DHCP offer src: , 68 dest:: , 67 yiaddrr: transaction that IP address! ID: 655 lifetime: 3600 secs Broadcast: OK. I ll take src: , 67 dest: , 68 yiaddrr: transaction ID: 654 lifetime: 3600 secs Broadcast: I m a DHCP server! Here s an IP address you can use DHCP ACK src: , 67 dest: , 68 yiaddrr: transaction ID: 655 lifetime: 3600 secs Broadcast: OK. You ve got that IP address! Network Layer 4-7

8 CSMA/CD (collision detection) spatial layout of nodes B D Link Layer 5-8

9 Ethernet CSMA/CD algorithm 1. NIC receives datagram from network layer, creates frame 2. If NIC senses channel idle, starts frame transmission. If NIC senses channel busy, waits until channel idle, then transmits. 3. If NIC transmits entire frame without detecting another transmission, NIC is done with frame! 4. If NIC detects another transmission while transmitting, aborts and sends jam signal 5. After aborting, NIC enters binary (exponential) backoff: after mth collision, NIC chooses K at random from {0,1,2,, 2 m -1}. NIC waits K 512 bit times, returns to Step 2 longer backoff interval with more collisions Link Layer 5-9

10 Interconnected ASes 3c 3a 3b AS3 1a 1c 1d 1b Intra-AS Routing algorithm AS1 Forwarding table Inter-AS Routing algorithm 2a DV: Routing Information Protocol (RIP), BGP LS: OSPF (Open Shortest Path First routing) 2c AS2 v 2b forwarding table configured by both intraand inter-as routing algorithm intra-as sets entries for internal dests inter-as & intra-as sets entries for external dests Network Layer 4-10

11 Inter-AS tasks v other networks suppose router in AS1 receives datagram destined outside of AS1: router should forward packet to gateway router, but which one? 3b 3c AS3 3a 1a AS1 1c 1d x 1b AS1 must: 1. learn which dests are reachable through AS2, which through AS3 2. propagate this reachability info to all routers in AS1 job of inter-as routing! 2a AS2 2c 2b other networks Network Layer 4-11

12 BGP basics: distributing path information v v other networks using ebgp session between 3a and 1c, AS3 sends prefix reachability info to AS1. 1c can then use ibgp do distribute new prefix info to all routers in AS1 1b can then re-advertise new reachability info to AS2 over 1b-to- 2a ebgp session when router learns of new prefix, it creates entry for prefix in its forwarding table. 3b AS3 3a 1a AS1 1c x 1d ebgp session ibgp session 1b 2a AS2 2c 2b other networks Network Layer 4-12

13 Example: setting forwarding table in router 1d v v suppose AS1 learns (via inter-as protocol) that subnet x reachable via AS3 (gateway 1c), but not via AS2 inter-as protocol propagates reachability info to all internal routers router 1d determines from intra-as routing info that its interface e is on the least cost path to 1c installs forwarding table entry (x,e) 3c x other networks 3b 3a AS3 1a AS1 1c 1d 1b 2a AS2 2c 2b other networks Network Layer 4-13

14 Example: choosing among multiple ASes v v other networks now suppose AS1 learns from inter-as protocol that subnet x is reachable from AS3 and from AS2. to configure forwarding table, router 1d must determine which gateway it should forward packets towards for dest x this is also job of inter-as routing protocol! hot potato routing: send packet towards closest of two routers. 3b 3c AS3 3a 1a AS1 1c 1d x? 1b 2a AS2 2c 2b other networks Network Layer 4-14

15 Final Grade: 4 components Labs: 10% 3 labs, Lab1-5points; Lab2-25+2pts; Lab bonus pt Quizzes: 30% 9 Quizzes the one with lowest percentage is not counted Projects: 30% 3 project, each worth of 15% Exams: 30% Mid-term exam: ( pts) Final Exam: ( pts) Link Layer 5-15

16 Questions? Network Layer 4-16