DOCSLIB.ORG

Configuring Routing Protocols

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Configuring Routing Protocols Routing Protocols- Dynamic Routing Packet routing in the Internet is divided into two general groups Interior and Exterior Routing. Interior routing with (IGP’s) Interior Gateway protocols happens inside independent network systems also known as autonomous systems. Within an autonomous system (AS), routing information is exchanged using an interior routing protocols RIP, RIPv2, IGRP, EIGRP, OSPF, IS-IS. The Exterior routing protocols (EGP’s) External Gateway Protocols are used between the autonomous systems such as Boarder Gateway protocol, BGP. There are two main types of algorithms for IP routing: Distance Vector and Link State Routing Within each autonomous system routing is done separately from other autonomous systems, Routing between autonomous systems is performed by running BGP (Border Gateway Protocol). IGP (Interior Gateway Protocol) is a protocol for routing within a single autonomous system These protocols define how to route to networks within the AS, and can also distribute routing information for networks outside the AS (that information will come, naturally, from the routers at the edges of the AS, which also run the BGP protocol). Distance Vector Routing and Link State Routing. Distance Vector protocols determine best path on how far the destination is. Link State protocols are more sophisticated taking into consideration link variables, such as bandwidth, delay, reliability and load. Distance Vector protocols judge best path on how far it is. Distance can be hops or a combination of metrics calculated to represent a distance value. The Distance Vector routing protocols are: Routing Information Protocol (RIP v1 and v2) and (IGRP) Interior Gateway Routing Protocol. Distance-vector routing protocols are simple and efficient in small networks, and require little, if any management. However, they do not scale well, and have poor convergence properties, which has led to the development of more complex but more scalable link-state routing protocols for use in large networks. A Link-state routing is a concept used in routing of packet-switched networks in computer communications. Link-state routing works by having the routers tell every router on the network about its closest neighbors. The entire routing table is not distributed from any router, only the part of the table containing its neighbors. Link-state routing protocols are the OSPF, IS-IS, EIGRP and Novell's NLSP (NetWare Link State Protocol) which only supports IPX. This type of routing protocol requires each router to maintain at least a partial map of the network. When a network link changes state (up to down, or vice versa), a notification, called a link state advertisement (LSA) is flooded throughout the network. All the routers note the change, and re-compute their routes accordingly. Link State Routing protocols provide greater flexibility and sophistication than the Distance Vector routing protocols. They reduce overall broadcast traffic and make better decisions about routing by taking characteristics such as bandwidth, delay, reliability, and load into consideration, instead of just distance or hop count. Exploring the update behavior of distance-vector and link-state protocols from the perspective of a single router R. For the following scenarios, consider whether R will "always", "never", or "sometimes" transmit routing data as a result of a certain event in the network Interior Gateway Routing Protocol (IGRP) IGRP is a Cisco proprietary distance vector protocol. This means to use IGRP all routers must be Cisco. IGRP has a max hop count of 255 with the default being 100. IGRP uses bandwith and delay as the default metric this is called a composite metric. Reliability, load and MTU maximum transmission unit can also be used. Question You are configuring a router. In particular, a routing table that contains static, RIP, and IGRP routers for the same destination network with each set to its default administrative distance. He asks you which route will be used to forward data? A. The IGRP route B. The static route C. The RIP route D. All three will load balance. Answer B Explanation To decide which route to use, IOS uses a concept called Administrative Distance. Administrative distance is a number that denotes how believable an entire routing protocol is on a single router. The lower the number, the better, or more believable the routing protocol. By default, static routes have an administrative distance of 1. Question You want to configure a router for load balancing across 4 unequal cost paths on your network. Which of the following routing protocols can you use? (Choose two) A. RIP v1 B. RIP v2 C. OSPF D. IGRP E. EIGRP F. VLSM Answer D & E Routing Basics Routing is the process of directing packets from a source node to a destination node on a different network. Getting packets to their next hop requires a router to perform two basic activities: path determination and packet switching. Path determination Involves reviewing all paths to a destination network and choosing the optimal route. To determine the optimal route, information is put in a route table, which includes information such as destination network, the next hop, and an associated metric. Packet switching Involves changing a packet's physical destination address to that of the next hop (the packet's logical destination and source addresses will stay the same). Information a Router needs to know to route a packet • Destination address. • Neighbor routers. • Possible routes to all remote networks. • The best route to each network. • How to maintain and verify routing information. There are two main types of routing, static and dynamic, the third type of routing is called Hybrid. Static routing involves the cumbersome process of manually configuring and maintaining route tables by an administrator. Dynamic routing enables routers to "talk" to each other and automatically update their routing tables. This process occurs through the use of broadcasts. Static Routing Advantages • No over head on CPU • No Bandwidth between routers • Increased security as the administrator can choose which networks to allow to route. Disadvantages • Administrative overhead - adding a router will mean adding its route to all routers manually. Dynamic Routing Routing protocols are protocols that implement routing algorithms, to build tables used in determining path selection for routed protocols. Dynamic routing protocols assist in the automatic creation of routing tables. Network topologies are subject to change at any time. A link may fail unexpectedly, or a new link may be added. A dynamic routing protocol must discover these changes, automatically adjust its routing tables, and inform other routers of the changes. The process of rebuilding the routing tables based on new information is called convergence. Interior gateway protocols (IGPs) are used to exchange routing information with routers in the same autonomous system AS. Autonomous System (AS) is a collection of networks under a common administrative domain this means all routers sharing the same routing table information are in the same AS. Exterior gateway protocols (EGPs) are used to communicate between ASes. An example of an EGP is the Border Gateway Protocol (BGP) Administrative Distances The administrative distance (AD) is used to rate the trustworthiness of routing information received by a router from a neighboring router. 0 is most trusted and 255 is not trusted and will not be used. The lower the number, the more trustworthy the type of route is Static Route to a connected interface = 0 Static Route to a IP address = 1 Internal EIGRP = 90 OSPF = 110 RIP = 120 If a router receives two updates listing the same remote network the router will check the AD’s and accept the route with lowest AD to be included in the routing table. If both advertised routes have the same AD then routing metrics such as hop count or bandwidth are taken into account and the lowest metric is used for the best path. If the advertised route has the same AD and metrics then the router will load-balance to the remote network. If a network is directly connected the router always uses the interface connected to the network if an administrator configures a static route that is given an AD of 1 so if you have a static route a RIP advertised route and a IGRP advertised route listing the same network the router always uses the static route unless you change the AD. Routing Protocols Most routing algorithms can be classified into one of two categories • distance vector • link-state The distance vector routing approach determines the direction (vector) and distance to any link in the internetwork. The link-state approach, also called shortest path first, recreates the exact topology of the entire internetwork Distance-Vector Routing Protocols Distance-vector routing refers to a method for exchanging route information. A router will advertise a route as a vector of direction and distance. Direction refers to a port that leads to the next router along the path to the destination, distance is a metric that indicates the number of hops to the destination. Each router learns routes from its neighbouring routers' perspectives and then advertises the routes from its own perspective. Because each router depends on its neighbours for information, which they in turn may have learned from their neighbours, and so on, distance vector routing is also referred to as "routing by rumour." distance vector routing protocols all send out complete routing tables periodically. (RIP) Routing Information Protocol uses hop count its only metric Cisco's propriety (IGRP) Internet Gateway Routing Protocol includes bandwith and delay when calculating metrics. Problems with Distance -Vector The main problem with distance -vector is that it updates the network step by step so it requires more bandwidth to process the information. More problems include: Routing loops and Counting to infinity. Distance vector algorithms also do not allow a router to know the exact topology of an internetwork as each router only sees its neighbouring routers.
Load more

Recommended publications
  • 5 and 6 Routing DV and LS.Pptx
    1/25/10 NAT: Network Address Translation Advantages: • can change address of devices in local network without notifying outside world • devices inside local net not explicitly addressable by or visible to the outside world (a security plus) Disadvantage: • devices inside local net not explicitly addressable by or visible to the outside world, making peer-to-peer networking that much harder • routers should only process up to layer 3 (port#’s are app layer objects) • address shortage should instead be solved by IPv6, instead NAT hinders the adoption of IPv6 (nothing wrong with that?) Lesson: Be careful what you propose as a “temporary” patch, " “temporary” solutions have a tendency to stay around beyond expiration date “The evil that men do lives after them, " the good is oft interred with their bones.” – Shakespeare, Julius Caesar 1 The Internet Network Layer Host, router network layer functions: Transport layer: TCP, UDP Routing protocols Forwarding protocol (IP) addressing conventions • path selection • datagram format • RIP, OSPF, BGP • Network • packet handling conventions layer forwarding “Signalling” protocol table (ICMP) • error reporting • router “signaling” Link layer: Ethernet, WiFi, SONET, ATM Physical layer: copper, fiber, radio, microwave 2 1 1/25/10 Routing on the Internet Routers on the Internet are store and forward routers: • each incoming packet is buffered • packet’s destination is looked up in the routing table • packet is forwarded to the next hop towards the destination routing algorithm local forwarding table dest
    [Show full text]
  • A Survey on Distance Vector Routing Protocols
    A Survey on Distance Vector Routing Protocols Linpeng Tang,∗ Qin Liu† November 5, 2018 Abstract routing loop and count to infinity (CTI) problem. Be- cause each router only has limited information about In this paper we give a brief introduction to five dif- the network topology, routing loops might emerge ferent distance vector routing protocols (RIP, AODV, and lead to CTI problem, greatly impede the effi- EIGRP, RIP-MTI and Babel) and give some of our ciency of the protocol. In this survey we will see how thoughts on how to solve the count to infinity prob- several distance vector routing protocols have worked lem. Our focus is how distance vector routing proto- to alleviate or solve this problem. Distance vector cols, based on limited information, can prevent rout- routing protocols also suffers from security issues, be- ing loops and the count to infinity problem. cause routing computation is done distributively, a malfunctioning or malicious node may severely affect the whole network. However, in recent years more 1 Introduction secure distance vector routing protocols have been proposed [7].Another critical issue is the support for In computer communication theory relating to routing areas. In reality, large networks are typically packet-switched networks, a distance-vector routing divided into areas to accelerate routing, but distance- protocol is one of the two major classes of routing vector routing protocols don’t support routing areas, protocols, the other major class being the link-state so they are not suitable for really big networks. protocol. A distance-vector routing protocol uses In general, distance vector routing protocols are the Distributed Bellman-Ford algorithm to calculate more suitable for small or median sized networks or paths.[13] when each node only have a limited storage or com- Compared to link-state routing protocols, distance- puting power.
    [Show full text]
  • RFC 8966: the Babel Routing Protocol
    Stream: Internet Engineering Task Force (IETF) RFC: 8966 Obsoletes: 6126, 7557 Category: Standards Track Published: January 2021 ISSN: 2070-1721 Authors: J. Chroboczek D. Schinazi IRIF, University of Paris-Diderot Google LLC RFC 8966 The Babel Routing Protocol Abstract Babel is a loop-avoiding, distance-vector routing protocol that is robust and efficient both in ordinary wired networks and in wireless mesh networks. This document describes the Babel routing protocol and obsoletes RFC 6126 and RFC 7557. Status of This Memo This is an Internet Standards Track document. This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG). Further information on Internet Standards is available in Section 2 of RFC 7841. Information about the current status of this document, any errata, and how to provide feedback on it may be obtained at https://www.rfc-editor.org/info/rfc8966. Copyright Notice Copyright (c) 2021 IETF Trust and the persons identified as the document authors. All rights reserved. This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (https://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Simplified BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Simplified BSD License.
    [Show full text]
  • Understanding Route Redistribution
    Understanding Route Redistribution Franck Le Geoffrey G. Xie Hui Zhang Carnegie Mellon University Naval Postgraduate School Carnegie Mellon University [email protected] [email protected] [email protected] Abstract—Route redistribution (RR) has become an integral option local to a router. It designates the dissemination of part of IP network design as the result of a growing need routing information from one protocol process to another for disseminating certain routes across routing protocol bound- within the same router. For routers in the RIP instance to learn aries. While RR is widely used and resembles BGP in several nontrivial aspects, surprisingly, the safety of RR has not been the prefixes in the OSPF instance, a router (e.g., D or E) needs systematically studied by the networking community. This paper to run both a process of RIP and a process of OSPF and inject presents the first analytical model for understanding the effect the OSPF routes into the RIP instance. of RR on network wide routing dynamics and evaluating the As such, router vendors introduced RR to address a need safety of a specific RR configuration. We first illustrate how from network operations. We recently looked at the configura- easily inaccurate configurations of RR may cause severe routing instabilities, including route oscillations and persistent routing tions of some large university campus networks and found that loops. At the same time, general observations regarding the root RR is indeed widely used. However, contrary to traditional causes of these instabilities are provided. We then introduce a routing protocols, there is no standard or RFC formally formal model based on the general observations to represent defining the functionality of RR.
    [Show full text]
  • Objectives Distance Vector Routing Protocols Characteristics Of
    Objectives Identify the characteristics of distance vector routing protocols. Describe the network discovery process Distance Vector Routing Protocols Identify the conditions leading to a routing loop and explain the implications for router performance. Recognize that distance vector routing Routing Protocols and Concepts– Chapter 4 protocols are in use today 2 ITE PC v4.0 Chapter 1 © 2007 Cisco Systems, Inc. All rights reserved. Cisco Public 1 Distance Vector Routing Protocols Characteristics of Distance Vector routing protocols Examples of Distance Vector routing protocols: Periodic updates Routing Information Protocol (RIP) Neighbors Interior Gateway Routing Protocol (IGRP) Broadcast updates Enhanced IGRP (EIGRP) Entire routing table is included with routing update The meaning of Distance Vector: – A router using distance vector routing protocols knows 2 things: Distance to final destination Vector, or direction, traffic should be 3 4 directed The Routing Algorithm Routing Protocol Characteristics Criteria used to compare routing protocols include: Time to convergence Scalability Resource usage Implementation & maintenance Advantages and Disadvantages of Distance Vector -Simple implementation -Slow convergence and maintenance -Limited scalability -Low resource -Routing loops requirements 5 6 Copyright © 2001, Cisco Systems, Inc. All rights reserved. Printed in USA. Presentation_ID.scr 1 Network Discovery Initial Exchange of Routing Information Router initial start up (Cold Starts) If a routing protocol is configured
    [Show full text]
  • Comparison of RIP, OSPF and EIGRP Routing Protocols Based on OPNET
    ENSC 427: COMMUNICATION NETWORKS SPRING 2014 FINAL PROJECT Comparison of RIP, OSPF and EIGRP Routing Protocols based on OPNET Project Group # 9 http://www.sfu.ca/~sihengw/ENSC427_Group9/ Justin Deng Siheng Wu Kenny Sun 301138281 301153928 301154475 [email protected] [email protected] [email protected] Table of Contents List of Figures………………………………………………………………………….……..….1 Abstract..........................................................................................................................................2 1. Introduction................................................................................................................................3 1.1 Routing Protocol Basics ……….……………………………………...….…………………..3 1.2 Routing Metrics Basics ……………...…..…………………….………………………….….3 1.3 Static Routing and Dynamic Routing ………………………………………………………..3 1.4 Distance Vector and Link State ……………………………………………………………...3 2. Three Routing Protocols………………………………………………….………………..….4 2.1 Routing Information Protocol (RIP) ……….…………………………….…………………...4 2.2 Open Shortest Path First (OSPF)………..…………………….…………………………...….5 2.3 Enhanced Interior Gateway Routing Protocol (EIGRP) …….....……………………………..7 3. OPNET Simulations………………………………………………………………………......8 3.1 Topologies ……………………………….…………………………………………………...8 3.1.1 Mesh Topology ………..………….……………………………………………………....8 3.1.2 Tree Topology ……………………..……………………………………………………...9 3.2 Simulation Setup …………………………………………………………………………….10 3.2.1 Simulation Setup for Failure/Recovery Configuration...........…………………………...10 3.2.2 Simulation Setup for Individual
    [Show full text]
  • A Study of BGP Path Vector Route Looping Behavior
    A Study of BGP Path Vector Route Looping Behavior Dan Pei Xiaoliang Zhao Dan Massey Lixia Zhang UCLA USC/ISI USC/ISI UCLA [email protected] [email protected] [email protected] [email protected] Abstract and policy changes, the interactions between the intra- and inter-domain routing protocols, or even due to subtle im- Measurements have shown evidences of inter-domain plementation details such as the delay between the routing packet forwarding loops in the Internet, but the exact cause table change and the update to the forwarding table which of these loops remains unclear. As one of the efforts in is used to forward packets. A complete understanding of identifying the causes, this paper examines how transient packet looping in the Internet requires an understanding of loops can be created at the inter-domain level via BGP, all the above components and their interactions. As a first and what are the major factors that contribute to duration step in identifying the causes of packet looping in the In- of the routing loops. As a path-vector routing protocol, ternet, this paper solely focuses on understanding routing BGP messages list the entire AS path to each destination loops in path vector routing protocols in general, and in and the path information enables each node to detect, thus BGP in particular. break, arbitrarily long routing loops involving itself. How- Path-vector routing algorithms were designed as an ever, delays due to physical constrains and protocol mecha- improvement over previous distance vector routing algo- nisms slow down routing updates propagation and the rout- rithms.
    [Show full text]
  • What Is Dynamic Routing?
    FortiOS™ Dynamic Routing Guide FortiOS™ Handbook 4.0 MR1 FortiOS Dynamic Routing Guide FortiOS™ Handbook 4.0 MR1 23 February 2010 01-41002-112804-20100223 © Copyright 2010 Fortinet, Inc. All rights reserved. No part of this publication including text, examples, diagrams or illustrations may be reproduced, transmitted, or translated in any form or by any means, electronic, mechanical, manual, optical or otherwise, for any purpose, without prior written permission of Fortinet, Inc. Trademarks Dynamic Threat Prevention System (DTPS), APSecure, FortiASIC, FortiBIOS, FortiBridge, FortiClient, FortiGate®, FortiGate Unified Threat Management System, FortiGuard®, FortiGuard-Antispam, FortiGuard-Antivirus, FortiGuard-Intrusion, FortiGuard-Web, FortiLog, FortiAnalyzer, FortiManager, Fortinet®, FortiOS, FortiPartner, FortiProtect, FortiReporter, FortiResponse, FortiShield, FortiVoIP, and FortiWiFi are trademarks of Fortinet, Inc. in the United States and/or other countries. The names of actual companies and products mentioned herein may be the trademarks of their respective owners. Contents Introduction 9 Before you begin . 9 How this guide is organized . 9 Document conventions . 10 IP addresses . 10 Notes, tips and cautions . 10 Typographical conventions. 10 CLI command syntax conventions . 11 Registering your Fortinet product. 13 Fortinet products End user license agreement . 13 Fortinet documentation . 13 Fortinet Tools and Documentation CD . 13 Fortinet Knowledge Base . 13 Comments on Fortinet technical documentation . 13 Customer service and technical support . 13 Training . 14 Dynamic Routing Overview 15 Routing concepts . 15 Routing in VDOMs . 15 The default route . 16 The routing table . 16 Viewing the routing table in the web-based manager . 17 Viewing the routing table in the CLI . 19 Viewing the routing table with diagnose commands . 20 Searching the routing table .
    [Show full text]
  • An Advanced Approach for Distance Vector Routing Protocol Babel
    Volume 1, Issue 4, December 2013 ISSN: 2320-9984 (Online) International Journal of Modern Engineering & Management Research Website: www.ijmemr.org An Advanced Approach for Distance Vector Routing Protocol Babel Deshraj Ahirwar Mukesh Kumar Dhariwal Assistant Professor Assistant Professor Department of Computer Science & Engineering Department of Computer Science & Engineering University Institute of Technology, RGPV, University Institute of Technology, RGPV, Bhopal (M.P.) [INDIA] Bhopal (M.P.) [INDIA] Email :[email protected] Email : [email protected] Sanjay Kumar Tehariya Abhishek Kesharwani Assistant Professor Assistant Professor Department of Computer Science & Engineering Department of Computer Science & Engineering University Institute of Technology, RGPV, University Institute of Technology, RGPV Bhopal (M.P.) [INDIA] Bhopal (M.P.) [INDIA] Email : [email protected] Email : [email protected] Abstract—This type of protocols maintains the absence of routing pathologies, such as fresh lists of destinations and their routes by routing loops. periodically distributing routing tables throughout the network. The main disadvantages of such algorithms are: Respective amount of data for maintenance. And Slow reaction on restructuring and failures. It is loop-avoidance vector routing protocol. The Babel routing protocol is a distance-vector routing protocol for Internet Protocol packet-switched network that is designed to be robust and efficient on both wireless mesh networks and wired networks. Keywords:—
    [Show full text]
  • IP Routing: Protocol-Independent Configuration Guide, Cisco IOS Release 15S Americas Headquarters Cisco Systems, Inc
    IP Routing: Protocol-Independent Configuration Guide, Cisco IOS Release 15S 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.
    [Show full text]
  • Routing Configuration Guide, Cisco IOS XE Everest 16.5.1A (Catalyst 3850 Switches)
    Routing Configuration Guide, Cisco IOS XE Everest 16.5.1a (Catalyst 3850 Switches) First Published: 2017-05-31 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 © 2017 Cisco Systems, Inc. All rights reserved. CONTENTS CHAPTER 1 Configuring Bidirectional Forwarding Detection 1 Bidirectional Forwarding Detection 1 Finding Feature Information 1 Prerequisites for Bidirectional Forwarding Detection 1 Restrictions for Bidirectional Forwarding Detection 2 Information About Bidirectional Forwarding Detection 2 BFD Operation 2 Benefits of Using BFD for Failure Detection 5 How to Configure Bidirectional Forwarding Detection 5 Configuring BFD Session Parameters on the Interface 5 Configuring BFD Support for Dynamic Routing Protocols 7 Configuring BFD Support for Static Routing 17 Configuring BFD Echo Mode 19 Creating and Configuring BFD Templates 20 Monitoring and Troubleshooting BFD 21 Feature Information for Bidirectional Forwarding Detection 22 CHAPTER 2 Configuring MSDP 23 Finding Feature Information 23 Information About Configuring MSDP 23 MSDP Overview 24 MSDP Operation 24 MSDP Benefits 25 How to Configure MSDP 26 Default MSDP Configuration 26 Configuring a Default MSDP Peer 26 Routing Configuration Guide, Cisco IOS XE Everest 16.5.1a (Catalyst 3850 Switches) iii Contents Caching Source-Active State 28 Controlling Source Information that Your Switch Originates 29 Redistributing Sources 30 Filtering Source-Active Request Messages
    [Show full text]
  • Cisco − Redistributing Routing Protocols Table of Contents
    Cisco − Redistributing Routing Protocols Table of Contents Redistributing Routing Protocols......................................................................................................................1 Introduction.............................................................................................................................................1 Prerequisites............................................................................................................................................1 Requirements....................................................................................................................................1 Components Used.............................................................................................................................1 Conventions......................................................................................................................................2 Metrics....................................................................................................................................................2 Administrative Distance..........................................................................................................................2 Redistribution Configuration Syntax and Examples..............................................................................4 IGRP and EIGRP..............................................................................................................................4 OSPF................................................................................................................................................5
    [Show full text]