Routing Protocols. Autonomous System (AS)

Similar documents
Basic Idea. Routing. Example. Routing by the Network

Routing by the Network

Routing Protocols --- Exterior Gateway Protocol

Routing in the Internet

ICS 351: Today's plan. OSPF BGP Routing in general

ICS 351: Today's plan. distance-vector routing game link-state routing OSPF

Routing Protocols. The routers in an internet are responsible for receiving and. forwarding IP datagrams through the interconnected set of

Routing Protocols of IGP. Koji OKAMURA Kyushu University, Japan

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

CSc 450/550 Computer Networks Internet Routing

Chapter 7 Routing Protocols

Chapter 7: Routing Dynamically. Routing & Switching

Internet Routing Protocols Part II

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

Inter-Domain Routing: BGP

Introduction to Dynamic Routing Protocols

CHAPTER 4: ROUTING DYNAMIC. Routing & Switching

Why dynamic route? (1)

Internet Routing Protocols Tuba Saltürk

RIP Configuration. RIP Overview. Operation of RIP. Introduction. RIP routing table. RIP timers

TDC 363 Introduction to LANs

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

Unit 3: Dynamic Routing

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

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

ETSF10 Internet Protocols Routing on the Internet

Politecnico di Milano Scuola di Ingegneria Industriale e dell Informazione. 06 Routing protocols. Fundamentals of Communication Networks

Routing Protocols and

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

CCNA 3 (v v6.0) Chapter 5 Exam Answers % Full

Antonio Cianfrani. Routing Protocols

CSCI Topics: Internet Programming Fall 2008

Important Lessons From Last Lecture Computer Networking. Outline. Routing Review. Routing hierarchy. Internet structure. External BGP (E-BGP)

Network Layer: Routing

Computer Networking Introduction

Chapter 4: Advanced Internetworking. Networking CS 3470, Section 1

ICS 351: Today's plan. OSPF BGP Routing in general routing protocol comparison encapsulation network dynamics

BTEC Level 3 Extended Diploma

CS321: Computer Networks Unicast Routing

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

Internetworking. different kinds of network technologies that can be interconnected by routers and other networking devices to create an internetwork

IP Routing Tecnologie e Protocolli per Internet II rev 1

Module 8. Routing. Version 2 ECE, IIT Kharagpur

Chapter 3. Introduction to Dynamic Routing Protocols. CCNA2-1 Chapter 3

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

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

Routing, Routing Algorithms & Protocols

Top-Down Network Design

Chapter 4: Network Layer

Network layer: Overview. Network layer functions Routing IP Forwarding

Two types of routing protocols are used in internetworks: interior gateway protocols (IGPs) and exterior gateway protocols (EGPs).

Routing. Info 341 Networking and Distributed Applications. Addresses, fragmentation, reassembly. end-to-end communication UDP, TCP

Routing. Advanced Computer Networks: Routing 1

Chapter IV: Network Layer

OSPF Protocol Overview on page 187. OSPF Standards on page 188. OSPF Area Terminology on page 188. OSPF Routing Algorithm on page 190

Chapter 6 Reading Organizer

shortcut Tap into learning NOW! Visit for a complete list of Short Cuts. Your Short Cut to Knowledge

Chapter 4: outline. Network Layer 4-1

Internet Interconnection Structure

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

PART III. Implementing Inter-Network Relationships with BGP

Planning for Information Network

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

Routing Unicast routing protocols

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

Routing Protocols. Technology Description BGP CHAPTER

Inter-domain Routing. Outline. Border Gateway Protocol

Chapter 4: Network Layer, partb

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

Lab 4: Routing using OSPF

Routing. Jens A Andersson Communication Systems

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

Introduction to Routing

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

Introduction to IP Routing. Geoff Huston

EECS 122, Lecture 16. Link Costs and Metrics. Traffic-Sensitive Metrics. Traffic-Sensitive Metrics. Static Cost Metrics.

Network Layer, Part 2 Routing. Terminology

Table of Contents. Cisco Introduction to EIGRP

Keywords RIP, OSPF, IGP, EGP, AS, LSA

Internet Routing : Fundamentals of Computer Networks Bill Nace

Aims. The aims of this unit are to: Outline the usage and importance of routing protocols. Understand the problems caused with routing protocols.

BLM6196 COMPUTER NETWORKS AND COMMUNICATION PROTOCOLS

Vanguard Managed Solutions

Lecture 4. The Network Layer (cont d)

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

Open Shortest Path First (OSPF)

Routing Between Autonomous Systems (Example: BGP4) RFC 1771

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

Unit 9. Author: W.Buchanan. Routing Protocols (1)

To contain/reduce broadcast traffic, we need to reduce the size of the network (i.e., LAN).

IP Protocols. ALTTC/Oct

Unicast Routing Protocols (RIP, OSPF, and BGP)

ETSF10 Internet Protocols Routing on the Internet

A study of WAN design, routing protocols and connectivity between Head office to Branch office

Most important (cont d) What s most important in Project 1. Important for individuals. From from Most Important

CSCE 463/612 Networks and Distributed Processing Spring 2018

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

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

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

EIGRP. Routing Protocols and Concepts Chapter 9. Video Frank Schneemann, MS EdTech

Transcription:

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? A set of routers and networks managed by a single organization. The routers within the AS exchange information using a common routing protocol. The AS graph is connected (in the absence of failure). An organization can register their network and get an AS number. 1

Autonomous System (AS) AS1 R3 R7 R6 AS2 R4 IGP 1 IGP 2 R1 BGP R2 R5 Which class of protocols to use? Use interior router protocols to exchange information between routers within an AS. Use exterior routing protocol to pass exchange routing information between routers in different AS s. 2

Routing Information Protocol (RIP) The Routing Information Protocol (RIP) is one of the most commonly used Interior Gateway Protocol on internal networks It is a distance-vector protocol, which employs Hop Count as the metric. The maximum number ofhopsallowedwithripis15. RIP uses a distributed version of Bellman-Ford algorithm. RIP (contd.) Each node calculates the distances between itself and all other nodes within the AS and stores this information as a table. Eachnodesendsitstabletoallneighboringnodes. When a node receives distance tables from its neighbors, it calculates the shortest routes to all other nodes and updates its own table to reflect any changes. 3

Distance Vector Routing Table Destination Address Hop Count Next Router Other Information 115.2.1.00 4 132.35.27.1 126.3.56.6 5 176.21.11.3 165.11.12.3 7 173.23.12.5 188.22.33.2 6 130.22.34.7 195.23.12.8 3 201.23.11.5 Problems Slow convergence for larger networks. If a network becomes inaccessible, it may take a long time for all other routing tables to know this. After a number of message transfers. Routing loops may take a long time to be detected. Counting to infinity problem. Too much bandwidth consumed by routing updates. 4

Open Shortest Path First (OSPF) Widely used as the interior router protocol in TCP/IP networks. Basic concept: Computes a route that incurs the least cost. User configurable: delay, data rate, cost, etc. Each router maintains a database. Topology of the autonomous system to which the router belongs. Vertices and edges. Two types of vertices: Router Network Two types of (weighted) edges: Two routers connected to each other by direct point-to-point link. A router is directly connected to a network. A router calculates the least-cost path to all destination networks. Using Dijkstra s algorithm. Only the next hop to the destination is used in the forwarding process. 5

At steady state All routers know the same network topology. Hello packets sent every 10 seconds (configurable) to neighbors. Link State Advertisement (LSA) flooded initially from each router. Absence of Hello packet for 40 seconds indicate failure of neighbor. Causes LSA to be flooded again. LSAs re-flooded every 30 minutes anyway. OSPF Header Format 0 8 16 31 Version Type Message length SourceAddr AreaId Checksum Authentication type Authentication Data 6

Packet types : 1 : Hello (check if neighbor is up) 2 : Database Description (synchronize database at beginning) 3 : Link State Request (request specific LSA) 4 : Link State Update (LSAs flooded) 5 : Link State Acknowledgement (flooded LSAs are explicitly ack ed reliable flooding) Authentication type: Cleartext Encrypted (MD5 Hash, others possible) OSPF allows sets of networks to be grouped together. Such a grouping is called an Area. 7

OSPF 4 Net A 1 2 Net D R1 Net B 1 2 Note: Numbers in Blue shows the Cost to reach that network R2 5 Net C 1 3 R3 Link State Database Advertiser Network Cost Neighbor R1 A 4 R4 R1 B 1 R2 R2 B 2 R1 R2 C 5 R3 R3 C 1 R2 R3 D 3 R4 R4 A 1 R1 R4 D 2 R3 Network Cost Next A 4 Router ----- B 1 ----- C 8 R2 D 7 R4 Routing table of RI 8

Border Gateway Protocol (BGP) What is BGP? Most widely used exterior router protocol for the Internet. Allows routers belonging to different autonomous systems to exchange routing information. Sent as messages over TCP connections. The router tables get updated. 9

Message Types in BGP Four types of messages: 1) Open: used to open a neighbor connection with another router. 2) Update: used to transmit information about a single route. 3) Keepalive: used to periodically confirm the neighbor connection. 4) Notification: used to notify about some error condition. Types of error conditions reported: Message header error authentication and syntax. Open message error syntax errors and unrecognized options. Update message error. Hold timer expired used to close a connection if periodic messages are not received. Cease used by a router to close a connection with another router in the absence of any other error. 10

Functional Procedures in BGP Neighbor Acquisition Two routers agree to be neighbors by exchanging messages. Neighbor Reachability Check if the neighbor is still alive, and is maintaining the relationship. Network Reachability Each router maintains a list of the networks that it can reach, and the preferred routes. All modern-day routers support BGP. The routers that are managed by ISP s actually run BGP. Organizational networks in many cases do not run BGP. Rely on the ISP s routers to route packets to the outside world. Default route will be to the ISP router. 11

BGP Runs over TCP: BGP uses TCP for all communication. So the reliability issues are taken care by TCP. Conserve network bandwidth: BGP doesn t pass full information in each update message. Instead full information is just passed on once and thereafter successive messages only carries the incremental changes called deltas. Support for CIDR: BGP supports classless addressing (CIDR). That it supports a way to send the network mask along with the addresses. Security: BGP allows a receiver to authenticate messages, so that the identity of the sender can be verified. Multicasting and IGMP Multicasting is used to send a message to a select group of users (one-to-many) IP supports multicasting using class D address having more than 250 million addresses The Internet Group Message protocol (IGMP) has been designed to help a multicast router to identify hosts in a LAN environment IGMP uses three types messages: query message, membership report and leave report 12