Homework 3 Discussion

Similar documents
CIS 632 / EEC 687 Mobile Computing

Homework 2: IP Due: 11:59 PM, Oct 20, 2016

Computer Networks. Routing Algorithms

Cisco CCNA Basic IP Routing Part I

CS4450. Computer Networks: Architecture and Protocols. Lecture 20 Pu+ng ALL the Pieces Together. Spring 2018 Rachit Agarwal

Quiz 7 May 14, 2015 Computer Engineering 80N

Connecting to the Network

Homework 2: IP Due: 11:59 PM, Oct 19, 2017

COM-208: Computer Networks - Homework 6

FINAL EXAM - SLOT 2 TCP/IP NETWORKING Duration: 90 min. With Solutions

CSCI4211: Introduction to Computer Networks Fall 2017 Homework Assignment 2

cs/ee 143 Communication Networks

Exercise 1 INTERNET. x.x.x.254. net /24. net /24. x.x.x.33. x.x.x.254. x.x.x.52. x.x.x.254. x.x.x.254. x.x.x.

Design and development of the reactive BGP peering in softwaredefined routing exchanges

Review for Chapter 4 R1,R2,R3,R7,R10,R11,R16,R17,R19,R22,R24, R26,R30 P1,P2,P4,P7,P10,P11,P12,P14,P15,P16,P17,P22,P24,P29,P30

Switching & ARP Week 3

EEC-684/584 Computer Networks

Topology of the Internet. Autonomous Systems (AS) Two-Level Routing. Why are there different Protocols?

Homework 4 assignment for ECE374 Posted: 04/06/15 Due: 04/13/15

COMPUTER NETWORK. Homework #3. Due Date: May 22, 2017 in class

DGS-1510 Series Gigabit Ethernet SmartPro Switch Web UI Reference Guide

Carnegie Mellon Computer Science Department Spring 2015 Midterm Exam

ECE 461 Internetworking Fall Quiz 1

CSE 473 Introduction to Computer Networks. Final Exam. Your Name: 12/17/2014 PLEASE WRITE LEGIBLY NO POINTS FOR ILLEGIBLE ANSWERS

CSE 461 Midterm Winter 2018

EITF25 Internet Routing. Jens A Andersson

CSE 123: Computer Networks

IP: Addressing, ARP, Routing

ELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition

Networking: Network Layer

CS 458 Internet Engineering Spring First Exam

CCENT Study Guide. Chapter 9 IP Routing

Guide to TCP/IP Fourth Edition. Chapter 6: Neighbor Discovery in IPv6

CS 457 Lecture 11 More IP Networking. Fall 2011

Routing Protocols of IGP. Koji OKAMURA Kyushu University, Japan

Youki Kadobayashi NAIST

Copyright 2011 Sakun Sharma

CSc 450/550 Computer Networks Internet Routing

Telecommunication Protocols Laboratory Course. Lecture 3

Sybex CCENT Chapter 8: IP Routing. Instructor & Todd Lammle

Lab 8.4.2: Show IP Route Challenge Lab

Exercise Sheet 4. Exercise 1 (Routers, Layer-3-Switches, Gateways)

ECPE / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition

Lecture (03) Internet Protocol tcp/ip> OSI>

Overview. Problem: Find lowest cost path between two nodes Factors static: topology dynamic: load

TCP/IP THE TCP/IP ARCHITECTURE

ROUTING INTRODUCTION TO IP, IP ROUTING PROTOCOLS AND PROXY ARP

Introduction to IP Routing. Geoff Huston

Communication Networks

ECSE 414 Fall 2014 Final Exam Solutions

Lecture 8. Basic Internetworking (IP) Outline. Basic Internetworking (IP) Basic Internetworking (IP) Service Model

CS 349/449 Internet Protocols Midterm Exam Winter /21/2003

Putting it all together

ICS 451: Today's plan

Lecture 8. Reminder: Homework 3, Programming Project 2 due on Thursday. Questions? Tuesday, September 20 CS 475 Networks - Lecture 8 1

Routing Protocol. Seiya Tsubone. Apr The University of Tokyo. Seiya Tsubone (The University of Tokyo) Routing Protocol Apr. 25.

Lies, Damn Lies and ARP Replies

You submitted this homework on Sun 23 Feb :12 PM PST. You got a score of 5.00 out of 5.00.

Inter-Autonomous-System Routing: Border Gateway Protocol

Inter-networking. Problem. 3&4-Internetworking.key - September 20, LAN s are great but. We want to connect them together. ...

CSE 1 23: Computer Networks

Vorlesung Kommunikationsnetze

ELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition

To see how ARP (Address Resolution Protocol) works. ARP is an essential glue protocol that is used to join Ethernet and IP.

Top-Down Network Design, Ch. 7: Selecting Switching and Routing Protocols. Top-Down Network Design. Selecting Switching and Routing Protocols

Second Midterm Exam Solution CMPSCI 591 and 453: Computer Networks Spring 2005 Prof. Jim Kurose

A B C D E Total / 24 / 23 / 12 / 18 / 3 / 80

SIMPLE ROUTER PROJECT 2

Troubleshooting Cisco Express Forwarding Routing Loops

1. (10 points): For each of the following, choose exactly one best answer.

Inter-Autonomous-System Routing: Border Gateway Protocol

ECPE / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition

ELEC / COMP 177 Fall Some slides from Kurose and Ross, Computer Networking, 5 th Edition

CS164 Final Exam Winter 2013

We will discuss about three different static routing algorithms 1. Shortest Path Routing 2. Flooding 3. Flow Based Routing

CS 344/444 Computer Network Fundamentals Midterm Exam Spring /07/2007

CSCI Topics: Internet Programming Fall 2008

Routing in the Internet

Module 8. Routing. Version 2 ECE, IIT Kharagpur

CSC458 Lecture 6. Administrivia. Inter-domain Routing IP Addressing. Midterm will Cover Following Topics (2) Midterm will Cover Following Topics

Routing. Directly Connected IP Networks. Data link layer routing. ifconfig command

Lecture 13: Link-state Routing. CSE 123: Computer Networks Alex C. Snoeren

Computer Networking Introduction

12 WEEK EXAM NAME: ALPHA: SECTION:

Midterm Exam II CMPSCI 453: Computer Networks Fall 2010 Prof. Jim Kurose

ARP Inspection and the MAC Address Table for Transparent Firewall Mode

MID II Tuesday, 1 st April 2008

Computer Networks II IPv4 routing

Chapter Motivation For Internetworking

Routing Protocols. Autonomous System (AS)

Youki Kadobayashi NAIST

Top-Down Network Design

COMPUTER NETWORK. Homework #3. Due Date: May 22, 2017 in class

n Describe sniffing concepts, including active and passive sniffing n Describe sniffing countermeasures n Describe signature analysis within Snort

Routing Algorithms. Daniel Zappala. CS 460 Computer Networking Brigham Young University

CSE 123: Computer Networks

Routing Algorithms. CS158a Chris Pollett Apr 4, 2007.

MID-TERM EXAM TCP/IP NETWORKING Duration: 2 hours With Solutions

Exam : Cisco Title : Update : Demo. Cisco Certified Network Associate

Routing. Directly Connected IP Networks. Data link layer routing. ifconfig command

Transcription:

Homework 3 Discussion

Address Resolution Protocol (ARP)

Data Link Layer Network Layer

Data Link Layer Network Layer Protocol Data Unit(PDU) Frames Packets Typical Device Switch/Bridge Router Range Local Area Network(LAN) Internet Identification Hardware Address (MAC) IP Address

Address Resolution Protocol (ARP) In the end, frame is the protocol data unit that get transmitted on the wire. Physical interfaces cannot understand IP addresses. Each host and router needs a link layer address (MAC address) to identify itself in Local Area Network (subnet), and also a network layer address (IP address to) identify its position in the internet. ARP provides a mechanism to translate IP addresses into hardware (MAC) addresses

A host sends an IP packet within its Local Area Network Source MAC Destination MAC Source IP Destination IP 01:02:03:04:05? 10.0.0.1 10.0.0.3 1. Is the destination IP in my subnet? - Yes 2. Send an ARP request to get the MAC of H3 H1 ARP request: Who has IP 10.0.0.3? Switch H2 IP: 10.0.0.2 21:22:23:24:25:26 IP: 10.0.0.1 01:02:03:04:05:06 H3 IP: 10.0.0.3 31:32:33:34:35:36

A host sends an IP packet to a host its Local Area Network Source MAC Destination MAC Source IP Destination IP 01:02:03:04:05 31:32:33:34:35:36 10.0.0.1 10.0.0.3 1. Is the destination IP in my subnet? - Yes 2. Send an ARP request to get the MAC of H3 H2 H1 IP: 10.0.0.1 01:02:03:04:05:06 Switch ARP reply: My IP is 10.0.0.3, and my MAC is 31:32:33:34:35:36 IP: 10.0.0.2 21:22:23:24:25:26 H3 IP: 10.0.0.3 31:32:33:34:35:36

A host sends an IP packet to a host in other network Source MAC Destination MAC Source IP Destination IP 01:02:03:04:05? 10.0.0.10 30.0.0.30 1. Is destination IP in my subnet? - No 2. Send this IP packet to my default gateway router 3. Send an ARP request to get the MAC of default gateway router H1 IP: 10.0.0.10 01:02:03:04:05:06 ARP request: What is the MAC of my gateway router 10.0.0.1? IP: 10.0.0.1 11:11:11:11:11:01 Router IP: 20.0.0.1 11:11:11:11:11:02 IP: 30.0.0.1 11:11:11:11:11:03 H2 IP: 20.0.0.20 21:22:23:24:25:26 IP: 30.0.0.30 31:32:33:34:35:36 H3

A host sends an IP packet to a host in other network Source MAC Destination MAC Source IP Destination IP 01:02:03:04:05 11:11:11:11:11:01 10.0.0.10 30.0.0.30 1. Is destination IP in my subnet? - No 2. Send this IP packet to my default gateway router 3. Send an ARP request to get the MAC of default gateway router H1 ARP reply: My IP is 10.0.0.1, and my MAC is 11:11:11:11:11:01 Router IP: 20.0.0.1 11:11:11:11:11:02 H2 IP: 20.0.0.20 21:22:23:24:25:26 IP: 10.0.0.10 01:02:03:04:05:06 IP: 10.0.0.1 11:11:11:11:11:01 IP: 30.0.0.1 11:11:11:11:11:03 IP: 30.0.0.30 31:32:33:34:35:36 H3

When router receives a Frame Source MAC Destination MAC Source IP Destination IP 01:02:03:04:05 11:11:11:11:11:01 10.0.0.10 30.0.0.30 1. By searching the destination IP in its forwarding table, router knows that the next hop is in its southbound interface. 2. Router has to rewrite the Ethernet header to get the frame transmitted in a new subnet. 3. Router sends an ARP request for the MAC of IP 30.0.0.30 H1 IP: 10.0.0.10 01:02:03:04:05:06 IP: 10.0.0.1 11:11:11:11:11:01 Router IP: 20.0.0.1 11:11:11:11:11:02 IP: 30.0.0.1 11:11:11:11:11:03 H2 IP: 20.0.0.20 21:22:23:24:25:26 IP: 30.0.0.30 31:32:33:34:35:36 H3

When router receives a Frame Source MAC Destination MAC Source IP Destination IP 01:02:03:04:05 11:11:11:11:11:01 10.0.0.10 30.0.0.30 H1 Router IP: 20.0.0.1 11:11:11:11:11:02 H2 IP: 20.0.0.20 21:22:23:24:25:26 IP: 10.0.0.10 01:02:03:04:05:06 IP: 10.0.0.1 11:11:11:11:11:01 IP: 30.0.0.1 11:11:11:11:11:03 ARP request: What is the MAC of 30.0.0.30? IP: 30.0.0.30 31:32:33:34:35:36 H3

When router receives a Frame Source MAC Destination MAC Source IP Destination IP 01:02:03:04:05 11:11:11:11:11:01 10.0.0.10 30.0.0.30 Source MAC Destination MAC Source IP Destination IP 11:11:11:11:11:03 31:32:33:34:35:36 10.0.0.10 30.0.0.30 H1 IP: 10.0.0.10 01:02:03:04:05:06 IP: 10.0.0.1 11:11:11:11:11:01 Router IP: 20.0.0.1 11:11:11:11:11:02 IP: 30.0.0.1 11:11:11:11:11:03 ARP reply: I have IP 30.0.0.30, and my MAC is 31:32:33:34:35:36 H2 IP: 20.0.0.20 21:22:23:24:25:26 IP: 30.0.0.30 31:32:33:34:35:36 H3

ARP Cache (1)A table that maps IP addresses into physical (MAC) addresses (2) Dynamically updated when a host/router receives an ARP request or reply.

Common AS relationships and Policies Provider-Customer: 1. Provider advertises all the routes he knows to the customer 2. Provider advertises all the routes learned from the customer to everyone else Customer-Provider: 1. Customer advertises his own prefixes to the provider 2. Customer advertises all the routes learned from his customer to the provider 3. Customer advertises all the routes learned from the provider to his customer 4. Customer should not advertise any route learned from one provider to another provider Peer (Provider-Provider): 1. Provider advertises all the routes learned from his customer to the peer 2. Provider advertises all the routes learned from the peer to his customer 3. Provider should not advertise any route learned from the peer to other provider.

Customer 1 Customer 2 Customer 3 Provider 1 Provider 2 Customer should not advertise any route learned from one provider to another provider

Provider 1 Provider 2 Provider 3 Customer 1 Customer 2 Customer 3 Provider should not advertise any route learned from the peer to other provider

Distance-vector Routing Assumption: Each router knows the cost to reach each of its directly connected neighbors. Basic idea: Each router tells its neighbors what it knows about everyone Each router only knows the costs to every other router, but does not know the entire network topology Please look through lecture 14 for more details

Counting to Infinity Problem R1 4 3 R2 R3 Node Distance R1 0 R2 4 R3 7 Node Distance R1 4 R2 0 R3 3 Node Distance R1 7 R2 3 R3 0

Counting to Infinity Problem R1 R2: 4 R3: 7 4 3 R2 R3 Node Distance R1 0 R2 4 R3 7 Node Distance R1 4 R2 0 R3 3 \ 11 Node Distance R1 7 R2 3 R3 0 \ Inf \ Inf

Counting to Infinity Problem R1 4 3 R1: 4 R3: 11 R2 R3 Node Distance R1 0 R2 4 R3 7 \ 15 Node Distance R1 4 R2 0 R3 3 \ 11 Node Distance R1 7 R2 3 R3 0 \ Inf \ Inf

Link-state Routing Assumption: Each router knows the cost to reach each of its directly connected neighbors. Basic idea: Each router tells everyone what it knows about its neighbor Each router knows the costs to every other router, and the entire network topology Please look through lecture 13 for more details

Link-state Routing How does router know the entire network topology? 1. A router sends out its own routing message that is guaranteed to be received by all routers. 2. A router can construct the network graph by learning received the routing messages from all routers. 3. Apply Dijkstra's algorithm to find the shortest path to each router

When router R1 receives the following message Sender ID: R2 Links: [R1: 2] [R3: 3] [R4: 4] Sender ID: R3 Links: [R2: 3] [R4: 5] Sender ID: R4 Links: [R1: 1] [R2: 4] [R3: 5] 2 R2 3 R1 4 R3 1 R4 5