Routing Protocol. RIPv1

Size: px
Start display at page:

Download "Routing Protocol. RIPv1"

Transcription

1 Outline Routing Protocol RIPv1, RIPv2, EIGRP OSPF o RIPv1, RIPv2 o EIGRP o OSPF 2 3 RIPv1 RIP Characteristics A classful, Distance Vector (DV) routing protocol Metric = hop count Routes with a hop count > 15 are unreachable Updates are broadcast every 30 seconds RIPv1 RIP Message Format RIP header - divided into 3 fields - Command field - Version field - Must be zero Route Entry - composed of 3 fields - Address family identifier - IP address - Metric 4

2 5 RIPv1 RIP Operation RIP uses 2 message types: Request message This is sent out on startup by each RIP enabled interface Requests all RIP enabled neighbors to send routing table Response message Message sent to requesting router containing routing table 6 RIP in action dst RIP request dst. request router every 30 sec. RIP reply RIPv1 o IP addresses initially divided into classes - Class A - Class B - Class C o RIP is a classful routing protocol - Does not send subnet masks in routing updates Automatic Summarization Boundary Routers RIP automatically summarizes classful networks Boundary routers automatic summarize RIP subnets from one major network to another. 7 8

3 9 RIPv2 Difference between RIPv1 & RIPv2 RIPv1 A classful distance vector routing protocol Does not support discontiguous subnets Does not support VLSM Does not send subnet mask in routing update Routing updates are broadcast RIPv2 A classless distance vector routing protocol that is an enhancement of RIPv1 s features. Next hop address is included in updates Routing updates are multicast The use of authentication is an option 10 Similarities between RIPv1 & RIPv2 o Use of timers to prevent routing loops o Use of split horizon or split horizon with poison reverse o Use of triggered updates o Maximum hop count of 15 RIPv1 Limitations RIPv1 Limitations o RIPv1 a classfull routing protocol -Subnet mask are not sent in updates -Summarizes networks at major network boundaries -if network is discontiguous and RIPv1 configured, convergence will not be reached 11 12

4 13 RIPv1 Limitations o RIPv1 does not support VLSM Reason: RIPv1 does not send subnet mask in routing updates o RIPv1 does summarize routes to the Classfull boundary Or uses the Subnet mask of the outgoing interface to determine which subnets to advertise 14 RIPv1 Limitations o No CIDR Support o In the diagram R2 will not include the static route in its update Reason: Classful routing protocols do not support CIDR routes that are summarized with a smaller mask than the classful subnet mask Configuring RIPv2 o Comparing RIPv1 & RIPv2 Message Formats - RIPv2 Message format is similar to RIPv1 but has 2 extensions 1st extension is the subnet mask field 2nd extension is the addition of next hop address Configuring RIPv2 oenabling and Verifying RIPv2 oconfiguring RIP on a Cisco router By default it is running RIPv

5 17 Configuring RIPv2 o Configuring RIPv2 on a Cisco router -Requires using the version 2 command -RIPv2 ignores RIPv1 updates o To verify RIPv2 is configured use the show ip protocols command 18 Configuring RIPv2 o Auto-Summary & RIPv2 o RIPv2 will automatically summarize routes at major network boundaries and can also summarize routes with a subnet mask that is smaller than the classfull subnet mask 19 Configuring RIPv2 odisabling Auto- Summary in RIPv2 oto disable automatic summarization issue the no autosummary command 20 Configuring RIPv2 o Verifying RIPv2 Updates o When using RIPv2 with automatic summarization turned off Each subnet and mask has its own specific entry, along with the exit interface and next-hop address to reach that subnet. o To verify information being sent by RIPv2 use the debug ip rip command

6 VLSM & CIDR o RIPv2 and VLSM o Networks using a VLSM IP addressing scheme Use classless routing protocols (i.e. RIPv2) to disseminate network addresses and their subnet masks VLSM & CIDR ocidr uses Supernetting Supernetting is a bunch of contiguous classful networks that is addressed as a single network VLSM & CIDR o To verify that supernets are being sent and received use the following commands -Show ip route -Debug ip rip Routing Protocol Distance Vector Summary RIP v1 & v2 Classless Routing Protocol Uses Hold- Down Timers Use of Split Horizon or Split Horizon w/ Poison Reverse Max Hop count = 15 Auto Summary Support CIDR Supports VLSM Uses Authentication RIPv1 Yes No Yes Yes Yes Yes No No No RIPv2 Yes Yes Yes Yes Yes Yes Yes Yes Yes 23 24

7 25 EIGRP 26 EIGRP Roots of EIGRP: IGRP (Cisco) Developed in 1985 to overcome RIPv1 s limited hop count Distance vector routing protocol Metrics used by IGRP Bandwidth (used by default) Delay (used by default) Reliability Load Discontinued support starting with IOS 12.2(13)T & 12.2(R1s4)S EIGRP EIGRP Message Format o EIGRP Header Data link frame header - contains source and destination MAC address IP packet header - contains source & destination IP address EIGRP packet header - contains AS number Type/Length/Field - data portion of EIGRP message EIGRP o EIGRP packet header contains Opcode field Autonomous System number 27 28

8 EIGRP EIGRP Parameters contains Weights Hold time EIGRP in Autonomous System o TLV: IP internal contains Metric field Subnet mask field Destination field EIGRP Redistribute form other Autonomous System o TLV: IP external contains Fields used when external routes are imported into EIGRP routing process EIGRP Protocol Dependent Modules (PDM) o EIGRP uses PDM to route several different protocols i.e. IP, IPX & AppleTalk o PDMs are responsible for the specific routing task for each network layer protocol 31 32

9 33 EIGRP Reliable Transport Protocol (RTP) o Purpose of RTP Used by EIGRP to transmit and receive EIGRP packets o Characteristics of RTP Involves both reliable & unreliable delivery of EIGRP packet Reliable delivery requires acknowledgment from destination Unreliable delivery does not require an acknowledgement from destination Packets can be sent Unicast Multicast Using address EIGRP Packet Types o EIGRP uses five different packet types, some in pairs. Hello Packets Update Packets Acknowledgement Packets Query and Reply Packets EIGRP Packet Types o Hello packets Used to discover & form adjacencies with neighbors Hello packets are multicasts and use unreliable delivery. o Update packets EIGRP Packet Types Used to propagate routing information Unlike RIP, EIGRP does not send periodic updates. Update packets are sent only when necessary. o ACK packets Used to acknowledge receipt of update, query & reply packets 35 36

10 37 EIGRP Packet Types o Query & Reply packets Used by DUAL for searching for networks Query packets - Can use Unicast Multicast Reply packet - Use only unicast EIGRP Hello Protocol o Purpose of Hello Protocol To discover & establish adjacencies with neighbor routers o Characteristics of hello protocol Time interval for sending hello packet Most networks it is every 5 seconds Multipoint non broadcast multi-access networks Unicast every 60 seconds - Holdtime This is the maximum time router should wait before declaring a neighbor down Default holdtime 38 3 times hello interval EIGRP Bounded Updates o EIGRP only sends update when there is a change in route status o Routing update is called Partial update A partial update includes only the route information that has changed The whole routing table is NOT sent o and also considered as Bounded update When a route changes, only those devices that are impacted will be notified of the change o EIGRP s use of partial bounded updates minimizes use of bandwidth EIGRP DUAL Diffusing Update Algorithm (DUAL) Purpose EIGRP s primary method for preventing routing loops Advantage of using DUAL Provides for fast convergence time by keeping a list of loop-free backup routes 39 40

11 EIGRP o Administrative Distance (AD) Defined as the trustworthiness of the source route o EIGRP default administrative distances Summary routes = 5 Internal routes = 90 Imported routes = 170 EIGRP Authentication o EIGRP can Encrypt routing information Authenticate routing information EIGRP o Topology Example EIGRP o EIGRP will automatically summarize routes at classful boundaries 43 44

12 Basic EIGRP Configuration o Autonomous System (AS) & Process IDs Autonomous System This is a collection of networks under the control of a single authority (reference RFC 1930) AS Numbers are assigned by IANA Entities needing AS numbers ISP Internet Backbone prodiers Institutions connecting to other institutions using AS numbers Basic EIGRP Configuration o EIGRP autonomous system number actually functions as a process ID o Process ID represents an instance of the routing protocol running on a router o Example Router(config)#router eigrp autonomoussystem Basic EIGRP Configuration The router eigrp command o All routers in the EIGRP routing domain must use the same process ID number (autonomous-system number) Basic EIGRP Configuration The Network Command o Functions of the network command Enables interfaces to transmit & receive EIGRP updates Includes network or subnet in EIGRP updates o Example: Router(config-router)#network network-address o When EIGRP is configured on R2, DUAL sends a notification message to the console stating that a neighbor relationship with another EIGRP router has been established

13 Basic EIGRP Configuration The network Command with a Wildcard Mask - This option is used when you want to configure EIGRP to advertise specific subnets - Example Router(config-router)#network network-address [wildcard-mask] Basic EIGRP Configuration Verifying EIGRP o EIGRP routers must establish adjacencies with their neighbors before any updates can be sent or received o Command used to view neighbor table and verify that EIGRP has established adjacencies with neighbors is show ip eigrp neighbors Basic EIGRP Configuration If a neighbor is not listed after adjacencies have been established with a router's neighbors o Are both routers configured with the same EIGRP process ID? o Is the directly connected network included in the EIGRP network statements? o Is the passive-interface command configured to prevent EIGRP Hello packets on the interface? Basic EIGRP Configuration o The show ip protocols command is also used to verify that EIGRP is enabled 51 52

14 53 Basic EIGRP Configuration Examining the Routing Table o The show ip route command is also used to verify EIGRP o EIGRP routes are denoted in a routing table by the letter D o By default, EIGRP automatically summarizes routes at major network boundary Basic EIGRP Configuration o Introducing the Null0 Summary Route Null0 is not a physical interface In the routing table summary routes are sourced from Null0 Reason: routes are used for advertisement purposes EIGRP will automatically include a null0 summary route as child route when 2 conditions are met At least one subnet is learned via EIGRP Automatic summarization is enabled 54 Basic EIGRP Configuration o R3 s routing table shows that the /16 network is automatically summarized by R1 & R3 EIGRP Metric Calculation EIGRP Composite Metric & the K Values o EIGRP uses the following values in its composite metric -Bandwidth, delay, reliability, and load o The composite metric used by EIGRP formula used has values K1 K5 K1 & K3 = 1 others K values =

15 EIGRP Metric Calculation o Use the sh ip protocols command to verify the K values EIGRP Metric Calculation EIGRP Metrics o Use the show interfaces command to view metrics o EIGRP Metrics Bandwidth EIGRP uses a static bandwidth to calculate metric Most serial interfaces use a default bandwidth value of 1.544Mbos (T1) EIGRP Metric Calculation EIGRP Metrics o Delay is the defined as the measure of time it takes for a packet to traverse a route -it is a static value based on link type to which interface is connected EIGRP Metric Calculation o Reliability (not a default EIGRP metric) -A measure of the likelihood that a link will fail -Measure dynamically & expressed as a fraction of 255 the higher the fraction the better the reliability o Load (not a default EIGRP metric) A number that reflects how much traffic is using a link Number is determined dynamically and is expressed as a fraction of 255 The lower the fraction the less the load on the link 59 60

16 EIGRP Metric Calculation Using the Bandwidth Command o Modifying the interface bandwidth - Use the bandwidth command - Example Router(config-if)#bandwidth kilobits o Verifying bandwidth Use the show interface command Note : bandwidth command does not change the link s physical bandwidth EIGRP Metric Calculation o The EIGRP metric can be determined by examining the bandwidth delay EIGRP Metric Calculation o EIGRP uses the lowest bandwidth (BW) in its metric calculation Calculated BW = reference BW / lowest BW(kbps) * 256 o Delay EIGRP uses the cumulative sum of all outgoing interfaces Calculated Delay = the sum of outgoing interface delays * 256 o EIGRP Metric = calculated BW + calculated delay 63 64

17 EIGRP Metric Calculation EIGRP Metric Calculation Example : R2 to Network A Link Bandwidth (kbps) Delay (µs) R2 R1 1,544 20,000 R2 ISP ,000 R2 R3 1,024 20,000 R1 ISP 10,000 1,000 R3 ISP 100, ISP Net A 100, (10 7 / 1,544) x 256 1,657,856 (10 7 / 64) x ,000,000 (10 7 / 1,024) x 256 2,499,840 (10 7 / 10,000) x ,000 (10 7 / 128) x ,000,000 (10 7 / 100,000) x , DUAL Brief o EIGRP uses the Diffusing Update Algorithm (DUAL). o EIGRP does not send periodic updates and route entries do not age out. o EIGRP uses a lightweight Hello protocol to monitor connection status with its neighbors. o Only changes in the routing information, such as a new link or a link becoming unavailable cause a routing update to occur. o EIGRP's DUAL maintains a topology table separate from the routing table, which includes both the best path to a destination network and any backup paths that DUAL has determined to be loop-free. o Loop-free means that the neighbor does not have a route to the destination network that passes through this router. DUAL Concepts The Diffusing Update Algorithm (DUAL) is used to prevent looping 67 68

18 DUAL Concepts o Successor a neighboring router that is used for packet forwarding and is the least-cost route to the destination network o Feasible distance the lowest calculated metric to reach the destination network FD is the metric listed in the routing table entry 69 DUAL Concepts Feasible Successors, Feasibility Condition & Reported Distance Feasible Successor 70 -This is a loop free backup route to same destination as successor route DUAL Concepts Feasible Successors, Feasibility Condition & Reported Distance o Reported distance(rd) The metric that a router reports to a neighbor about its own cost to that network DUAL Concepts o Feasibility Condition (FC) Met when a neighbor s RD is less than the local router s FD to the same destination network 71 72

19 DUAL Concepts o Topology Table: Successor & Feasible Successor o EIGRP Topology table Viewed using the show ip eigrp topology 73 command Contents of table include: all successor routes all feasible successor routes 74 DUAL Concepts o EIGRP Topology Table dissected DUAL Concepts Topology Table: No Feasible Successor o A feasible successor may not be present because the feasibility condition may not be met -In other words, the reported distance of the neighbor is greater than or equal to the current feasible distance 75 76

20 DUAL Concepts o Finite Sate Machine (FSM) An abstract machine that defines a set of possible states something can go through, what event causes those states and what events result form those states FSMs are used to describe how a device, computer program, or routing algorithm will react to a set of input events o DUAL FSM DUAL Concepts Selects a best loop-free path to a destination Selects alternate routes by using information in EIGRP tables DUAL Concepts Finite State Machines (FSM) o To examine output from EIGRP s finite state machine us the debug eigrp fsm command More EIGRP Configurations The Null0 Summary Route o By default, EIGRP uses the Null0 interface to discard any packets that match the parent route but do not match any of the child routes o EIGRP automatically includes a null0 summary route as a child route whenever both of the following conditions exist One or subnets exists that was learned via EIGRP Automatic summarization is enabled 79 80

21 More EIGRP Configurations The Null0 Summary Route More EIGRP Configurations Disabling Automatic Summarization o The auto-summary command permits EIGRP to automatically summarize at major network boundaries o The no auto-summary command is used to disable automatic summarization This causes all EIGRP neighbors to send updates that will not be automatically summarized this will cause changes to appear in both -routing tables -topology tables More EIGRP Configurations Manual Summarization o Manual summarization can include supernets Reason: EIGRP is a classless routing protocol & include subnet mask in update o Command used to configure manual summarization Router(config-if)#ip summary-address eigrp as-number network-address subnet-mask More EIGRP Configurations o Configuring a summary route in EIGRP 83 84

22 More EIGRP Configurations EIGRP Default Routes o quad zero static default route -Can be used with any currently supported routing protocol -Is usually configured on a router that is connected a network outside the EIGRP domain o EIGRP & the Quad zero static default route Requires the use of the redistribute static command to disseminate default route in EIGRP updates More EIGRP Configurations Fine-Tuning EIGRP o EIGRP bandwidth utilization -By default, EIGRP uses only up to 50% of interface bandwidth for EIGRP information -The command to change the percentage of bandwidth used by EIGRP is Router(config-if)#ip bandwidth-percent eigrp as-number percent More EIGRP Configurations o Configuring Hello Intervals and Hold Times -Hello intervals and hold times are configurable on a perinterface basis -The command to configure hello interval is Router(config-if)#ip hello-interval eigrp as-number seconds o Changing the hello interval also requires changing the hold time to a value greater than or equal to the hello interval -The command to configure hold time value is Router(config-if)#ip hold-time eigrp as-number seconds 88 Summary o Background & History EIGRP is a derivative of IGRP EIGRP is a Cisco proprietary distance vector routing protocol released in 1994 o EIGRP terms and characteristics EIGPR uses RTP to transmit & receive EIGRP packets EIGRP has 5 packet type: Hello packets Update packets Acknowledgement packets Query packets Reply packets Supports VLSM & CIDR

23 89 Summary o EIGRP terms and characteristics EIGRP uses a hello protocol Purpose of hello protocol is to discover & establish adjacencies EIGRP routing updates Aperiodic Partial and bounded Fast convergence 90 Summary o EIGRP commands The following commands are used for EIGRP configuration RtrA(config)#router eigrp [autonomous-system #] RtrA(config-router)#network network-number The following commands can be used to verify EIGRP Show ip protocols Show ip eigrp neighbors Show ip route 91 Summary o EIGRP metrics include Bandwidth (default) Delay (default) Reliability Load 92 o DUAL Summary Purpose of DUAL To prevent routing loops Successor Primary route to a destination Feasible successor Backup route to a destination Feasible distance Lowest calculated metric to a destination Reported distance The distance towards a destination as advertised by an upstream neighbor

24 Summary o Choosing the best route 93 After router has received all updates from directly connected neighbors, it can calculate its DUAL 1 st metric is calculated for each route 2 nd route with lowest metric is designated successor & is placed in routing table 3 rd feasible successor is found Criteria for feasible successor: it must have lower reported distance to the destination than the installed route s feasible distance Feasible routes are maintained in topology table 94 Summary o Automatic summarization On by default Summarizes routes on classful boundary Summarization can be disabled using the following command RtrA(config-if)#no auto-summary Link-State Routing o Link state routing protocols Also known as shortest path first algorithms These protocols built around Dijkstra s SPF Link-State Routing Dikjstra s algorithm also known as the shortest path first (SPF) algorithm 95 96

25 Link-State Routing o The shortest path to a destination is not necessarily the path with the least number of hops Link-State Routing Protocols 2 link state routing protocols used for routing IP Open Shortest Path First (OSPF) Intermediate System-Intermediate System (IS-IS) OSPF OSPF Background of OSPF o Began in 1987 o 1989 OSPFv1 released in RFC 1131 This version was experimental & never deployed o 1991 OSPFv2 released in RFC 1247 o 1998 OSPFv2 updated in RFC 2328 (current version) o 1999 OSPFv3 published in RFC 2740 (for IPv6)

26 OSPF packet OSPF Message Encapsulation o OSPF packet type There exist 5 types o OSPF packet header Contains - Router ID and area ID and Type code for OSPF packet type o IP packet header Contains - Source IP address, Destination IP address, & Protocol field set to Data link frame header Contains - Source MAC address and Destination MAC address 102 OSPF Packet Types 1. Hello - Hello packets are used to establish and maintain adjacency with other OSPF routers. 2. DBD - The Database Description (DBD) packet contains an abbreviated list of the sending router's link-state database and is used by receiving routers to check against the local link-state database. 3. LSR - Receiving routers can then request more information about any entry in the DBD by sending a Link-State Request (LSR). 4. LSU - Link-State Update (LSU) packets are used to reply to LSRs as well as to announce new information. LSUs contain seven different types of Link-State Advertisements (LSAs). 5. LSAck - When an LSU is received, the router sends a Link-State Acknowledgement (LSAck) to confirm receipt of the LSU. OSPF Hello Protocol : OSPF Hello Packet Purpose of Hello Packet Discover OSPF neighbors & establish adjacencies Before two routers can form an OSPF neighbor adjacency, they must agree on three values: Hello interval, Dead interval, and network type. Advertise guidelines on which routers must agree to become neighbors Used by multi-access networks to elect a designated router and a backup designated router OSPF

27 OSPF o Hello Packets continued Contents of a Hello Packet, router ID of transmitting router o OSPF Hello Intervals Usually multicast ( = all OSPF routers) Sent every 10 seconds on multiaccess and point-to-point segments and 30 seconds for NBMA (non broadcast multiple-access) segments o OSPF Dead Intervals This is the time that must transpire before the neighbor is considered down Default time is 4 times the hello interval OSPF o Hello protocol packets contain information that is used in electing Designated Router (DR) - DR is responsible for updating all other OSPF routers Backup Designated Router (BDR) - This router takes over DR s responsibilities if DR fails OSPF Link State Update o Purpose of a Link State Update (LSU) Used to deliver link state advertisements o Purpose of a Link State Advertisement (LSA) Contains information about neighbors & path costs OSPF Algorithm o OSPF routers build & maintain link-state database containing LSA received from other routers Information found in database is utilized upon execution of Dijkstra SPF algorithm SPF algorithm used to create SPF tree SPF tree used to populate routing table

28 OSPF Administrative Distance o Default Administrative Distance for OSPF is 110 OSPF Authentication Purpose is to encrypt & authenticate routing information This is an interface specific configuration Routers will only accept routing information from other routers that have been configured with the same password or authentication information Basic OSPF Configuration o Topology Example Discontiguous IP addressing scheme Since OSPF is a classless routing protocol the subnet mask is configured in Basic OSPF Configuration The router ospf command o To enable OSPF on a router use the following command R1(config)#router ospf process-id Process id A locally significant number between 1 and this means it does not have to match other OSPF routers in order to establish adjacencies with those neighbors

29 Basic OSPF Configuration o OSPF network command - Requires entering: network address wildcard mask - the inverse of the subnet mask area-id - area-id refers to the OSPF area. OSPF area is a group of routers that share link state information Example: Router(config-router)#network network-address wildcard-ask area area-id -The area area-id refers to the OSPF area. -An OSPF area is a group of routers that share link-state information. -All OSPF routers in the same area must have the same link-state information in their link-state databases. Basic OSPF Configuration Basic OSPF Configuration o Router ID This is an IP address used to identify a router 3 criteria for deriving the router ID Use IP address configured with OSPF router-id command -Takes precedence over loopback and physical interface addresses If router-id command not used then router chooses highest IP address of any loopback interfaces If no loopback interfaces are configured then the highest IP address on any active interface is used Basic OSPF Configuration OSPF Router ID o Commands used to verify current router ID Show ip protocols Show ip ospf Show ip ospf interface

30 117 Basic OSPF Configuration OSPF Router ID o Router ID & Loopback addresses - Highest loopback address will be used as router ID if router-id command isn t used - Advantage of using loopback address the loopback interface cannot fail OSPF stability o The OSPF router-id command Introduced in IOS 12.0 Command syntax Router(config)#router ospf process-id Router(config-router)#router-id ip-address o Modifying the Router ID Use the command Router#clear ip ospf process 118 Basic OSPF Configuration Verifying OSPF o Use the show ip ospf command to verify & trouble shoot OSPF networks Command will display the following: Neighbor adjacency -No adjacency indicated by - Neighboring router s Router ID is not displayed A state of full is not displayed -Consequence of no adjacency- No link state information exchanged Inaccurate SPF trees & routing tables Command show ip protocols show ip ospf Basic OSPF Configuration Verifying OSPF - Additional Commands show ip ospf interface Description Displays OSPF process ID, router ID, networks router is advertising & administrative distance Displays OSPF process ID, router ID, OSPF area information & the last time SPF algorithm calculated Displays hello interval and dead interval Basic OSPF Configuration Examining the routing table o Use the show ip route command to display the routing table -An O at the beginning of a route indicates that the router source is OSPF -Note OSPF does not automatically summarize at major network boundaries

31 121 OSPF Metric o OSPF uses cost as the metric for determining the best route -The best route will have the lowest cost -Cost is based on bandwidth of an outgoing interface The lower the cost, the more likely the interface is to be used to forward data traffic." Cost is calculated using the formula 10 8 / bandwidth -Reference bandwidth defaults to 100 Mbps can be modified using auto-cost reference-bandwidth command 122 OSPF Metric OSPF Metric o COST of an OSPF route Is the accumulated value from one router to the next OSPF Metric o Usually the actual speed of a link is different than the default bandwidth This makes it imperative that the bandwidth value reflects link s actual speed Reason: so routing table has best path information o The show interface command will display interface s bandwidth -Most serial link default to 1.544Mbps

32 Basic OSPF Configuration Modifying the Cost of a link o Both sides of a serial link should be configured with the same bandwidth Commands used to modify bandwidth value Bandwidth command Example: Router(config-if)#bandwidth bandwidth-kbps Basic OSPF Configuration ip ospf cost command allows you to directly specify interface cost Example:R1(config)#interface serial 0/0/0 R1(config-if)#ip ospf cost Basic OSPF Configuration Modifying the Cost of the link o Difference between bandwidth command & the ip ospf cost command ip ospf cost command Sets cost to a specific value bandwidth command Link cost is calculated Basic OSPF Configuration

33 OSPF and Multiaccess Networks Challenges in Multi-access Networks o OSPF defines five network types: Point-to-point Broadcast Multiaccess non-broadcast multi-access (NBMA) OSPF and Multi-access Networks Point-to-multipoint Virtual links OSPF in Multi-access Networks o 2 challenges presented by multi-access networks Multiple adjacencies Extensive LSA flooding OSPF in Multi-access Networks o Extensive flooding of LSAs For every LSA sent out there must be an acknowledgement of receipt sent back to transmitting router. consequence: lots of bandwidth consumed and chaotic traffic

34 OSPF in Multi-access Networks o Solution to LSA flooding issue is the use of Designated router (DR) Backup designated router (BDR) o DR & BDR selection Routers are elected to send & receive LSA o Sending & Receiving LSA DR others only form full adjacencies with the DR and BDR in the network. DR others send LSAs via multicast to DR & BDR DR forward LSA via multicast address to all other routers OSPF in Multi-access Networks DR/BDR Election Process o DR/BDR elections DO NOT occur in point to point networks OSPF in Multi-access Networks o DR/BDR elections will take place on multi-access networks as shown below OSPF in Multi-access Networks Criteria for getting elected DR/BDR 1. DR: Router with the highest OSPF interface priority. 2. BDR: Router with the second highest OSPF interface priority. 3. If OSPF interface priorities are equal, the highest router ID is used to break the tie

35 OSPF in Multi-access Networks o Timing of DR/BDR Election Occurs as soon as 1 st router has its interface enabled on multi-access network When a DR is elected it remains as the DR until one of the following occurs -The DR fails. -The OSPF process on the DR fails. -The multi-access interface on the DR fails. OSPF in Multiaccess Networks o Manipulating the election process -If you want to influence the election of DR & BDR then do one of the following Boot up the DR first, followed by the BDR, and then boot all other routers, OR Shut down the interface on all routers, followed by a no shutdown on the DR, then the BDR, and then all other routers OSPF in Multiaccess Networks OSPF Interface Priority o Manipulating the DR/BDR election process continued Use the ip ospf priority interface command. Example:Router(config-if)#ip ospf priority {0-255} Priority number range 0 to means the router cannot become the DR or BDR 1 is the default priority value More OSPF Configuration Redistributing an OSPF Default Route o Topology includes a link to ISP Router connected to ISP Called an autonomous system border router Used to propagate a default route Example of static default route R1(config)#ip route loopback 1 Requires the use of the default-information originate command Example of default-information originate command 140 R1(config-router)#default-information originate

36 141 More OSPF Configuration Fine-Tuning OSPF o Since link speeds are getting faster it may be necessary to change reference bandwidth values Do this using the autocost reference-bandwidth command Example: R1(config-router)#autocost reference-bandwidth More OSPF Configuration Fine-Tuning OSPF o Modifying OSPF timers Reason to modify timers Faster detection of network failures Manually modifying Hello & Dead intervals Router(config-if)#ip ospf hello-interval seconds Router(config-if)#ip ospf dead-interval seconds Point to be made Hello & Dead intervals must be the same 142 between neighbors 143 Summary o RFC 2328 describes OSPF link state concepts and operations o OSPF Characteristics A commonly deployed link state routing protocol Employs DRs & BDRs on multi-access networks DRs & BDRs are elected DR & BDRs are used to transmit and receive LSAs Uses 5 packet types: 1: HELLO 2: DATABASE DESCRIPTION 3: LINK STATE REQUEST 4: LINK STATE UPDATE 5: LINK STATE ACKNOWLEDGEMENT 144 Summary o OSPF Characteristics Metric = cost Lowest cost = best path o Configuration Enable OSPF on a router using the following command R1(config)#router ospf process-id use the network command to define which interfaces will participate in a given OSPF process Router(config-router)#network network-address wildcard-mask area area-id

37 Summary overifying OSPF configuration Use the following commands show ip protocol show ip route show ip ospf interface show ip ospf neighbor Question? 145

ITE PC v4.0. Chapter Cisco Systems, Inc. All rights reserved. Cisco Public

ITE PC v4.0. Chapter Cisco Systems, Inc. All rights reserved. Cisco Public EIGRP Routing Protocols and Concepts Chapter 9 1 Objectives Describe the background and history of Enhanced Interior Gateway Routing Protocol (EIGRP). Examine the basic EIGRP configuration commands and

More information

Introduction to Local and Wide Area Networks

Introduction to Local and Wide Area Networks Introduction to Local and Wide Area Networks Lecturers Amnach Khawne Jirasak Sittigorn Chapter 1 1 Routing Protocols and Concepts Chapter 8 : The Routing Table: A Closer Look Chapter 9 : EIGRP Chapter

More information

EIGRP 04/01/2008. Routing Protocols and Concepts Chapter 9 Modified by Tony Chen

EIGRP 04/01/2008. Routing Protocols and Concepts Chapter 9 Modified by Tony Chen EIGRP Routing Protocols and Concepts Chapter 9 Modified by Tony Chen 04/01/2008 1 Introduction 2 EIGRP Roots of EIGRP: IGRP -Developed in 1985 to overcome RIPv1 s limited hop count -Distance vector routing

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

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

TDC 363 Introduction to LANs

TDC 363 Introduction to LANs TDC 363 Introduction to LANs OSPF Greg Brewster DePaul University TDC 363 Greg Brewster, DePaul University 1 OSPF Link State Routing Algorithms Open Shortest Path First (OSPF) Message Types Operations

More information

Final exam study Guide

Final exam study Guide Final exam study Guide K-1A * In relationship to the OSI layer model and encapsulation/decapsulation process, what happen to a packet that travels through multiple hops of routers? - What happen to the

More information

Advanced Networking: Routing & Switching 2 Chapter 7

Advanced Networking: Routing & Switching 2 Chapter 7 EIGRP Advanced Networking: Routing & Switching 2 Chapter 7 Copyleft 2014 Hacklab Cosenza (http://hlcs.it) Released under Creative Commons License 3.0 By-Sa Cisco name, logo and materials are Copyright

More information

RIPv2. Routing Protocols and Concepts Chapter 7. ITE PC v4.0 Chapter Cisco Systems, Inc. All rights reserved. Cisco Public

RIPv2. Routing Protocols and Concepts Chapter 7. ITE PC v4.0 Chapter Cisco Systems, Inc. All rights reserved. Cisco Public RIPv2 Routing Protocols and Concepts Chapter 7 1 Objectives Encounter and describe the limitations of RIPv1 s limitations. Apply the basic Routing Information Protocol Version 2 (RIPv2) configuration commands

More information

Cisco CCNA 2 Exploration - Routing

Cisco CCNA 2 Exploration - Routing Cisco CCNA 2 Exploration - Routing Chapter 9 EIGRP João José jjose@ualg.pt http://w3.ualg.pt/~jjose/cisco/ Based on: Graziani, R. (2008) CIS 82 Routing Theory and Concepts Introduction to EIGRP EIGRP:

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

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

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

More information

Claim desired outcome

Claim desired outcome Assessment Authoring - Table of Specification (TOS) The Table of Specification (TOS) is a high-level design template for a given assessment. It identifies the claims, components skills, targeted number

More information

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

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

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

Chapter 9. Enhanced Interior Gateway Routing Protocol (EIGRP) Part I

Chapter 9. Enhanced Interior Gateway Routing Protocol (EIGRP) Part I Chapter 9 Enhanced Interior Gateway Routing Protocol (EIGRP) Part I CCNA2-1 Chapter 9-2 Note for Instructors These presentations are the result of a collaboration among the instructors at St. Clair College

More information

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

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

More information

NAT Internetworking Standards and Technologies, Computer Engineering, KMITL 2

NAT Internetworking Standards and Technologies, Computer Engineering, KMITL 2 EIGRP & NAT Jirasak Sittigorn Internetworking Standards & Technologies Department of Computer Engineering, Faculty of Engineering King Mongkut's Institute of Technology Ladkrabang EIGRP Characteristics

More information

CCNA EXPLORATION V4.0 ROUTING PROTOCOLS AND CONCEPTS

CCNA EXPLORATION V4.0 ROUTING PROTOCOLS AND CONCEPTS CCNA EXPLORATION V4.0 ACCESSIBLE INSTRUCTOR MATERIALS COMPARISON OF NEW CURRICULA WITH EXISTING CURRICULA Prepared by Cisco Learning Institute June 23, 2008 Routing Protocols and Concepts Summary New CCNA

More information

Lab 4: Routing using OSPF

Lab 4: Routing using OSPF Network Topology:- Lab 4: Routing using OSPF Device Interface IP Address Subnet Mask Gateway/Clock Description Rate Fa 0/0 172.16.1.17 255.255.255.240 ----- R1 LAN R1 Se 0/0/0 192.168.10.1 255.255.255.252

More information

Lab 9.6.1: Basic EIGRP Configuration Lab

Lab 9.6.1: Basic EIGRP Configuration Lab Lab 9.6.1: Basic EIGRP Configuration Lab Topology Diagram Address Table 1 Learning Objectives Upon completion of this lab, you will be able to: Cable a network according to the Topology Diagram. Erase

More information

CIS 83 Midterm Spring 2004 Answer Sheet Name Score Grade Question Answer Question Answer

CIS 83 Midterm Spring 2004 Answer Sheet Name Score Grade Question Answer Question Answer CIS 83 Midterm Spring 2004 Answer Sheet Name: Score: Grade: Question Answer Question Answer 1 A B C D E F 51 A B C D E F 2 A B C D E F 52 A B C D E F 3 A B C D E F 53 A B C D E F 4 A B C D E F 54 A B C

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

Chapter 2: Configuring the Enhanced Interior Gateway Routing Protocol

Chapter 2: Configuring the Enhanced Interior Gateway Routing Protocol : Configuring the Enhanced Interior Gateway Routing Protocol CCNP ROUTE: Implementing IP Routing ROUTE v6 1 Objectives Describe the basic operation of EIGRP. Plan and implement EIGRP routing. Configure

More information

Section 6. Implementing EIGRP ICND2

Section 6. Implementing EIGRP ICND2 ICND2 Section 6 Implementing EIGRP Enhanced Interior Gateway Routing Protocol (EIGRP) was introduced in Cisco IOS Release 9.21 as an enhancement to the limitations of IGRP. IGRP was developed by Cisco

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

8. Refer to the exhibit. The ORL router is unable to form a neighbor relationship with the JAX router. What is a possible cause of this problem?

8. Refer to the exhibit. The ORL router is unable to form a neighbor relationship with the JAX router. What is a possible cause of this problem? 1. Refer to the exhibit. A new PC was deployed in the Sales network. It was given the host address of 192.168.10.31 with a default gateway of 192.168.10.17. The PC is not communicating with the network

More information

IP Enhanced IGRP Commands

IP Enhanced IGRP Commands IP Enhanced IGRP Commands Use the commands in this chapter to configure and monitor IP Enhanced IGRP. For configuration information and examples, refer to the Configuring IP Enhanced IGRP chapter of the

More information

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

Lab10- Configuring EIGRP

Lab10- Configuring EIGRP Lab10- Configuring EIGRP Topology Lab10- Configuring EIGRP Page 1 Learning Objectives Upon completion of this lab, you will be able to: Cable a network according to the Topology Diagram. Erase the startup

More information

Configuring Networking Protocols

Configuring Networking Protocols 11 CHAPTER This chapter describes how to configure the ML-Series card for supported IP routing protocols. It is intended to provide enough information for a network administrator to get the protocols up

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

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

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

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

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

Unit 3: Dynamic Routing

Unit 3: Dynamic Routing 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

More information

Introduction to Local and Wide Area Networks

Introduction to Local and Wide Area Networks Introduction to Local and Wide Area Networks Lecturers Amnach Khawne Jirasak Sittigorn Chapter 1 1 Routing Protocols and Concepts Chapter 4 : Distance Vector Routing Protocols Chapter 5 : RIP version 1

More information

Which of the following are primary functions of a router? (Choose two.) - packet switching - path selection

Which of the following are primary functions of a router? (Choose two.) - packet switching - path selection Which three statements are true regarding the encapsulation and de-encapsulation of packets when traveling through a router? (Choose three.) - The router modifies the TTL field, decrementing it by one.

More information

Default & Static Routes and Routing Information Protocol. Presented by : Mohammed Hamad

Default & Static Routes and Routing Information Protocol. Presented by : Mohammed Hamad Default & Static Routes and Routing Information Protocol Presented by : Mohammed Hamad When a device has multiple paths to reach a destination, it always selects one path by preferring it over others.

More information

CCNA EXPLORATION V4.0 ROUTING PROTOCOLS AND CONCEPTS ACCESSIBLE INSTRUCTOR MATERIALS POWERPOINT OBJECTIVES

CCNA EXPLORATION V4.0 ROUTING PROTOCOLS AND CONCEPTS ACCESSIBLE INSTRUCTOR MATERIALS POWERPOINT OBJECTIVES CCNA EXPLORATION V4.0 ROUTING PROTOCOLS AND CONCEPTS ACCESSIBLE INSTRUCTOR MATERIALS Prepared by Cisco Learning Institute June 23, 2008 Chapter 1 Introduction to Routing and Packet Forwarding Objectives

More information

CCNA Questions/Answers Routing Protocols

CCNA Questions/Answers Routing Protocols Refer to the exhibit and configuration shown above. Routers R1 and R2 are properly configured with eigrp 976 protocol and are able to ping interfaces fa0/1 and fa0/2, respectively. Which commands are necessary

More information

Routing with a distance vector protocol - EIGRP

Routing with a distance vector protocol - EIGRP Routing with a distance vector protocol - EIGRP Introducing Routing and Switching in the Enterprise Chapter 5.2 Copyleft 2012 Vincenzo Bruno (www.vincenzobruno.it) Released under Crative Commons License

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

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

Configuring EIGRP. 2001, Cisco Systems, Inc.

Configuring EIGRP. 2001, Cisco Systems, Inc. Configuring EIGRP 4-1 EIGRP Overview 4-2 What Is EIGRP? IPX Routing Protocols IP Routing Protocols AppleTalk Routing Protocol Enhanced IGRP IP Routing Protocols AppleTalk Routing Protocol IPX Routing Protocols

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

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

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

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

RIP version 1. Routing Protocols and Concepts Chapter 5. Version Cisco Systems, Inc. All rights reserved. Cisco Public 1

RIP version 1. Routing Protocols and Concepts Chapter 5. Version Cisco Systems, Inc. All rights reserved. Cisco Public 1 RIP version 1 Routing Protocols and Concepts Chapter 5 Version 4.0 1 Objectives Describe the functions, characteristics, and operation of the RIPv1 protocol. Configure a device for using RIPv1. Verify

More information

CIS 83 LAB 3 - EIGRP Rich Simms September 23, Objective. Scenario. Topology

CIS 83 LAB 3 - EIGRP Rich Simms September 23, Objective. Scenario. Topology CIS 83 LAB 3 - EIGRP Rich Simms September 23, 2006 Objective The objective of this lab is to become familiar setting up and configuring EIGRP on three routers. EIGRP is a Cisco proprietary distance-vector

More information

Configuring EIGRP. Finding Feature Information

Configuring EIGRP. Finding Feature Information The Enhanced Interior Gateway Routing Protocol (EIGRP) is an enhanced version of the Interior Gateway Routing Protocol (IGRP) developed by Cisco. The convergence properties and the operating efficiency

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

Exam : : Building Scalable Cisco Internetworks (BSCI) Title. Ver :

Exam : : Building Scalable Cisco Internetworks (BSCI) Title. Ver : Exam : 642-801 Title : Building Scalable Cisco Internetworks (BSCI) Ver : 03-22-05 QUESTION 1 A packet that needs to be forwarded arrives on an interface of a router. In order for a router to route data,

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

Explanation: In order to verify proper route redistribution, use the "show ip route" command on all routers

Explanation: In order to verify proper route redistribution, use the show ip route command on all routers QUESTION 401 The 192.168.0.0/16 network is not being propagated throughout the network via BGP as expected. Observe the BGP configuration commands from the advertising router shown below. Router bgp 65111

More information

Simulation Based EIGRP over OSPF Performance Analysis

Simulation Based EIGRP over OSPF Performance Analysis Master Thesis in Electrical Engineering Emphasis on Telecommunications Thesis no: 4983 May 14, 2010 Simulation Based EIGRP over OSPF Performance Analysis Mohammad Nazrul Islam shojib_12@yahoo.com Md. Ahsan

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

Table of Contents. Cisco Introduction to EIGRP

Table of Contents. Cisco Introduction to EIGRP Table of Contents Introduction to EIGRP...1 Introduction...1 Before You Begin...1 Conventions...1 Prerequisites...1 Components Used...1 What is IGRP?...2 What is EIGRP?...2 How Does EIGRP Work?...2 EIGRP

More information

Chapter 5 RIP version 1

Chapter 5 RIP version 1 Cisco CCNA 2 Exploration - Routing Chapter 5 RIP version 1 João José jjose@ualg.pt http://w3.ualg.pt/~jjose/cisco/ Based on: Graziani, R. (2008) CIS 82 Routing Theory and Concepts RIPv1: A Distance Vector,

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

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

EIGRP Features and Operation

EIGRP Features and Operation EIGRP Features and Operation Enhanced IGRP (EIGRP) is a classless, enhanced distance-vector protocol. EIGRP is a Cisco proprietary protocol. EIGRP includes the subnet mask in its route updates. And as

More information

IPv4 IGP Troubleshooting. IPv4 Routing Workflow. IPv4 routing can be subdivided into three discrete steps

IPv4 IGP Troubleshooting. IPv4 Routing Workflow. IPv4 routing can be subdivided into three discrete steps Internetwork Expert s CCNP Bootcamp IPv4 IGP Troubleshooting http:// IPv4 Routing Workflow IPv4 routing can be subdivided into three discrete steps Routing lookup Switching method Layer 2 encapsulation

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

Configuring EIGRP. Overview CHAPTER

Configuring EIGRP. Overview CHAPTER CHAPTER 24 This chapter describes how to configure the adaptive security appliance to route data, perform authentication, and redistribute routing information, using the Enhanced Interior Gateway Routing

More information

RIP Configuration. RIP Overview. Operation of RIP. Introduction. RIP routing table. RIP timers

RIP Configuration. RIP Overview. Operation of RIP. Introduction. RIP routing table. RIP timers Table of Contents RIP Configuration 1 RIP Overview 1 Operation of RIP 1 Operation of RIP 2 RIP Version 2 RIP Message Format 3 Protocols and Standards 4 Configuring RIP Basic Functions 5 Configuration Prerequisites

More information

Configuring OSPF. Cisco s OSPF Implementation

Configuring OSPF. Cisco s OSPF Implementation Configuring OSPF This chapter describes how to configure OSPF. For a complete description of the OSPF commands in this chapter, refer to the OSPF s chapter of the Network Protocols Reference, Part 1. To

More information

EIGRP. About EIGRP. CLI Book 1: Cisco ASA Series General Operations CLI Configuration Guide, 9.7 1

EIGRP. About EIGRP. CLI Book 1: Cisco ASA Series General Operations CLI Configuration Guide, 9.7 1 This chapter describes how to configure the Cisco ASA to route data, perform authentication, and redistribute routing information using the Enhanced Interior Gateway Routing Protocol (). About, page 1

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

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

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

cisco. Number: Passing Score: 800 Time Limit: 120 min.

cisco. Number: Passing Score: 800 Time Limit: 120 min. 300-101.cisco Number: 300-101 Passing Score: 800 Time Limit: 120 min Exam A QUESTION 1 Examine the following output of the show ip ospf interface command. What would be the effect of executing the auto-cost

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

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

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

904 ASBRs (Autonomous System Boundary Routers)

904 ASBRs (Autonomous System Boundary Routers) I N D E X A ABRs (Area Border Routers), 292 LSA propagation, 294 Access layer, hierarchical designs, 42 access lists. See also IP access lists BGP-4, 557 controlling terminal access, 51 52 guidelines for

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

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

IRT0030 ANDMESIDE LOENG 5. Indrek Rokk

IRT0030 ANDMESIDE LOENG 5. Indrek Rokk IRT0030 ANDMESIDE LOENG 5 Indrek Rokk 2 Harjutus Aadress 2001:db8:aaaa:fc:50a5:8a35:a5bb:66e1/64 Küsimused Interface ID Subnet prefix Site prefix ISP prefix ISP prefix kahendkoodis Registry number Registry

More information

CCNP 1 Module 6 OSPF Paul Flynn 1

CCNP 1 Module 6 OSPF Paul Flynn 1 CCNP 1 Module 6 OSPF Paul Flynn 1 Module Overview 6.1 OSPF Overview 6.1.1 Issues addressed by OSPF 6.1.2 OSPF terminology 6.1.3 OSPF states 6.1.4 OSPF network types 6.1.5 The OSPF Hello protocol 6.2 OSPF

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

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

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

CCNP 1: Advanced Routing

CCNP 1: Advanced Routing Scope and Sequence CCNP 1: Advanced Routing Cisco Networking Academy Program Version 3.1 TABLE OF CONTENTS CCNP 1: ADVANCED ROUTING...1 TARGET AUDIENCE...3 PREREQUISITES...3 COURSE DESCRIPTION...3 COURSE

More information

Enhanced IGRP. Chapter Goals. Enhanced IGRP Capabilities and Attributes CHAPTER

Enhanced IGRP. Chapter Goals. Enhanced IGRP Capabilities and Attributes CHAPTER 40 CHAPTER Chapter Goals Identify the four key technologies employed by (EIGRP). Understand the Diffusing Update Algorithm (DUAL), and describe how it improves the operational efficiency of EIGRP. Learn

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

Introduction to OSPF OSPF. Link State Routing. Link State. Fast Convergence. Low Bandwidth Utilisation

Introduction to OSPF OSPF. Link State Routing. Link State. Fast Convergence. Low Bandwidth Utilisation Introduction to OSPF ISP/IP Workshops OSPF Open Shortest Path First Link state or SPF technology Developed by OSPF working group of IETF (RFC 47) Designed for TCP/IP Internet environment Fast convergence

More information

Cramsession for Building Scalable Cisco Networks Routing 2.0

Cramsession for Building Scalable Cisco Networks Routing 2.0 TM BrainBuzz Cramsession Last updated October, 2000. Click here for updates. Click here to see additional documents related to this study guide. Contents Contents... 1 Routing Protocols... 2 Hybrid Protocols...

More information

Ch. 5 Maintaining and Troubleshooting Routing Solutions. Net412- Network troubleshooting

Ch. 5 Maintaining and Troubleshooting Routing Solutions. Net412- Network troubleshooting Ch. 5 Maintaining and Troubleshooting Routing Solutions Net412- Network troubleshooting Troubleshooting Routing Network Layer Connectivity EIGRP OSPF 2 Network Connectivity Just like we did when we looked

More information

EIGRP. Finding Feature Information

EIGRP. Finding Feature Information The Enhanced Interior Gateway Routing Protocol () is an enhanced version of the Interior Gateway Routing Protocol (IGRP) developed by Cisco. The convergence properties and the operating efficiency of have

More information

Implementing Cisco IP Routing (ROUTE)

Implementing Cisco IP Routing (ROUTE) Implementing Cisco IP Routing (ROUTE) Foundation Learning Guide Foundation learning for the ROUTE 642-902 Exam Diane Teare Cisco Press 800 East 96th Street Indianapolis, IN 46240 Implementing Cisco IP

More information

Configuring EIGRP. Finding Feature Information. Contents

Configuring EIGRP. Finding Feature Information. Contents Configuring EIGRP First Published: 2005 Last Updated: September 10, 2010 Enhanced Interior Gateway Routing Protocol (EIGRP) is an enhanced version of the IGRP developed by Cisco. The convergence properties

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

Configuring IP Routing Protocols

Configuring IP Routing Protocols CHAPTER 18 Configuring IP Routing Protocols This chapter describes how to configure the various Internet Protocol (IP) routing protocols. For a complete description of the commands listed in this chapter,

More information

The following questions are designed to test your understanding of this chapter s

The following questions are designed to test your understanding of this chapter s Review Questions The following questions are designed to test your understanding of this chapter s material. For more information on how to get additional questions, please see www.lammle.com/ccn a. You

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 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

FiberstoreOS V3.3 IPv6 Routing Command Line Reference

FiberstoreOS V3.3 IPv6 Routing Command Line Reference FiberstoreOS V3.3 IPv6 Routing Command Line Reference Contents 1 OSPFv3 Commands... 4 1.1 area default-cost...4 1.2 area range...5 1.3 area stub... 6 1.4 auto-cost...7 1.5 clear ipv6 ospf...8 1.6 default-information

More information