DOCSLIB.ORG

Routing Configuration Guide, Cisco IOS XE Everest 16.5.1A (Catalyst 3850 Switches)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read 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 32 Controlling Source Information that Your Switch Forwards 34 Using a Filter 34 Using TTL to Limit the Multicast Data Sent in SA Messages 36 Controlling Source Information that Your Switch Receives 37 Configuring an MSDP Mesh Group 39 Shutting Down an MSDP Peer 40 Including a Bordering PIM Dense-Mode Region in MSDP 41 Configuring an Originating Address other than the RP Address 43 Monitoring and Maintaining MSDP 44 Configuration Examples for Configuring MSDP 45 Configuring a Default MSDP Peer: Example 45 Caching Source-Active State: Example 46 Controlling Source Information that Your Switch Originates: Example 46 Controlling Source Information that Your Switch Forwards: Example 46 Controlling Source Information that Your Switch Receives: Example 46 Feature Information for Multicast Source Discovery Protocol 46 CHAPTER 3 Configuring IP Unicast Routing 47 Finding Feature Information 48 Information About Configuring IP Unicast Routing 48 Information About IP Routing 48 Types of Routing 49 IP Routing and Switch Stacks 50 Classless Routing 51 Address Resolution 52 Proxy ARP 53 ICMP Router Discovery Protocol 53 UDP Broadcast Packets and Protocols 54 Broadcast Packet Handling 54 IP Broadcast Flooding 54 Routing Configuration Guide, Cisco IOS XE Everest 16.5.1a (Catalyst 3850 Switches) iv Contents How to Configure IP Routing 55 How to Configure IP Addressing 56 Default IP Addressing Configuration 56 Assigning IP Addresses to Network Interfaces 58 Using Subnet Zero 59 Disabling Classless Routing 60 Configuring Address Resolution Methods 61 Defining a Static ARP Cache 61 Setting ARP Encapsulation 63 Enabling Proxy ARP 64 Routing Assistance When IP Routing is Disabled 65 Proxy ARP 65 Default Gateway 65 ICMP Router Discovery Protocol (IRDP) 66 Configuring Broadcast Packet Handling 68 Enabling Directed Broadcast-to-Physical Broadcast Translation 69 Forwarding UDP Broadcast Packets and Protocols 70 Establishing an IP Broadcast Address 72 Flooding IP Broadcasts 73 Monitoring and Maintaining IP Addressing 74 How to Configure IP Unicast Routing 75 Enabling IP Unicast Routing 75 Example of Enabling IP Routing 76 What to Do Next 76 Information About RIP 77 Summary Addresses and Split Horizon 77 How to Configure RIP 78 Default RIP Configuration 78 Configuring Basic RIP Parameters 78 Configuring RIP Authentication 81 Configuring Summary Addresses and Split Horizon 82 Configuring Split Horizon 84 Configuration Example for Summary Addresses and Split Horizon 85 Information About OSPF 86 Routing Configuration Guide, Cisco IOS XE Everest 16.5.1a (Catalyst 3850 Switches) v Contents OSPF Nonstop Forwarding 86 OSPF NSF Awareness 87 OSPF NSF Capability 87 OSPF Area Parameters 87 Other OSPF Parameters 88 LSA Group Pacing 89 Loopback Interfaces 89 How to Configure OSPF 89 Default OSPF Configuration 89 Configuring Basic OSPF Parameters 91 Configuring OSPF Interfaces 92 Configuring OSPF Area Parameters 95 Configuring Other OSPF Parameters 96 Changing LSA Group Pacing 98 Configuring a Loopback Interface 99 Monitoring OSPF 100 Configuration Examples for OSPF 101 Example: Configuring Basic OSPF Parameters 101 Information About EIGRP 101 EIGRP Features 102 EIGRP Components 102 EIGRP Nonstop Forwarding 103 EIGRP NSF Awareness 103 EIGRP NSF Capability 103 EIGRP Stub Routing 104 How to Configure EIGRP 105 Default EIGRP Configuration 105 Configuring Basic EIGRP Parameters 107 Configuring EIGRP Interfaces 109 Configuring EIGRP Route Authentication 110 Monitoring and Maintaining EIGRP 112 Information About BGP 112 BGP Network Topology 113 Nonstop Forwarding Awareness 114 Routing Configuration Guide, Cisco IOS XE Everest 16.5.1a (Catalyst 3850 Switches) vi Contents Information About BGP Routing 114 Routing Policy Changes 115 BGP Decision Attributes 115 Route Maps 117 BGP Filtering 117 Prefix List for BGP Filtering 117 BGP Community Filtering 117 BGP Neighbors and Peer Groups 118 Aggregate Routes 118 Routing Domain Confederations 118 BGP Route Reflectors 119 Route Dampening 119 More BGP Information 119 How to Configure BGP 120 Default BGP Configuration 120 Enabling BGP Routing 123 Managing Routing Policy Changes 125 Configuring BGP Decision Attributes 126 Configuring BGP Filtering with Route Maps 128 Configuring BGP Filtering by Neighbor 129 Configuring BGP Filtering by Access Lists and Neighbors 130 Configuring Prefix Lists for BGP Filtering 131 Configuring BGP Community Filtering 133 Configuring BGP Neighbors and Peer Groups 134 Configuring Aggregate Addresses in a Routing Table 137 Configuring Routing Domain Confederations 138 Configuring BGP Route Reflectors 139 Configuring Route Dampening 141 Monitoring and Maintaining BGP 142 Configuration Examples for BGP 143 Example: Configuring BGP on Routers 143 Information About ISO CLNS Routing 144 Connectionless Routing 144 Information About IS-IS Routing 145 Routing Configuration Guide, Cisco IOS XE Everest 16.5.1a (Catalyst 3850 Switches) vii Contents Nonstop Forwarding Awareness 146 IS-IS Global Parameters 146 IS-IS Interface Parameters 146 How to Configure ISO CLNS Routing 147 Default IS-IS Configuration 147 Enabling IS-IS Routing 149 Configuring IS-IS Global Parameters 151 Configuring IS-IS Interface Parameters 155 Monitoring and Maintaining ISO IGRP and IS-IS 157 Configuration Examples for ISO CLNS Routing 159 Example: Configuring IS-IS Routing 159 Information About Multi-VRF CE 159 Understanding Multi-VRF CE 160 Network Topology 160 Packet-Forwarding Process 161 Network Components 161 VRF-Aware Services 162 How to Configure Multi-VRF CE 162 Default Multi-VRF CE Configuration 162 Multi-VRF CE Configuration Guidelines 163 Configuring VRFs 163 Configuring VRF-Aware Services 165 Configuring VRF-Aware Services for ARP 165 Configuring VRF-Aware Services for Ping 166 Configuring VRF-Aware Services for SNMP 166 Configuring VRF-Aware Servcies for uRPF 167 Configuring VRF-Aware RADIUS 168 Configuring VRF-Aware Services for Syslog 168 Configuring VRF-Aware Services for Traceroute 169 Configuring VRF-Aware Services for FTP and TFTP 170 Configuring Multicast VRFs 171 Configuring a VPN Routing Session 173 Configuring BGP PE to CE Routing Sessions 174 Monitoring Multi-VRF CE 175 Routing Configuration Guide, Cisco IOS XE Everest 16.5.1a (Catalyst 3850 Switches) viii Contents Configuration Examples for Multi-VRF CE 176 Multi-VRF CE Configuration Example 176 Configuring Unicast Reverse Path Forwarding 179 Protocol-Independent Features 180 Distributed Cisco Express Forwarding 180 Information About Cisco Express Forwarding 180 How to Configure Cisco Express Forwarding 180 Load-Balancing Scheme for Cisco Express Forwarding Traffic 182 Restrictions for Cisco Express Forwarding Load-Balancing 182 Cisco Express Forwarding Load-Balancing Overview 182 Per-Destination Load Balancing 182 Load-Balancing Algorithms for Cisco Express Forwarding Traffic 183 How to Configure a Load-Balancing for Cisco Express Forwarding Traffic 183 Configuration Examples for Cisco Express Forwarding Traffic Load-Balancing 185 Number of Equal-Cost Routing Paths 185 Information About Equal-Cost Routing Paths 185 How to Configure Equal-Cost Routing Paths 186 Static Unicast Routes 186 Information About Static Unicast Routes 186 Configuring Static Unicast Routes 187 Default Routes and Networks 188 Information About Default Routes and Networks 188 How to Configure Default Routes and Networks 189 Route Maps to Redistribute Routing Information 190 Information About Route Maps 190 How to Configure a Route Map 190 How to Control Route Distribution 194 Policy-Based Routing 196 Information About Policy-Based Routing 196 How to Configure PBR 197 Filtering Routing Information 200 Setting Passive Interfaces 200 Controlling Advertising and Processing in Routing Updates 201 Filtering Sources of Routing Information 202 Routing Configuration Guide, Cisco IOS XE Everest 16.5.1a (Catalyst 3850 Switches) ix Contents Managing Authentication Keys 203 Prerequisites 203 How to Configure Authentication Keys 204 Monitoring and Maintaining the IP Network
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]
  • 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]
  • Routing Loop
    Routing loop A routing loop is a common problem with various types of networks, particularly computer networks. They are formed when an error occurs in the operation of the routing algorithm, and as a result, in a group of nodes, the path to a particular destination forms a loop. In the simplest version, a routing loop of size two, node A thinks that the path to some destination (call it C) is through its neighbouring node, node B. At the same time, node B thinks that the path to C starts at node A. Thus, whenever traffic for C arrives at either A or B, it will loop endlessly between A and B, unless some mechanism exists to prevent that behaviour. How a routing loop can form For example, in this illustration, node A is transmitting data to node C via node B. If the link between nodes B and C goes down and B has not yet informed node A about the breakage, node A transmits the data to node B assuming that the link A-B-C is operational and of lowest cost. Node B knows of the broken link and tries to reach node C via node A, thus sending the original data back to node A. Furthermore, node A receives the data that it originated back from node B and consults its routing table. Node A's routing table will say that it can reach node C via node B (because it still has not been informed of the break) thus sending its data Broken network back to node B creating an infinite loop.
    [Show full text]