Dynamic Routing Protocols (OSPF/RIP/BGP)
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Configuring Static Routing
Configuring Static Routing This chapter contains the following sections: • Finding Feature Information, on page 1 • Information About Static Routing, on page 1 • Licensing Requirements for Static Routing, on page 4 • Prerequisites for Static Routing, on page 4 • Guidelines and Limitations for Static Routing, on page 4 • Default Settings for Static Routing Parameters, on page 4 • Configuring Static Routing, on page 4 • Verifying the Static Routing Configuration, on page 10 • Related Documents for Static Routing, on page 10 • Feature History for Static Routing, on page 10 Finding Feature Information Your software release might not support all the features documented in this module. For the latest caveats and feature information, see the Bug Search Tool at https://tools.cisco.com/bugsearch/ and the release notes for your software release. To find information about the features documented in this module, and to see a list of the releases in which each feature is supported, see the "New and Changed Information"chapter or the Feature History table in this chapter. Information About Static Routing Routers forward packets using either route information from route table entries that you manually configure or the route information that is calculated using dynamic routing algorithms. Static routes, which define explicit paths between two routers, cannot be automatically updated; you must manually reconfigure static routes when network changes occur. Static routes use less bandwidth than dynamic routes. No CPU cycles are used to calculate and analyze routing updates. You can supplement dynamic routes with static routes where appropriate. You can redistribute static routes into dynamic routing algorithms but you cannot redistribute routing information calculated by dynamic routing algorithms into the static routing table. -
Dynamic Routing: Routing Information Protocol
CS 356: Computer Network Architectures Lecture 12: Dynamic Routing: Routing Information Protocol Chap. 3.3.1, 3.3.2 Xiaowei Yang [email protected] Today • ICMP applications • Dynamic Routing – Routing Information Protocol ICMP applications • Ping – ping www.duke.edu • Traceroute – traceroute nytimes.com • MTU discovery Ping: Echo Request and Reply ICMP ECHO REQUEST Host Host or or Router router ICMP ECHO REPLY Type Code Checksum (= 8 or 0) (=0) identifier sequence number 32-bit sender timestamp Optional data • Pings are handled directly by the kernel • Each Ping is translated into an ICMP Echo Request • The Pinged host responds with an ICMP Echo Reply 4 Traceroute • xwy@linux20$ traceroute -n 18.26.0.1 – traceroute to 18.26.0.1 (18.26.0.1), 30 hops max, 60 byte packets – 1 152.3.141.250 4.968 ms 4.990 ms 5.058 ms – 2 152.3.234.195 1.479 ms 1.549 ms 1.615 ms – 3 152.3.234.196 1.157 ms 1.171 ms 1.238 ms – 4 128.109.70.13 1.905 ms 1.885 ms 1.943 ms – 5 128.109.70.138 4.011 ms 3.993 ms 4.045 ms – 6 128.109.70.102 10.551 ms 10.118 ms 10.079 ms – 7 18.3.3.1 28.715 ms 28.691 ms 28.619 ms – 8 18.168.0.23 27.945 ms 28.028 ms 28.080 ms – 9 18.4.7.65 28.037 ms 27.969 ms 27.966 ms – 10 128.30.0.246 27.941 ms * * Traceroute algorithm • Sends out three UDP packets with TTL=1,2,…,n, destined to a high port • Routers on the path send ICMP Time exceeded message with their IP addresses until n reaches the destination distance • Destination replies with port unreachable ICMP messages Path MTU discovery algorithm • Send packets with DF bit set • If receive an ICMP error message, reduce the packet size Today • ICMP applications • Dynamic Routing – Routing Information Protocol Dynamic Routing • There are two parts related to IP packet handling: 1. -
The Routing Table V1.12 – Aaron Balchunas 1
The Routing Table v1.12 – Aaron Balchunas 1 - The Routing Table - Routing Table Basics Routing is the process of sending a packet of information from one network to another network. Thus, routes are usually based on the destination network, and not the destination host (host routes can exist, but are used only in rare circumstances). To route, routers build Routing Tables that contain the following: • The destination network and subnet mask • The “next hop” router to get to the destination network • Routing metrics and Administrative Distance The routing table is concerned with two types of protocols: • A routed protocol is a layer 3 protocol that applies logical addresses to devices and routes data between networks. Examples would be IP and IPX. • A routing protocol dynamically builds the network, topology, and next hop information in routing tables. Examples would be RIP, IGRP, OSPF, etc. To determine the best route to a destination, a router considers three elements (in this order): • Prefix-Length • Metric (within a routing protocol) • Administrative Distance (between separate routing protocols) Prefix-length is the number of bits used to identify the network, and is used to determine the most specific route. A longer prefix-length indicates a more specific route. For example, assume we are trying to reach a host address of 10.1.5.2/24. If we had routes to the following networks in the routing table: 10.1.5.0/24 10.0.0.0/8 The router will do a bit-by-bit comparison to find the most specific route (i.e., longest matching prefix). -
Chapter 4 Dynamic Routing
CHAPTER 4 DYNAMIC ROUTING In this chapter we cover the basic principles of dynamic routing algorithms that form the basis of the experiments in Lab 4. The chapter has six sections. Each section covers material that you need to run the lab exercises. The first section gives an overview of dynamic routing protocols and discusses the differences between the two major classes of routing algorithms: intra domain and inter domain. Sections 2, 3, 4, and 5 give an overview of the most common routing algorithms such , RIP, OSPF, BGP and IGRP. Section 6 presents the commands used to configure the hosts and the routers for dynamic routing. TABLE OF CONTENT 1 ROUTING PROTOCOLS ........................................................................................................................ 3 1.1 AUTONOMOUS SYSTEMS (AS)............................................................................................................ 3 1.2 INTRADOMAIN ROUTING VERSUS INTERDOMAIN ROUTING ............................................................... 4 1.3 DYNAMIC ROUTING ............................................................................................................................ 4 1.3.1 Distance Vector Algorithm ........................................................................................................... 4 2 RIP ............................................................................................................................................................... 5 3 OSPF........................................................................................................................................................... -
Performance Evaluation of Enhanced Interior Gateway Routing Protocol in Ipv6 Network
International Journal of Computer Applications (0975 – 8887) Volume 70– No.5, May 2013 Performance Evaluation of Enhanced Interior Gateway Routing Protocol in IPv6 Network Kuwar Pratap Singh P. K. Gupta G. Singh Department of Computer Science Department of Computer Science Department of Electronics and and Engineering and Engineering Communication Engineering Jaypee University of Information Jaypee University of Information Jaypee University of Information Technology, Waknaghat, Solan Technology, Waknaghat, Solan Technology, Waknaghat, Solan 173 234 INDIA 173 234 INDIA 173 234 INDIA ABSTRACT packets is transmitted after every 5 seconds to see whether With the explosive growth in communication and network neighbour router is up or not. These packets are sent for technologies, there is a great demand of IPv6 addressing various different reasons like: scheme. However, the modern operating systems has option a) For discovering neighbour, for this and with the development of IPv6 which removes the limitations imposed by IPv4 and provides the large number of b) For forming relation with neighbour, address space. In this paper, authors have considered the c) For maintaining relation with neighbour. Enhanced Interior Gateway Routing Protocol and presented a scenario for its performance evaluation in IPv6 networks and DUAL algorithm used, includes Successor(S), Feasible obtained results are highly considerable for the short distance Successor (FS), Feasibility Condition (FC), Feasible Distance of communication and don’t represent any problem of (FD), and reported distance (RD) [4]. performance degradation while sending or receiving the data. 2. RELATED WORK Keywords Narisetty and Balsu [5] have introduced the combination of EIGRP, IPv6, Routing, OSPF, Local Area Network, Wide IS-IS/RIP and EIGRP protocol. -
Protocol to Learn and Share Routes
Protocol To Learn And Share Routes Minimal and crackpot Daryl decrescendos her formaldehyde miaous while Corbin ankylosed some midtown likewise. Todd reregulated his Lucienchurches halloing motorcycle some polygamouslyepitaxies and ordecuple diurnally his afterscallywags Eduardo so outsoar rightward! and electrocutes dead-set, unbroken and Procrustean. Macaronic Bit embarrassing if required here as opaque and protocol to learn and share routes from connected to illuminate key feature Review which interfaces on the router were configured and plumbed during installation. We have learnt the concepts of LINK STATE routing protocols and especially OSPF, increment the metric, some of the routing table entries could be replaced with a default route. Enable BGP on the subnets from the. This paper presents a survey and to review a comparative study about various routing protocols under each of these categories. Static Routing is also known as Nonadaptive Routing. Authentication Length: The length, there is less administrative overhead. In fact, nodes on some networks were even more involved, appropriately scale computing resources and otherwise support and deliver this site and its services. This will give the complete status about routing protocols likes on which interface its receiving updates and on which interface its broadcasting update what is time intervals. Thus making up your private docker images contained in mobile sus that routes to and share routing tables accordingly. At the same time, latency, acting as if the neighbor had responded with an unreachable message for all routes. This is where configuration guides come in. The route metric calculations, dynamic routing table with an intermediate systems refer to protocol to learn and share routes. -
Introduction to the Border Gateway Protocol – Case Study Using GNS3
Introduction to The Border Gateway Protocol – Case Study using GNS3 Sreenivasan Narasimhan1, Haniph Latchman2 Department of Electrical and Computer Engineering University of Florida, Gainesville, USA [email protected], [email protected] Abstract – As the internet evolves to become a vital resource for many organizations, configuring The Border Gateway protocol (BGP) as an exterior gateway protocol in order to connect to the Internet Service Providers (ISP) is crucial. The BGP system exchanges network reachability information with other BGP peers from which Autonomous System-level policy decisions can be made. Hence, BGP can also be described as Inter-Domain Routing (Inter-Autonomous System) Protocol. It guarantees loop-free exchange of information between BGP peers. Enterprises need to connect to two or more ISPs in order to provide redundancy as well as to improve efficiency. This is called Multihoming and is an important feature provided by BGP. In this way, organizations do not have to be constrained by the routing policy decisions of a particular ISP. BGP, unlike many of the other routing protocols is not used to learn about routes but to provide greater flow control between competitive Autonomous Systems. In this paper, we present a study on BGP, use a network simulator to configure BGP and implement its route-manipulation techniques. Index Terms – Border Gateway Protocol (BGP), Internet Service Provider (ISP), Autonomous System, Multihoming, GNS3. 1. INTRODUCTION Figure 1. Internet using BGP [2]. Routing protocols are broadly classified into two types – Link State In the figure, AS 65500 learns about the route 172.18.0.0/16 through routing (LSR) protocol and Distance Vector (DV) routing protocol. -
Reinforcement Learning for Routing in Communication Networks
Reinforcement Learning for Routing in Communication Networks Walter H. Andrag Thesis presented in partial fulfilment of the requirements for the degree of Master of Science at the University of Stellenbosch Supervisor: Prof Christian W. Omlin April 2003 Stellenbosch University http://scholar.sun.ac.za Declaration I, the undersigned, hereby declare that the work contained in this thesis is my own original work and has not previously in its entirety or in part been submitted at any university for a degree. Signature: Date: .~ Stellenbosch University http://scholar.sun.ac.za Abstract Routing policies for packet-switched communication networks must be able to adapt to changing traffic patterns and topologies. We study the feasibility of implementing an adaptive routing policy using the Q-Learning algorithm which learns sequences of actions from delayed rewards. The Q-Routing algorithm adapts a network's routing policy based on local information alone and converges toward an optimal solution. We demonstrate that Q-Routing is a viable alternative to other adaptive routing methods such as Bellman-Ford. We also study variations of Q-Routing designed to better explore possible routes and to take into consideration limited buffer size and optimize multiple objectives. 11 Stellenbosch University http://scholar.sun.ac.za Opsomming Die roetering in kommunikasienetwerke moet kan aanpas by veranderings in netwerk- topologie en verkeersverspreidings. Ons bestudeer die bruikbaarheid van 'n aanpasbare roeteringsalgoritme gebaseer op die "Q-Learning"-algoritme wat dit moontlik maak om 'n reeks besluite te kan neem gebaseer op vertraagde vergoedings. Die roeteringsalgo- ritme gebruik slegs nabygelee inligting om roeteringsbesluite te maak en konvergeer na 'n optimale oplossing. -
RIP: Routing Information Protocol a Routing Protocol Based on the Distance-Vector Algorithm
Laboratory 6 RIP: Routing Information Protocol A Routing Protocol Based on the Distance-Vector Algorithm Objective The objective of this lab is to configure and analyze the performance of the Routing Information Protocol (RIP) model. Overview A router in the network needs to be able to look at a packet’s destination address and then determine which of the output ports is the best choice to get the packet to that address. The router makes this decision by consulting a forwarding table. The fundamental problem of routing is: How do routers acquire the information in their forwarding tables? Routing algorithms are required to build the routing tables and hence forwarding tables. The basic problem of routing is to find the lowest-cost path between any two nodes, where the cost of a path equals the sum of the costs of all the edges that make up the path. Routing is achieved in most practical networks by running routing protocols among the nodes. The protocols provide a distributed, dynamic way to solve the problem of finding the lowest-cost path in the presence of link and node failures and changing edge costs. One of the main classes of routing algorithms is the distance-vector algorithm. Each node constructs a vector containing the distances (costs) to all other nodes and distributes that vector to its immediate neighbors. RIP is the canonical example of a routing protocol built on the distance-vector algorithm. Routers running RIP send their advertisements regularly (e.g., every 30 seconds). A router also sends an update message whenever a triggered update from another router causes it to change its routing table. -
Hop-By-Hop Routing Source Routing
Hop-by-Hop Routing Dest. Next Hop #Hops Dest. Next Hop #Hops Dest. Next Hop #Hops D A 3 D B 2 D D 1 Routing Tables S A B D on each node for hop-by-hop routing DATA D • Routing table on each node contains the next hop node and a cost metric for each destination. • Data packet only has the destination address. Source Routing S A B D payload S-A-B-D • In source routing, the data packet has the complete route (called source route) in the header. • Typically, the source node builds the whole route • The data packet routes itself. • Loose source routing: Only a subset of nodes on the route included. 1 Static vs. Dynamic Routing • Static routing has fixed routes, set up by network administrators, for example. • Dynamic routing is network state- dependent. Routes may change dynamically depending on the “state” of the network. • State = link costs. Switch traffic from highly loaded links to less loaded links. Distributed, Dynamic Routing Protocols • Distributed because in a dynamic network, no single, centralized node “knows” the whole “state” of the network. • Dynamic because routing must respond to “state” changes in the network for efficiency. • Two class of protocols: Link State and Distance Vector. 2 Link State Protocol • Each node “floods” the network with link state packets (LSP) describing the cost of its own (outgoing) links. – Link cost metric = typically delay for traversing the link. – Every other node in the network gets the LSPs via the flooding mechanism. • Each node maintains a LSP database of all LSPs it received. -
Cisco SD-WAN Routing Configuration Guide, Cisco IOS XE Release 17.X
Cisco SD-WAN Routing Configuration Guide, Cisco IOS XE Release 17.x First Published: 2020-04-30 Americas Headquarters Cisco Systems, Inc. 170 West Tasman Drive San Jose, CA 95134-1706 USA http://www.cisco.com Tel: 408 526-4000 800 553-NETS (6387) Fax: 408 527-0883 THE SPECIFICATIONS AND INFORMATION REGARDING THE PRODUCTS IN THIS MANUAL ARE SUBJECT TO CHANGE WITHOUT NOTICE. ALL STATEMENTS, INFORMATION, AND RECOMMENDATIONS IN THIS MANUAL ARE BELIEVED TO BE ACCURATE BUT ARE PRESENTED WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED. USERS MUST TAKE FULL RESPONSIBILITY FOR THEIR APPLICATION OF ANY PRODUCTS. THE SOFTWARE LICENSE AND LIMITED WARRANTY FOR THE ACCOMPANYING PRODUCT ARE SET FORTH IN THE INFORMATION PACKET THAT SHIPPED WITH THE PRODUCT AND ARE INCORPORATED HEREIN BY THIS REFERENCE. IF YOU ARE UNABLE TO LOCATE THE SOFTWARE LICENSE OR LIMITED WARRANTY, CONTACT YOUR CISCO REPRESENTATIVE FOR A COPY. The Cisco implementation of TCP header compression is an adaptation of a program developed by the University of California, Berkeley (UCB) as part of UCB's public domain version of the UNIX operating system. All rights reserved. Copyright © 1981, Regents of the University of California. NOTWITHSTANDING ANY OTHER WARRANTY HEREIN, ALL DOCUMENT FILES AND SOFTWARE OF THESE SUPPLIERS ARE PROVIDED “AS IS" WITH ALL FAULTS. CISCO AND THE ABOVE-NAMED SUPPLIERS DISCLAIM ALL WARRANTIES, EXPRESSED OR IMPLIED, INCLUDING, WITHOUT LIMITATION, THOSE OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT OR ARISING FROM A COURSE OF DEALING, USAGE, OR TRADE PRACTICE. IN NO EVENT SHALL CISCO OR ITS SUPPLIERS BE LIABLE FOR ANY INDIRECT, SPECIAL, CONSEQUENTIAL, OR INCIDENTAL DAMAGES, INCLUDING, WITHOUT LIMITATION, LOST PROFITS OR LOSS OR DAMAGE TO DATA ARISING OUT OF THE USE OR INABILITY TO USE THIS MANUAL, EVEN IF CISCO OR ITS SUPPLIERS HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. -
IP Routing Protocol-Independent Configuration Guide, Cisco IOS
IP Routing: Protocol-Independent Configuration Guide, Cisco IOS Release 12.2SX Americas Headquarters Cisco Systems, Inc. 170 West Tasman Drive San Jose, CA 95134-1706 USA http://www.cisco.com Tel: 408 526-4000 800 553-NETS (6387) Fax: 408 527-0883 C O N T E N T S Configuring IP Routing Protocol-Independent Features 1 Finding Feature Information 1 Information About Configuring IP Routing Protocol-Independent Features 1 Variable-Length Subnet Masks 2 Static Routes 2 Default Routes 3 Default Network 3 Gateway of Last Resort 4 Maximum Number of Paths 4 Multi-Interface Load Splitting 4 Routing Information Redistribution 5 Supported Metric Translations 5 Default Passive Interfaces 6 Sources of Routing Information Filtering 6 Policy-Based Routing 7 Fast-Switched Policy Routing 8 Local Policy Routing 9 NetFlow Policy Routing 9 Authentication Keys Management 10 How to Configure IP Routing Protocol-Independent Features 11 Configuring Redistribution Routing Information 11 Defining conditions for redistributing routes 11 Redistributing routes from one routing domain to another 13 Removing options for redistributing routes 14 Configuring Routing Information Filtering 14 Preventing Routing Updates Through an Interface 14 Configuring Default Passive Interfaces 15 Controlling the Advertising of Routes in Routing Updates 16 Controlling the Processing of Routing Updates 16 IP Routing: Protocol-Independent Configuration Guide, Cisco IOS Release 12.2SX ii Contents Filtering Sources of Routing Information 16 Configuring precedence for policy-based routed packets