Unit 3: Dynamic Routing

Size: px
Start display at page:

Download "Unit 3: Dynamic Routing"

Transcription

1 Unit 3: Dynamic Routing Basic Routing The term routing refers to taking a packet from one device and sending it through the network to another device on a different network. Routers don t really care about hosts they only care about networks and the best path to each one of them. The list of the minimum factors a router must know to be able to affectively route packets: Destination address Neighbor routers from which it can learn about remote networks Possible routes to all remote networks The best route to each remote network How to maintain and verify routing information The router learns about remote networks from neighboring routers or from an administrator. The router then builds a routing table, which is basically a map of the internetwork, and it describes how to find remote networks. If a network is directly connected, then the router already knows how to get to it. The static routing method requires someone to hand-type all network locations into the routing table. Conversely, when dynamic routing is used, a protocol on one router communicates with the same protocol running on neighboring routers. The routers then update each other about all the networks they know about and place this information into the routing table. If a change occurs in the network, the dynamic routing protocols automatically inform all routers about the event. If static routing is used, the administrator is responsible for updating all changes by hand onto all routers. Dynamic Routing Dynamic routing is when protocols are used to find networks and update routing tables on routers. A routing protocol defines the set of rules used by a router when it communicates routing information between neighboring routers. Two types of routing protocols are used in internetworks: interior gateway protocols (IGPs) and exterior gateway protocols (EGPs). IGPs are used to exchange routing information with routers in the same autonomous system (AS). An AS is either a single network or a collection of networks under a common administrative domain, which basically means that all routers sharing the same routing-table information are in the same AS. EGPs are used to communicate between ASs. An example of an EGP is Border Gateway Protocol (BGP). Routing Protocol Basics Administrative Distances:

2 The administrative distance (AD) is used to rate the trustworthiness of routing information received on a router from a neighbor router. An administrative distance is an integer from 0 to 255, where 0 is the most trusted and 255 means no traffic will be passed via this route. If a router receives two updates listing the same remote network, the first thing the router checks is the AD. If one of the advertised routes has a lower AD than the other, then the route with the lowest AD will be chosen and placed in the routing table. If both advertised routes to the same network have the same AD, then routing protocol metrics like hop count and/or the bandwidth of the lines will be used to find the best path to the remote network. Autonomous Systems: Within the Internet, an autonomous system (AS) is a collection of connected Internet Protocol (IP) routing prefixes under the control of one or more network operators on behalf of a single administrative entity or domain that presents a common, clearly defined routing policy to the Internet. The newer definition in RFC 1930 came into use because multiple organizations can run Border Gateway Protocol (BGP) using private AS numbers to an ISP that connects all those organizations to the Internet. Even though there may be multiple autonomous systems supported by the ISP, the Internet only sees the routing policy of the ISP. That ISP must have an officially registered autonomous system number (ASN). A unique ASN is allocated to each AS for use in BGP routing. AS numbers are important because the ASN uniquely identifies each network on the Internet. Redistribution of Routing Information: Route redistribution is when we take a route from one routing protocol and inject it or distribute it into another protocol. By default, routers only advertise and share routes with other routers running the same protocol. So if we have 2 routers and one runs OSPF and the other runs EIGRP and we want them to know about each other s routes, by default, they won't share routing information because they are not running the same protocol.

3 Load Balancing: Network load balancing (commonly referred to as dual-wan routing or multihoming) is the ability to balance traffic across two WAN links without using complex routing protocols like BGP. This capability balances network sessions like Web, , etc. over multiple connections in order to spread out the amount of bandwidth used by each LAN user, thus increasing the total amount of bandwidth available. For example, a user has a single WAN connection to the Internet operating at 1.5Mbit/s. They wish to add a second broadband (cable, DSL, wireless, etc.) connection operating at 2.5Mbit/s. This would provide them with a total of 4Mbit/s of bandwidth when balancing sessions. Routing Protocols There are three classes of routing protocols: 1. Distance vector: The distance-vector protocols in use today find the best path to a remote network by judging distance. In RIP routing, each instance where a packet goes through a router is called a hop, and the route with the least number of hops to the network will be chosen as the best one. RIP is a distance-vector routing protocol and periodically sends out the entire routing table to directly connected neighbors. 2. Link state: In link-state protocols, also called shortest-path-first protocols, the routers each create three separate tables. One of these tables keeps track of directly attached neighbors, one determines the topology of the entire internetwork, and one is used as the routing table. OSPF is an IP routing protocol that s completely link-state. Link state protocols send updates containing the state of their own links to all other directly connected routers on the network. 3. Hybrid: Hybrid protocols use aspects of both distance-vector and link-state protocols, and EIGRP is a great example. Routing Information Protocol (RIP) Routing Information Protocol (RIP) is a true distance-vector routing protocol. RIP sends the complete routing table out of all active interfaces every 30 seconds. It relies on hop count to determine the best way to a remote network, but it has a maximum allowable hop count of 15 by default, so a destination of 16 would be considered unreachable. RIP version 1 uses only classful routing, which means that all devices in the network must use the same subnet mask. This is because RIP version 1 doesn t send updates with subnet mask

4 information in tow. RIP version 2 provides something called prefix routing and does send subnet mask information with its route updates. This is called classless routing. RIP Operation: A big problem with distance vector routing protocol is routing loop. Let s take a look at how a routing loop occurs. Here we have routers A, B and C. Notice that at the beginning (when a routing protocol is not turned on) there are only directly connected networks in the routing tables of these routers. For example, in the routing table of router A, network has already been known because it is directly connected through interface E0 and the metric (of a directly connected network) is 0 (these 3 parameters are shown in the routing tables below). Also B knows networks & with a metric of 0. Also C knows networks & with a metric of 0. Now we turn on RIP on these routers (In the rest of this article, we will call network network 1, network 2 and so on). RIP sends update every 30 seconds so after 30 sec goes by, A sends a copy of its routing table to B, B already knew about network 2 but now B learns about network 1 as well. Notice the metric we have here for directly connected networks, since we re using RIP, we re using a metric of hop count. Remember a hop count (or a hop) is how many routers that these packets will have to go through to reach the destination. For example, from router A to network 1 & 2 (which are directly connected) it goes to 0 hop, router B has now learned about network 1 from A via E0 interface so the metric now will be 1 hop.

5 Each router receives a routing table from its direct neighbor. For example, Router B receives information from Router A about network 1 and 2. It then adds a distance vector metric (such as the number of hops), increasing the distance vector of these routes by 1. B also exchanges its routing table with A about network 2 and 3. B then passes the routing table to its other neighbor, Router C.

6 C also sends its update to B and B sends it to A. Now the network is converged. Now let s assume network 4 down suddenly.

7 When network 4 fails, Router C detects the failure and stops routing packets out its E1 interface. However, Routers A and B have not yet received notification of the failure. Router A still believes it can access through Router B. The routing table of Router A still reflects a path to network with a distance of 2 and router B has a path with a distance of 1. There will be no problem if C sends an update earlier than B and inform that network is currently down but if B sends its update first, C will see B has a path to network 4 with a metric of 1 so it updates its routing table, thinking that if B can go to network 4 by 1 hop than I can go to network 4 by 2 hops but of course this is totally wrong. The problem does not stop here. In turn, C sends an update to B and informs it can access network 4 by 2 hops. B learns this and think if C can access network 4 by 2 hops than I can access by 3 hops.

8 This same process occurs when B continually sends its update to C and the metric will increase to infinity so this phenomenon is called counting to infinity. Below lists some methods to prevent this phenomenon: SPLIT HORIZON: A router never sends information about a route back in same direction which is original information came, routers keep track of where the information about a route came from. Means when router A sends update to router B about any failure network, router B does not send any update for same network to router A in same direction. ROUTE POISONING: Router consider route advertised with an infinitive metric to have failed ( metric=16) instead of marking it down. For example, when network 4 goes down, router C starts route poisoning by advertising the metric (hop count) of this network as 16, which indicates an unreachable network. When router B receives this advertising, it continue advertising this network with a metric of 16. POISON REVERSE: The poison reverse rule overwrites split horizon rule. For example, if router B receives a route poisoning of network 4 from router C then router B will send an update back to router C (which breaks the split horizon rule) with the same poisoned hop count of 16. This ensures all the routers in the domain receive the poisoned route update. Notice that every router performs poison reverse when learning about a downed network. In the above example, router A also performs poison reverse when learning about the downed network from B. HOLD DOWN TIMERS: After hearing a route poisoning, router starts a hold-down timer for that route. If it gets an update with a better metric than the originally recorded metric within the hold-down timer period, the

9 hold-down timer is removed and data can be sent to that network. Also within the hold-down timer, if an update is received from a different router than the one who performed route poisoning with an equal or poorer metric, that update is ignored. During the hold-down timer, the downed route appears as possibly down in the routing table. For example, in the above example, when B receives a route poisoning update from C, it marks network 4 as possibly down in its routing table and starts the hold-down timer for network 4. In this period if it receives an update from C informing that the network 4 is recovered then B will accept that information, remove the hold-down timer and allow data to go to that network. But if B receives an update from A informing that it can reach network by 1 (or more) hop, that update will be ignored and the hold-down timer keeps counting. Note: The default hold-down timer value = 180 second. TRIGGERED UPDATE: When any route failed in network, do not wait for the next periodic update instead send an immediate update listing the poison route. COUNTING TO INFINITY: Maximum count 15 hops after it will not be reachable. RIP Timers: RIP uses several timers to regulate its operation. These timers are described below: Update timer: how often the router sends update. Default update timer is 30 seconds Invalid timer (also called Expire timer): how much time must expire before a route becomes invalid since seeing a valid update; and place the route into hold down. Default invalid timer is 180 seconds Disadvantages with RIP Increased network traffic: RIP checks with its neighboring routers every 30 seconds, which increases network traffic. Maximum hop count: RIP has a maximum hop count of 15, which means that on large networks, other remote routers may not be able to be reached. Closest may not be shortest: Choosing the closest path by hop count does not necessarily mean that the fastest route was selected. RIP does not consider other factors when calculating best path. RIP only updates neighbors so the updates for non-neighboring routers are not first-hand information.

10 Dijkstra Algorithm Here we want to find the best route between A and E (see below). We can see that there are six possible routes between A and E (ABE, ACE, ABDE, ACDE, ABDCE, ACDBE), and it's obvious that ABDE is the best route because its weight is the lowest. But life is not always so easy, and there are some complicated cases in which we have to use algorithms to find the best route. 1. As we see in the first image, the source node (A) has been chosen as T-node, and so its label is permanent (we show permanent nodes with filled circles and T-nodes with the --> symbol). 2. In the next step, we see that the status record set of tentative nodes directly linked to T- node (B, C) has been changed. Also, since B has less weight, it has been chosen as T-node and its label has changed to permanent (see below). 3. In step 3, like in step 2, the status record set of tentative nodes that have a direct link to T- node (D, E), has been changed. Also, since D has less weight, it has been chosen as T-node and its label has changed to permanent.

11 4. In step 4, we don't have any tentative nodes, so we just identify the next T-node. Since E has the least weight, it has been chosen as T-node. Overview of OSPF Open Shortest Path First is an open standard routing protocol that s been implemented by a wide variety of network vendors, including Cisco. Here s a list that summarizes some of OSPF s best features: 1. Allows for the creation of areas and autonomous systems 2. Minimizes routing update traffic 3. Is highly flexible, versatile, and scalable 4. Supports VLSM/CIDR 5. Offers an unlimited hop count 6. Is open standard and supports multi-vendor deployment Here are three of the biggest reasons to implement OSPF in a way that makes full use of its intentional, hierarchical design: 1. To decrease routing overhead 2. To speed up convergence 3. To confine network instability to single areas of the network

12 An OSPF hierarchical design minimizes routing table entries and keeps the impact of any topology changes contained within a specific area. OSPF runs great inside an autonomous system, but it can also connect multiple autonomous systems together. The router that connects these ASs is called an autonomous system boundary router (ASBR). OSPF Terminology: Link: A link is a network or router interface assigned to any given network. When an interface is added to the OSPF process, it s considered to be a link. This link, or interface, will have up or down state information associated with it as well as one or more IP addresses. Router ID: The router ID (RID) is an IP address used to identify the router. Cisco chooses the router ID by using the highest IP address of all configured loopback interfaces. If no loopback interfaces are configured with addresses, OSPF will choose the highest IP address out of all active physical interfaces. To OSPF, this is basically the name of each router. Neighbor: Neighbors are two or more routers that have an interface on a common network, such as two routers connected on a point-to-point serial link. Adjacency: An adjacency is a relationship between two OSPF routers that permits the direct exchange of route updates. Designated router: A designated router (DR) is elected whenever OSPF routers are connected to the same broadcast network to minimize the number of adjacencies formed and to publicize received routing information to and from the remaining routers on the broadcast network or link.

13 Backup designated router: A backup designated router (BDR) is a hot standby for the DR on broadcast, or multi-access, links. The BDR receives all routing updates from OSPF adjacent routers but does not disperse LSA updates. Hello protocol: The OSPF Hello protocol provides dynamic neighbor discovery and maintains neighbor relationships. Hello packets and Link State Advertisements (LSAs) build and maintain the topological database. Hello packets are addressed to multicast address Link State Advertisement: A Link State Advertisement (LSA) is an OSPF data packet containing link-state and routing information that s shared among OSPF routers. An OSPF router will exchange LSA packets only with routers to which it has established adjacencies. OSPF areas: An OSPF area is a grouping of contiguous networks and routers. All routers in the same area share a common area ID. OSPF Operation OSPF operation is basically divided into these three categories: - Neighbor and adjacency initialization - LSA flooding - SPF tree calculation Neighbor and Adjacency Initialization: The beginning neighbor/adjacency formation stage is a very big part of OSPF operation. When OSPF is initialized on a router, the router allocates memory for it, as well as for the maintenance of both neighbor and topology tables. Once the router determines which interfaces have been configured for OSPF, it will then check to see if they re active and begin sending Hello packets. The Hello protocol is used to discover neighbors, establish adjacencies, and maintain relationships with other OSPF routers. Hello packets are periodically sent out of each enabled OSPF interface and in environments that support multicast. The address used for this is , and the frequency with which Hello packets are sent out depends upon the network type and topology. Broadcast and point-to-point networks send Hellos every 10 seconds, whereas non-broadcast and point-to-multipoint networks send them every 30 seconds.

14 LSA Flooding LSA flooding is the method OSPF uses to share routing information. LSA information containing link-state data is shared with all OSPF routers within an area. The network topology is created from the LSA updates, and flooding is used so that all OSPF routers have the same topology map to make SPF calculations with. Efficient flooding is achieved through the use of a reserved multicast address: (AllSPFRouters). LSA updates, which indicate that something in the topology has changed, are handled a bit differently. The network type determines the multicast address used for sending updates. Table below contains the multicast addresses associated with LSA flooding. Point-tomultipoint networks use the adjacent router s unicast IP address. Once the LSA updates have been flooded throughout the network, each recipient must acknowledge that the flooded update has been received. It s also important for recipients to validate the LSA update. SPF Tree Calculation Within an area, each router calculates the best/shortest path to every network in that same area. This calculation is based upon the information collected in the topology database and an algorithm called shortest path first (SPF). It s important to understand that this tree contains only networks that exist in the same area as the router itself does. If a router has interfaces in multiple areas, then separate trees will be constructed for each area. One of the key criteria considered during the route selection process of the SPF algorithm is the metric or cost of each potential path to a network. But this SPF calculation doesn t apply to routes from other areas. OSPF Metrics OSPF uses a metric referred to as cost. A cost is associated with every outgoing interface included in an SPF tree. The cost of the entire path is the sum of the costs of the outgoing interfaces along

15 the path. Cisco uses a simple equation of 108/bandwidth, where bandwidth is the configured bandwidth for the interface. Using this rule, a 100 Mbps Fast Ethernet interface would have a default OSPF cost of 1 and a 1,000 Mbps Ethernet interface would have a cost of 1. IS- IS Protocol Intermediate System to Intermediate System (IS-IS) is a routing protocol designed to move information efficiently within a computer network, a group of physically connected computers or similar devices. It accomplishes this by determining the best route for datagrams through a packetswitched network. IS-IS is a link-state routing protocol, operating by reliably flooding link state information throughout a network of routers. Each IS-IS router independently builds a database of the network's topology, aggregating the flooded network information. Like the OSPF protocol, IS-IS uses Dijkstra's algorithm for computing the best path through the network. Packets (datagrams) are then forwarded, based on the computed ideal path, through the network to the destination. Both IS-IS and Open Shortest Path First (OSPF) are link state protocols, and both use the same Dijkstra algorithm for computing the best path through the network. As a result, they are conceptually similar. Both support variable length subnet masks, can use multicast to discover neighboring routers using hello packets, and can support authentication of routing updates. While OSPF was natively built to route IP and is itself a Layer 3 protocol that runs on top of IP, IS-IS is an OSI Layer 2 protocol. It is at the same layer as Connectionless Network Protocol (CLNP). Path Vector Protocol A path vector protocol is a network routing protocol which maintains the path information that gets updated dynamically. Updates which have looped through the network and returned to the same node are easily detected and discarded. This algorithm is sometimes used in Bellman Ford routing algorithms to avoid "Count to Infinity" problems. It is different from the distance vector routing and link state routing. Each entry in the routing table contains the destination network, the next router and the path to reach the destination. Path Vector Messages in Border Gateway Protocol (BGP): The autonomous system boundary routers (ASBR), which participate in path vector routing, advertise the reachability of networks. Each router that receives a path vector message must verify that the advertised path is according to its policy. If the messages comply with the policy, the ASBR modifies its routing table and the message before sending it to the next neighbor. In the modified message it sends its own AS number and replaces the next router entry with its own identification.

16 Border Gateway Protocol is an example of a path vector protocol. In BGP, the routing table maintains the autonomous systems that are traversed in order to reach the destination system. Exterior Gateway Protocol (EGP) does not use path vectors. It has three phases: Initiation Sharing Updating Border Gateway Protocol (BGP) A Routing Protocol used to exchange routing information between different networks. General operation: Learns multiple paths via internal and external BGP speakers Picks the best path and installs it in the routing table (RIB) Best path is sent to external BGP neighbors Policies are applied by influencing the best path selection Terminology: Neighbor Any two routers that have formed a TCP connection to exchange BGP routing information are called peers or neighbors ibgp ibgp refers to the BGP neighbor relationship within the same AS. The neighbors do not have to be directly connected.

17 ebgp When BGP neighbor relationship are formed between two peers belongs to different AS are called ebgp EBGP neighbors by default need to be directly connected. BGP Attributes: Well-known attributes must be supported by every BGP implementation Mandatory attributes must be included with every route entry. If one attribute is missing, it will result in an error message Discretionary attributes every BGP router must recognize, but they don t have to be present with every route entry Optional attributes not necessarily supported by all BGP implementations. It can be either transitive or non-transitive. BGP is used internally (ibgp) and externally (ebgp) ibgp used to carry some/all Internet prefixes across ISP backbone and ISP s customer prefixes ebgp used to exchange prefixes with other ASes and implement routing policy

18

19

20

Two types of routing protocols are used in internetworks: interior gateway protocols (IGPs) and exterior gateway protocols (EGPs).

Two types of routing protocols are used in internetworks: interior gateway protocols (IGPs) and exterior gateway protocols (EGPs). Introduction Dynamic routing is when protocols are used to find networks and update routing tables on routers. True, this is easier than using static or default routing, but it ll cost you in terms of

More information

9.1. Routing Protocols

9.1. Routing Protocols 9.1. Routing Protocols Each organization that has been assigned a network address from an ISP is considered an autonomous system (AS). That organization is free to create one large network, or divide the

More information

Planning for Information Network

Planning for Information Network Planning for Information Network Lecture 8: Network Routing Protocols Assistant Teacher Samraa Adnan Al-Asadi 1 Routing protocol features There are many ways to characterize routing protocols, including

More information

Part II. Chapter 3. Determining IP Routes

Part II. Chapter 3. Determining IP Routes Part II Chapter 3 Routers perform two main functions: switching and routing. The switching function is the process of moving packets from an inbound interface to an outbound interface. The switching function

More information

TDC 363 Introduction to LANs

TDC 363 Introduction to LANs TDC 363 Introduction to LANs Routing Protocols and RIP Greg Brewster DePaul University TDC 363 1 Dynamic Routing Routing Protocols Distance Vector vs. Link State Protocols RIPv1 & RIPv2 RIP Problems Slow

More information

A study of WAN design, routing protocols and connectivity between Head office to Branch office

A study of WAN design, routing protocols and connectivity between Head office to Branch office A study of WAN design, routing protocols and connectivity between Head office to Branch office Dr. Anil Kumar Singh ABSTRACT Jagran Institute of Management, 620-W Block Saket Nagar, Kanpur 3.LAB SETUP

More information

Top-Down Network Design

Top-Down Network Design Top-Down Network Design Chapter Seven Selecting Switching and Routing Protocols Original slides by Cisco Press & Priscilla Oppenheimer Selection Criteria for Switching and Routing Protocols Network traffic

More information

CS 43: Computer Networks. 24: Internet Routing November 19, 2018

CS 43: Computer Networks. 24: Internet Routing November 19, 2018 CS 43: Computer Networks 24: Internet Routing November 19, 2018 Last Class Link State + Fast convergence (reacts to events quickly) + Small window of inconsistency Distance Vector + + Distributed (small

More information

Routing Protocols. Technology Description BGP CHAPTER

Routing Protocols. Technology Description BGP CHAPTER CHAPTER 11 This chapter describes the level of support that Cisco ANA provides for routing protocols, as follows: Technology Description, page 11-1 Information Model Objects (IMOs), page 11-3 Vendor-Specific

More information

Network Protocols. Routing. TDC375 Winter 2002 John Kristoff - DePaul University 1

Network Protocols. Routing. TDC375 Winter 2002 John Kristoff - DePaul University 1 Network Protocols Routing TDC375 Winter 2002 John Kristoff - DePaul University 1 IP routing Performed by routers Table (information base) driven Forwarding decision on a hop-by-hop basis Route determined

More information

Top-Down Network Design, Ch. 7: Selecting Switching and Routing Protocols. Top-Down Network Design. Selecting Switching and Routing Protocols

Top-Down Network Design, Ch. 7: Selecting Switching and Routing Protocols. Top-Down Network Design. Selecting Switching and Routing Protocols Top-Down Network Design Chapter Seven Selecting Switching and Routing Protocols Copyright 2010 Cisco Press & Priscilla Oppenheimer 1 Switching 2 Page 1 Objectives MAC address table Describe the features

More information

Network Protocols. Routing. TDC375 Autumn 03/04 John Kristoff - DePaul University 1

Network Protocols. Routing. TDC375 Autumn 03/04 John Kristoff - DePaul University 1 Network Protocols Routing TDC375 Autumn 03/04 John Kristoff - DePaul University 1 IPv4 unicast routing All Internet hosts perform basic routing for local net destinations, forward to local host for non-local

More information

Routing Protocols of IGP. Koji OKAMURA Kyushu University, Japan

Routing Protocols of IGP. Koji OKAMURA Kyushu University, Japan Routing Protocols of IGP Koji OKAMURA Kyushu University, Japan Routing Protocol AS (Autonomous System) Is operated autonomous in the organization. 6bit IGP (Interior Gateway Protocol) Routing Control inside

More information

CS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 16, 2017

CS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 16, 2017 CS 43: Computer Networks Internet Routing Kevin Webb Swarthmore College November 16, 2017 1 Hierarchical routing Our routing study thus far - idealization all routers identical network flat not true in

More information

Internet Routing Protocols Tuba Saltürk

Internet Routing Protocols Tuba Saltürk Internet Routing Protocols 15505068 Tuba Saltürk Outline Internet Routers Routing Protocol Interior Gateway Protocol (IGP) Distance- Vector Routing Protocol Routing Information Protocol (RIP) Interior

More information

Chapter 7 Routing Protocols

Chapter 7 Routing Protocols Chapter 7 Routing Protocols Nonroutable Protocols In the early days of networking, networks were small collections of computers linked together For the purposes of sharing information and expensive peripherals

More information

IP Routing Tecnologie e Protocolli per Internet II rev 1

IP Routing Tecnologie e Protocolli per Internet II rev 1 IP Routing Tecnologie e Protocolli per Internet II rev 1 Andrea Detti Electronic Engineering dept. E-mail: andrea.detti@uniroma2.it Some sources: Cisco CCNA Routing and Switching ICND1 and ICND2 Slide

More information

Symbols. Numerics I N D E X

Symbols. Numerics I N D E X I N D E X Symbols? (question mark), CLI help system, 126 Numerics A 2-router BGP topology, configuring, 279 284 4-router BGP topology, configuring, 266, 276 279 ABRs (area border routers), 9, 87, 95, 141

More information

Introduction to OSPF

Introduction to OSPF Introduction to OSPF 1 OSPF Open Shortest Path First Link state or SPF technology Developed by OSPF working group of IETF (RFC 1247) OSPFv2 standard described in RFC2328 Designed for: TCP/IP environment

More information

Basic Idea. Routing. Example. Routing by the Network

Basic Idea. Routing. Example. Routing by the Network Basic Idea Routing Routing table at each router/gateway When IP packet comes, destination address checked with routing table to find next hop address Questions: Route by host or by network? Routing table:

More information

COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS

COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS COMPARATIVE ANALYSIS OF ROUTING PROTOCOLS S.Kokila, Assistant Professor, Department of Computer Science, A.V.P College of Arts and Science, Tiruppur, Tamilnadu, India. G.Pramela, Assistant Professor, Department

More information

Routing by the Network

Routing by the Network Routing Basic Idea Routing table at each router/gateway When IP packet comes, destination address checked with routing table to find next hop address Questions: Route by host or by network? Routing table:

More information

Ravi Chandra cisco Systems Cisco Systems Confidential

Ravi Chandra cisco Systems Cisco Systems Confidential BGP4 1 Ravi Chandra cisco Systems 0799_04F7_c2 Cisco Systems Confidential 2 Border Gateway Protocol (BGP) Introduction to BGP BGP Peer Relationship BGP Attributes Applying Policy with BGP Putting it all

More information

Inter-Domain Routing: BGP

Inter-Domain Routing: BGP Inter-Domain Routing: BGP Richard T. B. Ma School of Computing National University of Singapore CS 3103: Compute Networks and Protocols Inter-Domain Routing Internet is a network of networks Hierarchy

More information

ITEC310 Computer Networks II

ITEC310 Computer Networks II ITEC310 Computer Networks II Chapter 22 Network Layer:, and Routing Department of Information Technology Eastern Mediterranean University Objectives 2/131 After completing this chapter you should be able

More information

CS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 14, 2013

CS 43: Computer Networks Internet Routing. Kevin Webb Swarthmore College November 14, 2013 CS 43: Computer Networks Internet Routing Kevin Webb Swarthmore College November 14, 2013 1 Reading Quiz Hierarchical routing Our routing study thus far - idealization all routers identical network flat

More information

BTEC Level 3 Extended Diploma

BTEC Level 3 Extended Diploma BTEC Level 3 Extended Diploma Unit 9 Computer Network Routing and Routing Protocols BTEC Level 3 Extended Diploma Introduction to Routing Routing is the process that a router uses to forward packets toward

More information

Routing Protocol Type Primarily IGP or EGP RIP Distance-Vector IGP EIGRP OSPF IS-IS BGP

Routing Protocol Type Primarily IGP or EGP RIP Distance-Vector IGP EIGRP OSPF IS-IS BGP Appendix D Memory Tables Chapter 1 Table 1-2 Routing Protocol Characteristics Routing Protocol Type Primarily IGP or EGP RIP Distance-Vector IGP EIGRP OSPF IS-IS BGP Chapter 3 Table 3-2 Hexadecimal/Binary

More information

Basic IP Routing. Finding Feature Information. Information About Basic IP Routing. Variable-Length Subnet Masks

Basic IP Routing. Finding Feature Information. Information About Basic IP Routing. Variable-Length Subnet Masks This module describes how to configure basic IP routing. The Internet Protocol (IP) is a network layer (Layer 3) protocol that contains addressing information and some control information that enables

More information

CSc 450/550 Computer Networks Internet Routing

CSc 450/550 Computer Networks Internet Routing CSc 450/550 Computer Networks Internet Routing Jianping Pan Summer 2007 7/12/07 CSc 450/550 1 Review Internet Protocol (IP) IP header addressing class-based, classless, hierarchical, NAT routing algorithms

More information

Hierarchical Routing. Our routing study thus far - idealization all routers identical network flat not true in practice

Hierarchical Routing. Our routing study thus far - idealization all routers identical network flat not true in practice Hierarchical Routing Our routing study thus far - idealization all routers identical network flat not true in practice scale: with 200 million destinations: can t store all destinations in routing tables!

More information

CCNA 3 (v v6.0) Chapter 5 Exam Answers % Full

CCNA 3 (v v6.0) Chapter 5 Exam Answers % Full CCNA 3 (v5.0.3 + v6.0) Chapter 5 Exam Answers 2017 100% Full ccnav6.com /ccna-3-v5-0-3-v6-0-chapter-5-exam-answers-2017-100-full.html CCNA Exam Answers 2017 CCNA 3 (v5.0.3 + v6.0) Chapter 5 Exam Answers

More information

Routing Protocol. Seiya Tsubone. Apr The University of Tokyo. Seiya Tsubone (The University of Tokyo) Routing Protocol Apr. 25.

Routing Protocol. Seiya Tsubone. Apr The University of Tokyo. Seiya Tsubone (The University of Tokyo) Routing Protocol Apr. 25. Routing Protocol Seiya Tsubone The University of Tokyo Apr. 25. 2013 Seiya Tsubone (The University of Tokyo) Routing Protocol Apr. 25. 2013 1 / 60 Table of Contents 1 The Concept of Routing 2 RIP 3 OSPF

More information

2008 NDP Lectures 7 th Semester

2008 NDP Lectures 7 th Semester 2008 NDP Lectures 7 th Semester Neeli R. Prasad, Associate Professor Head of Wireless Security and Sensor Networks Group Networking and Security Aalborg University Niels Jernes Vej 12, 9220 Aalborg East,

More information

Table of Contents 1 Static Routing Configuration RIP Configuration 2-1

Table of Contents 1 Static Routing Configuration RIP Configuration 2-1 Table of Contents 1 Static Routing Configuration 1-1 Introduction 1-1 Static Route 1-1 Default Route 1-1 Application Environment of Static Routing 1-1 Configuring a Static Route 1-2 Configuration Prerequisites

More information

Distance Vector Routing Protocols

Distance Vector Routing Protocols Distance Vector Routing Protocols Routing Protocols and Concepts Chapter 4 Version 4.0 1 Objectives Identify the characteristics of distance vector routing protocols. Describe the network discovery process

More information

Routing, Routing Algorithms & Protocols

Routing, Routing Algorithms & Protocols Routing, Routing Algorithms & Protocols Computer Networks Lecture 6 http://goo.gl/pze5o8 Circuit-Switched and Packet-Switched WANs 2 Circuit-Switched Networks Older (evolved from telephone networks), a

More information

Introduction to Routing

Introduction to Routing 1 Introduction to Routing Session 2 Presentation_ID.scr 1 Agenda Addressing Concepts Routing Protocols Statics and Defaults 3 ISO OSI Reference Model Routing Information Protocol (RIP and RIPv2) L7 L6

More information

Last time. Transitioning to IPv6. Routing. Tunneling. Gateways. Graph abstraction. Link-state routing. Distance-vector routing. Dijkstra's Algorithm

Last time. Transitioning to IPv6. Routing. Tunneling. Gateways. Graph abstraction. Link-state routing. Distance-vector routing. Dijkstra's Algorithm Last time Transitioning to IPv6 Tunneling Gateways Routing Graph abstraction Link-state routing Dijkstra's Algorithm Distance-vector routing Bellman-Ford Equation 10-1 This time Distance vector link cost

More information

Introduction to OSPF

Introduction to OSPF Introduction to OSPF ISP/IXP Workshops ISP/IXP Workshops 1999, Cisco Systems, Inc. 1 OSPF Dynamic Routing Protocol Link State technology Runs over IP, protocol 89 Designed by IETF for TCP/IP Supports VLSM

More information

Routing in the Internet

Routing in the Internet Routing in the Internet Daniel Zappala CS 460 Computer Networking Brigham Young University Scaling Routing for the Internet 2/29 scale 200 million destinations - can t store all destinations or all prefixes

More information

Overview. Information About Layer 3 Unicast Routing. Send document comments to CHAPTER

Overview. Information About Layer 3 Unicast Routing. Send document comments to CHAPTER CHAPTER 1 This chapter introduces the basic concepts for Layer 3 unicast routing protocols in Cisco NX-OS. This chapter includes the following sections: Information About Layer 3 Unicast Routing, page

More information

Basic IP Routing. Finding Feature Information. Information About Basic IP Routing. Variable-Length Subnet Masks

Basic IP Routing. Finding Feature Information. Information About Basic IP Routing. Variable-Length Subnet Masks This module describes how to configure basic IP routing. The Internet Protocol (IP) is a network layer (Layer 3) protocol that contains addressing information and some control information that enables

More information

Routing Protocol comparison

Routing Protocol comparison Routing Protocol comparison Introduction to routing Networks allow people to communicate, collaborate, and interact in many ways. Networks are used to access web pages, talk using IP telephones, participate

More information

Chapter 7: Routing Dynamically. Routing & Switching

Chapter 7: Routing Dynamically. Routing & Switching Chapter 7: Routing Dynamically Routing & Switching The Evolution of Dynamic Routing Protocols Dynamic routing protocols used in networks since the late 1980s Newer versions support the communication based

More information

ABR (Area Border Router), 206, 216 access, dedicated networks, 23 access layer, three-layer hierarchical design model, 6

ABR (Area Border Router), 206, 216 access, dedicated networks, 23 access layer, three-layer hierarchical design model, 6 1358_fmi.book Page 460 Thursday, May 27, 2004 2:21 PM A ABR (Area Border Router), 206, 216 access, dedicated networks, 23 access layer, three-layer hierarchical design model, 6 access lists, scalable networks,

More information

Introduction to OSPF

Introduction to OSPF Introduction to OSPF ISP/IXP Workshops ISP/IXP Workshops 1999, Cisco Systems, Inc. 1 Agenda OSPF Primer OSPF in Service Provider Networks OSPF BCP - Adding Networks OSPF Command Summary 2 OSPF Primer 3

More information

Introduction. Keith Barker, CCIE #6783. YouTube - Keith6783.

Introduction. Keith Barker, CCIE #6783. YouTube - Keith6783. Understanding, Implementing and troubleshooting BGP 01 Introduction http:// Instructor Introduction Keith Barker, CCIE #6783 CCIE Routing and Switching 2001 CCIE Security 2003 kbarker@ine.com YouTube -

More information

The most simple way to accelerate a Router is at 9.8 m/sec/sec.

The most simple way to accelerate a Router is at 9.8 m/sec/sec. Routing Introduction Direct vs. Indirect Delivery Static vs. Dynamic Routing Distance Vector vs. Link State (C) Herbert Haas 2005/03/11 The most simple way to accelerate a Router is at 9.8 m/sec/sec. Seen

More information

Which of the following describe the process identifier that is used to run OSPF on a router? (Choose two)

Which of the following describe the process identifier that is used to run OSPF on a router? (Choose two) ICND1 OSPF Questions Question 1 Which of the following describe the process identifier that is used to run OSPF on a router? (Choose two) A. It is locally significant. B. It is globally significant. C.

More information

Routing Protocols. Autonomous System (AS)

Routing Protocols. Autonomous System (AS) Routing Protocols Two classes of protocols: 1. Interior Routing Information Protocol (RIP) Open Shortest Path First (OSPF) 2. Exterior Border Gateway Protocol (BGP) Autonomous System (AS) What is an AS?

More information

Connecting to a Service Provider Using External BGP

Connecting to a Service Provider Using External BGP Connecting to a Service Provider Using External BGP First Published: May 2, 2005 Last Updated: August 21, 2007 This module describes configuration tasks that will enable your Border Gateway Protocol (BGP)

More information

Overview. Problem: Find lowest cost path between two nodes Factors static: topology dynamic: load

Overview. Problem: Find lowest cost path between two nodes Factors static: topology dynamic: load Dynamic Routing Overview Forwarding vs Routing forwarding: to select an output port based on destination address and routing table routing: process by which routing table is built Network as a Graph C

More information

Open Shortest Path First (OSPF)

Open Shortest Path First (OSPF) CHAPTER 42 Open Shortest Path First (OSPF) Background Open Shortest Path First (OSPF) is a routing protocol developed for Internet Protocol (IP) networks by the interior gateway protocol (IGP) working

More information

Lecture 19: Network Layer Routing in the Internet

Lecture 19: Network Layer Routing in the Internet Lecture 19: Network Layer Routing in the Internet COMP 332, Spring 2018 Victoria Manfredi Acknowledgements: materials adapted from Computer Networking: A Top Down Approach 7 th edition: 1996-2016, J.F

More information

Chapter 3. Introduction to Dynamic Routing Protocols. CCNA2-1 Chapter 3

Chapter 3. Introduction to Dynamic Routing Protocols. CCNA2-1 Chapter 3 Chapter 3 Introduction to Dynamic Routing Protocols CCNA2-1 Chapter 3 Introduction to Dynamic Routing Protocols Introduction to Dynamic Routing Protocols CCNA2-2 Chapter 3 Perspective and Background Dynamic

More information

Computer Networking Introduction

Computer Networking Introduction Computer Networking Introduction Halgurd S. Maghdid Software Engineering Department Koya University-Koya, Kurdistan-Iraq Lecture No.15 Chapter 4: outline 4.1 introduction 4.2 virtual circuit and datagram

More information

EECS 122, Lecture 16. Link Costs and Metrics. Traffic-Sensitive Metrics. Traffic-Sensitive Metrics. Static Cost Metrics.

EECS 122, Lecture 16. Link Costs and Metrics. Traffic-Sensitive Metrics. Traffic-Sensitive Metrics. Static Cost Metrics. EECS 122, Lecture 16 Kevin Fall kfall@cs.berkeley.edu edu Link Costs and Metrics Routing protocols compute shortest/cheapest paths using some optimization criteria Choice of criteria has strong effect

More information

Redesde Computadores(RCOMP)

Redesde Computadores(RCOMP) Redesde Computadores(RCOMP) Lecture 06 2016/2017 IPv4 routeing. Static routeing and dynamic routeing. Routeing protocols: RIP, RIPv2, EIGRP and OSPF. Autonomous systems and route redistribution Instituto

More information

Operation Manual Routing Protocol. Table of Contents

Operation Manual Routing Protocol. Table of Contents Table of Contents Table of Contents Chapter 1 IP Routing Protocol Overview... 1-1 1.1 Introduction to IP Route and Routing Table... 1-1 1.1.1 IP Route... 1-1 1.1.2 Routing Table... 1-1 1.2 Routing Management

More information

REDDIG II Computer Networking Training

REDDIG II Computer Networking Training REDDIG II Computer Networking Training JM SANCHEZ / PH RASSAT -20/06/2012 Invierno 2011 Capacitacion en fabrica - CORPAC Dynamic Routing Dynamic Routing Function(s) of Dynamic Routing Protocols: Dynamically

More information

Architectures and Protocols for Integrated Networks. Intra-domain and Inter-domain Routing Protocols

Architectures and Protocols for Integrated Networks. Intra-domain and Inter-domain Routing Protocols Architectures and Protocols for Integrated Networks Intra-domain and Inter-domain Routing Protocols How is the routing table built? Path finding Paths from a device to any other device. Aggregated according

More information

This appendix contains supplementary Border Gateway Protocol (BGP) information and covers the following topics:

This appendix contains supplementary Border Gateway Protocol (BGP) information and covers the following topics: Appendix C BGP Supplement This appendix contains supplementary Border Gateway Protocol (BGP) information and covers the following topics: BGP Route Summarization Redistribution with IGPs Communities Route

More information

BGP. Daniel Zappala. CS 460 Computer Networking Brigham Young University

BGP. Daniel Zappala. CS 460 Computer Networking Brigham Young University Daniel Zappala CS 460 Computer Networking Brigham Young University 2/20 Scaling Routing for the Internet scale 200 million destinations - can t store all destinations or all prefixes in routing tables

More information

Vendor: Alcatel-Lucent. Exam Code: 4A Exam Name: Alcatel-Lucent Interior Routing Protocols and High Availability.

Vendor: Alcatel-Lucent. Exam Code: 4A Exam Name: Alcatel-Lucent Interior Routing Protocols and High Availability. Vendor: Alcatel-Lucent Exam Code: 4A0-101 Exam Name: Alcatel-Lucent Interior Routing Protocols and High Availability Version: Demo QUESTION 1 When a router receives an IP packet, but does not find a match

More information

SEMESTER 2 Chapter 4 Distance Vector Routing Protocols V 4.0 RIP, IGRP, EIGRP

SEMESTER 2 Chapter 4 Distance Vector Routing Protocols V 4.0 RIP, IGRP, EIGRP SEMESTER 2 Chapter 4 Distance Vector Routing Protocols V 4.0 4.1.1 What are the three distance vector routing protocols? What are the key characteristics of RIP? What are the key characteristics of IGRP?

More information

Operation Manual IPv4 Routing H3C S3610&S5510 Series Ethernet Switches. Table of Contents

Operation Manual IPv4 Routing H3C S3610&S5510 Series Ethernet Switches. Table of Contents Table of Contents Table of Contents Chapter 1 Static Routing Configuration... 1-1 1.1 Introduction... 1-1 1.1.1 Static Route... 1-1 1.1.2 Default Route... 1-1 1.1.3 Application Environment of Static Routing...

More information

Chapter 4: outline. Network Layer 4-1

Chapter 4: outline. Network Layer 4-1 Chapter 4: outline 4.1 introduction 4.2 virtual circuit and datagram networks 4.3 what s inside a router 4.4 IP: Internet Protocol datagram format IPv4 addressing ICMP IPv6 4.5 routing algorithms link

More information

CHAPTER 4: ROUTING DYNAMIC. Routing & Switching

CHAPTER 4: ROUTING DYNAMIC. Routing & Switching CHAPTER 4: ROUTING DYNAMIC Routing & Switching CHAPTER4 4.1 Dynamic Routing Protocols 4.2 Distance Vector Dynamic Routing 4.3 RIP and RIPng Routing 4.4 Link-State Dynamic Routing 4.5 The Routing Table

More information

Chapter 4: Network Layer

Chapter 4: Network Layer Chapter 4: Network Layer 4. 1 Introduction 4.2 Virtual circuit and datagram networks 4.3 What s inside a router 4.4 IP: Internet Protocol Datagram format IPv4 addressing ICMP IPv6 4.5 Routing algorithms

More information

CS118 Discussion Week 7. Taqi

CS118 Discussion Week 7. Taqi CS118 Discussion Week 7 Taqi Outline Hints for project 2 Lecture review: routing About Course Project 2 Please implement byte-stream reliable data transfer Cwnd is in unit of bytes, not packets How to

More information

RIP Version 2. The Classless Brother

RIP Version 2. The Classless Brother RIP Version 2 The Classless Brother (C) Herbert Haas 2005/03/11 1 Why RIPv2 Need for subnet information and VLSM Need for Next Hop addresses for each route entry Need for external route tags Need for multicast

More information

debug ip ospf database external default-metric subnet area 0 stub distribute-list in Serial0/1

debug ip ospf database external default-metric subnet area 0 stub distribute-list in Serial0/1 Which statement about stateless autoconfiguration is true? A host can autoconfigure itself by appending its MAC address to the local link prefix (64 bits). 2 Autoconfiguration allows devices to connect

More information

Routing Unicast routing protocols

Routing Unicast routing protocols Routing Unicast routing protocols Jens A Andersson Electrical and Information Technology R1 Choosing an Optimal Path R4 5 R7 5 10 40 R6 6 5 B R2 15 A 20 4 10 10 R8 R3 5 10 R5 1 Router A router is a type

More information

IP Routing Volume Organization

IP Routing Volume Organization IP Routing Volume Organization Manual Version 20091105-C-1.03 Product Version Release 6300 series Organization The IP Routing Volume is organized as follows: Features IP Routing Overview Static Routing

More information

Chapter 8 Configuring OSPF

Chapter 8 Configuring OSPF Chapter 8 Configuring OSPF This chapter describes how to configure OSPF on HP routing switches using the CLI and Web management interface. To display OSPF configuration information and statistics, see

More information

Routing Protocols. The routers in an internet are responsible for receiving and. forwarding IP datagrams through the interconnected set of

Routing Protocols. The routers in an internet are responsible for receiving and. forwarding IP datagrams through the interconnected set of Routing Protocols MITA DUTTA The routers in an internet are responsible for receiving and forwarding IP datagrams through the interconnected set of sub-networks from source to destination. Routing protocols

More information

ICMP, ARP, RARP, IGMP

ICMP, ARP, RARP, IGMP Internet Layer Lehrstuhl für Informatik 4 Raw division into three tasks: Data transfer over a global network Route decision at the sub-nodes Control of the network or transmission status Routing Protocols

More information

OSPF Protocol Overview on page 187. OSPF Standards on page 188. OSPF Area Terminology on page 188. OSPF Routing Algorithm on page 190

OSPF Protocol Overview on page 187. OSPF Standards on page 188. OSPF Area Terminology on page 188. OSPF Routing Algorithm on page 190 Chapter 17 OSPF Protocol Overview The Open Shortest Path First (OSPF) protocol is an interior gateway protocol (IGP) that routes packets within a single autonomous system (AS). OSPF uses link-state information

More information

Building the Routing Table. Introducing the Routing Table Directly Connected Networks Static Routing Dynamic Routing Routing Table Principles

Building the Routing Table. Introducing the Routing Table Directly Connected Networks Static Routing Dynamic Routing Routing Table Principles Building the Routing Table Introducing the Routing Table Directly Connected Networks Static Routing Dynamic Routing Routing Table Principles Introducing the Routing Table R1# show ip route Codes: C - connected,

More information

Why dynamic route? (1)

Why dynamic route? (1) Routing Why dynamic route? (1) Static route is ok only when Network is small There is a single connection point to other network No redundant route 2 Why dynamic route? (2) Dynamic Routing Routers update

More information

Configuring BGP. Cisco s BGP Implementation

Configuring BGP. Cisco s BGP Implementation Configuring BGP This chapter describes how to configure Border Gateway Protocol (BGP). For a complete description of the BGP commands in this chapter, refer to the BGP s chapter of the Network Protocols

More information

To contain/reduce broadcast traffic, we need to reduce the size of the network (i.e., LAN).

To contain/reduce broadcast traffic, we need to reduce the size of the network (i.e., LAN). 2.3.3 Routers 2.3.3.1 Motivation Bridges do not stop broadcast traffic. This can lead to broadcast storms (e.g., more than 100 nonunicast frames/sec) which can be catastrophic. This can bring the network

More information

Routing Protocols --- Exterior Gateway Protocol

Routing Protocols --- Exterior Gateway Protocol Content Routing Protocols --- Exterior Gateway Protocol Linda Wu (CMPT 471 23-3) Limiting router interaction Autonomous system BGP protocol BGP messages Other issues on BGP Reference: chapter 15 Notes-13

More information

Module 6 Implementing BGP

Module 6 Implementing BGP Module 6 Implementing BGP Lesson 1 Explaining BGP Concepts and Terminology BGP Border Gateway Protocol Using BGP to Connect to the Internet If only one ISP, do not need BGP. If multiple ISPs, use BGP,

More information

CS321: Computer Networks Unicast Routing

CS321: Computer Networks Unicast Routing CS321: Computer Networks Unicast Routing Dr. Manas Khatua Assistant Professor Dept. of CSE IIT Jodhpur E-mail: manaskhatua@iitj.ac.in Introduction The goal of the network layer is deliver a datagram from

More information

Routing Architecture. Objectives. Module 2 Routing Fundamentals. Author: Rolf Augstein January 2006

Routing Architecture. Objectives. Module 2 Routing Fundamentals. Author: Rolf Augstein January 2006 Routing Architecture Module 2 Routing Fundamentals Basic Problems Principles, Classification Operation Author: Rolf Augstein raugstein@rolfaugstein.com January 2006 Feel free to use this publication for

More information

Table of Contents 1 OSPF Configuration 1-1

Table of Contents 1 OSPF Configuration 1-1 Table of Contents 1 OSPF Configuration 1-1 Introduction to OSPF 1-1 Basic Concepts 1-2 OSPF Area Partition 1-4 Router Types 1-7 Classification of OSPF Networks 1-9 DR and BDR 1-9 OSPF Packet Formats 1-11

More information

Chapter 4: Network Layer. Lecture 12 Internet Routing Protocols. Chapter goals: understand principles behind network layer services:

Chapter 4: Network Layer. Lecture 12 Internet Routing Protocols. Chapter goals: understand principles behind network layer services: NET 331 Computer Networks Lecture 12 Internet Routing Protocols Dr. Anis Koubaa Reformatted slides from textbook Computer Networking a top-down appraoch, Fifth Edition by Kurose and Ross, (c) Pearson Education

More information

Determining IP Routes. 2000, Cisco Systems, Inc. 9-1

Determining IP Routes. 2000, Cisco Systems, Inc. 9-1 Determining IP Routes, Cisco Systems, Inc. 9- Objectives Upon completion of this chapter, you will be able to complete the following tasks: Distinguish the use and operation of static and dynamic routes

More information

Keywords RIP, OSPF, IGP, EGP, AS, LSA

Keywords RIP, OSPF, IGP, EGP, AS, LSA Volume 4, Issue 2, February 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Evolution of

More information

Internet Routing : Fundamentals of Computer Networks Bill Nace

Internet Routing : Fundamentals of Computer Networks Bill Nace Internet Routing 14-740: Fundamentals of Computer Networks Bill Nace Material from Computer Networking: A Top Down Approach, 6 th edition. J.F. Kurose and K.W. Ross Looking Ahead Lab #2 just due Quiz #2

More information

IPv6 Routing: OSPFv3

IPv6 Routing: OSPFv3 Open Shortest Path First version 3 (OSPFv3) is an IPv4 and IPv6 link-state routing protocol that supports IPv6 and IPv4 unicast address families (AFs). Finding Feature Information, page 1 Prerequisites

More information

Routing. Routing. Overview. Overview. Routing vs. Forwarding. Why Routing

Routing. Routing. Overview. Overview. Routing vs. Forwarding. Why Routing Routing Dr. Arjan Durresi Department of Computer Science Louisiana State University Overview Routing vs. Forwarding Routing Algorithms, Distance Vector, Link State Dijkstra s Algorithm ARPAnet Routing

More information

Chapter 6 Reading Organizer

Chapter 6 Reading Organizer Name Date Chapter 6 Reading Organizer After completion of this chapter, you should be able to: Describe and plan a network using OSPF Design and configure a network using single-area OSPF Work with multi-protocol

More information

BGP Configuration. BGP Overview. Introduction to BGP. Formats of BGP Messages. Header

BGP Configuration. BGP Overview. Introduction to BGP. Formats of BGP Messages. Header Table of Contents BGP Configuration 1 BGP Overview 1 Introduction to BGP 1 Formats of BGP Messages 1 BGP Path Attributes 4 BGP Route Selection 8 Configuring BGP 8 Configuration Prerequisites 8 Configuration

More information

EIGRP. Routing Protocols and Concepts Chapter 9. Video Frank Schneemann, MS EdTech

EIGRP. Routing Protocols and Concepts Chapter 9. Video Frank Schneemann, MS EdTech Video Frank Schneemann, MS EdTech EIGRP Routing Protocols and Concepts Chapter 9 ITE PC v4.0 Chapter 1 2007 Cisco Systems, Inc. All rights reserved. Cisco Public 1 9.0.1 Introduction Enhanced Interior

More information

Distance vector and RIP

Distance vector and RIP DD2490 p4 2008 Distance vector and RIP Olof Hagsand KTHNOC/NADA Literature RIP lab RFC 245: RIPv2. Sections 1 2 contains some introduction that can be useful to understand the context in which RIP is specified..1.4

More information

9 Routing Introduction

9 Routing Introduction 9 Routing Introduction CERTIFICATION OBJECTIVES 9.01 Types of Routes 9.02 Static Routes 9.03 Router on a Stick 9.04 Dynamic Routing Protocols 9.05 Problems with Distance Vector Protocols Two-Minute Drill

More information

CSCD 433/533 Advanced Networks Spring 2016

CSCD 433/533 Advanced Networks Spring 2016 CSCD 433/533 Advanced Networks Spring 2016 Lecture 13 Router Algorithms and Design Chapter 5 1 Topics Router Algorithms Routing in General Hierarchical routing Interior Gateway Protocols OSPF mention of

More information