Redistribution is necessary when routing protocols connect and must pass routes between the two.
Route Redistribution involves placing the routes learned from one routing domain, such as RIP, into
another routing domain, such as EIGRP.
While running a single routing protocol throughout your entire IP internetwork is desirable, multiprotocol routing is common for a number of reasons, such as company mergers, multiple departments
managed by multiple network administrators, and multi-vendor environments. Running different
routing protocols is often part of a network design.
BGP is the exterior gateway protocol that connects different autonomous systems on the internet. It allows for the exchange of routing and reachability information between these systems. BGP operates using a finite state machine to manage the states of connections between peers. It establishes TCP connections between routers to exchange routing updates and keep connections alive through regular keepalive messages. BGP version 4, defined in RFC 4271, is the current standard implementation which supports features like classless inter-domain routing and route aggregation.
Open Shortest Path First (OSPF) is an interior gateway protocol that uses link state routing and the Dijkstra algorithm to calculate the shortest path to destinations within an autonomous system. It elects a Designated Router to generate network link advertisements and assist in database synchronization between routers. Routers run the Shortest Path First algorithm on their link state databases to determine the best routes and populate their routing tables.
Tunneling provides a mechanism to transport packets of one protocol within another protocol. The
protocol that is carried is called as the passenger protocol, and the protocol that is used for carrying the
passenger protocol is called as the transport protocol. Generic Routing Encapsulation (GRE) is one of the
available tunneling mechanisms which uses IP as the transport protocol and can be used for carrying
many different passenger protocols. The tunnels behave as virtual point-to-point links that have two
endpoints identified by the tunnel source and tunnel destination addresses at each endpoint.
MPLS enables packets to be forwarded based on labels rather than IP addresses. PE routers add labels to incoming packets and remove labels from outgoing packets. P routers swap or pop labels to forward packets. MPLS with L3 VPN allows private networks in different locations to communicate securely over a shared infrastructure by associating routes with virtual routing instances (VRFs) and advertising them using BGP. An example configuration shows VRF and BGP configuration, along with commands to view MPLS label bindings and packet forwarding information.
BFD is a protocol that can quickly detect failures in the forwarding path between two adjacent routers, including interfaces, data links, and forwarding planes. It operates in two modes: asynchronous mode where it periodically sends control packets, and demand mode where it only sends packets when needed. When a failure is detected, BFD triggers routing protocol actions to recalculate the routing table and reduce convergence time. It provides fast failure detection independently of media, encapsulation, topology, or routing protocol. Configuring BFD involves setting intervals at the interface level and enabling it for routing protocols.
BGP is the exterior gateway protocol that connects different autonomous systems on the internet. It allows for the exchange of routing and reachability information between these systems. BGP operates using a finite state machine to manage the states of connections between peers. It establishes TCP connections between routers to exchange routing updates and keep connections alive through regular keepalive messages. BGP version 4, defined in RFC 4271, is the current standard implementation which supports features like classless inter-domain routing and route aggregation.
Open Shortest Path First (OSPF) is an interior gateway protocol that uses link state routing and the Dijkstra algorithm to calculate the shortest path to destinations within an autonomous system. It elects a Designated Router to generate network link advertisements and assist in database synchronization between routers. Routers run the Shortest Path First algorithm on their link state databases to determine the best routes and populate their routing tables.
Tunneling provides a mechanism to transport packets of one protocol within another protocol. The
protocol that is carried is called as the passenger protocol, and the protocol that is used for carrying the
passenger protocol is called as the transport protocol. Generic Routing Encapsulation (GRE) is one of the
available tunneling mechanisms which uses IP as the transport protocol and can be used for carrying
many different passenger protocols. The tunnels behave as virtual point-to-point links that have two
endpoints identified by the tunnel source and tunnel destination addresses at each endpoint.
MPLS enables packets to be forwarded based on labels rather than IP addresses. PE routers add labels to incoming packets and remove labels from outgoing packets. P routers swap or pop labels to forward packets. MPLS with L3 VPN allows private networks in different locations to communicate securely over a shared infrastructure by associating routes with virtual routing instances (VRFs) and advertising them using BGP. An example configuration shows VRF and BGP configuration, along with commands to view MPLS label bindings and packet forwarding information.
BFD is a protocol that can quickly detect failures in the forwarding path between two adjacent routers, including interfaces, data links, and forwarding planes. It operates in two modes: asynchronous mode where it periodically sends control packets, and demand mode where it only sends packets when needed. When a failure is detected, BFD triggers routing protocol actions to recalculate the routing table and reduce convergence time. It provides fast failure detection independently of media, encapsulation, topology, or routing protocol. Configuring BFD involves setting intervals at the interface level and enabling it for routing protocols.
The chapter discusses IP routing and routing protocols. It explains the goals of routing which include stability, robustness, dynamic path updates, and secure information transmission. It also covers routing metrics, interior and exterior routing protocols, static and dynamic routing, routing tables, and the Routing Information Protocol (RIP). RIP uses hop count as its metric and supports up to 15 hops between routers. Enhancements in RIPv2 include multicast updates, triggered updates, classless operation, and authentication.
This document provides an overview of the Open Shortest Path First (OSPF) routing protocol. It describes OSPF's message encapsulation, packet types, neighbor discovery process using Hello packets, link state database and shortest path first algorithm, metric and cost calculation, and mechanisms for handling multi-access networks like designated router election. The objectives are to describe OSPF configuration and troubleshooting.
EIGRP is a proprietary routing protocol developed by Cisco that uses a composite metric and has fast convergence properties. It functions as a hybrid of distance-vector and link-state routing protocols, sending subnet mask and VLSM information in updates. EIGRP forms neighbor relationships through periodic hello messages and establishes three key tables - Neighbor, Topology, and Routing - to store neighbor, route, and best path information. It utilizes five packet types and reliable transport to efficiently share routing updates.
- OSPF is a link-state routing protocol that was developed in 1991 as an improvement over the distance vector routing protocol RIP. It is based on the Bellman-Ford algorithm.
- OSPF networks can be divided into sub-domains called areas. Areas limit the scope of route information distribution and reduce the number of routes that need to be propagated. All routers within an area must be connected.
- The backbone area, with an ID of 0.0.0.0, acts as a hub that connects all other areas and distributes routing information between them. It must remain continuously connected.
In this webinar, we cover how Border Gateway Protocol works. Starting from key concepts, you'll learn about Autonomous Systems, the BGP protocol, AS Path, learning and advertising routes, RIBs and route selection. See the webinar recording at https://www.thousandeyes.com/webinars/how-bgp-works
ARP resolves IP addresses to MAC addresses for local network delivery. It uses broadcast datagrams to request MAC addresses and unicasts to reply. Proxy ARP allows routers to answer for hosts on remote networks during subnet transition. RARP and Inverse ARP work in reverse to resolve MAC addresses to IP addresses.
This document discusses the Spanning Tree Protocol (STP) which provides a loop-free network topology by placing ports into blocking states. It describes how STP elects a root bridge, establishes root and designated ports, and transitions ports between blocking and forwarding states. The document also introduces Rapid Spanning Tree Protocol which speeds up STP's recalculation of the spanning tree when the network topology changes.
- Open Shortest Path First (OSPF) is a link-state routing protocol that can be used for both small and large networks. It uses areas and hierarchical network design to reduce routing overhead and improve performance as the network scales.
- OSPF establishes neighbor relationships to exchange routing information. It elects a Designated Router and Backup Designated Router to optimize this exchange on multi-access networks. Link-state databases are synchronized between neighbors to calculate the shortest paths.
- Basic OSPF configuration involves enabling OSPF on interfaces and networks, setting authentication, and adjusting metrics and timers. Loopback interfaces ensure router IDs remain stable. Verification commands display neighbor relationships and routing tables.
The document discusses OSPF link-state routing protocol. It describes OSPF's use of link-state databases containing topology information and Dijkstra's algorithm to calculate the shortest path to all destinations. It also explains OSPF's hierarchical area-based network structure and use of link-state advertisements to exchange routing information between neighbors.
NAT maps private IP addresses to public IP addresses, allowing multiple devices on a private network to share a single public IP address to access the Internet. It is commonly used when there is a shortage of IPv4 addresses. There are different types of NAT, including dynamic NAT which maps private addresses to public addresses on a need basis, and NAPT which allows thousands of devices to share one IP address by also mapping port numbers. NAT solves issues like merging networks with duplicate private addresses and changing ISPs without renumbering an entire network.
Dynamic routing protocols have several advantages over static routing, including not requiring knowledge of destination networks and automatically updating topology changes. RIP, OSPF, and EIGRP are examples of dynamic interior gateway protocols (IGPs) that are commonly used within autonomous systems to exchange routing information between neighbor routers. EIGRP is a proprietary Cisco protocol that has fast convergence and includes features from both distance vector and link state routing protocols.
This document provides an overview of different routing protocols. It discusses IP routing, static routing, and dynamic routing. It also covers proactive routing protocols like DSDV which maintain routing tables and periodically update them. Reactive protocols like DSR and AODV establish routes on demand. Hybrid protocols combine proactive and reactive approaches. The document describes the key processes, advantages, and disadvantages of DSDV, DSR, AODV, and zone routing protocol.
This document provides an overview of EtherChannel concepts and configuration. EtherChannel allows linking multiple physical Ethernet ports together to form a single logical trunk with increased bandwidth. It uses protocols like PAgP and LACP to dynamically establish and maintain EtherChannel bundles. EtherChannel load balances traffic across physical ports and treats the bundle as a single logical port for functions like spanning tree. The document outlines terminology, configuration, verification commands, and considerations for optimizing EtherChannel deployment.
This document provides an overview of the Enhanced Interior Gateway Routing Protocol (EIGRP). It describes the history and development of EIGRP, its basic operation and components, including reliable transport protocol, packet types, neighbor discovery via hello packets, and route updates using the diffusing update algorithm. It also covers basic EIGRP configuration such as enabling it with the router eigrp command, advertising networks, and verifying neighbor relationships.
This document discusses layer 2 switching and VLANs. It begins by explaining how switching breaks up large collision domains into smaller ones by creating individual collision domains per switch port. It then discusses how VLANs allow further segmentation of the network by logically grouping ports regardless of their physical location. VLANs create separate broadcast domains to limit broadcast traffic to specific groups of users. The document provides examples of creating, assigning ports to, and deleting VLANs on a switch to segmented the network.
EtherChannel allows grouping multiple physical Ethernet links into a single logical link to provide fault tolerance and increased bandwidth. Key points for configuration include using the same port types, speed and duplex settings across all ports in the channel. Settings like VLAN lists and STP settings must also be consistent. Layer 3 EtherChannel requires assigning an IP to the port-channel interface, while Layer 2 only requires adding the physical ports to the channel group. Verification can be done with show commands.
DHCP (Dynamic Host Configuration Protocol) is a protocol that automatically provides IP hosts with IP addresses and other configuration information from a DHCP server. It uses UDP and works by having clients broadcast discover messages to locate servers, which respond with offer messages containing IP addresses and configuration options. Servers then acknowledge address assignments, while also allowing reservations of specific addresses and exclusions of certain ranges. Windows Server backs up the DHCP database and configuration every 60 minutes for restoration using the netsh command.
Border Gateway Protocol (BGP) is a standardized exterior gateway protocol designed to exchange routing and reachability information among autonomous systems (AS) on the Internet.
This document provides an overview of routing concepts and protocols. It discusses the basic components of routing including algorithms, databases, and protocols. It describes different routing algorithm types such as static, distance vector, and link state. Specific routing protocols covered include RIP, OSPF, and BGP. It also discusses routing within autonomous systems and between autonomous systems on the internet.
The document discusses spanning tree protocol (STP) which is used to prevent loops and enable redundancy in switched networks. STP designates one switch as the root bridge and elects root ports and designated ports to block ports and create a loop-free topology. STP also defines port states like forwarding, blocking, listening and learning. Rapid spanning tree protocol (RSTP) was introduced to improve upon STP by providing faster convergence when the network topology changes.
1. The document describes configuring EIGRP routing on a network topology. This includes configuring EIGRP routing processes and interfaces, modifying timers, enabling authentication, adjusting metrics, ensuring all routes are learned, implementing route summarization, and filtering routes.
2. Key tasks are configuring EIGRP routing processes on each router with associated networks, changing timers on EIGRP process 200, enabling MD5 authentication between R4 and R5, adjusting metrics for EIGRP 100, redistributing between EIGRP processes, and summarizing loopback routes on R5 and R7.
3. The solution provides the configuration commands needed to complete each task, such as enabling EIGRP routing on
The chapter discusses IP routing and routing protocols. It explains the goals of routing which include stability, robustness, dynamic path updates, and secure information transmission. It also covers routing metrics, interior and exterior routing protocols, static and dynamic routing, routing tables, and the Routing Information Protocol (RIP). RIP uses hop count as its metric and supports up to 15 hops between routers. Enhancements in RIPv2 include multicast updates, triggered updates, classless operation, and authentication.
This document provides an overview of the Open Shortest Path First (OSPF) routing protocol. It describes OSPF's message encapsulation, packet types, neighbor discovery process using Hello packets, link state database and shortest path first algorithm, metric and cost calculation, and mechanisms for handling multi-access networks like designated router election. The objectives are to describe OSPF configuration and troubleshooting.
EIGRP is a proprietary routing protocol developed by Cisco that uses a composite metric and has fast convergence properties. It functions as a hybrid of distance-vector and link-state routing protocols, sending subnet mask and VLSM information in updates. EIGRP forms neighbor relationships through periodic hello messages and establishes three key tables - Neighbor, Topology, and Routing - to store neighbor, route, and best path information. It utilizes five packet types and reliable transport to efficiently share routing updates.
- OSPF is a link-state routing protocol that was developed in 1991 as an improvement over the distance vector routing protocol RIP. It is based on the Bellman-Ford algorithm.
- OSPF networks can be divided into sub-domains called areas. Areas limit the scope of route information distribution and reduce the number of routes that need to be propagated. All routers within an area must be connected.
- The backbone area, with an ID of 0.0.0.0, acts as a hub that connects all other areas and distributes routing information between them. It must remain continuously connected.
In this webinar, we cover how Border Gateway Protocol works. Starting from key concepts, you'll learn about Autonomous Systems, the BGP protocol, AS Path, learning and advertising routes, RIBs and route selection. See the webinar recording at https://www.thousandeyes.com/webinars/how-bgp-works
ARP resolves IP addresses to MAC addresses for local network delivery. It uses broadcast datagrams to request MAC addresses and unicasts to reply. Proxy ARP allows routers to answer for hosts on remote networks during subnet transition. RARP and Inverse ARP work in reverse to resolve MAC addresses to IP addresses.
This document discusses the Spanning Tree Protocol (STP) which provides a loop-free network topology by placing ports into blocking states. It describes how STP elects a root bridge, establishes root and designated ports, and transitions ports between blocking and forwarding states. The document also introduces Rapid Spanning Tree Protocol which speeds up STP's recalculation of the spanning tree when the network topology changes.
- Open Shortest Path First (OSPF) is a link-state routing protocol that can be used for both small and large networks. It uses areas and hierarchical network design to reduce routing overhead and improve performance as the network scales.
- OSPF establishes neighbor relationships to exchange routing information. It elects a Designated Router and Backup Designated Router to optimize this exchange on multi-access networks. Link-state databases are synchronized between neighbors to calculate the shortest paths.
- Basic OSPF configuration involves enabling OSPF on interfaces and networks, setting authentication, and adjusting metrics and timers. Loopback interfaces ensure router IDs remain stable. Verification commands display neighbor relationships and routing tables.
The document discusses OSPF link-state routing protocol. It describes OSPF's use of link-state databases containing topology information and Dijkstra's algorithm to calculate the shortest path to all destinations. It also explains OSPF's hierarchical area-based network structure and use of link-state advertisements to exchange routing information between neighbors.
NAT maps private IP addresses to public IP addresses, allowing multiple devices on a private network to share a single public IP address to access the Internet. It is commonly used when there is a shortage of IPv4 addresses. There are different types of NAT, including dynamic NAT which maps private addresses to public addresses on a need basis, and NAPT which allows thousands of devices to share one IP address by also mapping port numbers. NAT solves issues like merging networks with duplicate private addresses and changing ISPs without renumbering an entire network.
Dynamic routing protocols have several advantages over static routing, including not requiring knowledge of destination networks and automatically updating topology changes. RIP, OSPF, and EIGRP are examples of dynamic interior gateway protocols (IGPs) that are commonly used within autonomous systems to exchange routing information between neighbor routers. EIGRP is a proprietary Cisco protocol that has fast convergence and includes features from both distance vector and link state routing protocols.
This document provides an overview of different routing protocols. It discusses IP routing, static routing, and dynamic routing. It also covers proactive routing protocols like DSDV which maintain routing tables and periodically update them. Reactive protocols like DSR and AODV establish routes on demand. Hybrid protocols combine proactive and reactive approaches. The document describes the key processes, advantages, and disadvantages of DSDV, DSR, AODV, and zone routing protocol.
This document provides an overview of EtherChannel concepts and configuration. EtherChannel allows linking multiple physical Ethernet ports together to form a single logical trunk with increased bandwidth. It uses protocols like PAgP and LACP to dynamically establish and maintain EtherChannel bundles. EtherChannel load balances traffic across physical ports and treats the bundle as a single logical port for functions like spanning tree. The document outlines terminology, configuration, verification commands, and considerations for optimizing EtherChannel deployment.
This document provides an overview of the Enhanced Interior Gateway Routing Protocol (EIGRP). It describes the history and development of EIGRP, its basic operation and components, including reliable transport protocol, packet types, neighbor discovery via hello packets, and route updates using the diffusing update algorithm. It also covers basic EIGRP configuration such as enabling it with the router eigrp command, advertising networks, and verifying neighbor relationships.
This document discusses layer 2 switching and VLANs. It begins by explaining how switching breaks up large collision domains into smaller ones by creating individual collision domains per switch port. It then discusses how VLANs allow further segmentation of the network by logically grouping ports regardless of their physical location. VLANs create separate broadcast domains to limit broadcast traffic to specific groups of users. The document provides examples of creating, assigning ports to, and deleting VLANs on a switch to segmented the network.
EtherChannel allows grouping multiple physical Ethernet links into a single logical link to provide fault tolerance and increased bandwidth. Key points for configuration include using the same port types, speed and duplex settings across all ports in the channel. Settings like VLAN lists and STP settings must also be consistent. Layer 3 EtherChannel requires assigning an IP to the port-channel interface, while Layer 2 only requires adding the physical ports to the channel group. Verification can be done with show commands.
DHCP (Dynamic Host Configuration Protocol) is a protocol that automatically provides IP hosts with IP addresses and other configuration information from a DHCP server. It uses UDP and works by having clients broadcast discover messages to locate servers, which respond with offer messages containing IP addresses and configuration options. Servers then acknowledge address assignments, while also allowing reservations of specific addresses and exclusions of certain ranges. Windows Server backs up the DHCP database and configuration every 60 minutes for restoration using the netsh command.
Border Gateway Protocol (BGP) is a standardized exterior gateway protocol designed to exchange routing and reachability information among autonomous systems (AS) on the Internet.
This document provides an overview of routing concepts and protocols. It discusses the basic components of routing including algorithms, databases, and protocols. It describes different routing algorithm types such as static, distance vector, and link state. Specific routing protocols covered include RIP, OSPF, and BGP. It also discusses routing within autonomous systems and between autonomous systems on the internet.
The document discusses spanning tree protocol (STP) which is used to prevent loops and enable redundancy in switched networks. STP designates one switch as the root bridge and elects root ports and designated ports to block ports and create a loop-free topology. STP also defines port states like forwarding, blocking, listening and learning. Rapid spanning tree protocol (RSTP) was introduced to improve upon STP by providing faster convergence when the network topology changes.
1. The document describes configuring EIGRP routing on a network topology. This includes configuring EIGRP routing processes and interfaces, modifying timers, enabling authentication, adjusting metrics, ensuring all routes are learned, implementing route summarization, and filtering routes.
2. Key tasks are configuring EIGRP routing processes on each router with associated networks, changing timers on EIGRP process 200, enabling MD5 authentication between R4 and R5, adjusting metrics for EIGRP 100, redistributing between EIGRP processes, and summarizing loopback routes on R5 and R7.
3. The solution provides the configuration commands needed to complete each task, such as enabling EIGRP routing on
For some very basic VRF configuration follow the steps:
1. Enters VRF configuration mode and assigns a VRF name.
Router(config)#ip vrf vrf-name
2. Creates a VPN route distinguisher (RD) following one of the 16bit-ASN:32bit-number or 32bitIP:16bit-number explained above
Router(config-vrf)#rd route-distinguisher
3. Creates a list of import and/or export route target communities for the specified VRF.
Router(config-vrf)# route-target {import | export | both} route-distinguisher
4. (Optional step) Associates the specified route map with the VRF.
Router(config-vrf)# import map route-map
A network consists of a collection of computers, printers and other compatible equipment/ hardware
that is connected together so that they can communicate with each other.
The document provides the configuration steps to complete an IPv6 lab topology including:
1. Configure routing protocols EIGRP, OSPF, and RIP on each router as specified in the topology.
2. Enable tunneling between IPv6 and IPv4 interfaces to allow communication across the different address families.
3. Configure specific routing protocols over the tunnels, including EIGRP 111 between R4 and R5 and RIP between R2 and R6.
4. Redistribute routes between protocols to ensure all routers receive routes from each other protocol.
The document provides instructions for configuring IPv6 on a network topology. It includes tasks to configure IPv6 addresses on routers, configure Frame-Relay over IPv6, assign IPv6 addresses to routers through autoconfiguration, and configure OSPF routing between the routers.
A VPN (Virtual Private Network) extends a private network across a public network, such as the
Internet.
A VPN is a network that uses a public telecommunication infrastructure, such as the Internet, to provide
remote offices or individual users with secure access to their organization's network. A VPN ensures
privacy through security procedures and tunneling protocols such as the Layer Two Tunneling Protocol
(L2TP). Data is encrypted at the sending end and decrypted at the receiving end.
Networking Devices are units that mediate data in a computer network and are also called network equipment. Units which are the last receiver or generate data are called hosts or data terminal equipment.
Wireless networks come in many different forms, cover various distances, and provide a range of low to
high bandwidth depending on the type installed. Wireless LAN – Wireless LAN enable Laptop users to
access the Network of a company.
Here are the key steps to configure RIPv2 on Router1:
1. Enter configuration mode:
Router1> enable
Router1# configure terminal
2. Configure the FastEthernet 0/0 interface:
Router1(config)# interface FastEthernet 0/0
Router1(config-if)# ip address 192.168.12.1 255.255.255.0
Router1(config-if)# no shutdown
3. Configure the Serial 0/0 interface:
Router1(config-if)# interface Serial 0/0
Router1(config-if)# ip address 192.168.23.1 255.255.255.252
Router1(config-if
IP Address is a unique identification given to Host, network device, server for data communication. IP
Address stand for Internet Protocol address, it is an addressing scheme used to identify a system on a
network. It is a unique address that certain electronic devices currently use to communicate with each
other on a network using internet protocol.
TCP Intercept was developed to protect servers and other resources from Denial-of-Service (DoS)
attacks, specifically TCP SYN attacks.
Just as the name says, TCP Intercept captures incoming TCP requests. Instead of allowing direct access
to the server, TCP Intercept acts as an intermediary, establishing a connection to the server on behalf of
the requesting client.
TCP Intercept will block a client if too many incoming connections are attempted.
Spanning Tree Protocol (STP) resolves physically redundant topologies into loop-free, tree-like
topologies. The biggest issue with STP is that some hardware failures can cause it to fail. This failure
creates forwarding loops (or STP loops). Major network outages are caused by STP loops.
The loop guard STP feature that is intended to improve the stability of the Layer 2 networks. This
document also describes Bridge Protocol Data Unit (BPDU) skew detection. BPDU skew detection is a
diagnostic feature that generates syslog messages when BPDUs are not received in time.
A Routed Protocol is used to deliver application traffic. It provides appropriate addressing information in
its Internet Layer (Network Layer) addressing to allow a packet to be forwarded from one network to
another. Routed Protocols are nothing more than data being transported across the networks.
Internet Protocol version 6 (IPv6) is the latest version of the
Internet Protocol (IP), the communications protocol that
provides an identification and location system for computers
on networks and routes traffic across the Internet.
IPv4 & IPv6 are not designed to be interoperable, complicating
the transition to IPv6. However, several IPv6 transition
mechanisms have been devised to permit communication
between IPv4 and IPv6 hosts.
Cisco Internetworking Operating System (ios)Netwax Lab
Cisco IOS (originally Internetwork Operating
System) is software used on most Cisco Systems
routers and current Cisco network switches.
(Earlier switches ran CatOS.) IOS is a package of
routing, switching, internetworking and
telecommunications functions integrated into a
multitasking operating system.
In computer networking, a single layer-2 network may be partitioned to create multiple distinct
broadcast domains, which are mutually isolated so that packets can only pass between them via one or
more routers; such a domain is referred to as a virtual local area network, virtual LAN or VLAN.
A virtual local area network (VLAN) is a logical group of workstations, servers and network devices that
appear to be on the same LAN despite their geographical distribution. A VLAN allows a network of
computers and users to communicate in a simulated environment as if they exist in a single LAN and are
sharing a single broadcast and multicast domain.
The document discusses redistributing routes between routing protocols. It provides configuration examples of redistributing OSPF routes into EIGRP on router R1. The key command for redistribution is "redistribute" in router configuration mode. Metrics are also configured on R1 using the "default-metric" command to redistribute OSPF routes into EIGRP.
Redistribution into EIGRP(Exterior & Interior gateway Routing protocol)lurdhu agnes
Redistribution allows routes learned in one routing protocol to be advertised to another protocol. The document discusses configuring route redistribution from OSPF into EIGRP using the redistribute command. It notes that options include the protocol to redistribute from, OSPF process, and match criteria. Metrics can be set globally, per redistribute command, or using route-maps. An example configuration uses default-metric to redistribute OSPF routes into EIGRP.
Dynamic routing protocols are used to automatically discover remote networks, maintain up-to-date routing information, and choose the best path to destination networks. There are two main types - interior gateway protocols (IGPs) like RIP, OSPF, and EIGRP that are used within an autonomous system, and exterior protocols like BGP that route between autonomous systems. IGPs use metrics like hop count or bandwidth to determine the best path. OSPF is a link-state protocol that floods link information, while EIGRP uses DUAL algorithm and maintains topology tables for fast convergence.
Performance Analysis of Routing Protocols RIP, OSPF and EIGRPIRJET Journal
This document analyzes the performance of three routing protocols: RIP, OSPF, and EIGRP. It simulates these protocols using GNS3 software and analyzes parameters like convergence time, end-to-end delay, and throughput. Redistribution between the protocols is implemented using configuration commands. Ping tests and Wireshark analysis show packet forwarding between networks running different protocols. Analysis finds that EIGRP has the best performance with low convergence time and delay compared to RIP and OSPF in the simulated networks.
Route redistribution allows routes learned by one routing protocol to be advertised to another protocol. This is necessary when different protocols are used in the same internetwork due to vendor or other requirements. The redistribution device runs both protocols and shares routes between them, but external redistributed routes have lower preference than internally learned routes. Metrics must be translated between protocols since they use different metrics like hop count, bandwidth, and cost.
Packet Tracer: Routing protocols EIGRP and OSPFRafat Khandaker
The document summarizes an experiment in Packet Tracer where the routing protocols EIGRP and OSPF were implemented on a simulated enterprise network with multiple hosts and routers. EIGRP and OSPF were configured on the 3 routers to exchange routing update tables and allow routing between all hosts. The experiment demonstrated how each protocol operates, including configuration of EIGRP with autonomous system numbers and OSPF with areas to establish routing adjacencies between routers. Pings between hosts across the routers confirmed correct routing was achieved with both protocols.
EIGRP is a proprietary routing protocol developed by Cisco that is based on distance-vector routing. It uses the Diffusing Update Algorithm to quickly converge on routes and prevent routing loops. EIGRP calculates composite metrics for routes using factors like bandwidth and delay to determine the best path. It elects successors and feasible successors for routes to provide primary and backup paths. EIGRP also uses neighbor tables, topology tables, and routing tables to store routing information and make forwarding decisions.
The document discusses several routing protocols: IGRP is a distance-vector protocol that uses a composite metric and supports unequal cost load balancing. EIGRP is an advanced protocol that converges faster and has less overhead than IGRP. OSPF is a link-state protocol that uses the SPF algorithm to determine the shortest routes; it divides networks into hierarchical areas and routes to improve scalability.
The document discusses routing protocols and path selection algorithms. It provides an overview of common dynamic routing protocols including RIP, EIGRP, OSPF, IS-IS, and BGP. It describes how distance vector protocols, link-state protocols, and path vector protocols work differently in advertising routes and calculating the best paths. It also discusses how routers use the forwarding information base and administrative distances to select the best path for forwarding packets.
The document discusses routing protocols and path selection algorithms. It provides an overview of common dynamic routing protocols including RIP, EIGRP, OSPF, IS-IS, and BGP. It describes how distance vector protocols, link-state protocols, and path vector protocols work, and compares their algorithms. It also discusses how routers use prefix length and administrative distance to select the best path for forwarding packets.
EIGRP is a hybrid routing protocol that uses both distance-vector and link-state characteristics. It uses DUAL algorithm for routing calculations and loop prevention. EIGRP sends periodic hello packets to discover neighbors and non-periodic updates when routes change. The default EIGRP metric is the minimum bandwidth on a path plus the sum of the delays. Show commands can be used to display EIGRP neighbor information, topology tables, route tables, traffic statistics, and event/packet details for troubleshooting.
Ccnav5.org ccna 3-v50_practice_final_exam_2014Đồng Quốc Vương
This document provides a practice final exam for CCNA 3 v5.0 with 50 multiple choice questions covering topics such as OSPF, EIGRP, STP, wireless networking, and network device configuration and management. It tests knowledge of routing protocols, switching technologies, wireless security and authentication methods, and best practices for upgrading device firmware.
EIGRP is an advanced distance vector routing protocol that is an evolution of IGRP. It supports features like classless routing, VLSM, route summarization, load balancing and more. For routers to exchange routing information, they must first become neighbors by discovering each other using multicast hello packets and ensuring certain fields match, like the AS number. EIGRP stores routing data in neighbor, topology, and routing tables and uses metrics like bandwidth and delay to calculate the best routes.
Using multiple routing protocols allows for interim conversion between protocols, application-specific needs that differ per protocol, political boundaries between groups, and device mismatches. Route redistribution controls the exchange of routing information between protocols and requires seed metrics, filtering with distribute lists or route maps, and adjusting administrative distances. DHCP enables dynamic IP addressing on networks through server, client, and relay agent configuration in Cisco devices.
EIGRP is a cisco proprietary, Advance distance vector, classless Interior gateway routing protocol.
Released in-1994.
It works on Network Layer of OSI Model.
It use the IP protocol no 88. (It doesn’t use TCP or UDP)
EIGRP AD – 90
Eigrp External routes AD – 170
EIGRP has a maximum hop-count of 224, though the default maximum hop-count is set to 100
This document discusses routing concepts and types of routing protocols. It defines routing as moving information across a network from source to destination based on IP address. There are static and dynamic routing protocols, with dynamic routing allowing routers to automatically learn and update routing tables in response to network changes. Interior gateway protocols like OSPF and IS-IS are used within autonomous systems, while exterior gateway protocols like BGP route between autonomous systems. Classful protocols do not include subnet masks while classless protocols do, allowing for variable length subnet masking. Administrative distance numbers and metrics are used to determine the best path when multiple routes exist. Distance vector protocols use the Bellman-Ford algorithm while link state protocols have each node build a connectivity map to calculate best
EIGRP and OSPF are routing protocols. EIGRP uses the DUAL algorithm and metric to select fast, loop-free routes. It supports multiple network layers and rapid convergence. OSPF is an open standard link-state protocol that provides a common network view and calculates the shortest path. It can route between autonomous systems and uses link state updates and SPF algorithm. Configuring OSPF involves assigning networks to areas and defining the routing process. Verification includes checking neighbors, routes, and topology tables.
EIGRP and OSPF are routing protocols. EIGRP uses the DUAL algorithm and metric to select fast, loop-free routes. It supports multiple network layers and rapid convergence. OSPF is an open standard link-state protocol that provides a common network view and calculates the shortest path. It can route between autonomous systems and uses link state updates and SPF algorithm. Configuring OSPF involves assigning networks to areas and defining the routing process. Verification includes checking neighbors, routes, and topology tables.
The chapter discusses EIGRP and OSPF routing protocols. It provides information on configuring and verifying EIGRP, including EIGRP tables, metrics, neighbor discovery using hello packets, and terminology such as feasible successors. It also covers configuring and verifying OSPF, as well as using wildcards.
The document describes setting up static routes on 7 routers (R1-R7) to allow connectivity between all routers and PCs in a network topology. It involves configuring IP addresses and static routes on each router's interfaces according to the topology diagram, so that each router has a route to every other subnet and can ping all other routers and PCs.
This document outlines the steps to configure HSRP (Hot Standby Router Protocol) on two multi-layer switches (MLS1 and MLS2) including: configuring IP addresses, EIGRP routing, web server and NTP server, setting MLS1 as the active router, tracking the state of interfaces, using HSRP for load balancing between the routers, and enabling NAT on the border router for internal traffic.
The document provides instructions for a lab on route redistribution between OSPF, EIGRP and RIP routing protocols. It involves configuring the routing protocols on various routers as specified in the topology, including redistributing routes between protocols. It also requires summarizing loopback routes between areas and protocols.
Route redistribution involves sharing routes between different routing protocols. Challenges include incompatible metrics between protocols and routing loops or suboptimal paths that can occur from redistributing routes back into their origin domain. Route maps, distribution lists, and adjusting administrative distances can control redistribution and prevent issues like feedback of routes into their source protocol.
The document describes tasks for configuring a zone-based firewall on Router 1:
1. Create an inside and outside zone on Router 1's interfaces; apply an inspect policy between the zones to allow necessary traffic.
2. Configure R2 to ping R3 by name by adding DNS and host entries.
3. Configure R2 to copy a file from R4's HTTP server using the file path and name.
4. Configure R2 as the NTP server and have the other routers synchronize to it after applying necessary firewall policies.
The document provides the configuration steps for a lab exercise on BGP. The steps include:
1. Configuring IBGP and EBGP neighborships between routers as shown in the topology diagram using loopback addresses.
2. Advertising loopback networks in BGP to ensure all routers have the routing information.
3. Configuring route reflectors to reduce the number of neighbor relationships needed.
4. Setting preferences for best paths between routers for certain networks.
This document provides instructions for completing 12 tasks to configure access control lists on routers. The tasks include configuring IP addresses, inter-VLAN routing, EIGRP routing, DNS, Telnet/SSH access, and ACLs to restrict traffic between VLANs and access to websites based on the VLAN. Detailed configuration steps are provided for each router to implement the access controls and routing as outlined in the tasks.
1. The document provides instructions for configuring OSPF routing, filtering LSAs, and summarizing routes between OSPF areas on a network with multiple routers.
2. Tasks include configuring OSPF on each router, filtering routes between areas, redistributing EIGRP routes into OSPF, and using prefix lists and route summarization.
3. The solution shows the OSPF and redistribution configurations needed on each router to implement the requested tasks and filters.
The document describes the tasks and solution for a lab on VLANs and trunking. The tasks are to: 1) Configure IP addresses as shown in the topology, 2) Create DHCP servers for VLANs 10 and 20, 3) Configure SW1 as the VTP server and the others as clients with the domain "netwaxlab.com", 4) Ensure PCs get IP addresses via DHCP, and 5) Allow communication between PCs 9 and 10 which have different IPs on the same VLAN. The solution describes the configurations needed on the switches to accomplish these tasks.
The document provides instructions for configuring an ASA firewall to:
1. Configure security levels and interfaces for DMZ and DMZ1 subnets.
2. Enable ping access between the DMZ and DMZ1 interfaces.
3. Restrict telnet access to the ASA to only the R2 host.
4. Enable SSH access to the ASA from the ISP subnet only.
5. Apply PAT for the Inside, DMZ and DMZ1 interfaces.
6. Allow the ISP to telnet to the R2 host using port 2487.
The document describes tasks to configure NAT on routers R1 and R2. This includes dynamically NATing internal networks and loopbacks to external IP ranges, PAT for some internal networks, and static NAT for R7's loopbacks. EIGRP is configured internally with redistribution. Access-lists are used to define the NAT source addresses and pools are used to map them to external IP ranges. Connectivity to external sites is tested with ping.
This document provides instructions for configuring cut-through proxy on an ASA firewall. It includes steps to configure interfaces, ACLs, AAA authentication with an ISE server, a virtual Telnet IP, and verification tests. The goal is to allow a client to Telnet to a virtual IP on the ASA that will authenticate with ISE and cut through to permit access to a real host IP if authentication succeeds.
The document describes the steps to configure dynamic routing, site-to-site VPN, and network access between devices in a lab topology. The tasks include: 1) Configuring IP addresses and dynamic routing protocols on routers and firewalls, 2) Establishing connectivity between all devices, 3) Implementing NAT and VPN services on the firewalls to allow communication between specified subnets, and 4) Opening a non-standard port for remote access between two routers via one of the firewalls.
1. The document describes configuring IP addresses, DNS, a site-to-site GRE VPN between routers R5 and R6, and a DMVPN network between routers R1, R2, and R3.
2. For the GRE VPN, ISAKMP and IPsec are configured on R5 and R6 using a preshared key of "netwaxlab" to secure the GRE tunnel.
3. For the DMVPN, R1 is configured as a hub router and R2 and R3 as spoke routers. ISAKMP and IPsec are configured using a preshared key of "netwaxlab" to secure the GRE tunnels between the routers.
The document describes configuring VRRP (Virtual Router Redundancy Protocol) on routers R1 and R2. It involves:
1. Configuring R1 as the master for VRRP group 1 using virtual IP 10.0.0.254 and authentication.
2. Configuring R2 as the master for load-balanced VRRP group 2 using virtual IP 10.0.0.193 and a different authentication string.
3. Enabling tracking on both routers so that the priority of the backup router decreases if the route to the opposite network fails, allowing it to take over as master.
1. The document describes tasks for configuring a role-based CLI, including configuring IP addresses, routing protocols, VPN tunnels, and access privileges for different devices.
2. It provides configuration steps for R2 and R3 to enable PAT for inside networks and configure a site-to-site VPN between them with IPsec.
3. PC5 is given full access to R13 but can only use show commands on R14, while PC4 is limited to the show history command on R11.
1. The document describes configuring high availability routing between two firewalls (ASA1 and ASA2) using failover, and between two routers (MLS3 and R2) using HSRP.
2. It provides configuration examples for failover on the ASAs, HSRP on MLS3 and R2, PAT on the ASA and R2, and EIGRP routing between the ASA and MLS3.
3. It also specifies default gateways for different PCs to reach R1 via the active HSRP router.
1. The document describes the configuration steps for a lab exercise involving BGP routing. It includes tasks to configure IP addresses, IBGP, HSRP, servers, and BGP routing on multiple routers as shown in the given topology diagram.
2. Key steps are to configure IBGP between routers R1-R4, HSRP between R5-R6, servers on R6, and BGP routing between all routers as specified in the tasks and topology, including IBGP, EBGP, route reflectors, and BGP confederations.
3. The goal is to verify connectivity between loopbacks and servers across the different BGP and IBGP domains as configured.
1. The document describes tasks for configuring OSPF routing on a network topology.
2. Key configurations include enabling OSPF on each router, configuring authentication for Area 1, summarizing loopback routes on R4, and preventing Area 3 routers from receiving routes from other areas.
3. PAT is configured on routers R1 and R11 to allow traffic from multiple private networks to use a single public IP address.
This document describes the configuration of a network topology with VLANs, trunking, routing, and NAT. The key tasks are:
1. Configure switches and routing with VLANs, VTP, EIGRP, and trunking to separate traffic from different client groups.
2. Perform PAT on routers R1 and R2 to allow clients to access the internet.
3. Configure a web server for clients to access via its IP address or domain name.
"Scaling RAG Applications to serve millions of users", Kevin GoedeckeFwdays
How we managed to grow and scale a RAG application from zero to thousands of users in 7 months. Lessons from technical challenges around managing high load for LLMs, RAGs and Vector databases.
This talk will cover ScyllaDB Architecture from the cluster-level view and zoom in on data distribution and internal node architecture. In the process, we will learn the secret sauce used to get ScyllaDB's high availability and superior performance. We will also touch on the upcoming changes to ScyllaDB architecture, moving to strongly consistent metadata and tablets.
Connector Corner: Seamlessly power UiPath Apps, GenAI with prebuilt connectorsDianaGray10
Join us to learn how UiPath Apps can directly and easily interact with prebuilt connectors via Integration Service--including Salesforce, ServiceNow, Open GenAI, and more.
The best part is you can achieve this without building a custom workflow! Say goodbye to the hassle of using separate automations to call APIs. By seamlessly integrating within App Studio, you can now easily streamline your workflow, while gaining direct access to our Connector Catalog of popular applications.
We’ll discuss and demo the benefits of UiPath Apps and connectors including:
Creating a compelling user experience for any software, without the limitations of APIs.
Accelerating the app creation process, saving time and effort
Enjoying high-performance CRUD (create, read, update, delete) operations, for
seamless data management.
Speakers:
Russell Alfeche, Technology Leader, RPA at qBotic and UiPath MVP
Charlie Greenberg, host
The Department of Veteran Affairs (VA) invited Taylor Paschal, Knowledge & Information Management Consultant at Enterprise Knowledge, to speak at a Knowledge Management Lunch and Learn hosted on June 12, 2024. All Office of Administration staff were invited to attend and received professional development credit for participating in the voluntary event.
The objectives of the Lunch and Learn presentation were to:
- Review what KM ‘is’ and ‘isn’t’
- Understand the value of KM and the benefits of engaging
- Define and reflect on your “what’s in it for me?”
- Share actionable ways you can participate in Knowledge - - Capture & Transfer
In our second session, we shall learn all about the main features and fundamentals of UiPath Studio that enable us to use the building blocks for any automation project.
📕 Detailed agenda:
Variables and Datatypes
Workflow Layouts
Arguments
Control Flows and Loops
Conditional Statements
💻 Extra training through UiPath Academy:
Variables, Constants, and Arguments in Studio
Control Flow in Studio
In the realm of cybersecurity, offensive security practices act as a critical shield. By simulating real-world attacks in a controlled environment, these techniques expose vulnerabilities before malicious actors can exploit them. This proactive approach allows manufacturers to identify and fix weaknesses, significantly enhancing system security.
This presentation delves into the development of a system designed to mimic Galileo's Open Service signal using software-defined radio (SDR) technology. We'll begin with a foundational overview of both Global Navigation Satellite Systems (GNSS) and the intricacies of digital signal processing.
The presentation culminates in a live demonstration. We'll showcase the manipulation of Galileo's Open Service pilot signal, simulating an attack on various software and hardware systems. This practical demonstration serves to highlight the potential consequences of unaddressed vulnerabilities, emphasizing the importance of offensive security practices in safeguarding critical infrastructure.
AppSec PNW: Android and iOS Application Security with MobSFAjin Abraham
Mobile Security Framework - MobSF is a free and open source automated mobile application security testing environment designed to help security engineers, researchers, developers, and penetration testers to identify security vulnerabilities, malicious behaviours and privacy concerns in mobile applications using static and dynamic analysis. It supports all the popular mobile application binaries and source code formats built for Android and iOS devices. In addition to automated security assessment, it also offers an interactive testing environment to build and execute scenario based test/fuzz cases against the application.
This talk covers:
Using MobSF for static analysis of mobile applications.
Interactive dynamic security assessment of Android and iOS applications.
Solving Mobile app CTF challenges.
Reverse engineering and runtime analysis of Mobile malware.
How to shift left and integrate MobSF/mobsfscan SAST and DAST in your build pipeline.
Northern Engraving | Nameplate Manufacturing Process - 2024Northern Engraving
Manufacturing custom quality metal nameplates and badges involves several standard operations. Processes include sheet prep, lithography, screening, coating, punch press and inspection. All decoration is completed in the flat sheet with adhesive and tooling operations following. The possibilities for creating unique durable nameplates are endless. How will you create your brand identity? We can help!
AI in the Workplace Reskilling, Upskilling, and Future Work.pptxSunil Jagani
Discover how AI is transforming the workplace and learn strategies for reskilling and upskilling employees to stay ahead. This comprehensive guide covers the impact of AI on jobs, essential skills for the future, and successful case studies from industry leaders. Embrace AI-driven changes, foster continuous learning, and build a future-ready workforce.
Read More - https://bit.ly/3VKly70
Getting the Most Out of ScyllaDB Monitoring: ShareChat's TipsScyllaDB
ScyllaDB monitoring provides a lot of useful information. But sometimes it’s not easy to find the root of the problem if something is wrong or even estimate the remaining capacity by the load on the cluster. This talk shares our team's practical tips on: 1) How to find the root of the problem by metrics if ScyllaDB is slow 2) How to interpret the load and plan capacity for the future 3) Compaction strategies and how to choose the right one 4) Important metrics which aren’t available in the default monitoring setup.
QA or the Highway - Component Testing: Bridging the gap between frontend appl...zjhamm304
These are the slides for the presentation, "Component Testing: Bridging the gap between frontend applications" that was presented at QA or the Highway 2024 in Columbus, OH by Zachary Hamm.
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Keywords: AI, Containeres, Kubernetes, Cloud Native
Event Link: https://meine.doag.org/events/cloudland/2024/agenda/#agendaId.4211
inQuba Webinar Mastering Customer Journey Management with Dr Graham HillLizaNolte
HERE IS YOUR WEBINAR CONTENT! 'Mastering Customer Journey Management with Dr. Graham Hill'. We hope you find the webinar recording both insightful and enjoyable.
In this webinar, we explored essential aspects of Customer Journey Management and personalization. Here’s a summary of the key insights and topics discussed:
Key Takeaways:
Understanding the Customer Journey: Dr. Hill emphasized the importance of mapping and understanding the complete customer journey to identify touchpoints and opportunities for improvement.
Personalization Strategies: We discussed how to leverage data and insights to create personalized experiences that resonate with customers.
Technology Integration: Insights were shared on how inQuba’s advanced technology can streamline customer interactions and drive operational efficiency.
QR Secure: A Hybrid Approach Using Machine Learning and Security Validation F...AlexanderRichford
QR Secure: A Hybrid Approach Using Machine Learning and Security Validation Functions to Prevent Interaction with Malicious QR Codes.
Aim of the Study: The goal of this research was to develop a robust hybrid approach for identifying malicious and insecure URLs derived from QR codes, ensuring safe interactions.
This is achieved through:
Machine Learning Model: Predicts the likelihood of a URL being malicious.
Security Validation Functions: Ensures the derived URL has a valid certificate and proper URL format.
This innovative blend of technology aims to enhance cybersecurity measures and protect users from potential threats hidden within QR codes 🖥 🔒
This study was my first introduction to using ML which has shown me the immense potential of ML in creating more secure digital environments!
JavaLand 2024: Application Development Green Masterplan
Route Redistribution
1. Route Redistribution
Redistribution is necessary when routing protocols connect and must pass routes between the two.
Route Redistribution involves placing the routes learned from one routing domain, such as RIP, into
another routing domain, such as EIGRP.
While running a single routing protocol throughout your entire IP internetwork is desirable, multi-
protocol routing is common for a number of reasons, such as company mergers, multiple departments
managed by multiple network administrators, and multi-vendor environments. Running different
routing protocols is often part of a network design. In any case, having a multiple protocol environment
makes redistribution a necessity.
Redistribution Challenge
The challenge to redistributing routing protocols is that each routing protocol uses its own metric and
they are not compatible with each other. Furthermore, there is no magic algorithm than can
automatically translate metrics between, say RIP and BGP.
Differences in routing protocol characteristics, such as metrics, administrative distance, classful and
classless capabilities can effect redistribution. Consideration must be given to these differences for
redistribution to succeed.
Each routing protocol has its own way of determining the best path to a network. RIP uses hops, and
EIGRP and IGRP both use a composite metric of bandwidth, delay, reliability, load, and MTU size.
Because of the differences in metric calculations, when redistributing routes, you lose all metrics and
must manually specify the cost metric for each routing domain. This is because RIP has no way of
translating bandwidth, delay, reliability, load, and MTU size into hops, and vice versa. Another issue to
address with route redistribution is that some routing protocols are classful, meaning that the routing
protocol does not send subnet mask information in the routing updates (for example, in RIP and IGRP).
Figure 1 Route Redistribution Example
2. Route Redistribution
In addition, some protocols are classless, meaning that the routing protocol does send subnet mask
information in the routing updates (for example, in EIGRP). This poses a problem when variable-length
subnet masking (VLSM, in which you use a netmask other than the default netmask for the IP address)
and classless interdomain routing (CIDR, sometimes referred to as "supernetting" or route
summarization) routes need to be redistributed from a classless routing protocol into a classful routing
protocol.
Route Maps
When a routing update arrives at an interface, a series of steps occur to process it correctly. The
diagram below outlines those steps and serves as a foundation for the rest of this route redistribution
and filtering section.
Figure 2 Route Map Steps
3. Route Redistribution
Route maps are extremely flexible and are used in a number routing scenarios including:
1. Controlling redistribution based on permit/deny statements
2. Defining policies in policy-based routing (PBR)
3. Add more mature decision making to NAT decisions than simply using static translations
4. When implementing BGP PBR
Basic Route Map Configuration
R1(config)# route-map {tag} permit | deny [sequence_number]
That is how all route maps begin. Permit means that any traffic matching the match statement that
follows is processed by the route map. Deny means that any traffic matching the match statement that
follows is NOT processed by the route map. Know the difference.
Configuring Redistribution
To configure redistribution between routing protocols, the redistribute protocol command is used under
the routing protocol that receives the routes.
R1(config-router)# redistribute protocol [AS/process-ID] [metric metric-vlaue]
EIGRP Redistribution Example
R1(config)# router eigrp 10
R1(config-router)# redistribute ospf 20 metric 1000 100 255 1 1500
The example above shows OSPF being redistruted into EIGRP with a metric of 1000 100 255 1 1500. That
is a lot of different numbers for an EIGRP cost! That’s because EIGRP redistribution metric requires you
to input all of the metric calculation manually:
1. bandwidth
2. delay
3. reliability
4. loading
5. mtu
Both RIP and EIGRP require the use the metric keyword.
Redistributing into RIP
RIP is a standardized Distance-Vector routing protocol that uses hop-count as its distance metric.
Consider the following example:
4. Route Redistribution
RouterB is our redistribution point between IGRP and RIP. To redistribute all IGRP routes into RIP:
RouterB(config)# router rip
RouterB(config-router)# network 172.16.0.0
RouterB(config-router)# redistribute igrp 10 metric 2
First, the router rip process was enabled. Next, RIP was configured to advertise the network of
172.16.0.0/16. Finally, RIP was configured to redistribute all igrp routes from Autonomous System 10,
and apply a hopcount metric of 2 to the redistributed routes. If a metric is not specified, RIP will assume
a metric of 0, and will not advertise the redistributed routes.
Redistributing into IGRP
IGRP is a Cisco-proprietary Distance-Vector routing protocol that, by default, uses a composite of
bandwidth and delay as its distance metric. IGRP can additionally consider Reliability, Load, and MTU for
its metric.
Still using the above example, to redistribute all RIP routes into IGRP:
RouterB(config)# router igrp 10
RouterB(config-router)# network 10.0.0.0
RouterB(config-router)# redistribute rip metric 10000 1000 255 1 1500
First, the router igrp process was enabled for Autonomous System 10. Next, IGRP was configured to
advertise the network of 10.0.0.0/8. Finally, IGRP was configured to redistribute all rip routes, and apply
a metric of 10000 (bandwidth), 1000 (delay), 255 (reliability), 1 (load), and 1500 (MTU) to the
redistributed routes.
Redistributing into EIGRP
EIGRP is a Cisco-proprietary hybrid routing protocol that, by default, uses a composite of bandwidth and
delay as its distance metric. EIGRP can additionally consider Reliability, Load, and MTU for its metric.
Figure 3 Topology between IGRP & RIP
5. Route Redistribution
To redistribute all OSPF routes into EIGRP:
RouterB(config)# router eigrp 15
RouterB(config-router)# network 10.1.2.0 0.0.0.255
RouterB(config-router)# redistribute ospf 20 metric 10000 1000 255 1 1500
First, the router eigrp process was enabled for Autonomous System 15. Next, EIGRP was configured to
advertise the network of 10.1.2.0/24. Finally, EIGRP was configured to redistribute all ospf routes from
processID 20, and apply a metric of 10000 (bandwidth), 1000 (delay), 255 (reliability), 1 (load), and 1500
(MTU) to the redistributed routes.
It is possible to specify a default-metric for all redistributed routes:
RouterB(config)# router eigrp 15
RouterB(config-router)# redistribute ospf 20
RouterB(config-router)# default-metric 10000 1000 255 1 1500
RIP and IGRP also support the default-metric command. Though IGRP/EIGRP use only bandwidth and
delay by default to compute the metric, it is still necessary to specify all five metrics when redistributing.
If the default-metric or a manual metric is not specified, IGRP/EIGRP will assume a metric of 0, and will
not advertise the redistributed routes.
Redistribution will occur automatically between IGRP and EIGRP on a router, if both processes are using
the same Autonomous System number.
EIGRP, by default, will auto-summarize internal routes unless the no autosummary command is used.
However, EIGRP will not auto-summarize external routes unless a connected or internal EIGRP route
exists in the routing table from the same major network of the external routes.
Redistributing into OSPF
OSPF is a standardized Link-State routing protocol that uses cost (based on bandwidth) as its link-state
metric. An OSPF router performing redistribution automatically becomes an ASBR.
Figure 4 Topology between EIGRP & OSPF
6. Route Redistribution
To redistribute all EIGRP routes into OSPF:
RouterB(config)# router ospf 20
RouterB(config-router)# network 172.16.0.0 0.0.255.255 area 0
RouterB(config-router)# redistribute eigrp 15
RouterB(config-router)# default-metric 30
First, the router ospf process was enabled with a process-ID of 20. Next, OSPF was configured to place
any interfaces in the network of 172.16.0.0/16 into area 0. Then, OSPF will redistribute all eigrp routes
from AS 15. Finally, a default-metric of 30 was applied to all redistributed routes.
If the default-metric or a manual metric is not specified for the redistributed routes, a default metric of
20 will be applied to routes of all routing protocols except for BGP. Redistributed BGP routes will have a
default metric of 1 applied by OSPF.
By default, OSPF will only redistribute classful routes into the OSPF domain. To configure OSPF to accept
subnetted networks during redistribution, the subnets parameter must be used:
RouterB(config)# router ospf 20
RouterB(config-router)# redistribute eigrp 15 subnets
Routes redistributed into OSPF are marked external. OSPF identifies two types of external routes, Type-1
(which is preferred) and Type-2 (which is default). To change the type of redistributed routes:
RouterB(config)# router ospf 20
RouterB(config-router)# redistribute eigrp 15 subnets metric-type 1
Redistributing Static and Connected Routes
Redistributing static routes into a routing protocol is straightforward:
RouterB(config)# router eigrp 15
RouterB(config-router)# redistribute static
Redistributing networks on connected interfaces into a routing protocol is equally straightforward:
RouterB(config)# router eigrp 15
RouterB(config-router)# redistribute connected
The above commands redistribute all connected networks into EIGRP. Route-maps can be used to
provide more granular control:
RouterB(config)# route-map CONNECTED permit 10
RouterB(config-route-map)# match interface fa0/0, fa0/1, s0/0, s0/1
RouterB(config)# router eigrp 15
RouterB(config-router)# redistribute connected route-map CONNECTED
7. Route Redistribution
Connected networks can be indirectly redistributed into a routing protocol. Recall that routes will only
be redistributed if they exist in the routing table, and consider again the following example:
If RouterB is configured as follows:
RouterB(config)# router eigrp 15
RouterB(config-router)# network 10.1.2.0 0.0.0.255
RouterB will advertise the 10.1.2.0/24 network to RouterA, but it will not have an EIGRP route in its
routing table for that network, as the network is directly connected.
Despite this, when redistributing EIGRP into OSPF, the 10.1.2.0/24 is still injected into OSPF. The
network 10.1.2.0 0.0.0.255 command under the EIGRP process will indirectly redistribute this network
into OSPF.
Pitfalls of Route Redistribution – Administrative Distance
Route redistribution introduces unique problems when there are multiple points of redistribution.
Consider the following diagram:
Figure 5 Redistributing Static and Connected Routes
Figure 6 Pitfalls of Route Redistribution – Administrative Distance
8. Route Redistribution
The first issue is caused by Administrative Distance (AD), which determines which routing protocol is
“trusted” the most. By default, OSPF routes have an AD of 110, whereas RIP routes have an AD of 120.
Lowest AD is preferred, thus making the OSPF routes the most trusted.
Assume mutual redistribution has been performed on RouterC and RouterD. The following networks will
be injected from RIP into OSPF: 10.1.1.0/24, 10.1.2.0/24, 10.1.3.0/24, 10.1.4.0/24, and 10.1.5.0/24.
RouterC will eventually receive OSPF routes to the above networks from RouterD, in addition to the RIP
routes already in its table. Likewise, RouterD will receive OSPF routes to these networks from RouterC.
Because OSPF’s AD is lower than RIP’s, both RouterC and RouterD will prefer the sub-optimal path
through OSPF to reach the non-connected networks. Thus, RouterC will choose the OSPF route for all
the 10.x.x.x/24 networks except for 10.1.1.0/24, as it is already directly connected.
This actually creates a routing loop. RouterC will prefer the OSPF path through RouterA to reach the
10.x.x.x networks (except for 10.1.1.0/24), and RouterA will likely consider RouterC its shortest path to
reach those same networks. Traffic will be continuously looped between these two routers.
Even if RouterC managed to send the traffic through RouterA and RouterB to RouterD, the preferred
path to the 10.x.x.x networks for RouterD is still through OSPF. Thus, the routing loop is inevitable.
There are two methods to correct this particular routing loop. The first method involves filtering
incoming routes using a distribution-list, preventing RouterC and RouterD from accepting any routes
that originated in RIP from their OSPF neighbors.
RouterC’s configuration would be as follows:
RouterC(config)# access-list 10 deny 10.1.2.0 0.0.0.255
RouterC(config)# access-list 10 deny 10.1.3.0 0.0.0.255
RouterC(config)# access-list 10 deny 10.1.4.0 0.0.0.255
RouterC(config)# access-list 10 deny 10.1.5.0 0.0.0.255
RouterC(config)# access-list 10 permit any
RouterC(config)# router ospf 20
RouterC(config-router)# distribute-list 10 in fastethernet0/0
An access-list was created that is denying the RIP networks in question, and permitting all other
networks. Under the OSPF process, a distribute-list is created for routes coming inbound off of the
fastethernet0/0 interface. The access-list and distribute-list numbers must match. RouterD’s
configuration would be similar.
This prevents each router from building OSPF routes for the networks that originated in RIP, and thus
eliminates the possibility of a loop. However, redundancy is also destroyed – if RouterC’s fa0/1 interface
were to fail, it could not choose the alternate path through OSPF.
9. Route Redistribution
The second method involves using the distance command to adjust the AD of specific routes. This can
accomplished two ways:
a. Lowering the AD of the local RIP-learned routes.
b. Raising the AD of the external OSPF-learned routes.
To force the RIP routes to be preferred, RouterC’s configuration would be as follows:
RouterC(config)# access-list 10 permit 10.1.2.0 0.0.0.255
RouterC(config)# access-list 10 permit 10.1.3.0 0.0.0.255
RouterC(config)# access-list 10 permit 10.1.4.0 0.0.0.255
RouterC(config)# access-list 10 permit 10.1.5.0 0.0.0.255
RouterC(config)# access-list 10 deny any
RouterC(config)# router rip
RouterC(config-router)# distance 70 10.1.1.0 0.0.0.255 10
An access-list was created that is permitting the RIP networks in question, and denying all other
networks. Under the RIP process, an administrative distance of 70 is applied to updates from routers on
the 10.1.1.0 network, for the specific networks matching access-list 10. RouterD’s configuration would
be similar.
Thus, the RIP-originated networks will now have a lower AD than the redistributed routes from OSPF.
The loop has again been eliminated. Another solution would be to raise the AD of the external OSPF
routes. OSPF provides a simple mechanism to accomplish this:
RouterC(config)# router ospf 20
RouterC(config-router)# distance ospf external 240
Pitfalls of Route Redistribution – Route Feedback
Figure 7 Pitfalls of Route Redistribution – Route Feedback
10. Route Redistribution
A routing loop is only one annoying issue resulting from the above design. Route feedback is another
problem that must be addressed.
OSPF routes redistributed into RIP on RouterC will eventually reach RouterD, and then be redistributed
again back into OSPF. This is a basic example of route feedback.
Depending on the metrics used, this could potentially cause RouterB to prefer the route through
RouterD (and through the RIP domain), to reach the 192.168.2.0/24 network. This is an obvious example
of suboptimal routing.
Thus, routes that originated in a routing domain should not to be re-injected into that domain.
Distribution-lists and the distance command can be utilized to accomplish this, but route tags may
provide a more robust solution.
Tagging routes provides a mechanism to both identify and filter those routes further along in the routing
domain. A route retains its tag as it passes from router to router. Thus, if a route is tagged when
redistributed into RIP on RouterC, that same route can be selectively filtered once it is advertised to
RouterD.
Route tags are applied using route-maps. Route-maps provide a sequential list of commands, each
having a permit or deny result:
RouterC(config)# route-map OSPF2RIP deny 5
RouterC(config-route-map)# match tag 33
RouterC(config-route-map)# route-map OSPF2RIP permit 15
RouterC(config-route-map)# set tag 44
Route-maps are covered in great detail in a separate guide.
The full configuration necessary on RouterC would be as follows:
RouterC(config)# route-map OSPF2RIP deny 5
RouterC(config-route-map)# match tag 33
RouterC(config-route-map)# route-map OSPF2RIP permit 15
RouterC(config-route-map)# set tag 44
RouterC(config)# router rip
RouterC(config)# redistribute ospf 20 route-map OSPF2RIP
RouterC(config)# route-map RIP2OSPF deny 5
RouterC(config-route-map)# match tag 44
RouterC(config-route-map)# route-map RIP2OSPF permit 15
RouterC(config-route-map)# set tag 33
RouterC(config)# router ospf 20
RouterC(config)# redistribute rip route-map RIP2OSPF
11. Route Redistribution
Thus, OSPF routes being redistributed into RIP are set with a tag of 44. When RIP is redistributed back
into OSPF, any route with a tag that matches 44 is denied.
Similarly, RIP routes being redistributed into OSPF are set with a tag of 33. When OSPF is redistributed
back into RIP, any route with a tag that matches 33 is denied. The net result: routes originating from a
routing domain will not redistributed back into that domain.
Example
R1(config)#int fa0/0
R1(config-if)#ip add 172.168.101.1 255.255.255.0
R1(config-of)#no shut
R1(config)#int s0/0
R1(config-if)#ip add 192.168.1.1 255.255.255.0
R1(config-of)#no shut
R2(config)#int fa0/0
R2(config-if)#ip add 172.168.102.1 255.255.255.0
R2(config-of)#no shut
R2(config)#int s0/0
R2(config-if)#ip add 192.168.1.2 255.255.255.0
R2(config-of)#no shut
R2(config)#int s0/1
R2(config-if)#ip add 192.168.2.1 255.255.255.0
Figure 8 Topology
12. Route Redistribution
R2(config-of)#no shut
R3(config)#int fa0/0
R3(config-if)#ip add 172.168.103.1 255.255.255.0
R3(config-of)#no shut
R3(config)#int s0/0
R3(config-if)#ip add 192.168.2.2 255.255.255.0
R3(config-of)#no shut
R1(config)#router rip
R1(config-router)#version 2
R1(config-router)#network 0.0.0.0
R1(config-router)#no auto-summary
R2(config)#router rip
R2(config-router)#version 2
R2(config-router)#network 172.168.102.0
R2(config-router)#network 192.168.1.0
R2(config-router)#no auto-summary
R2(config)#router Eigrp 100
R2(config-router)#network 192.168.2.0
R2(config-router)#no auto-summary
R3(config)#router Eigrp 100
R3(config-router)#network 0.0.0.0
R3(config-router)#no auto-summary
R1#sh ip route
172.168.0.0/24 is subnetted, 2 subnets
C 172.168.101.0 is directly connected, FastEthernet0/0
R 172.168.102.0 [120/1] via 192.168.1.2, 00:00:01, Serial0/0
C 192.168.1.0/24 is directly connected, Serial0/0
We cannot see here R3 routes
R3#sh ip route
172.168.0.0/24 is subnetted, 1 subnets
C 172.168.103.0 is directly connected, FastEthernet0/0
C 192.168.2.0/24 is directly connected, Serial0/0
We can see here only connected routes
R1#ping 172.168.103.1 repeat 1000
13. Route Redistribution
R2(config)#router rip
R2(config-router)#redistribute Eigrp 100 metric 5
R1#sh ip route
We will see here all the Eigrp routes
R2(config)#router Eigrp 100
R2(config-router)# redistribute rip metric 1544 0 255 1 1500
Now we will re-distribute OSPF
R1#(config)#no router rip
R2#(config)#no router rip
R1(config)#router ospf 100
R1(config-router)#network 0.0.0.0 255.255.255.255 area 0
R2(config)#router ospf 200
R2(config-router)#network 192.168.1.0 0.0.0.255 area 0
R2(config-router)#network 172.168.102.0 0.0.0.255 area 0
R2(config-router)#router ospf 200
R2(config-router)#redistributes Eigrp 100 subnets
R2(config-router)#router Eigrp 100
R2(config-router)#redistribute ospf 200 metric 1544 0 255 1 1500
Now if we remove the Rip and run Eigrp 200 and other side we will run Eigrp 200
R1(config)#no router ospf 100
R2(config)#no router ospf 200
R1(config)#router Eigrp 200
R1(config-router)#network 0.0.0.0
R2(config)#router Eigrp 200
R2(config-router)#network 192.168.1.0
R2(config-router)#network 172.168.102.0
R1#sh ip route
R3#sh ip route
In Eigrp by default, An AS will never send the routes to another AS
14. Route Redistribution
We will perform here redistribution
R2(config)#router Eigrp 100
R2(config-router)#redistribute Eigrp 200
R2(config)#router Eigrp 200
R2(config-router)#redistribute Eigrp 100
R1#sh ip route
We cannot redistribute from ospf to ospf.