ECE 428 Internet Protocols (Network Layer: Layer 3)

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "ECE 428 Internet Protocols (Network Layer: Layer 3)"

Transcription

1 ECE 428 Internet Protocols (Network Layer: Layer 3) 1

2 Done so far MAC protocols (with PHYsical layer) Transport bits from one node to another. Key element: Determine WHEN to transmit DLC protocol (running on top of MAC) Establish a reliable link between two nodes Flow control (determined by the receiver) Error control (retransmission) Fragmentation/reassembly Summary: DLC/MAC support 1-hop comm. 2

3 Links: OC-192 (10 Gbps) The Canadian Network 3

4 ORION (Ontario Research and Innovation Optical Network) ORION Office 34 King Street East, Suite 800, 8th Floor Toronto, Ontario, M5C 2X8 4

5 COGENT Network 5

6 Network Connection to UW 6

7 UW Network 7

8 The Internet at a glance Border/edge router AS AS 8

9 The Internet Cloud Routers + DHCP & DNS servers 9

10 Multi-hop communication Host1 R R R R R R R Host2 Computer A Computer B Application + Others Router Application + Others Transport Transport Network (IP) Network (IP) Network (IP) DLC1 DLC1 DLC2 DLC2 MAC1/PHY1 MAC1/PHY1 MAC2/PHY2 MAC2/PHY2 Medium 1 Medium2 10

11 Key question in multi-hop comm. Packet forwarding through a set of routers? How hosts and routers discover each other? How packets are routed to their destinations? 11

12 Routing protocols What is routing? Routers exchange information about the networks and hosts to which they are connected. Allow routers to build routing tables (RT). An incoming packet to a router is put on an outgoing link based on RT information. Hop-by-hop routing Each router makes an individual, one-hop forwarding decision. 12

13 What is Routing? OSPF RIP UDP BGP TCP ICMP Network layer Routing Table IP DLC1 DLC2 DLC3 DLC4 MAC1 MAC2 MAC3 MAC OSPF: Open Shortest Path First BGP: Border Gateway Protocol RIP: Routing Information Protocol TCP: Transmission Control Protocol UDP: User Datagram Protocol ICMP: Internet Control Message Protocol 13

14 IP Packet Format: Header + Payload 4 bits 8 bits 8 bits 3 bits 13 bits 16 bits 16 bits Bit 0 V=4 IHL SERVICE TYPE TOTAL LENGTH 31 H IDENTIFICATION F FRAGMENT OFFSET e TIME TO LIVE PROTOCOL HEADER CHECKSUM a d SOURCE ADDRESS e DESTINATION ADDRESS r IP OPTIONS IP PAYLOAD V = Version, IHL = Internet Header Length, F = Flags 14

15 IP Address Length: 32 bits in IPv4 (128 bits in IPv6) <= Unique How many addresses for a node Host: one (common) Router: Many (1 for each link connected to the router) Notation Dotted decimal notation Each of the four bytes is respectively written as a decimal integer separated by periods. Ex.: ( C 2B) Hex =>

16 IP Address IP address: 2 logical components of variable length Network prefix (leftmost p = 32 h bits Identical for all hosts connected to the same link Host ID (rightmost h bits) Unique for hosts connected to the same link p = 32-h bits h bits Network-prefix Host 16

17 IP Address Notation for IP address and prefix length Address/prefix-length ( /24) Usefulness of network prefix Packet forwarding is done using network prefix Routing tables keep an entry for each network prefix -- and not for each host computer Smaller RT size 17

18 Other header fields Version: 4 for IPV4 IHL (Internet Header Length) Gives IP header length in units of 4-bytes Without the options field (IHL = 5) Service type How the packet is to be handled by the routers Lowest delay, highest reliability, Largely ignored by router manufacturers Total length Length of the entire IP packet including the header in bytes 18

19 Other header fields Flags, Fragment Offset, ID Used to chop up large IP packets into small chunks If the network can t handle large IP packets. ID A unique value chosen by the sender to allow a recipient to reassemble a packet that had to be chopped up All fragments from the same IP packet have the same ID Offset Position of the fragment in the IP packet Flag: 3 bits <Don t fragment, More fragment to follow, Not used> 19

20 Other header fields Time To Live (TTL): in # of hops Each time a packet is forwarded: TTL = TTL 1 Idea: Drop a packet if it goes into a routing loop. Protocol: Receiving protocol ID 1: ICMP 6: TCP Header Checksum: To protect Tx error in header IP Options Route Record can be gathered 20

21 How does IP routing work? A router forwards packets based on Fields within the IP header Entries in its routing table (RT) Classification of packets Packets for which the node is the ultimate destination Give the packet to the upper layer entity identified by Protocol field. Packets for which ANOTHER node is the ultimate destination Forward the packet to another router 21

22 Structure of a Routing Table Target/Prefixlength Next Hop Interface /32 Router 1 x /24 Router 2 y Host-specific route Network-prefix route /32 directly z /0 Router 3 w Default route 22

23 How does IP routing work? When a node receives an IP packet to forward, Search the RT for an entry whose Target Address/Prefix Length fields MATCH the IP Destination Address in the packet. If a matching entry is found, forward the packet to the node identified by the Next Hop field via the specified Interface. Address matching Given: an IP address and a Target Address/Prefix length Matching occurs if the leftmost Prefix-length bits of Target Address are equal to those same bits in the packet s IP address. If more than one matching is found Select the route with the largest Prefix-length. 23

24 How does IP routing work? The Next Hop fields in an RT For a Target that is NOT connected to one of the node s directly attached links, the NH field contains the IP. address of a router that can be used to reach that Target. Otherwise, the NH field contains a special value ( directly ) indicating that the Target is connected to one of the node s directly attached links. 24

25 How does IP routing work? Three categories of RT entries Host-specific route: Denoted by Prefix-length of 32 Provides matching for exactly one IP address. Network-prefix route: Denoted by Prefix-length of 1 31 Default route: Prefix-length = 0 Provides matching for all IP addresses. Used when the first alternatives are absent. 25

26 How does IP routing work? Summary of matching If a host-specific route is available, use it. If no host-specific route is available, but there is a network-prefix route, use the network-prefix route. If neither a host-specific nor a network-prefix route is available, choose a default router, if one exists Finally, if a packet can not be forwarded, send an ICMP Unreachable message to the source of the packet. 26

27 Three ways Statically Creating Routing Tables Network-prefix routes to all hosts connected to an attached link. Default route for the rest of the destinations Routers can still update their tables using the following approaches. Dynamically By running routing protocols (OSPF, RIP, BGP) Dynamically When ICMP Redirect messages are received 27

28 Creating Routing Tables ICMP Redirect Message Two nodes are neighbors if they are on the same link. If a router finds that a neighboring host is using a non-optimal Next Hop to reach a certain destination. The router can inform the host by sending an ICMP Redirect message The Redirect message contains the IP address of the desired router. All the three entities must be on the same link. 28

29 Autonomous System (AS) Transit AS Multi-homed AS Border/edge router AS Stub AS AS 29

30 Autonomous System Each AS has a 16-bit unique ID: Max #65,000 By 2004: 10,000 AS AS Number used in Inter-AS routing (BGP) Get an ASN from ARIN (American Registry for Internet Numbers) in NA RIPE (Reseaux IP Europeens ) in Europe APNIC (Asia Pacific Network Info. Center) in Asia 30

31 Protocols for Constructing RT Intra-Domain (within an AS) RIP (Routing Information Protocol) OSPF (Open Shortest Path First) Inter-Domain (Among AS) BGP (Border Gateway Protocol) 31

32 RIP Uses the distance-vector (DV) algorithm Metric for computation of shortest path Hop Count Max# of hops is limited to 15 (scope of RIP is an AS) 32

33 A router RIP Update message Sends an Update msg to each neighbor/30sec. Does not receive an Update for 180sec link down Contains 25 entries of the form <Destination, Cost>. Destination: Network Address (IP/Prefix-length) Behavior: Let X receive entry <Z, C1> from Y Meaning: Y can reach network Z with a cost C1 Let X has an entry in its RT: <Z, NH, C2> If C2 <= C1 + 1: No action is taken (X s RT has the best path.) If C2 > C1 + 1: Replace <Z, NH, C2> with <Z, Y s IP, C1+1> If X has no entry <Z, NH, C2>, create one: <Z, Y s IP, C1+1> 33

34 RIP: Description A B C 34

35 RIP Steady state: Shortest paths established. Routers learns from neighbors only local knowledge Local knowledge => routing loop A A B B C C 35

36 Disadvantages RIP Routing loop Long convergence time Bad news (link failure) propagates slowly. Advantages Routers know this in an indirect manner. Simple Low message overhead 36

37 OSPF (Link-State Protocol) Types of Link Point-to-Point: two routers directly connected Type 1 (Router link) Transient: Two routers connected to a LAN. Type 2 (Network link) Stub: a router connected to a LAN Type 3 (Summary link to network) Link State: <Type, Cost> Cost: Delay, hop count,. (define your metric..) A router knows the states of all its links: measure cost All routers exchange their knowledge All know the entire topology central idea in OSPF 37

38 OSPF (Link-State Protocol) Creation of states of the links by each router In the form of Link State Packets (LSP) Dissemination of LSPs to every other router (flood) In an efficient and reliable manner Formation of a shortest path tree for each node Use Dijkstra s Algorithm Calculation of a RT based on shortest paths 38

39 OSPF (Link-State Protocol) Creation of Link State Packets LSP: <Sender s ID, List of links(link, Cost), Seq#, Age> First two: for topology creation Third: Facilitates flooding, distinguishes new LSPs from old. Fourth: Prevents LSPs from remaining for a long time. LSPs are generated in two ways: When there is a change in the topology of the domain. On a periodic basis: 1-2 hours. 39

40 OSPF (Link-State Protocol) Flooding of LSPs: 1-to-all The creating node sends a copy of LSP to all neighbors. A node that receives an LSP If the LSP is an old one (check seq #) => drop it. If the LSP is a new one Replace the old one with the new one Send a copy to all neighbors except one from which it was received» Better: wait; send it to those who did not give you a copy. 40

41 OSPF (Link-State Protocol) Formation of shortest paths (Dijkstra s Alg.) Input: A weighted graph and a source node S Output: All shortest paths from S to all other nodes Process Labeling each node X with <cost, Y, status> Cost: Sum of all edge-weights from S to X Y: Node immediately preceding X on shortest path from S to X Status: T (tentative) or P (permanent) Idea Uses the idea of a working node. Nodes are marked P as computation progresses. Stop: When all are marked P. 41

42 OSPF (Link-State Protocol) Process (contd.) (S1) Initially: Node S: <0, --, T>; Others: <, --, T> (S2) If all nodes have been marked as P, go to S4 Else{Select a node with smallest cost in its <cost,?, T> Mark the selected node as P; call it working node(w) Go to S3.} (S3) For each T labeled neighbor Z of W, do fol. and go to S2. Let the label of W be <Wc, Wp, P> and of Z be <Zc, Zp, T> Let the cost of W Z link be C If (Wc + C < Zc), replace <Zc, Zp, T> with <Wc+C, W, T> (S4) For each node V in the graph, let <Vc, Vp, P> be its label. Vc: Cost of going from S to V on a shortest path Vp: The node immediately preceding V on the shortest path from S to V. 42

43 OSPF: Dijkstra s Algorithm B C 3 3 A E 2 F D G 4 H 43

44 Border Gateway Protocol 44

45 Main ideas BGP Allow two ASs to exchange routing information so that IP packets can flow across AS border. Enforce policies, rather than go for shortest paths. All BGP routers on an AS have identical routing info. Supported by all-to-all persistent TCP connections 45

46 Example Routing AS7 AS4 AS6 AS5 AS2 BGP router TCP connection AS3 AS1 N1, N2 46

47 Autonomous System (AS) Transit AS R2 R1 Multi-homed AS R4 R3 R5 R6 Stub AS Border/edge router AS4 AS3 N1 47

48 Example BGP R4 in AS3 knows that it can reach N1. R4 informs R3 in AS2 that it can reach N1. R2 knows whatever R3 knows. => R2 knows that it can reach N1 via R3. Now R2 informs R1 by sending a message as follows. The sequence of AS {AS2, AS3} to reach N1 The next hop router address (of R3) A list of metrics indicating the degree of preferences for the route 48

49 BGP Routing A BGP router advertises a route to a destination only if it is actively using the route. BGP routers exchange reachability information containing a path vector (AS path) a seq. of AS Path vector information is used to prevent loops When a router receives a path vector, it ensures that its AS number does not appear in the path vector. A path is discarded if its AS number appears on the received path. 49

50 Policy BGP Policy The attribute (AS path) info. allows policies to be enforced. Example Never use AS X Never use AS X to get to destination Y» Ex.: Never route IP packets originating and terminating at US hosts via Canada Never use AS X and AS Y on the same path. 50

51 Import policy BGP Routing: Enforce Policy Influence the selection of paths to destinations. Apply import policy to accept, deny or set preferences on the route advertisement received from neighbors. An ISP may reject a path if it includes an untrustworthy AS. Export policy Control the distribution of routing information. Apply export policy to determine which routes should be advertised. An ISP may have agreements to carry transit traffic from certain ISPs and not from all. 51

52 BGP Protocol at a Glance Initially, BGP peers exchange the entire BGP RT. Subsequently, only incremental updates are sent. An update contains an NLRI (Net. Layer Routing Info) field An AS path A list of IP/PL that can be reached by the above AS path The NH: Sender s IP corresponding to the end-point The receiving router of an update message puts its AS number at the beginning of the received AS path before forwarding the message. (The NH is different for each msg ) Each router constructs an AS-path graph. A BGP router routes packets using its own policies and connectivity information, such as cost. BGP peers exchange keepalive messages every 30s. 52

Topics for This Week

Topics for This Week Topics for This Week Routing Protocols in the Internet OSPF, BGP More on IP Fragmentation and Reassembly ICMP Readings Sections 5.6.4-5.6.5 1 Hierarchical Routing aggregate routers into regions, autonomous

More information

Initial motivation: 32-bit address space soon to be completely allocated. Additional motivation:

Initial motivation: 32-bit address space soon to be completely allocated. Additional motivation: IPv6 Initial motivation: 32-bit address space soon to be completely allocated. Additional motivation: header format helps speed processing/forwarding header changes to facilitate QoS IPv6 datagram format:

More information

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

Inter-networking. Problem. 3&4-Internetworking.key - September 20, LAN s are great but. We want to connect them together. ... 1 Inter-networking COS 460 & 540 2 Problem 3 LAN s are great but We want to connect them together...across the world Inter-networking 4 Internet Protocol (IP) Routing The Internet Multicast* Multi-protocol

More information

Inter-AS routing. Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley

Inter-AS routing. Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley Inter-AS routing Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley Some materials copyright 1996-2012 J.F Kurose and K.W. Ross, All Rights Reserved Chapter 4:

More information

Lecture 5 The Network Layer part II. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it

Lecture 5 The Network Layer part II. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it Lecture 5 The Network Layer part II Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it IP datagram format IP protocol version number header length (bytes) type of data max number remaining

More information

Lecture 4 The Network Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it

Lecture 4 The Network Layer. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it Lecture 4 The Network Layer Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it Network layer functions Transport packet from sending to receiving hosts Network layer protocols in every

More information

ROUTING INTRODUCTION TO IP, IP ROUTING PROTOCOLS AND PROXY ARP

ROUTING INTRODUCTION TO IP, IP ROUTING PROTOCOLS AND PROXY ARP IP ROUTING INTRODUCTION TO IP, IP ROUTING PROTOCOLS AND PROXY ARP Peter R. Egli 1/37 Contents 1. IP Routing 2. Routing Protocols 3. Fragmentation in the IP Layer 4. Proxy ARP 5. Routing and IP forwarding

More information

Internet Routing Protocols, DHCP, and NAT

Internet Routing Protocols, DHCP, and NAT Internet Routing Protocols, DHCP, and NAT Hwajung Lee Modified from Slides Courtesy of Cisco Networking Academy and the book titled Communication Networks by Leon-Garcia Contents Basic Routing Single Area

More information

Chapter 4: outline. Network Layer 4-1

Chapter 4: outline. Network Layer 4-1 Chapter 4: outline 4.1 introduction 4.2 virtual circuit and datagram networks 4.3 what s inside a router 4.4 IP: Internet Protocol datagram format IPv4 addressing ICMP IPv6 4.5 routing algorithms link

More information

HY 335 Φροντιστήριο 8 ο

HY 335 Φροντιστήριο 8 ο HY 335 Φροντιστήριο 8 ο Χειμερινό Εξάμηνο 2009-2010 Παπακωνσταντίνου Άρτεμις artpap@csd.uoc.gr 4/12/2009 Roadmap IP: The Internet Protocol IPv4 Addressing Datagram Format Transporting a datagram from source

More information

Networking: Network layer

Networking: Network layer control Networking: Network layer Comp Sci 3600 Security Outline control 1 2 control 3 4 5 Network layer control Outline control 1 2 control 3 4 5 Network layer purpose: control Role of the network layer

More information

Why dynamic route? (1)

Why dynamic route? (1) Routing Why dynamic route? (1) Static route is ok only when Network is small There is a single connection point to other network No redundant route 2 Why dynamic route? (2) Dynamic Routing Routers update

More information

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

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 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 R1. Let s review some of the terminology used in this textbook. Recall that

More information

Inter-Domain Routing: BGP

Inter-Domain Routing: BGP Inter-Domain Routing: BGP Richard T. B. Ma School of Computing National University of Singapore CS 3103: Compute Networks and Protocols Inter-Domain Routing Internet is a network of networks Hierarchy

More information

Hierarchical Routing. Our routing study thus far - idealization all routers identical network flat not true in practice

Hierarchical Routing. Our routing study thus far - idealization all routers identical network flat not true in practice Hierarchical Routing Our routing study thus far - idealization all routers identical network flat not true in practice scale: with 200 million destinations: can t store all destinations in routing tables!

More information

Hierarchical Routing. Our routing study thus far - idealization all routers identical network flat not true in practice

Hierarchical Routing. Our routing study thus far - idealization all routers identical network flat not true in practice Hierarchical Routing Our routing study thus far - idealization all routers identical network flat not true in practice scale: with 200 million destinations: can t store all destinations in routing tables!

More information

Computer Networking Introduction

Computer Networking Introduction Computer Networking Introduction Halgurd S. Maghdid Software Engineering Department Koya University-Koya, Kurdistan-Iraq Lecture No.15 Chapter 4: outline 4.1 introduction 4.2 virtual circuit and datagram

More information

Routing in the Internet

Routing in the Internet Routing in the Internet Daniel Zappala CS 460 Computer Networking Brigham Young University Scaling Routing for the Internet 2/29 scale 200 million destinations - can t store all destinations or all prefixes

More information

II. Principles of Computer Communications Network and Transport Layer

II. Principles of Computer Communications Network and Transport Layer II. Principles of Computer Communications Network and Transport Layer A. Internet Protocol (IP) IPv4 Header An IP datagram consists of a header part and a text part. The header has a 20-byte fixed part

More information

Chapter 4: Network Layer

Chapter 4: Network Layer 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 IPv4 addressing ICMP IPv6 4.5 Routing algorithms

More information

Chapter 4: Network Layer. Lecture 12 Internet Routing Protocols. Chapter goals: understand principles behind network layer services:

Chapter 4: Network Layer. Lecture 12 Internet Routing Protocols. Chapter goals: understand principles behind network layer services: NET 331 Computer Networks Lecture 12 Internet Routing Protocols Dr. Anis Koubaa Reformatted slides from textbook Computer Networking a top-down appraoch, Fifth Edition by Kurose and Ross, (c) Pearson Education

More information

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

Exercise Sheet 4. Exercise 1 (Routers, Layer-3-Switches, Gateways) Exercise Sheet 4 Exercise 1 (Routers, Layer-3-Switches, Gateways) 1. What is the purpose of Routers in computer networks? (Also explain the difference to Layer-3-Switches.) 2. What is the purpose of Layer-3-Switches

More information

Last time. Transitioning to IPv6. Routing. Tunneling. Gateways. Graph abstraction. Link-state routing. Distance-vector routing. Dijkstra's Algorithm

Last time. Transitioning to IPv6. Routing. Tunneling. Gateways. Graph abstraction. Link-state routing. Distance-vector routing. Dijkstra's Algorithm Last time Transitioning to IPv6 Tunneling Gateways Routing Graph abstraction Link-state routing Dijkstra's Algorithm Distance-vector routing Bellman-Ford Equation 10-1 This time Distance vector link cost

More information

Why dynamic route? (1)

Why dynamic route? (1) Routing Why dynamic route? (1) Static route is ok only when Network is small There is a single connection point to other network No redundant route 2 Why dynamic route? (2) Dynamic Routing Routers update

More information

Why dynamic route? (1)

Why dynamic route? (1) Routing Why dynamic route? (1) Static route is ok only when Network is small There is a single connection point to other network No redundant route 2 Why dynamic route? (2) Dynamic Routing Routers update

More information

Chapter IV: Network Layer

Chapter IV: Network Layer Chapter IV: Network Layer UG3 Computer Communications & Networks (COMN) Myungjin Lee myungjin.lee@ed.ac.uk Slides copyright of Kurose and Ross Hierarchical routing our routing study thus far - idealization

More information

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

Solution of Exercise Sheet 4. Exercise 1 (Routers, Layer-3-Switches, Gateways) Solution of Exercise Sheet 4 Exercise 1 (Routers, Layer-3-Switches, Gateways) 1. What is the purpose of Routers in computer networks? (Also explain the difference to Layer-3-Switches.) They forward packets

More information

CSC 4900 Computer Networks: Routing Protocols

CSC 4900 Computer Networks: Routing Protocols CSC 4900 Computer Networks: Routing Protocols Professor Henry Carter Fall 2017 Last Time Link State (LS) versus Distance Vector (DV) algorithms: What are some of the differences? What is an AS? Why do

More information

Department of Computer and IT Engineering University of Kurdistan. Computer Networks II Border Gateway protocol (BGP) By: Dr. Alireza Abdollahpouri

Department of Computer and IT Engineering University of Kurdistan. Computer Networks II Border Gateway protocol (BGP) By: Dr. Alireza Abdollahpouri Department of Computer and IT Engineering University of Kurdistan Computer Networks II Border Gateway protocol (BGP) By: Dr. Alireza Abdollahpouri Internet structure: network of networks local ISP Tier

More information

Announcements. CS 5565 Network Architecture and Protocols. Project 2B. Project 2B. Project 2B: Under the hood. Routing Algorithms

Announcements. CS 5565 Network Architecture and Protocols. Project 2B. Project 2B. Project 2B: Under the hood. Routing Algorithms Announcements CS 5565 Network Architecture and Protocols Lecture 20 Godmar Back Project 2B due in 2 parts: Apr 29 and May 6 Extra Credit Opportunities: Expand simulator (and your implementation) to introduce

More information

CS4/MSc Computer Networking. Lecture 4 The network layer: Forwarding, Routing, IP and Internet routing protocols

CS4/MSc Computer Networking. Lecture 4 The network layer: Forwarding, Routing, IP and Internet routing protocols CS4/MSc Computer Networking Lecture 4 The network layer: Forwarding, Routing, IP and Internet routing protocols Computer Networking, Copyright University of Edinburgh 2005 Network layer services External

More information

Chapter 4: Network Layer

Chapter 4: Network Layer Mecanismes d Echange d Informations Chapter 4 Network Layer A note on the use of these ppt slides: We re making these slides freely available to all (faculty, students, readers). They re in PowerPoint

More information

DATA COMMUNICATOIN NETWORKING

DATA COMMUNICATOIN NETWORKING DATA COMMUNICATOIN NETWORKING Instructor: Ouldooz Baghban Karimi Course Book & Slides: Computer Networking, A Top-Down Approach By: Kurose, Ross Introduction Course Overview Basics of Computer Networks

More information

CSc 450/550 Computer Networks Internet Routing

CSc 450/550 Computer Networks Internet Routing CSc 450/550 Computer Networks Internet Routing Jianping Pan Summer 2007 7/12/07 CSc 450/550 1 Review Internet Protocol (IP) IP header addressing class-based, classless, hierarchical, NAT routing algorithms

More information

CSCI Topics: Internet Programming Fall 2008

CSCI Topics: Internet Programming Fall 2008 CSCI 491-01 Topics: Internet Programming Fall 2008 Network Layer Derek Leonard Hendrix College November 17, 2008 Original slides copyright 1996-2007 J.F Kurose and K.W. Ross 1 Chapter 4: Roadmap 4.1 Introduction

More information

CS4/MSc Computer Networking. Lectures 6-8 The network layer: Forwarding, Routing, IP and Internet routing protocols

CS4/MSc Computer Networking. Lectures 6-8 The network layer: Forwarding, Routing, IP and Internet routing protocols CS4/MSc Computer Networking Lectures 6-8 The network layer: Forwarding, Routing, IP and Internet routing protocols Computer Networking, Copyright University of Edinburgh 2005 Network layer services External

More information

Outline. Routing. Introduction to Wide Area Routing. Classification of Routing Algorithms. Introduction. Broadcasting and Multicasting

Outline. Routing. Introduction to Wide Area Routing. Classification of Routing Algorithms. Introduction. Broadcasting and Multicasting Outline Routing Fundamentals of Computer Networks Guevara Noubir Introduction Broadcasting and Multicasting Shortest Path Unicast Routing Link Weights and Stability F2003, CSG150 Fundamentals of Computer

More information

IPv4. Christian Grothoff.

IPv4. Christian Grothoff. IPv4 christian@grothoff.org http://grothoff.org/christian/ As the builders say, the larger stones do not lie well without the lesser. Plato 1 The Network Layer Transports datagrams from sending to receiving

More information

Network Layer: Routing

Network Layer: Routing Network Layer: Routing The Problem A B R 1 R 2 R 4 R 3 Goal: for each destination, compute next hop 1 Lecture 9 2 Basic Assumptions Trivial solution: Flooding Dynamic environment: links and routers unreliable:

More information

Lecture 19: Network Layer Routing in the Internet

Lecture 19: Network Layer Routing in the Internet Lecture 19: Network Layer Routing in the Internet COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016, J.F

More information

Computer Networks. Wenzhong Li. Nanjing University

Computer Networks. Wenzhong Li. Nanjing University Computer Networks Wenzhong Li Nanjing University 1 Chapter 4. Internetworking The Internet Protocol IP Address ARP and DHCP ICMP IPv6 Mobile IP Internet Routing IP Multicasting Multiprotocol Label Switching

More information

Routing. Advanced Computer Networks: Routing 1

Routing. Advanced Computer Networks: Routing 1 Routing Advanced Computer Networks: Routing 1 Gateway To internet or wide area network Metropolitan Area Network (MAN) s s Organization Servers Backbone R S R R Departmental Server s R S R s S R s s s

More information

Chapter 2 - Part 1. The TCP/IP Protocol: The Language of the Internet

Chapter 2 - Part 1. The TCP/IP Protocol: The Language of the Internet Chapter 2 - Part 1 The TCP/IP Protocol: The Language of the Internet Protocols A protocol is a language or set of rules that two or more computers use to communicate 2 Protocol Analogy: Phone Call Parties

More information

ICMP, ARP, RARP, IGMP

ICMP, ARP, RARP, IGMP Internet Layer Raw division into three tasks: Data transfer over a global network Route decision at the sub-nodes Control of the network or transmission status Routing Protocols Transfer Protocols: IPv4,

More information

CS555, Spring /5/2005. April 12, 2005 No classes attend Senior Design Projects conference. Chapter 4 roadmap. Internet AS Hierarchy

CS555, Spring /5/2005. April 12, 2005 No classes attend Senior Design Projects conference. Chapter 4 roadmap. Internet AS Hierarchy CS555, Spring 2005 April 12, 2005 No classes attend Senior Design Projects conference Network Layer 4-1 Chapter 4 roadmap 4.1 Introduction and Network Service Models 4.2 VC and Datagram Networks 4.3 What

More information

IPv4. Christian Grothoff.

IPv4. Christian Grothoff. IPv4 christian@grothoff.org http://grothoff.org/christian/ Sites need to be able to interact in one single, universal space. Tim Berners-Lee 1 The Network Layer Transports datagrams from sending to receiving

More information

ECE 158A: Lecture 7. Fall 2015

ECE 158A: Lecture 7. Fall 2015 ECE 158A: Lecture 7 Fall 2015 Outline We have discussed IP shortest path routing Now we have a closer look at the IP addressing mechanism We are still at the networking layer, we will examine: IP Headers

More information

Introduction to Information Science and Technology 2017 Networking II. Sören Schwertfeger 师泽仁

Introduction to Information Science and Technology 2017 Networking II. Sören Schwertfeger 师泽仁 II Sören Schwertfeger 师泽仁 Outline Review Network Layer Routing Transport Layer Applications HTTP Demos Internet: Huge network of networks Billions of hosts (computers) Internet Structure Network Edge:

More information

ITEC310 Computer Networks II

ITEC310 Computer Networks II ITEC310 Computer Networks II Chapter 22 Network Layer:, and Routing Department of Information Technology Eastern Mediterranean University Objectives 2/131 After completing this chapter you should be able

More information

Chapter 4: Network Layer, partb

Chapter 4: Network Layer, partb Chapter 4: Network Layer, partb The slides are adaptations of the slides available by the main textbook authors, Kurose&Ross Network Layer 4-1 Interplay between routing, forwarding routing algorithm local

More information

EP2120 Internetworking/Internetteknik IK2218 Internets Protokoll och Principer

EP2120 Internetworking/Internetteknik IK2218 Internets Protokoll och Principer EP2120 Internetworking/Internetteknik IK2218 Internets Protokoll och Principer Homework Assignment 1 (Solutions due 20:00, Mon., 10 Sept. 2018) (Review due 20:00, Wed., 12 Sept. 2018) 1. IPv4 Addressing

More information

Computer Networks ICS 651. IP Routing RIP OSPF BGP MPLS Internet Control Message Protocol IP Path MTU Discovery

Computer Networks ICS 651. IP Routing RIP OSPF BGP MPLS Internet Control Message Protocol IP Path MTU Discovery Computer Networks ICS 651 IP Routing RIP OSPF BGP MPLS Internet Control Message Protocol IP Path MTU Discovery Routing Information Protocol DV modified with split horizon and poisoned reverse distance

More information

Link State Routing & Inter-Domain Routing

Link State Routing & Inter-Domain Routing Link State Routing & Inter-Domain Routing CS640, 2015-02-26 Announcements Assignment #2 is due Tuesday Overview Link state routing Internet structure Border Gateway Protocol (BGP) Path vector routing Inter

More information

Information Network Systems The network layer. Stephan Sigg

Information Network Systems The network layer. Stephan Sigg Information Network Systems The network layer Stephan Sigg Tokyo, November 1, 2012 Error-detection and correction Decoding of Reed-Muller codes Assume a second order (16, 11) code for m = 4. The r-th order

More information

Internet Protocol: Routing Algorithms. Srinidhi Varadarajan

Internet Protocol: Routing Algorithms. Srinidhi Varadarajan Internet Protocol: Routing Algorithms Srinidhi Varadarajan Routing Routing protocol Goal: determine good path (sequence of routers) thru network from source to dest. Graph abstraction for routing algorithms:

More information

Dongsoo S. Kim Electrical and Computer Engineering Indiana U. Purdue U. Indianapolis

Dongsoo S. Kim Electrical and Computer Engineering Indiana U. Purdue U. Indianapolis Session 8. TCP/IP Dongsoo S. Kim (dskim@iupui.edu) Electrical and Computer Engineering Indiana U. Purdue U. Indianapolis IP Packet 0 4 8 16 19 31 Version IHL Type of Service Total Length Identification

More information

ICMP, ARP, RARP, IGMP

ICMP, ARP, RARP, IGMP Internet Layer Lehrstuhl für Informatik 4 Raw division into three tasks: Data transfer over a global network Route decision at the sub-nodes Control of the network or transmission status Routing Protocols

More information

What is the difference between unicast and multicast? (P# 114)

What is the difference between unicast and multicast? (P# 114) 1 FINAL TERM FALL2011 (eagle_eye) CS610 current final term subjective all solved data by eagle_eye MY paper of CS610 COPUTER NETWORKS There were 30 MCQs Question no. 31 (Marks2) Find the class in 00000001.001011.1001.111

More information

CS BGP v4. Fall 2014

CS BGP v4. Fall 2014 CS 457 - BGP v4 Fall 2014 Autonomous Systems What is an AS? a set of routers under a single technical administration uses an interior gateway protocol (IGP) and common metrics to route packets within the

More information

Routing Protocols --- Exterior Gateway Protocol

Routing Protocols --- Exterior Gateway Protocol Content Routing Protocols --- Exterior Gateway Protocol Linda Wu (CMPT 471 23-3) Limiting router interaction Autonomous system BGP protocol BGP messages Other issues on BGP Reference: chapter 15 Notes-13

More information

CS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 16, 2017

CS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 16, 2017 CS 43: Computer Networks Internet Routing Kevin Webb Swarthmore College November 16, 2017 1 Hierarchical routing Our routing study thus far - idealization all routers identical network flat not true in

More information

Internetworking Part 2

Internetworking Part 2 CMPE 344 Computer Networks Spring 2012 Internetworking Part 2 Reading: Peterson and Davie, 3.2, 4.1 19/04/2012 1 Aim and Problems Aim: Build networks connecting millions of users around the globe spanning

More information

Introduction to routing in the Internet

Introduction to routing in the Internet Introduction to routing in the Internet Internet architecture IPv4, ICMP, ARP Addressing, routing principles (Chapters 2 3 in Huitema) Internet-1 Internet Architecture Principles End-to-end principle by

More information

Planning for Information Network

Planning for Information Network Planning for Information Network Lecture 7: Introduction to IPv6 Assistant Teacher Samraa Adnan Al-Asadi 1 IPv6 Features The ability to scale networks for future demands requires a limitless supply of

More information

The Interconnection Structure of. The Internet. EECC694 - Shaaban

The Interconnection Structure of. The Internet. EECC694 - Shaaban The Internet Evolved from the ARPANET (the Advanced Research Projects Agency Network), a project funded by The U.S. Department of Defense (DOD) in 1969. ARPANET's purpose was to provide the U.S. Defense

More information

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

Overview. Problem: Find lowest cost path between two nodes Factors static: topology dynamic: load Dynamic Routing Overview Forwarding vs Routing forwarding: to select an output port based on destination address and routing table routing: process by which routing table is built Network as a Graph C

More information

Routing Unicast routing protocols

Routing Unicast routing protocols Routing Unicast routing protocols Jens A Andersson Electrical and Information Technology R1 Choosing an Optimal Path R4 5 R7 5 10 40 R6 6 5 B R2 15 A 20 4 10 10 R8 R3 5 10 R5 1 Router A router is a type

More information

EEC-484/584 Computer Networks

EEC-484/584 Computer Networks EEC-484/584 Computer Networks Lecture 13 wenbing@ieee.org (Lecture nodes are based on materials supplied by Dr. Louise Moser at UCSB and Prentice-Hall) Outline 2 Review of lecture 12 Routing Congestion

More information

Chapter 09 Network Protocols

Chapter 09 Network Protocols Chapter 09 Network Protocols Copyright 2011, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Outline Protocol: Set of defined rules to allow communication between entities Open Systems

More information

CS 640: Introduction to Computer Networks. Intra-domain routing. Inter-domain Routing: Hierarchy. Aditya Akella

CS 640: Introduction to Computer Networks. Intra-domain routing. Inter-domain Routing: Hierarchy. Aditya Akella CS 640: Introduction to Computer Networks Aditya Akella Lecture 11 - Inter-Domain Routing - BGP (Border Gateway Protocol) Intra-domain routing The Story So Far Routing protocols generate the forwarding

More information

Vendor: Alcatel-Lucent. Exam Code: 4A Exam Name: Alcatel-Lucent Interior Routing Protocols and High Availability.

Vendor: Alcatel-Lucent. Exam Code: 4A Exam Name: Alcatel-Lucent Interior Routing Protocols and High Availability. Vendor: Alcatel-Lucent Exam Code: 4A0-101 Exam Name: Alcatel-Lucent Interior Routing Protocols and High Availability Version: Demo QUESTION 1 When a router receives an IP packet, but does not find a match

More information

IP - The Internet Protocol. Based on the slides of Dr. Jorg Liebeherr, University of Virginia

IP - The Internet Protocol. Based on the slides of Dr. Jorg Liebeherr, University of Virginia IP - The Internet Protocol Based on the slides of Dr. Jorg Liebeherr, University of Virginia Orientation IP (Internet Protocol) is a Network Layer Protocol. IP: The waist of the hourglass IP is the waist

More information

CS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 14, 2013

CS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 14, 2013 CS 43: Computer Networks Internet Routing Kevin Webb Swarthmore College November 14, 2013 1 Reading Quiz Hierarchical routing Our routing study thus far - idealization all routers identical network flat

More information

CS 43: Computer Networks. 24: Internet Routing November 19, 2018

CS 43: Computer Networks. 24: Internet Routing November 19, 2018 CS 43: Computer Networks 24: Internet Routing November 19, 2018 Last Class Link State + Fast convergence (reacts to events quickly) + Small window of inconsistency Distance Vector + + Distributed (small

More information

Network Layer PREPARED BY AHMED ABDEL-RAOUF

Network Layer PREPARED BY AHMED ABDEL-RAOUF Network Layer PREPARED BY AHMED ABDEL-RAOUF Network layer transport segment from sending to receiving host on sending side encapsulates segments into datagrams on receiving side, delivers segments to transport

More information

Chapter 4 Network Layer

Chapter 4 Network Layer Chapter 4 Network Layer CPSC 335 Data Communication Systems Readings: 4.4.3, 4.4.4, 4.5, 4.5.1 David Nguyen Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley March

More information

Introduction to routing in the Internet

Introduction to routing in the Internet Introduction to routing in the Internet Internet architecture IPv4, ICMP, ARP Addressing, routing principles (Chapters 2 3 in Huitema) Internet-1 Internet Architecture Principles End-to-end principle by

More information

Lecture 12. Introduction to IP Routing. Why introduction? Routing

Lecture 12. Introduction to IP Routing. Why introduction? Routing Lecture. Introduction to IP Routing Why introduction? Routing: very complex issue need in-depth study entire books on routing our scope: give a flavour of basic routing structure and messaging give an

More information

Lecture 8. Network Layer (cont d) Network Layer 1-1

Lecture 8. Network Layer (cont d) Network Layer 1-1 Lecture 8 Network Layer (cont d) Network Layer 1-1 Agenda The Network Layer (cont d) What is inside a router Internet Protocol (IP) IPv4 fragmentation and addressing IP Address Classes and Subnets Network

More information

Basic Idea. Routing. Example. Routing by the Network

Basic Idea. Routing. Example. Routing by the Network Basic Idea Routing Routing table at each router/gateway When IP packet comes, destination address checked with routing table to find next hop address Questions: Route by host or by network? Routing table:

More information

Routing Protocols. Autonomous System (AS)

Routing Protocols. Autonomous System (AS) Routing Protocols Two classes of protocols: 1. Interior Routing Information Protocol (RIP) Open Shortest Path First (OSPF) 2. Exterior Border Gateway Protocol (BGP) Autonomous System (AS) What is an AS?

More information

BGP Configuration. BGP Overview. Introduction to BGP. Formats of BGP Messages. Header

BGP Configuration. BGP Overview. Introduction to BGP. Formats of BGP Messages. Header Table of Contents BGP Configuration 1 BGP Overview 1 Introduction to BGP 1 Formats of BGP Messages 1 BGP Path Attributes 4 BGP Route Selection 8 Configuring BGP 8 Configuration Prerequisites 8 Configuration

More information

Internet. Organization Addresses TCP/IP Protocol stack Forwarding. 1. Use of a globally unique address space based on Internet Addresses

Internet. Organization Addresses TCP/IP Protocol stack Forwarding. 1. Use of a globally unique address space based on Internet Addresses Internet Organization Addresses TCP/IP Protocol stack Forwarding Jörg Liebeherr, 1998-2003 1 What defines the Internet? 1. Use of a globally unique address space based on Internet Addresses 2. Support

More information

Routing by the Network

Routing by the Network Routing Basic Idea Routing table at each router/gateway When IP packet comes, destination address checked with routing table to find next hop address Questions: Route by host or by network? Routing table:

More information

Routing. Jens A Andersson Communication Systems

Routing. Jens A Andersson Communication Systems Routing Jens A Andersson Communication Systems R1 Choosing an Optimal Path R4 5 R7 5 10 40 R6 6 5 B R2 15 A 20 4 10 10 R8 R3 5 R5 10 Router A router is a type of internetworking device that passes data

More information

CPSC 826 Internetworking. The Network Layer: Routing & Addressing Outline. The Network Layer

CPSC 826 Internetworking. The Network Layer: Routing & Addressing Outline. The Network Layer 1 CPSC 826 Intering The Network Layer: Routing & Addressing Outline The Network Layer Michele Weigle Department of Computer Science Clemson University mweigle@cs.clemson.edu November 10, 2004 Network layer

More information

PART III. Implementing Inter-Network Relationships with BGP

PART III. Implementing Inter-Network Relationships with BGP PART III Implementing Inter-Network Relationships with BGP ICNP 2002 Routing Protocols Autonomous System BGP-4 BGP = Border Gateway Protocol Is a Policy-Based routing protocol Is the de facto EGP of today

More information

Internet Routing Protocols Part II

Internet Routing Protocols Part II Indian Institute of Technology Kharagpur Internet Routing Protocols Part II Prof. Indranil Sen Gupta Dept. of Computer Science & Engg. I.I.T. Kharagpur, INDIA Lecture 8: Internet routing protocols Part

More information

Inter-domain Routing. Outline. Border Gateway Protocol

Inter-domain Routing. Outline. Border Gateway Protocol Inter-domain Routing Outline Border Gateway Protocol Internet Structure Original idea CS 640 2 Internet Structure Today CS 640 3 Route Propagation in the Internet Autonomous System (AS) corresponds to

More information

Lecture 9. Network Layer (cont d) Network Layer 1-1

Lecture 9. Network Layer (cont d) Network Layer 1-1 Lecture 9 Network Layer (cont d) Network Layer 1-1 Agenda Routing Tables Unicast and Multicast Routing Protocols Routing Algorithms Link State and Distance Vector Routing Information and Open Shortest

More information

5.1 introduction 5.5 The SDN control 5.2 routing protocols plane. Control Message 5.3 intra-as routing in Protocol the Internet

5.1 introduction 5.5 The SDN control 5.2 routing protocols plane. Control Message 5.3 intra-as routing in Protocol the Internet Chapter 5: outline 5.1 introduction 5.5 The SDN control 5.2 routing protocols plane link state 5.6 ICMP: The Internet distance vector Control Message 5.3 intra-as routing in Protocol the Internet t 5.7

More information

Last time. Wireless link-layer. Introduction. Characteristics of wireless links wireless LANs networking. Cellular Internet access

Last time. Wireless link-layer. Introduction. Characteristics of wireless links wireless LANs networking. Cellular Internet access Last time Wireless link-layer Introduction Wireless hosts, base stations, wireless links Characteristics of wireless links Signal strength, interference, multipath propagation Hidden terminal, signal fading

More information

Inter-AS routing and BGP. Network Layer 4-1

Inter-AS routing and BGP. Network Layer 4-1 Inter-AS routing and BGP Network Layer 4-1 Review: intra-as routing v Also known as interior gateway protocols (IGP) v Most common intra-as routing protocols: RIP: Routing Information Protocol, distance

More information

Review. Some slides are in courtesy of J. Kurose and K. Ross

Review. Some slides are in courtesy of J. Kurose and K. Ross Review The Internet (IP) Protocol Datagram format IP fragmentation ICMP: Internet Control Message Protocol NAT: Network Address Translation Routing in the Internet Intra-AS routing: RIP and OSPF Inter-AS

More information

COM-208: Computer Networks - Homework 6

COM-208: Computer Networks - Homework 6 COM-208: Computer Networks - Homework 6. (P22) Suppose you are interested in detecting the number of hosts behind a NAT. You observe that the IP layer stamps an identification number sequentially on each

More information

CS 43: Computer Networks. 21: The Network Layer & IP November 7, 2018

CS 43: Computer Networks. 21: The Network Layer & IP November 7, 2018 CS 43: Computer Networks 21: The Network Layer & IP November 7, 2018 The Network Layer! Application: the application (e.g., the Web, Email) Transport: end-to-end connections, reliability Network: routing

More information

Unit 3: Dynamic Routing

Unit 3: Dynamic Routing Unit 3: Dynamic Routing Basic Routing The term routing refers to taking a packet from one device and sending it through the network to another device on a different network. Routers don t really care about

More information

Network Protocols. Routing. TDC375 Winter 2002 John Kristoff - DePaul University 1

Network Protocols. Routing. TDC375 Winter 2002 John Kristoff - DePaul University 1 Network Protocols Routing TDC375 Winter 2002 John Kristoff - DePaul University 1 IP routing Performed by routers Table (information base) driven Forwarding decision on a hop-by-hop basis Route determined

More information

BGP. Daniel Zappala. CS 460 Computer Networking Brigham Young University

BGP. Daniel Zappala. CS 460 Computer Networking Brigham Young University Daniel Zappala CS 460 Computer Networking Brigham Young University 2/20 Scaling Routing for the Internet scale 200 million destinations - can t store all destinations or all prefixes in routing tables

More information

Network Protocols. Routing. TDC375 Autumn 03/04 John Kristoff - DePaul University 1

Network Protocols. Routing. TDC375 Autumn 03/04 John Kristoff - DePaul University 1 Network Protocols Routing TDC375 Autumn 03/04 John Kristoff - DePaul University 1 IPv4 unicast routing All Internet hosts perform basic routing for local net destinations, forward to local host for non-local

More information