CCNA Discovery 2: Chapter 6

Slides:



Advertisements
Similar presentations
Introduction to Dynamic Routing Protocols
Advertisements

Routing Protocol.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts – Chapter.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.1 Routing Working at a Small-to-Medium Business or ISP – Chapter 6.
Mod 10 – Routing Protocols
CCNA 2 v3.1 Module 6.
Routing and Routing Protocols
Routing and Routing Protocols
Chapter 5 – Routing Protocols: IGRP. Building a Network To Be Reliable – provide error detection and ability to correct errors To Provide Connectivity.
Lecture Week 3 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
1 Semester 2 Module 6 Routing and Routing Protocols YuDa college of business James Chen
Fundamentals of Networking Discovery 2, Chapter 6 Routing.
Chapter 3 Dynamic Routing Protocols. Introduction to Dynamic Routing Protocols Perspective and Background Network Discovery and Routing Table Maintenance.
Chapter 12 Intro to Routing & Switching.  Upon completion of this chapter, you should be able to:  Read a routing table  Configure a static route 
Chapter 7: Routing Dynamically
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 7: Routing Dynamically Routing Protocols.
Introduction to Routing and Routing Protocols By Ashar Anwar.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 3: Routing Dynamically Routing Protocols Assist. Prof. Pongpisit.
6: Routing Working at a Small to Medium Business.
Dynamic Routing Protocols  Function(s) of Dynamic Routing Protocols: – Dynamically share information between routers (Discover remote networks). – Automatically.
M. Menelaou CCNA2 DYNAMIC ROUTING. M. Menelaou DYNAMIC ROUTING Dynamic routing protocols can help simplify the life of a network administrator Routing.
CCNA Guide to Cisco Networking Chapter 8: Routing Protocols and Network Address Translation.
Routing/Routed Protocols. Remember: A Routed Protocol – defines logical addressing. Most notable example on the test – IP A Routing Protocol – fills the.
Routing and Routing Protocols Routing Protocols Overview.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
1 Introducing Routing 1. Dynamic routing - information is learned from other routers, and routing protocols adjust routes automatically. 2. Static routing.
M.Menelaou CCNA2 ROUTING. M.Menelaou ROUTING Routing is the process that a router uses to forward packets toward the destination network. A router makes.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 2 Module 6 Routing and Routing Protocols.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.1 Module 6 Routing and Routing Protocols.
Dynamic Routing Chapter 9. powered by DJ 1. C HAPTER O BJECTIVES At the end of this Chapter you will be able to:  Explain Dynamic Routing  Identify.
Introduction to Dynamic Routing Protocol
Routing -2 Dynamic Routing
Review Routing fundamental W.lilakiatsakun. Review Routing Fundamental VLSM VLSM Route Summarization Route Summarization Static & Dynamic Routing Static.
1. 2 Anatomy of an IP Packet IP packets consist of the data from upper layers plus an IP header. The IP header consists of the following:
© 2002, Cisco Systems, Inc. All rights reserved. 1 Determining IP Routes.
Routing Fundamental W.lilakiatsakun. Review Routing Fundamental VLSM Static & Dynamic Routing Routing algorithm concept.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Routing Protocols and Concepts Introduction to Dynamic Routing Protocol.
Page 110/27/2015 A router ‘knows’ only of networks attached to it directly – unless you configure a static route or use routing protocols Routing protocols.
Switching and Routing Technique W.lilakiatsakun. Assessment Final 40 % Final 40 % Midterm 30% Midterm 30% LAB + Assignment 30% LAB + Assignment 30%
Institute of Technology Sligo - Dept of Computing Sem 2 Chapter 12 Routing Protocols.
CCNA 2 Week 6 Routing Protocols. Copyright © 2005 University of Bolton Topics Static Routing Dynamic Routing Routing Protocols Overview.
© 2002, Cisco Systems, Inc. All rights reserved. 1 Routing Overview.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
6: Routing Working at a Small to Medium Business.
Routing and Routing Protocols
Routing Networks and Protocols Prepared by: TGK First Prepared on: Last Modified on: Quality checked by: Copyright 2009 Asia Pacific Institute of Information.
1 Version 3.1 Module 6 Routed & Routing Protocols.
1 7-Jan-16 S Ward Abingdon and Witney College Dynamic Routing CCNA Exploration Semester 2 Chapter 3.
Routing protocols. 1.Introduction A routing protocol is the communication used between routers. A routing protocol allows routers to share information.
Routing and Routing Protocols PJC CCNA Semester 2 Ver. 3.0 by William Kelly.
© 2002, Cisco Systems, Inc. All rights reserved..
1 © 2004, Cisco Systems, Inc. All rights reserved. Routing and Routing Protocols: Routing Static.
Cisco 2 - Routers Perrine modified by Brierley Page 13/21/2016 Chapter 4 Module 6 Routing & Routing Protocols.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.1 Routing Working at a Small-to-Medium Business or ISP – Chapter 6.
Sem 2 v2 Chapter 12: Routing. Routers can be configured to use one or more IP routing protocols. Two of these IP routing protocols are RIP and IGRP. After.
Routing and Routing Protocols CCNA 2 v3 – Module 6.
+ Dynamic Routing Protocols 2 nd semester
Lec4: Introduction to Dynamic Routing Protocol
Introduction to Dynamic Routing Protocol
Working at a Small-to-Medium Business or ISP – Chapter 6
Routing and Routing Protocols: Routing Static
CCNA 2 v3.1 Module 6 Routing and Routing Protocols
Introduction to Dynamic Routing Protocol
Chapter 5: Dynamic Routing
Chapter 7: Routing Dynamically
Chapter 3: Dynamic Routing
Routing and Routing Protocols: Routing Static
Introduction to Dynamic Routing Protocol
Working at a Small-to-Medium Business or ISP – Chapter 6
CCE1030 Computer Networking
Presentation transcript:

CCNA Discovery 2: Chapter 6 Routing

Contents 6.1: Routing Protocols 6.1.1: Routing 6.1.3: RIP, EIGRP, OSPF 6.1.4: Routing Metrics 6.1.5: RIP configuration 6.2: Exterior Routing Protocols 6.2.1: Autonomous Systems 6.2.2: Routing Across the Internet 6.2.3: BGP

6.1: Routing In order for 2 networks or 2 subnets to communicate, they must use the services of a Router To direct traffic, a router uses a Routing Table containing all the locally connected networks and the interfaces that are connected to each network. Each interface belongs to a different IP network. A router determines which route, or path, to use by looking up the information stored in its routing table. The routing table also contains information about routes that the router can use to reach remote networks which are not locally attached.

The routing process I want to send a message to H3 on Network 3

Learning routes Routes can be added to a Routing Table in 2 ways: Statically: Static Routes are configured by an administrator Dynamically: Dynamic routes are learned from another router via a routing protocol.

Routing tables The routing table is used by the router to determine where to send packets It contains a set of routes which describe which gateway or interface the router uses to reach a specified network A route has four main components: Destination value Subnet mask Gateway or interface address Route cost or metric

routing When a router receives a packet, it must complete these 3 tasks in order to route it: Apply the Subnet Mask Examine the Routing Table Forward Packet

Apply the subnet mask In order for the router to determine if its table contains a route to the destination network, it must determine if there is a match between the destination network address and one of the routes in its routing table. The router applies the Subnet Mask of each potential route in it's table to the IP address in the packet to find the network address with the longest match

Applying the subnet mask

Examining the Routing table The network address that results from the Subnet Mask operation is then compared to the network addresses of the routes in the table to see if any of them match Sometimes there is more than one route to the destination network, so routing protocol rules determine which route the router uses. If none of the route entries match, the router directs the message to the gateway specified by its default route If there is no default route, the packet is simply dropped.

Examining the routing table

Forwarding the packet If a match is found, the packet is forwarded out the correct interface or to the appropriate gateway

Types of routes There are several types of routes that can exist in a router’s Routing Table Directly Connected Routes Static Routes Dynamic Routes Default route Routing tables do not contain end-to-end information about the entire path from a source network to a destination network. They only contain information about the next hop along that path. The next hop is typically a directly-connected network within the routing table. Eventually the message gets passed to a router that is directly connected to the destination host and the message is delivered.

Directly connected routes C 172.16.0.0/16 is directly connected, etc. When the router powers up, any configured interfaces are enabled The router stores the network address of any configured interfaces in the routing table On Cisco routers, these routes are identified in the routing table with the prefix C These routes are automatically updated whenever the interface is reconfigured or shut down

Static routes S 10.10.0.0 via 192.168.1.2 A manually configured route to a specific network is considered a static route A static route does not change until the administrator manually reconfigures it These routes are identified in the routing table with the prefix S.

Dynamic routes R 192.168.2.0/24 via 192.168.1.2 Dynamic routes are automatically created and maintained by routing protocols Routing protocols exchange routing information with other routers in the network. Dynamic routes are identified in the routing table with a prefix that corresponds to the type of routing protocol that created the route R is used for the Routing Information Protocol (RIP).

Default route Gateway of last resort is 192.168.1.2 to network 0.0.0.0 The default route is a type of static route that specifies the gateway to use when the routing table does not contain a path for the destination network. It is common for default routes to point to the next router in the path to the ISP. If a subnet has only one router, that router is automatically the default gateway, because all network traffic to and from that local network has no option but to travel through that router.

Viewing a Routing table The command show ip route is used to view the contents of a routing table

Configuring static routes Configuring a static route on a Cisco router requires these steps: Step 1. Enter privileged mode by typing enable at the R1> prompt. R1>enable R1# Step 2. Enter global configuration mode R1#config terminal R1(config)# Step 3. Use the ip route command ip route [destination_network] [subnet_mask] [gateway_address] or ip route [destination_network] [subnet_mask] [exit_interface] Example: R1(config)#ip route 192.168.16.0 255.255.255.0 192.168.15.1 R1(config)#ip route 192.168.16.0 255.255.255.0 S0/0/0

Configure a static route To enable two-way communication with a host on network 192.168.16.0, the administrator also needs to configure a static route to R1 on router 2 (R2).

Disadvantage of static routes Because static routes are configured manually, network administrators must add and delete static routes to reflect any changes in network topology. In a large network, manually maintaining routing tables could require significant administrative time. For this reason, larger networks generally use dynamic routing rather than static routes.

6.1.2: Routing protocols Routes can change very quickly. Problems with cables and hardware failures can make destinations unreachable through the designated interface. Routers need to be able to quickly update routes in a way that does not depend on the administrator to make the changes manually. Routers use routing protocols to dynamically manage information received from their own interfaces and from other routers. Routing protocols can also be configured to manage manually entered routes.

Dynamic routing A dynamic routing protocol operates in this way: Learn all the available routes to a destination Place the best routes into the routing table Remove routes when they are no longer valid Advantages: Avoids the time-consuming process of configuring static routes. Enables routers to react to changes in the network and to adjust their routing tables automatically

Routing algorithm The method that a routing protocol uses to determine the best route is called a routing algorithm. There are two main classes of routing algorithms: Distance vector Link state Each type uses a different method for determining the best route to a destination network. For two routers to exchange routes, they must be using the same routing protocol and therefore the same routing algorithm.

convergence Whenever the topology of a network changes because of reconfiguration or failure, the routing tables in all the routers must also change to reflect an accurate view of the new topology. When all the routers in a network have updated their tables to reflect the new route, the routers are said to have converged.

Dynamic routing

Distance-vector algorithms Distance vector algorithms evaluate route information using 2 basic criteria: Distance - How far away is the network from this router? Vector - In which direction should the packet be sent to reach this network? distance vector routing protocols periodically pass copies of their routing table from router to router. These regular updates between routers communicate topology changes.

Distance-vector criteria The distance component of a route is expressed in terms of a route cost, or metric, that can be based on any of these: Hop count Bandwidth Transmission speed (Load) Delay Reliability Administrative cost The vector, or direction, component of a route is the address of the next hop along the path to the network named in the route. A hop is a router that the packet must pass through

Routing metrics Each routing protocol uses different metrics. Two routing protocols might choose different paths to the same destination because they use different metrics Ex: RIP chooses the path with the fewest number of hops, whereas EIGRP chooses the path based on the highest bandwidth and least delay. Metrics used in IP routing protocols include: Hop count - Number of routers a packet must traverse. Bandwidth - Bandwidth of a specific link. Load - Traffic utilization of a specific link (transmission speed) Delay - Time a packet takes to traverse a path. Reliability -- Probability of a link failure, based on the interface error count or previous link failures. Cost - Determined by either the Cisco IOS application or the network administrator to indicate preference for a route. Cost can represent a metric, a combination of metrics, or a policy.

Distance-vector characteristics Routing Updates: Routers share copies of the entire routing table at regular, periodic intervals The Distance metric can be based on hops, cost, bandwidth, speed, delay or reliability The Vector is the address of the next hop along a route

Finding the best path Each router that uses distance vector routing communicates its routing information to its neighbors. Neighbor routers share a directly connected network. The interface that leads to each directly connected network has a distance of 0. Eventually, each router learns about other more-remote networks based on the information that it receives from its neighbors. Each of the network entries in the routing table has an accumulated distance vector to show how far away that network is in a given direction. As the distance vector discovery process continues, routers discover the best path to destination networks based on the information they receive from each neighbor. The best path is the path with the shortest distance or smallest metric.

Hop count

6.1.3: RIP Routing Information Protocol (RIP) is a distance vector routing protocol that is commonly used RIP Characteristics Defined in RFC 1058 Distance vector protocol that uses hop count as its metric Defines a hop count greater than 15 as an unreachable route Sends updates every 30 seconds Simple and easy to implement.

Rip operation When a router receives a routing update with a change, it updates its routing table to reflect that change. If the router learns a new route from another router, it increases the hop count value by one before adding that route to its own routing table. The router uses the local network address of the directly connected router that sent the update as the next hop address. After updating its routing table, the router immediately begins transmitting routing updates to inform other network routers of the change. These updates, called triggered updates, are sent when a router learns about a new route, and are sent independently of the regularly scheduled updates that RIP routers forward.

Rip disadvantages Not Scalable: Allows a maximum of 15 hops, so it can only be used for networks that connect no more than 16 routers in a series. Uses a lot of Bandwidth: Periodically sends complete copies of the entire routing table to directly connected neighbors. In a large network, this can cause a significant amount of network traffic each time there is an update. Converges Slowly: on larger networks when the network changes, the routers are slow to converge

Ripv.1 vs. ripv.2 There are currently two versions of RIP available: Does not send subnet mask information in the updates Must use classful default subnet masks RIPv2 Supports classless routing Includes the subnet mask information in routing updates RIPv2 has many advantages over RIPv1 and is usually used unless the equipment cannot support RIPv2.

Enabling Routing Protocols

eigrp EIGRP is an enhanced distance vector routing protocol. EIGRP was developed to address some of the limitations of RIP: the hop count metric maximum network size of 15 hops EIGRP can use a number of metrics: The default ones used are: Bandwidth Delay: The delay encountered when a packet travels a particular route The characteristics of EIGRP are: Distance-vector protocol Cisco proprietary Uses a variety of metrics to calculate the cost of a route Updates are only sent when a route metric changes (after the initial exchange) Combines the next hop and metric features of distance vector protocols with additional database and update features Works well for larger networks Has a maximum hop count of 224 hops

Eigrp Tables EIGRP does not rely only on the routing table, it creates 2 other database tables to help make routing decisions: Neighbor Table Stores data about the neighboring routers that are directly connected Includes information such as the interface IP addresses, interface type, and bandwidth. Topology Table Built using the advertisements of its neighbors Contains all the routes advertised by the neighbor routers EIGRP uses the Diffused Update Algorithm (DUAL) to calculate the shortest path to a destination Enables a router running EIGRP to find the best alternate path quickly when a network change occurs. If no alternate route exists in the topology table, EIGRP queries its neighbors to find a new path to the destination.

Eigrp updates

Link-state Protocols Routers that use the distance vector routing algorithm have little information about distant networks and none about distant routers. A link-state routing algorithm maintains a full database of distant routers and how they interconnect Link-state routing uses the following features: Routing table - List of the known paths and interfaces. Link-state advertisement (LSA) – A small packet that describes the state of the interfaces (links) of a router, which is sent between routers. Topological database - Collection of information gathered from all the LSAs received by the router. Shortest Path First (SPF) algorithm – A Calculation performed on the database that results in the SPF tree. The SPF tree is a map of the network as seen from the point of view of the router. The information in this tree is used to build the routing table.

Link-state operation When LSAs are received from other routers, the SPF algorithm analyzes the information in the database to construct the SPF tree. Based on the SPF tree, the SPF algorithm then calculates the shortest paths to other networks. Each time a new LSA packet causes a change to the link-state database, SPF recalculates the best paths and updates the routing table.

Link-state updates

ospf Open Shortest Path First (OSPF) is a non-proprietary, link-state routing protocol described in RFC 2328. Characteristics of OSPF are: Link state protocol Uses the SPF algorithm to calculate the lowest cost to a destination Sends routing updates only when the topology changes Provides fast convergence Supports Variable Length Subnet Mask (VLSM) and discontiguous subnets Provides route authentication

Ospf operation In OSPF networks, routers send link-state advertisements to each other ONLY when a change occurs Ex: when a new neighbor is added, or when a link fails or is restored. If the network topology changes, the routers affected by the change send update LSAs to the rest of the network. All routers update their topology databases accordingly, regenerate their SPF trees to find new shortest paths to each network, and update their routing tables with the changed routes. OSPF requires more router resources, such as RAM and CPU processing power, and is an advanced networking protocol that requires an experienced support staff.

ospf

Choosing a routing protocol Sometimes it is necessary to use multiple routing protocols (when merging two pre-existing networks) but usually it is recommended that only one routing protocol be enabled for the entire network. As the size of a network grows, its routing needs will change Small networks with only one gateway to the Internet can probably use static routes As an organization grows and adds routers to its network topology, RIPv2 can be used. When a network begins to exceed 15 routers, RIP is no longer a good choice. For larger networks, EIGRP and OSPF are commonly used,

Criteria for choosing a protocol The 3 main criteria to consider when choosing a routing protocols: Ease of management What information does the protocol keep about itself? Which show commands are available? Ease of configuration How many commands does the average configuration require Is it possible to configure several routers in the network with the same configuration? Efficiency How much bandwidth does the routing protocol use while it is in a steady state, and how much could it use when converging in response to a major network event?

Administrative distance What happens if a router is using more than 1 routing protocol? Which route does it use? Each routing protocol has a value called the Administrative Distance, which signifies the reliability and efficiency of its routes If a router learns about 2 different routes from 2 different sources (ex. Static route vs. RIP route vs. EIGRP route) it will use the route with the LOWEST Administrative Distance, because this should be the most reliable route

Administrative distances

Configuring rip Step 1: Configure each interface with an IP address and enable it R1(config)# interface S0 R1(config-if)#ip add 192.168.1.1 255.255.255.0 R1(config)# interface fa 0/0 R1(config-if)#ip add 192.168.2.1 255.255.255.0 Step 2: Configure RIP routing protocol Enable rip routing protocol R1(config)# router rip Specify the version of rip R1(config-router)# version 2 Specify the connected networks to advertise R1(config-router)# network 192.168.1.0 R1(config-router)# network 192.168.2.0

Rip configuration

Verify rip Verify the Configuration: Ping devices on remote networks After a configuration is done, it is a good idea to compare the running configuration with an accurate topology diagram to verify the network numbers and interface IP addresses. This is good practice because it is easy to make a simple data entry error. Verify the Configuration: Ping devices on remote networks Verify RIP configuration Show run Show ip protocols Show ip route Troubleshoot RIP Debug ip rip

Show ip protocols Verifies that RIP routing is configured Verifies that the correct interfaces are sending and receiving RIP updates Verifies that the router is advertising the correct networks.

Show ip route Shows the routing table, which verifies that routes received by RIP neighbors are installed in the routing table

Debug ip rip Shows updates in real-time (as they are sent and received) debug activity uses router processor resources, so use with care

6.2: autonomous systems The Internet routing architecture has evolved over the years into a distributed system of interconnected networks. It is impossible for a single organization to manage all the routing information needed to reach every destination around the world. The Internet is divided up into collections of networks called Autonomous Systems (AS) An AS is a set of networks controlled by a single administrative authority using the same internal routing policy throughout. Each AS is identified by a unique AS number (ASN). ASNs are controlled and registered on the Internet.

ISP as vs. private as ISP AS Business that connect to the Internet through a single ISP become part of that ISP’s AS The AS is administered by the ISP It includes the ISP’s network routes and it also manages the routes to all the business and other customer networks that are connected to it. Private AS Larger companies with branches in multiple cities might connect to several local ISPs. This prevents them from being part of the ISP's AS These companies will register as a private AS with its own number

Autonomous system Numbers

Interior vs exterior routing Interior gateway routing protocols: used to exchange routing information within an AS or individual organization The purpose is to find the best path through the internal network. Run on the routers inside an organization Examples : are RIP, EIGRP, and OSPF. Exterior routing protocols : designed to exchange routing information between different autonomous systems protocols that can communicate between diverse systems serves as a translator for ensuring that external routing information gets successfully interpreted inside each AS network Run on dedicated exterior routers, located at the border of an AS, called border gateways Examples: BGP 95% of all autonomous systems use BGP

Exterior vs. Interior routing protocols

Routing packets through the internet Source host sends a packet destined for a remote host in another AS. The destination IP address of the packet is not a local network, so interior routers keep passing the packet along their default routes, until eventually it arrives at an exterior router at the edge of the local AS. The exterior router maintains a reachability database for all the autonomous systems with which it connects. This helps the router direct the packet through several autonomous systems The exterior router directs the packet to its next hop on the path, which is the exterior router at the neighboring AS. The packet arrives at the neighboring AS, where the exterior router checks its own reachability database and forwards the packet to the next AS on the path. The process is repeated at each AS until the exterior router at the destination AS recognizes the destination IP address of the packet as an internal network in that AS. The final exterior router then directs the packet to the next hop interior router listed in its routing table. The packet is then treated as a local packet and is directed through interior routing protocols through a series of internal next hops until it arrives at the destination host.

Routing packets through the internet

Isps rely on egps EGPs provides 2 useful features for ISPs. Allow traffic to be routed across the Internet to remote destinations Provide the method by which ISPs can set and enforce Routing Policies Routing Policies: ensure that the traffic flow through the ISP is efficient and that none of the internal routes are overloaded with transit traffic. ISPs must provide reliable internet service for their customers Must provide backup routes and routers in case the regular route fails

Isps rely on egps

Internet traffic The flow of messages in the Internet is called traffic Internet traffic can be categorized in 2 ways: Local traffic - Traffic carried within an AS that either originated in that same AS, or is intended to be delivered within that AS Transit traffic - Traffic that was generated outside that AS and can travel through the internal AS network to be delivered to destinations outside the AS

Flow of traffic between ass The flow of traffic between autonomous systems is carefully controlled. It is important to be able to limit or even prohibit certain types of messages from going to or from an AS for security reasons or to prevent overloading. Many autonomous systems network administrators choose not to carry transit traffic. Transit traffic can cause routers to overload and fail if those routers do not have the capacity to handle large amounts of traffic.

When to configure bgp When an ISP puts a router at a customer location, they will configure it with a default static route to the ISP Sometimes, an ISP may want the router to be included in its AS and to participate in BGP routing It is then necessary to configure the customer premise router with the commands necessary to enable BGP

Configure bgp Configure the AS number Router(config)# router bgp [AS_number] Identify the ISP router that is the BGP neighbor with which the customer premises equipment (CPE) router exchanges information Router(config-router)# neighbor [IP_address] remote-as [AS_number] Configure BGP to advertise an internal network route When an ISP customer has its own registered IP address block, it may want the routes to some of its internal networks to be known on the Internet. Router(config-router)# network [network_address]

Configure bgp

Summary Routing is used to forward messages to the correct destination All routers make routing decisions by looking up information stored in their routing tables. Routes can be statically assigned by an administrator, or dynamically learned by the router via a routing protocol. Dynamic Routing requires the use of a routing protocol to exchange information between routers Routing protocols can be either distance-vector or link-state protocols Distance-vector protocols calculate the direction and distance to any network Link-State protocols update devices with information on the state of links when there is a change Choosing a routing protocol should use criteria such: ease of management, ease of configuration, and efficiency An Organization’s network is also called an Autonomous Systems. Within an autonomous system, Interior Gateway Routing Protocols are used – Ex. RIP, EIGRP, OSPF Between Autonomous Systems, Exterior Gateway routing protocols control the flow of traffic – Ex. BGP Exterior Protocols allow traffic to be routed across the Internet and allows ISPs to set and enforce routing policies for traffic flow efficiency