Chapter 6 Routing
Objectives
Describe the purpose and function of dynamic routing and the protocols used to implement it Configure RIPv2 dynamic routing using Cisco IOS Describe the use of exterior routing protocols across the Internet Enable BGP on a customer site router
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
Routing
Routing is the method by which network devices direct messages across networks to arrive at the correct destination. Router makes routing decisions by looking up information stored in their routing tables. The routing table contain information about the routes that router uses to reach to destination These routes can be statically assigned to the router by administrator or can be dynamically given to the router via a program called a routing protocol
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
Routing
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
Routing
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
Routing
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
Routing
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
Routing
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
Routing
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
Routing
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
10
Routing
Every router uses a routing table to make decisions where to send packets. A route has four main components:
Destination value Mask Gateway or interface address Route cost or metric
The router looks at the destination IP address in the packet and then looks for a matching route in the routing table. The resulting network address is then compared to the network address of the route in the table.
If a match is found, the packet is forwarded out the correct interface When the network address matches more than one route in the routing table, the router uses the route that has the most specific, or longest, network address match from its routing table. Sometimes there is more than one equal cost route to the same destination network. There are routing protocol rules that determine which route the router will use. If none of the route entries match, the router directs the message to the gateway specified by the default route if it has been configured.
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com 11
Routing
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
12
Routing
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
13
Routing
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
14
Routing
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
15
Routing- configure static route
Configure static route
1. Connect to the router using a console cable. 2. Open a HyperTerminal window to connect with the first router that you want to configure. 3. Enter privileged mode Router1>enable Router1# 4. Enter global configuration mode. Router1#config terminal Router1(config)# 5. Use the ip route IOS command to configure the static route, with the following format: ip route [destination_network] [subnet_mask] [gateway_address]
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
16
Routing- configure static route
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
17
Routing- configure static route
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
18
Routing protocols
Routers use routing protocols to dynamically manage information received from their own interfaces and from other routers. A dynamic routing protocol learns all available routes, places the best routes into the routing table, and removes routes when they are no longer valid The method that a routing protocol uses to determine the best route to a destination network is called a routing algorithm. In order for two routers to exchange routes, they must be using the same routing protocol and therefore the same routing algorithm. There are two main classes of routing algorithms: distance vector and link state.
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
19
Routing protocols- distance vector
The distance vector routing algorithm passes periodic copies of a routing table from router to router. Two basic criterias: Distance - How far away is the network from this router? Vector - In what direction should the packet be sent to reach this network? The distance component of a route is expressed in terms of a route cost, or metric, that can represent: Number of hops Administrative cost Bandwidth Transmission speed Likelihood of delays Reliability 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
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
20
Routing protocols- distance vector
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
21
Routing protocols- distance vector
Neighbor routers share a directly connected network. Each router receives a routing table from its directly connected neighbor routers. 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 proceeds, 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 Routing table updates also occur periodically
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
22
Routing protocols- distance vector
Refer: 6.1.2.3
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
23
Routing protocols- activity
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
24
Common Interior Routing Protocols- RIP
Routing Information Protocol (RIP) is a distance vector routing protocol that is used in thousands of networks throughout the world. The key characteristics of RIP include the following: Initially specified in RFC 1058 Is a distance vector routing protocol Uses hop count as the metric for path selection Defines a hop count greater than 15 as an unreachable route Sends routing table contents every 30 seconds, by default Refer 6.1.3.1 When a router receives a routing update that includes a new or changed route, the router updates its routing table to reflect this new route. At each router, the hop count value is increased by one. The router uses the local network address of the directly connected router which sent the update as the next hop address. Triggered updates: are sent independently when topology changes
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
25
Common Interior Routing Protocols- RIP
The RIP protocol is simple, easy to implement, and is available free of cost with most routers. These advantages make RIP a widely used and popular routing protocol. RIP has several disadvantages: Allows a maximum of 15 hops, so it can only be used for networks that connect no more than 16 routers in series. 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. There are currently two versions of RIP available: RIPv1 & RIPv2 The most significant difference between RIP version 1 and 2 is that RIPv2 can support classless routing, because it includes the subnet mask information in routing updates. RIPv1 does not send subnet mask information in the updates; therefore it must rely on the classfull default subnet masks.
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
26
Common Interior Routing Protocols- RIP
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
27
Common Interior Routing Protocols- RIP
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
28
Common Interior Routing Protocols- RIP
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
29
Common Interior Routing Protocols-EIGRP
Enhanced Interior Gateway Routing Protocol (EIGRP) is a Cisco proprietary enhanced distance vector routing protocol. EIGRP uses a number of metrics, including a configured bandwidth value, and the delay encountered when a packet travels a particular route. The key characteristics of EIGRP are: Uses a variety of metrics to calculate the cost of a route Combines the next hop and metric features of distance vector protocols, with additional database and update features Has a maximum hop count of 224 hops EIGRP creates three database tables: the neighbor table, the topology table and the routing table The neighbor table stores data about the neighboring routers that are on directly connected local networks. The topology table contains all of the routes advertised by the neighbor routers. EIGRP depends on a routing algorithm called Diffused Update Algorithm (DUAL) to calculate the shortest path to a destination within a network and to install this route into the routing table.
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
30
Common Interior Routing Protocols-EIGRP
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
31
Routing protocols- Link-state
The 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) - Small packet of routing information that is sent between routers. LSAs describe the state of the interfaces (links) of a router, as well as other information, such as the IP address of each link Topological database - Collection of information gathered from all the LSAs received by the router SPF (Shortest Path First) algorithm - 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 (Each time a new LSA packet causes a change to the link-state database; SPF recalculates the best paths and updates the routing table.)
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
32
Routing protocols- Link-state
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
33
OSPF
Open Shortest Path First (OSPF) is a non-proprietary link-state routing protocol described in RFC 2328. The key characteristics of OSPF are: Uses the SPF algorithm to calculate the lowest cost to a destination Sends routing updates only when the topology changes; does not send periodic updates of the entire routing table. Provides fast convergence Supports VLSM and discontiguous subnets Provides route authentication
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
34
Routing Within An Organization
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. It is easy to configure and in small networks can work well. When a network begins to exceed 15 routers, RIP is no longer a good choice. For larger networks, EIGRP and OSPF are common. The three main criteria in helping settle on a protocol are: Ease of management - What information does the protocol keep about itself? What show commands are available? Ease of configuration - How many commands will the average configuration require? Is it possible to configure several routers in your network with the same configuration? Efficiency - How much bandwidth does the routing protocol take up while in steady state, and how much could it take up, when converging in response to a major network event?
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
35
Routing Within An Organization
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
36
Routing Within An Organization
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
37
Routing Within An Organization
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
38
Routing Within An Organization
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
39
Routing Within An Organization
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
40
Routing Within An Organization
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
41
Configure and Verify RIP
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
42
Configure and Verify RIP
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
43
Configure and Verify RIP
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
44
Configure and Verify RIP
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
45
Configure and Verify RIP
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
46
Configure and Verify RIP
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
47
Configure and Verify RIP
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
48
Configure and Verify RIP
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
49
Autonomous Systems
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. The most common example of an AS is the ISP
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
50
Autonomous Systems
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
51
AS- Activity
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
52
Routing between Autonomous Systems
Interior Gateway Protocols (IGP) are used to exchange routing information within an autonomous system or individual organization. Examples: RIP, EIGRP and OSPF. Exterior gateway protocols (EGP) are designed to exchange routing information between different Autonomous Systems. Examples: BGPv4 EGP protocols run on the exterior routers, that is, the routers that are located at the border of an AS. Exterior routers are also called border gateways.
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
53
Routing Across the Internet
Packets are routed across the Internet in several steps:
1. The source host sends a packet destined for a remote host located in another AS. 2. Since the destination IP address of the packet is not a local network, the 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. 3. The exterior router maintains a database for all the Autonomous Systems with which it connects. This reachability database tells the router that the path to the destination network passes through several ASs, and that the next hop on the path is through a directly-connected exterior router on a neighboring AS. 4. The exterior router directs the packet to its next hop on the path, which is the exterior router at the neighboring AS. 5. 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. 6. 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. 7. The final exterior router then directs the packet to the next hop interior router listed in its routing table. From then on, the packet is treated just like any local packet and is directed through interior routing protocols through a series of internal next hops until it arrives at the destination host.
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com 54
Routing Across the Internet
Step 1
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
55
Routing Across the Internet
Step 2
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
56
Routing Across the Internet
Step 3
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
57
Routing Across the Internet
Step 4
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
58
Routing Across the Internet
Step 5
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
59
Routing Across the Internet
Step 6
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
60
Step 7
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
61
Exterior Routing Protocols and the ISP
EGPs not only allow traffic to be routed across the Internet to remote destinations, but they also provide the method by which ISPs can set and enforce policies and local preferences so that the traffic flow through the ISP is efficient and that none of the internal routes are overloaded with transit traffic Business customers insist on reliability for their Internet service, and so ISPs must make sure that the Internet connection for those customers is always available. They do this by providing backup routes and routers in case the regular route fails
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
62
Exterior Routing Protocols and the ISP
The flow of messages in the Internet is called traffic. Internet traffic can be categorized in one of two ways: Local Traffic - Traffic carried within an AS that either originated in that same AS, or is intended to be delivered within that AS. This is like local traffic on a street. Transit Traffic - Traffic that was generated outside that AS and can travel through the internal AS network in route to be delivered to destinations outside the AS. This is like through traffic on a street. The flow of traffic between Autonomous Systems is carefully controlled.
63
Configure and Verify BGP
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
64
Summary
Routing is used to forward messages to the correct destination Routing can be dynamic or static Distance vector and Link-state dynamic routing protocols IGP & EGP (BGP)
Hc vin cng ngh thng tin Bach Khoa - Website: www.bkacad.com
65
66
