Internet Protocols. ICMP ICMP – Internet Control Message Protocol Each ICMP message is encapsulated in an IP packet – Treated like any other datagram,

Slides:



Advertisements
Similar presentations
Network Layer4-1 Hierarchical Routing scale: with 200 million destinations: r can’t store all dest’s in routing tables! r routing table exchange would.
Advertisements

Lecture 9 Overview. Hierarchical Routing scale – with 200 million destinations – can’t store all dests in routing tables! – routing table exchange would.
Path Vector Routing NETE0514 Presented by Dr.Apichan Kanjanavapastit.
Data Communications and Computer Networks Chapter 4 CS 3830 Lecture 22 Omar Meqdadi Department of Computer Science and Software Engineering University.
Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What’s inside a router 4.4 IP: Internet Protocol –Datagram format.
4a-1 CSE401: Computer Networks Hierarchical Routing & Routing in Internet S. M. Hasibul Haque Lecturer Dept. of CSE, BUET.
Network Layer4-1 Chapter 4 roadmap 4.1 Introduction and Network Service Models 4.2 Routing Principles 4.3 Hierarchical Routing 4.4 The Internet (IP) Protocol.
Announcement r Project 3 out, due 3/10 r Homework 3 out last week m Due next Mon. 3/1.
Routing - II Important concepts: Hierarchical Routing, Intra-domain routing, inter- domain routing, RIP, OSPF, BGP, Router Architecture.
Spring Routing & Switching Umar Kalim Dept. of Communication Systems Engineering 04/05/2007.
14 – Inter/Intra-AS Routing
Announcement r Project 2 Extension ? m Previous grade allocation: Projects 40% –Web client/server7% –TCP stack21% –IP routing12% Midterm 20% Final 20%
Routing in Wired Nets CS 215 W 01 - Mario Gerla. Routing Principles Routing: delivering a packet to its destination on the best possible path Routing.
Routing Algorithms & Routing Protocols  Shortest Path Routing  Flooding  Distance Vector Routing  Link State Routing  Hierarchical Routing  Broadcast.
1 ECE453 – Introduction to Computer Networks Lecture 10 – Network Layer (Routing II)
The Routing & the IP network data link physical network data link physical network data link physical network data link physical network data link physical.
14 – Inter/Intra-AS Routing Network Layer Hierarchical Routing scale: with > 200 million destinations: can’t store all dest’s in routing tables!
Network Layer Lecture # 2 MAHS. 4: Network Layer 4b-2 Hierarchical Routing scale: with 200 million destinations: r can’t store all dest’s in routing tables!
Lecture 14 ICMP: Internet Control Message Protocol r used by hosts, routers, gateways to communication network-level information m error reporting: unreachable.
I-4 routing scalability Taekyoung Kwon Some slides are from Geoff Huston, Michalis Faloutsos, Paul Barford, Jim Kurose, Paul Francis, and Jennifer Rexford.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Network Layer 1 Goals:  Understand Internet network layer concepts  Understand Internet routing  Understand Internet network layer protocols Content:
Objectives: Chapter 5: Network/Internet Layer  How Networks are connected Network/Internet Layer Routed Protocols Routing Protocols Autonomous Systems.
Network Layer (4). Classless Addressing Addresses allocated in contiguous blocks – Number of addresses assigned always power of 2 Network portion of address.
4: Network Layer4a-1 Hierarchical Routing r aggregate routers into regions, “autonomous systems” (AS) r routers in same AS run same routing protocol m.
RSC Part II: Network Layer 6. Routing in the Internet (2 nd Part) Redes y Servicios de Comunicaciones Universidad Carlos III de Madrid These slides are,
Introduction 1 Lecture 19 Network Layer (Routing Protocols) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer Science &
CS 3830 Day 29 Introduction 1-1. Announcements r Quiz 4 this Friday r Signup to demo prog4 (all group members must be present) r Written homework on chapter.
10-1 Last time □ Transitioning to IPv6 ♦ Tunneling ♦ Gateways □ Routing ♦ Graph abstraction ♦ Link-state routing Dijkstra's Algorithm ♦ Distance-vector.
Network Layer4-1 Chapter 4 roadmap 4.1 Introduction and Network Service Models 4.2 Routing Principles 4.3 Hierarchical Routing 4.4 The Internet (IP) Protocol.
Network Layer4-1 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside a router r 4.4 IP: Internet.
Routing in the Internet The Global Internet consists of Autonomous Systems (AS) interconnected with eachother: Stub AS: small corporation Multihomed AS:
Network Layer r Introduction r Datagram networks r IP: Internet Protocol m Datagram format m IPv4 addressing m ICMP r What’s inside a router r Routing.
4: Network Layer4a-1 Routing in the Internet r The Global Internet consists of Autonomous Systems (AS) interconnected with each other: m Stub AS: small.
Network Layer4-1 Intra-AS Routing r Also known as Interior Gateway Protocols (IGP) r Most common Intra-AS routing protocols: m RIP: Routing Information.
Network Layer4-1 The Internet Network layer forwarding table Host, router network layer functions: Routing protocols path selection RIP, OSPF, BGP IP protocol.
TCOM 509 – Internet Protocols (TCP/IP) Lecture 06_a Routing Protocols: RIP, OSPF, BGP Instructor: Dr. Li-Chuan Chen Date: 10/06/2003 Based in part upon.
ICT 6621 : Advanced NetworkingKhaled Mahbub, IICT, BUET, 2008 Lecture 5 TCP/IP Network Layer (3)
4: Network Layer4b-1 OSPF (Open Shortest Path First) r “open”: publicly available r Uses Link State algorithm m LS packet dissemination m Topology map.
Routing in the Inernet Outcomes: –What are routing protocols used for Intra-ASs Routing in the Internet? –The Working Principle of RIP and OSPF –What is.
Transport Layer3-1 Network Layer Every man dies. Not every man really lives.
Network Layer4-1 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside a router r 4.4 IP: Internet.
IP. Classless Inter-Domain Routing Classful addressing scheme wasteful – IP address space exhaustion – A class B net allocated enough for 65K hosts Even.
The Internet Network layer
Network Layer4-1 Chapter 4: Network Layer r 4. 1 Introduction r 4.2 Virtual circuit and datagram networks r 4.3 What’s inside a router r 4.4 IP: Internet.
TCP/IP (Routing). Content DHCP And Mobile IP Internet Routing Protocol RIP (Routing Information Protocol) OSPF (Open Shortest Path First) BGP (Border.
Border Gateway Protocol. Intra-AS v.s. Inter-AS Intra-AS Inter-AS.
Routing Protocols 1 ProtocolsLayer name DNSApplication TCP, UDPTransport IPInternet (Network ) WiFi, Ethernet Link (Physical)
1 Internet Routing 11/11/2009. Admin. r Assignment 3 2.
1 Computer Networks Chapter 5. Network layer The network layer is concerned with getting packets from the source all the way to the destination. Getting.
Routing in the Internet
14 – Inter/Intra-AS Routing
Homework 4 Out: Fri 2/24/2017 In: Fri 3/10/2017.
Chapter 4: Network Layer
NAT – Network Address Translation
Scaling the Network Chapters 3-4 Part 2
Homework 4 Out: Fri 2/26/2016 In: Fri 3/11/2016.
ICMP ICMP – Internet Control Message Protocol
Chapter 4: Network Layer
Chapter 5: Network Layer (Part III)
CS4470 Computer Networking Protocols
Routing.
Department of Computer and IT Engineering University of Kurdistan
Chapter 4: Network Layer
Chapter 4: Network Layer
Chapter 4: Network Layer
Chapter 4: Network Layer
Routing.
Network Layer: Internet Inter-Domain Routing
Chapter 5: Link Layer 5.1 Introduction and services
Presentation transcript:

Internet Protocols

ICMP ICMP – Internet Control Message Protocol Each ICMP message is encapsulated in an IP packet – Treated like any other datagram, but no error message sent if ICMP message causes error Some interesting messages: – Time exceeded: When an IP packet arrived at a router is dropped because the TTL field becomes 0, the router will send an ICMP TIME EXCEEDED message back to the source. Used in traceroute. – Echo and Echo reply: ping.

Computer Science, FSU3 Address Resolution IP address is virtual – Not understood by underlying the hardware of physical networks IP packets need to be transmitted by the underlying physical network Address resolution – Translating IP address to physical address – Address Resolution Protocol (ARP)

Computer Science, FSU4 ARP Example

Computer Science, FSU5 ARP Cache Each computer maintains a cache table – IP address  hardware address mapping – Only about computers on the same network Exchanges ARP messages – To resolve IP addresses with unknown hardware addresses

Computer Science, FSU6 ARP Protocol When a node sends an IP packet to another node on the same physical network – Look up destination address in the ARP table – If not found Broadcast a request to the local network Whose IP address is this?

Computer Science, FSU7 ARP Response The target node responds to sender (unicast?) – With its physical address – Adds the requester into its ARP table (why?) On receiving the response – Requester updates its table Other nodes upon receiving the request – Refresh the requester entry if already there – No action otherwise (why?) Table entries deleted if not refreshed for a while

DHCP DHCP – Dynamic Host Configuration Protocol A new machine asks for an IP address – Broadcast DHCP DISCOVER packet – A DHCP relay agent got this packet and relay it to the DHCP server – The DHCP server assigns an IP address – Periodically renew

TRY tcpdump -ennqti eth0 \( arp or icmp \)

Hierarchical Routing aggregate routers into regions, “autonomous systems” (AS) routers in same AS run same routing protocol – “intra-AS” routing protocol – routers in different AS can run different intra-AS routing protocol special routers in AS run intra-AS routing protocol with all other routers in AS also responsible for routing to destinations outside AS – run inter-AS routing protocol with other gateway routers gateway routers

Intra-AS and Inter-AS routing Gateways: perform inter-AS routing amongst themselves perform intra-AS routing with other routers in their AS inter-AS, intra-AS routing in gateway A.c network layer link layer a b b a a C A B d A.a A.c C.b B.a c b c

Inter-AS routing between A and B Intra-AS and Inter-AS routing Host h2 a b b a a C A B d c A.a A.c C.b B.a c b Host h1 Intra-AS routing within AS A Intra-AS routing within AS B

Why different Intra- and Inter-AS routing ? Policy: Inter-AS: admin wants control over how its traffic routed, who routes through its net. Intra-AS: single admin, so no policy decisions needed Scale: hierarchical routing saves table size, reduced update traffic Performance: Intra-AS: can focus on performance Inter-AS: policy may dominate over performance

Intra-AS Routing Also known as Interior Gateway Protocols (IGP) Most common IGPs: – RIP: Routing Information Protocol – OSPF: Open Shortest Path First – IGRP: Interior Gateway Routing Protocol (Cisco proprietary)

OSPF Represents the network as a graph, and runs the shortest path algorithm to find the path to any router. Divide the network into areas for scalability. – The backbone area is called area 0 – Route: local area  backbone  local area

OSPF Each area computes shortest paths. Backbone routers also accept information from area border routers to compute the shortest path to reach other routers. Then advertise this information to the border routers, who tells routers inside the area – To be able to select the best exit router in an area

Inter-AS routing

BGP From BGP point of view, three types of networks – Stub network (only one connection to the network) – Multiconnected network (multiple connection, but refuse to transmit traffic) – Transit network (backbone)

Internet Inter-AS routing: BGP BGP (Border Gateway Protocol): the de facto standard Path Vector protocol: – similar to Distance Vector protocol – each Border Gateway broadcast to neighbors (peers) entire path (i.e, sequence of ASs) to destination – E.g., Gateway X may send its path to dest. Z: Path (X,Z) = X,Y1,Y2,Y3,…,Z

Internet Inter-AS routing: BGP BGP messages exchanged using TCP. BGP messages: – OPEN: opens TCP connection to peer and authenticates sender – UPDATE: advertises new path (or withdraws old) – KEEPALIVE keeps connection alive in absence of UPDATES; also ACKs OPEN request – NOTIFICATION: reports errors in previous msg; also used to close connection

Internet Inter-AS routing: BGP Suppose gateway X send its path to peer gateway W W may or may not select path offered by X – cost, policy (don’t route via competitors AS), loop prevention reasons. If W selects path advertised by X, then: Path (W,Z) = W, Path (X,Z) Note: X can control incoming traffic by controlling its route advertisements to peers: – e.g., don’t want to route traffic to Z  don’t advertise any routes to Z

BGP: an example NLRI= /16 ASPATH=[0] /16 NLRI= /16 ASPATH=[10] NLRI= /16 ASPATH=[10] NLRI= /16 ASPATH=[210] NLRI= /16 ASPATH=[610] NLRI= /16 ASPATH=[610] NLRI= /16 ASPATH=[210] NLRI= /16 ASPATH=[7610] NLRI= /16 ASPATH=[4210] NLRI= /16 ASPATH=[3210] [3210]* [4210] [7610]