19-05-2021

Ine Ccnp Routing & Switching Video Course Download Torrent

INE CCNP Routing & Switching Training Bundle. INE CCNP Routing & Switching COMPLETE Training Bundle. – INE CCNP Routing & Switching COMPLETE Training Bundle.

INE – CCNP R&S v2
English | Size: 500.18 MB
Genre: eLearning

1-Introduction.flv119.09flv
INE – CCNP R&S v2 (2015) – HQ2-EIGRP
2- EIGRP Overview.mkv124.66mkv
3- EIGRP Neighborship & Parameters Overview.mkv72.77mkv
4- EIGRP Hello Packets, Hello & Dead Intervals_Timers.mkv33.74mkv
5- EIGRP Authentication — Part 1.mkv39.11mkv
6- EIGRP Authentication — Part 2.mkv46.88mkv
7- EIGRP Passive Interfaces & K-Values.mkv37.84mkv
8- EIGRP Static Neighbors and Router ID.mkv75.79mkv
9- EIGRP Neighbors over WANs.mkv34.31mkv
10- EIGRP Topology Table, Messages & Update Process.mkv39.42mkv
11- EIGRP Topology Exchange over WAN.mkv34.67mkv
12- EIGRP Feasible Distance & Reported Distance.mkv30.37mkv
13- EIGRP Metric Manipulation — Part 1.mkv26.83mkv
14- EIGRP Metric Manipulation — Part 2.mkv40.72mkv
15-EIGRP Convergence — Part 1.mkv75.14mkv
16- EIGRP Convergence — Part 2.mkv136.34mkv
17-EIGRP Convergence — Part 3.mkv66.94mkv
18-EIGRP Variance.mkv50.10mkv
19-ACL Review, Filtering Using ACLs.mkv102.00mkv
20- Introduction to Prefix-List Logic.mkv67.16mkv
21-EIGRP Route Filtering Using IP prefix Lists.mkv11.26mkv
22-Introduction to Route Map Logic.mkv61.20mkv
23-EIGRP Route Filtering Using Route-Maps.mkv15.23mkv
24-EIGRP Route Summarization — Part 1.mkv69.34mkv
25-EIGRP Route Summarization — Part 2.mkv94.12mkv
26-EIGRP Default Route.mkv79.04mkv
27- EIGRP Path Manipulation.mkv27.63mkv
28-Named Mode EIGRP Configuration.flv409.60flv
INE – CCNP R&S v2 (2015) – HQ3-OSPF
29-Introduction to OSPF.mkv109.73mkv
30-OSPF Neighbor Discovery, Hello Packet Parameters, Hello & Dead Intervals.mkv53.32mkv
31-OSPF Router-ID & MTU Mismatch.mkv70.96mkv
32-OSPF Authentication — Part 1.mkv27.14mkv
33-OSPF Authentication — Part 2.mkv51.97mkv
34-OSPF Network Types — Part 1.mkv101.27mkv
35-OSPF Network Types — Part 2.mkv56.19mkv
36-OSPF Link State Database, Types of LSAs.mkv14.42mkv
37-OSPF Type 1 LSA.mkv81.09mkv
38-OSPF Type 2 LSA.mkv42.28mkv
39-OSPF Type 3 LSA.mkv53.01mkv
40-OSPF Database Exchange, OSPF Message Types, Neighbor States.mkv24.66mkv
41-OSPF Database Exchange, LSA Flooding, Periodic flooding.mkv65.66mkv
42-OSPF Metric Calculation for Intra-Area & Inter-Area Routes.mkv30.56mkv
43-OSPF Metric Tuning.mkv20.32mkv
44-OSPF route Filtering between Areas.mkv43.84mkv
45-OSPF Route Filtering into the Routing Table.mkv70.89mkv
46- OSPF Route Summarization.mkv45.91mkv
47-OSPF Default Routing, Introduction to Stub Areas.mkv123.80mkv
48-OSPF Stub Areas — Part 1.mkv41.82mkv
49- OSPF of Type-5 LSAs (Redistribution filtering).mkv72.76mkv
50- OSPF Stub Areas — Part 2.mkv7.05mkv
51- Introduction to Virtual Links, Need for Virtual Links.mkv44.58mkv
52- Configuring Virtual Links with & without Authentication.mkv68.96mkv
53- OSPF Path Manipulation.mkv21.20mkv
INE – CCNP R&S v2 (2015) – HQ4-Route Redistribution
54-IGP Redistribution Overview.mkv15.73mkv
55-Redistribution into EIGRP.mkv74.30mkv
56-OSPF Type-4 ASBR-Summary LSAs.mkv19.47mkv
57-Redistribution into OSPF.mkv15.95mkv
58-Redistribution Using Route-Maps & Distribution-list Switching.mkv14.67mkv
59-Setting Attributes for Redistributed Routes Using Route-Map.mkv58.57mkv
60-Routing Loops & Preventing Routing Loops by Changing Metric Value.mkv33.68mkv
61-Preventing Loops with Administrative Distance.mkv80.19mkv
62-Routing Loops with more than Two Routing Doamins & Per-Route AD Settings.mkv37.84mkv
63-Preventing Routing Loops by Filtering Using Tags.mkv45.09mkv
64-Path Manipulation with Redistribution.mkv30.22mkv
INE – CCNP R&S v2 (2015) – HQ5-Infrastructure Services Part 1
65-IP Service-Level Agreements.flv454.06flv
INE – CCNP R&S v2 (2015) – HQ6-Policy-Based Routing
66-Policy-Based Routing.flv312.24flv
INE – CCNP R&S v2 (2015) – HQ7-Infrastructure Services Part 2
67-NTP.flv207.86flv
INE – CCNP R&S v2 (2015) – HQ8-BGP
68-Introduction to BGP.mkv45.95mkv
69-Overview of iBGP and eBGP.mkv71.08mkv
70-eBGP Neighborship Requirements.mkv53.86mkv
71-BGP Update Source & Multihop Requirement.mkv128.57mkv
72- iBGP Neighborship Requirements & Configuration.mkv38.39mkv
73- BGP Neighbor States.mkv25.55mkv
74- BGP Message Types. BGP Table & BGP Routes.mkv63.31mkv
75-BGP AS Path Attribute.mkv25.88mkv
76-Injecting Routes into BGP.mkv115.19mkv
77-Using BGP for Outbound Routing.mkv16.18mkv
78-iBGP BGP Table Entires & Next-Hop Issues with iBGP Switching.mkv108.86mkv
79-iBGP Full Mesh & Synchronization.mkv75.72mkv
80-BGP Peer-Groups.flv109.65flv
81-BGP Filtering — Part 1.mkv92.13mkv
82-BGP Filtering — Part 2.mkv99.55mkv
83-BGP Path Attributes & BGP Best Path Algorithm.mkv17.10mkv
84-BGP Attributes — Weight and Local Preference.mkv105.22mkv
85-BGP Attributes — Origin Code.mkv56.71mkv
86-BGP Attributes — AS-Path and MED.mkv80.84mkv
87-BGP Multipath.mkv17.06mkv
88-BGP Address-Family Configuration.flv661.78flv
INE – CCNP R&S v2 (2015) – HQ9-IPv6
89-IPv6 RIPng.mkv75.95mkv
90-EIGRP for IPv6.mkv49.46mkv
91-OSPF Version 3.mkv91.26mkv
92-Static IPv6 Routes.mkv5.33mkv
93-IPv6 Traffic Filters.flv76.98flv
94-IPv6 IGP Redistribution.flv370.44flv
95- Introduction to IPv4 & IPv6 Coexistence.mkv8.87mkv
96-Tunneling Concepts.mkv20.44mkv
97- Overview of IPv6 Tunneling Options & NAT-PT.mkv20.69mkv
98-Static Point-to-Point IPv6 Tunnels.mkv132.54mkv
99- IPv6 Automatic 6to4 Tunnels.mkv85.78mkv
100- ISATAP Tunnels.flv333.04flv
INE – CCNP R&S v2 (2015) – HQ10-Infrastructure Services Part 3
101-NAT64.flv289.39flv
INE – CCNP R&S v2 (2015) – HQ11-VPN Technology
102-Intro to VPNs.flv194.82flv
103-VRF-Lite.flv311.66flv
104-Intro to DMVPN.flv334.55flv
INE – CCNP R&S v2 (2015) – HQ12-Switching Part 1
105-Basic Switching Review.mkv74.94mkv
106-Etherchannel- L3 Channels and Misconfiguration Guard.flv172.22flv
107-VTP- VTPv3 and VTP Pruning.flv164.04flv
108-Introduction to Multilayer Switching.mkv108.05mkv
109-Cisco Express Forwarding.mkv140.22mkv
110-Switch Operations and Hardware.mkv94.57mkv
111-Switch Chassis Redundancy.flv109.00flv
112-Configuring a Switch as a DHCP Server.mkv76.55mkv
113-Managing Switch Ports.mkv37.66mkv
114-Port Mirroring SPAN and RSPAN.flv358.20flv
115-802.1d Spanning-Tree.mkv92.89mkv
116-802.1d Spanning-Tree Optimizations & Security.mkv143.27mkv
117-Rapid Spanning Tree Protocol (RSTP).mkv91.88mkv
118-Multiple Spanning Tree Protocol (MSTP) — Part 1.mkv185.17mkv
119-Multiple Spanning Tree Protocol (MSTP) — Part 2.mkv87.74mkv
INE – CCNP R&S v2 (2015) – HQ13-First Hop Redundancy Protocols
120-High Availability — Hot Standby Router Protocol.mkv176.61mkv
121-High Availability — VRRP.mkv82.65mkv
122-High Availability — GLBP.mkv118.81mkv
123-Supervisor and Route Processor Redundancy.mkv79.73mkv
INE – CCNP R&S v2 (2015) – HQ14-POE
124- Power Over Ethernet.mkv41.18mkv
INE – CCNP R&S v2 (2015) – HQ15-Switching Part 2
125- Voice VLAN.mkv42.41mkv
126- Voice QoS — Part 1.mkv125.85mkv
127- Voice QoS — Part 2.mkv137.22mkv
INE – CCNP R&S v2 (2015) – HQ16-Securing Switch Access
128- Securing Switch Access- AAA.flv264.80flv
129-Securing Switch Access- Storm Control.flv286.09flv
130-Securing Switch Access — DHCP Snooping.mkv80.20mkv
131-Securing Switch Access — Dynamic AARP Inspection.mkv44.22mkv
132-Securing VLANs — VLAN Access-Lists.mkv52.66mkv
133-Securing VLANs- Private VLANs.flv244.67flv
INE – CCNP R&S v2 (2015) – HQRemoved from course but was part of v1.0
50-OSPF Stub Areas — Part 3.mkv47.57mkv
112-Wireless — Part 1.mkv150.72mkv
113-Wireless — Part 2.mkv84.82mkv

Download Faster with Resume Support with Premium Account

Rapidgator:
https://rapidgator.net/file/1d8941c543eae93662b8b9710a270278/INE-CCNP-R-S-v2-2015-HQ.part01.rar.html
https://rapidgator.net/file/8537861cb3e1cec1f07e738b9f43aa6b/INE-CCNP-R-S-v2-2015-HQ.part02.rar.html
https://rapidgator.net/file/3488996f4324b8e73164f58dba266d44/INE-CCNP-R-S-v2-2015-HQ.part03.rar.html
https://rapidgator.net/file/4d7f0cc9fe592b837d9eb14d95def8af/INE-CCNP-R-S-v2-2015-HQ.part04.rar.html
https://rapidgator.net/file/f5716173e754eddb1eedeeba4a150ebe/INE-CCNP-R-S-v2-2015-HQ.part05.rar.html
https://rapidgator.net/file/e62bc05ef55bad5eec9a24d88aa3f54a/INE-CCNP-R-S-v2-2015-HQ.part06.rar.html
https://rapidgator.net/file/cc67d1e6f24485fc7c9c8b1c14832605/INE-CCNP-R-S-v2-2015-HQ.part07.rar.html
https://rapidgator.net/file/b80842d0fcf8c709d9ac3928755cf555/INE-CCNP-R-S-v2-2015-HQ.part08.rar.html
https://rapidgator.net/file/5c7ecaadbdb24a4a839f9e55a2cb50c4/INE-CCNP-R-S-v2-2015-HQ.part09.rar.html
https://rapidgator.net/file/6bf65e03d084f61eb73677fe5072a9e9/INE-CCNP-R-S-v2-2015-HQ.part10.rar.html
https://rapidgator.net/file/0ce7a7b54a6f10ff439a210dcb9f4640/INE-CCNP-R-S-v2-2015-HQ.part11.rar.html
https://rapidgator.net/file/4b5ad42517bbe0da14586d5fa70192ef/INE-CCNP-R-S-v2-2015-HQ.part12.rar.html

NitroFlare:
http://nitroflare.com/view/2123A4C71924B78/INE-CCNP-R-S-v2-2015-HQ.part01.rar
http://nitroflare.com/view/F044ED54D6352F9/INE-CCNP-R-S-v2-2015-HQ.part02.rar
http://nitroflare.com/view/622AE30B67B2F82/INE-CCNP-R-S-v2-2015-HQ.part03.rar
http://nitroflare.com/view/843EBAA1E478DA8/INE-CCNP-R-S-v2-2015-HQ.part04.rar
http://nitroflare.com/view/7B91943916AC3E1/INE-CCNP-R-S-v2-2015-HQ.part05.rar
http://nitroflare.com/view/5640431B912E4FC/INE-CCNP-R-S-v2-2015-HQ.part06.rar
http://nitroflare.com/view/27460BBEF65FD67/INE-CCNP-R-S-v2-2015-HQ.part07.rar
http://nitroflare.com/view/4076982366C0B17/INE-CCNP-R-S-v2-2015-HQ.part08.rar
http://nitroflare.com/view/31BB02D1F1392D4/INE-CCNP-R-S-v2-2015-HQ.part09.rar
http://nitroflare.com/view/4FAC23BC4A4359F/INE-CCNP-R-S-v2-2015-HQ.part10.rar
http://nitroflare.com/view/EFD67149367F3DE/INE-CCNP-R-S-v2-2015-HQ.part11.rar
http://nitroflare.com/view/0F4FC26C102263E/INE-CCNP-R-S-v2-2015-HQ.part12.rar

If any links die or problem unrar, send request tohttp://goo.gl/t4uR9G

Note: These are my personal notes while studying for the CCNP Route exam. Feel free to use them and by all means leave comments if you see any items that are incorrect or missing.

—(INE 19)—

IP Routing Overview

3 steps:

Routing – find the outgoing interface
- Step 1 – Find the longest match (most bits)
- Step 2 – Perform recursive lookup
  - Find an interface
- If multiple longest matches exist
  - Metric and Administrative Distance
    - Same protocol – metric used to decide between multiple routes
    - Different protocols – administrative distance used to decide

Switching – move the packet between interfaces
- Process switching, Fast switching, CEF
- Move the packet between interfaces
- Where load balancing occurs
Encapsulation
- Build the L2 header
- L2 packet rewrite
- Two different types of interfaces
  - Point to point
    - Only one possible destination
    - No need for layer 2 addressing
    - eg: HDLC, PPP
  - Multipoint
    - More than one possible destination
    - Requires layer 3 to layer 2 resolution
    - eg: Ethernet (mac), Frame Relay (DLCI), ATM (VPI/VCI),etc.

Routing to a Next-Hop vs. Interface

To next-hop
- eg: ip route 10.0.0.0 255.0.0.0 1.2.3.4
- Recursive lookup required
- Resolve layer 2 address of 1.2.3.4
To point-to-point interface
- eg: ip route 10.0.0.0 255.0.0.0 Serial0/0.1
- No recursive lookup
- Layer 2 resolution not required
Tomultipoint interface
- eg: ip route 10.0.0.0 255.0.0.0 FastEthernet0/0
- No recursive lookup
- Resolve layer 2 address for final destination
  - Ethernet Proxy-ARP
  - NBMA Addresses

—(INE 21)—

EIGRP

Enhanced Interior Gateway Routing Protocol

Successor to IGRP
Cisco proprietary “hybrid protocol”
- Both Distance Vector and Link State behavior
- Really “Advanced Distance Vector”
Classless
- Supports VLSM and summarization

Why use EIGRP?

Guarantees loop-fee topology
- Uses diffusing update algorithm (DUAL) calculation
Fast convergence
- With some configurations, 50-100 ms convergence
- Fastest of all IGP in certain designs
- Backup routes
Reliable and Efficient Updating
- Forms active neighbor adjacencies
- Guarantees packet delivery with Reliable Transport Protocol (RTP)
  - IP Protocol 88 (see IANA Protocol Numbers)
- Supports partial updates
  - Not all neighbors need all routes
Multiple routed protocol support
- IPv4, IPX & Appletalk
Granular Metric
- Hybrid metric derived from multiple factors
Unequal Cost Load Balancing
- Only IGP that supports true load distribution
Control Plane Security
- Supports MD5 authentication

How EIGRP Works

Step1 – Discover EIGRP Neighbors
- Multicast “HELLO” packets to discover neighbors on EIGRP enabled attached links
  - Transport via IP protocol 88
  - Destination address 224.0.0.10
- Hello packets contain
  - Autonomous System Number (not a public ASN like BGP)
  - Hold Time – how long to wait before declaring neighbor unreachable
    - Does not have to be the same between neighbors
    - Opposite of Hello/Dead timers for BGP/OSPF
  - Authentication
  - Metric Weightings (K Values)
- Neighbors found are inserted into EIGRP neighbor table
- Neighbors that agree on attributes and exchange updates form active adjacency
Step 2 – Exchange Topology Information
- EIGRP “Update” messages used to exchange routes
  - Sent as multicast to 224.0.0.10 or as unicast
  - IP Protocol 88 must be allowed for both multicast and unicast
- RTP uses sequence numbers and acknowledgements (ACKs) to ensure deliver
- Update messages describe attributes of a route
  - Prefix and Length (network and subnet mask)
  - Next-Hop
  - Bandwidth
  - Delay
  - Load
  - Reliability
  - MTU
  - Hop Count
  - External Attributes
- All routes learned from all neighbors make up the topology table
  - show ip eigrp topology
Step 3 – Choosing the Best Path
- Once topology is learned, DUAL runs to choose loop-free best path to each destination
- Unlike other protocols EIGRP uses complex “composite” metric to choose best path
- Composite metric calculated from:
  - Administrative weighting
  - Bandwidth
  - Delay
  - Load
  - Reliability
- Path with lowest composite metric is considered best and installed into IP routing table
  - show ip route eigrp
- One or more backup routes can also be pre-calculated per destination
- Only best route is advertised to other EIGRP neighbors
Step 4 – Neighbor and Topology Table Maintenance
- Unlike RIP or IGRP, active EIGRP neighbor adjacency reduces convergence time in event of network failure
- Adjacent neighbors hello packets contain “hold time”
  - If no hello is received within hold time, neighbor declared unreachable
- When neighbor is lost…
  - Paths via that neighbor are removed from topology and routing table
  - If backup routes exist they become new best paths and are inserted into routing table
    - In this case EIGRP can have sub-second convergence
  - If no backup routes exist, DUAL must run again
    - When best path is lost and no backup routes exist, route goes into “active state” and “active timer” starts
    - EIGRP “QUERY” message is reliably sent to remaining neighbors asking for alternate route
    - QUERY is propagated to all neighbors within EIGRP “query domain” or “flooding domain”
    - Neighbors respond with EIGRP “REPLY” packet indicating if alternate route is available
      - If alternate route exists, DUAL recalculates new best path
      - If no alternate route, prefix removed from topology table
      - If active timer expires and no REPLY received, route is declared “Stuck-In-Active” (SIA) and removed from topology table
        Indicates incorrect design

—(INE 22)—

EIGRP Loop Prevention

Loop-free topology guaranteed through:
- Split Horizon
  - Don’t advertise routes out the same link they came in on
- DUAL Feasibility Condition
  - If your metric to the destination is lower than mine, you must be closer

DUAL Terms

Successor – Best path to a destination
Feasible Distance (FD) – Composite metric of best path
Feasible Successor (FS) – Backup path to a destination
Advertised Distance (AD) – Compsite metric learned from neighbor
Local Distance (LD) – Composite metric to reach local neighbor
Feasibility Condition (FC) – Criteria for valid backup paths

DUAL Path Selection

Once adjacency occurs and update messages are exchanged, path selection begins
Each update includes the metric the upstream router uses to reach the destination (AD)
Local router knows the metric to reach each upstream router (LD)
Best path (successor) is chosen based on lowest AD + LD
Once best path is determined, additional paths are examined for backup routes:
- Feasibility Condition (FC) finds loop-free backup routes via logic.
  - If AD < FD, path is loop-free and a viable backup
  - eg: If your metric is lower than mine, you are closer to the destination, and loop-free
- Paths that mean the FC are Feasible Successors (FS)
- Only Feasible Successors can be used for unequal cost load balancing

Composite Metric Calculation in Detail

Inverse lowest bandwidth along path in Kbps scaled by 10^7 * 256
- Bandwidth looks at the bottleneck, or the lowest bandwidth value along a given path as that is the limiting factor
Cumulative delay along path in tens of microsends scaled by 256
Worst load along path (out of 255)
Worst reliability along path (out of 255)
Composite metric is computed as:
- metric = [k1 * bandwidth + (k2 * bandwidth)/(256 – load) + k3 * delay]
- If k5 != 0, metric * [k5/(reliability + k4)]
K values allow for manual administrative weighting
Default values are K1 = 1,K2 = 0,K3 = 1,K4 = 0,K5 = 0
- Implies default composite is bandwidth + delay
- Reliability and load typically not used since they are constantly changing

Implementing Basic EIGRP

InitializeEIGRP process
- router eigrp [asn]
EnableEIGRP on links
- network [network] [wildcard mask]
Network statement does not control what is advertised, it controls what interfaces run the protocol

Verifying Basic EIGRP

Show EIGRP metric weightings (K values)
- show ip protocols
Verify EIGRP interfaces
- show ip eigrp interfaces
Verify EIGRP neighbors
- show ip eigrp neighbors
Verify EIGRP topology
- show ip eigrp topology
- show ip eigrp topology
  - Will show topology details for a specific network
- show ip eigrp topology all-links
  - Will show all paths, including those not used (excluded from feasibility condition)
Verify EIGRP routes in routing table
- show ip route [eigrp]
See exchange of EIGRP messages
- debug eigrp packet
See all messages
- debug ip packet detail
- Multicast traffic to 224.0.0.10 with IP Protocol 88 indicated EIGRP traffic

—(INE 24)—

For backwards compatibility,EIGRP automatically summarizes routes
- no auto-summary (recommended)
EIGRP supports default routing in two ways
- Candidate default network
  - ip default-network [network]
- Native advertisement of 0.0.0.0/0 prefix
  - ip route 0.0.0.0 0.0.0.0 [next-hop]
- default-information command in EIGRP does not behave the same as other protocols
- Typical configuration would be to have a default static route on your edge (to the ISP) and advertise that to the internal network with redistribution
- Default network must be…
  - Dynamically learned through EIGRP
  - No directly connected
  - Classful network
EIGRP Summarization
- EIGRPsummarization serves two purposes
  - Minimize routing information needed in topology
  - Limit EIGRP query domain
- Process level auto-summary automatically summarizes to classful boundary when passing major network boundaries
- Summarize:
  - 10.1.4.0/24 (00000100)
  - 10.1.5.0/24 (00000101)
  - 10.1.6.0/24 (00000110)
  - 10.1.7.0/24 (00000111)
  - Could use 10.1.0.0/16 but this includes too many other subnets that aren’t part of the aggregate
  - Write out in binary and look for the match, in this case 10.1.4.0/22
- Interface level
  - ip summary-address eigrp [ASN] [network] [mask]
  - ip summary-address eigrp 1 10.1.4.0 255.255.252.0
DMVPN – an example of reducing the Query domain
- Mesh IPSEC tunnels using GRE
- Connect branch sites over the internet
- Hub and spoke topology
- Spoke routers advertise LAN segments, using EIGRP
- If a spoke LAN interface goes down, Query goes out to Hub, and then out to all spokes
- Causes adjacencies to reset and could bring down the network
- To resolve – spoke routers send only a summary
- Now when query goes to hub, a reply is sent back
EIGRP Stub and Query Reduction
- Stubs used to inform adjacent neighbors that QUERY messages should not be sent to them
- Generally used on spoke routers, or routers with only LAN segments behind them
  - router eigrp 1
  - eigrp stub
“Optimal Routing Design” – Russ White (added to reading list)
EIGRP Authentication
- Any end host can start listening to 224.0.0.10
- Configure Key ID and password – combined to form MD5 hash (lol md5)
- Multiple keys can be configured for manual or automated key rotation
  - key-chain accept & send lifetime
  - Start sending new keys before retiring old keys in order to prevent problems with switching keys
  - NTP to synchronize clocks
  - Create key chain, keys, and key-strings
    - key chain [name]
    - key #
    - key-string [password]
  - Enable authentication on the interface facing the neighbor
    - ip authentication mode eigrp 1 md5
    - ip authentication key-chain eigrp 1 [key chain]
  - Pro Tip – You can use “show key chain” to decrypt type 7 passwords (service password-encryption)
    - 52:30 of INE video 24

—(INE 25)—

OSPF

Open standards based IGP
- RFC 2328 “OSPF Version 2”
Link-State Protocol
- Uses Dijkstra SPF algorithm
“Classless” protocol
- Supports VLSM and Summarization
Attempts to build an overall “picture” of the links in a network
Guarantees Loop-Free Topology
- All routers agree on overall topology
Standards-based
- Inter-operability between vendors
Large scalability
- Hierarchy through “areas”
Fast convergence
- Actively tracks neighbor adjacencies
- Event driven incremental updates
Efficient updating
- Uses reliable multicast and unicast updates
- Non-OSPF devices do not need to process updates
- IP protocol 89
- Multicast address 224.0.0.5 and 224.0.0.6
Bandwidth based cost metric
- More flexible than static hop count
Control Plane Security
- Supports clear-text and MD5 based authentication
Extensible
- Future application support through “opaque” LSA
  - eg: MPLS traffic engineering

Distance Vector Routing Review

RIPv1/v2 & IGRP
Bellman-Ford based algorithm
Routers only know what directly connected neighbors tell them
- “Routing by rumor”
Entire routing table periodically advertised on a hop-by-hop basis
- Limits scalability
Loop prevention and convergence time limitations
- Split horizon, poison reverse, holddown timers

Link State Routing Review

OSPF & IS-IS
UseDijkstra Shortest Path First (SPF) based algorithm
- Guarantees loop-free calculation
Attributes of connected links (link-states) are advertised, not routes
- Routers agree on overall picture of topology before making a decision (map of the network)
Form adjacency relationship with connected neighbors
Exchange link atributes in form of Link State Advertisements (LSAs)/Link State Packets (LSPs) with neighbors
Store copy of all LSAs in Link State Database (LSDB) to form a “graph” of the network
Run Dijkstra algorithm to find shortest path to all links
Since all routers have same LSDB, all SPF calculations are loop-free

How OSPF Works

Step 1 -Discover OSPF Neighbors & Exchange Topology Information
- Uses “hello” packets to discoverneighborsonOSPF enabled attached links
  - Transport via IP protocol 89
  - Sent as multicast to 224.0.0.5 or 224.0.0.6, or unicast
- Hello packets contain attributes that neighbors must agree on to form adjacency
- Once adjacency is negotiated, LSDB is is exchanged
- OSPF adjacency occurs when connected neighbors use hello packets to agree on unique and common attributes
- Not all OSPF neighbors actually form adjacency
- Most OSPF configuration problems happen at this stage
- Unique attributes include:
  - Local Router-ID
  - Local Interface IP Address
- Common attributes include:
  - Interface Area-ID
  - Hello interval and dead interval
  - Interface network address
  - Interface MTU
  - Network Type
  - Authentication
  - Stub Flags
  - Other optional capabilities (NSF as an example)
Step 2 – Choose Best Path via SPF
Step 3 – Neighbor and Topology Table Maintenance

OSPF Hello Packets

OSPF routers periodically send hello packets out OSPF enabled links every hello interval
Hello packet contains
- Local Router-ID
- Local Area-ID
- Local Interface Subnet Mask
- Local Interface Priority
- Hello Interval
- Dead Interval
- Authentication Type and Password
- DR/BDR Addresses
- Options (eg. Stub Flags, etc.)
- Router IDs of other neighbors on the link

OSPF Adjacency State Machine

OSPFadjacency process uses 8 states to determineprogressofadjacency establishment
- Down
  - No hellos have been received from neighbor
- Attempt
  - Unicast hello packet has been sent to neighbor, but no hello has been received back
  - Only sued for manually configured NBMA neighbors
- Init
  - I have received a hello packet from a neighbor, but they have not acknowledged a hello from me
- 2-Way
  - I have received a hello packet from a neighbor and they have acknowledged a hello from me
  - Indicated by my Router-ID in neighbor’s hello packet
- ExStart
  - First step of actual adjacency
  - Master & slave relationship formed, where master has higher Router-ID
  - Master chooses the starting sequence number for the Database Descriptor (DBD) packets that are used for actual LSA exchange
- Exchange
  - Local link state database is sent through DBD packets
  - DBD sequence number is used for reliable acknowledgement/retransmission
- Loading
  - Link State Request packets are sent to ask for more information about a particular LSA
- Full
  - Neighbors are fully adjacent and databases are synchronized

—(INE 26)—

Step 2 – OSPF SPF Calculation
- Once databases are synchronized, path selection begins
- Each router’s LSA’s include a “cost” attribute for each described link
- Beth path to that link is lowest end-to-end cost
- Cisco’s implementation uses bandwidth but per the RFCis is arbitrary
  - Default Cisco Cost = 100mbps/link bandwidth
  - Reference bandwidth can be modified to accommodate higher speed links (eg: GigE)
Why SPF is needed
- With distance vector routing, you only know your neighbor’s best path
- With link-state routung, you know all paths, including your neighbor’s unused paths
- Dijkstra’s SPF algorithm ensures that all routers agree on the same routing path, even though they make independent decisions
- Result of SPF is called the Shortest Path Tree (SPT)
To find theSPT, SPF uses three internal data sets:
- Link State Database
  - All paths discovered from all neighbors
- Candidate Database
  - Links possible to be in the Shortest Path Tree
- Tree Database
  - Actual SPT once calculation is complete
Entries in the Candidate and Tree databases describe individual branches of the tree between two nodes
- Denoted as (Router ID, Neighbor ID, Cost)
  - eg: the branch between R1 and R2 with a cost of 10 is denoted as (R1,R2,10)
- R1’s ultimate goal is to build a tree with entries to every node in the topology (R1,Rn,cost)
  - ie: calculate the shortest path from R1 to everywhere
SPF Calculation Logic
- Step 1 – Start by setting the local router as the “root” of the SPT, witha cost of zero to itself
- Step 2 – Find the links to all local neighbors and add them to the Candidate database
- Step 3 – Take the lowest cost branch from the Candidate database and move it to the Tree database
- Step 4 – For the branch just moved to the Tree database do the following:
  - Find the remote node’s links connecting to other neighbors
  - Move all these links to the Candidate database, with the exception of any links that go to a neighbor already in the Tree database
- Step 5 – If the Candidate database is not empty, go to Step 3, otherwise SPF is complete and the Tree database contains the SPT

Step 3 – Neighbor & Topology Maintenance
- Once adjacencies established and SPT built, OSPF state machine tracks neighbor and topology changes
- Hello packets used to track neighbor changes
- LSA fields used to track topology changes
Hello packets continue to be sent on each OSPF enabled link every hello interval
- 10 or 30 seconds by default depending on interface type
If a hello packet is not received from a neighbor within the dead interval, that neighbor is declared down
- Defaults to 4 times hello interval
- Can be as low as 1 second for fast convergence
When an new LSA is received it is checked against the database for changes such as:
- Sequence number
  - Used to track new vs. old LSAs
- Age
  - Used to keep information new and withdraw old information
  - Periodic flooding occurs after 30 minutes
    - “paranoid” update
  - LSAs that reach maxage (60 minutes) are withdrawn
- Checksum
  - Used to avoid transmission & memory corruption
LSA Flooding
- When a change is detected new LSA is generated and flooded out all links
  - OSPF does not use split horizon
- Not all LSA changes require SPF to recalculate
  - eg: link up/down event vs. sequence number change
  - See RFC 2328 “13. The Flooding Procedure” for details

—(INE 27)—

OSPF Media Dependencies
- Unlike EIGRP, OSPF behaviour changes depending on what type of media it is configured on
  - ie: Ethernet vs. Frame Relay vs. PPP
- OSPF defines different “network types” to deal with different media characteristics
- OSPF network types control
  - How updates are sent
  - Who forms adjacencies
  - How next-hop is handled
- OSPF Network Types
  - Broadcast (Ethernet)
  - Non-broadcast (F/R, ATM)
  - Point-to-point (PPP/HDLC)
  - Point-to-multipoint (VPLS, DMVPN)
  - Point-to-multipoint Non-Broadcast (see above)
  - Loopback (for testing)

OSPF Network Broadcast
- ip ospf network broadcast
- Default on multi-access broadcast medias
  - Ethernet
  - Token Ring
  - FDDI
- Sends hellos and updates as multicast
  - 224.0.0.5 (AllSPFRouters)
  - 224.0.0.6 (AllDRouters)
- Performs Designated Router (DR) and Backup Designation Router (DBR) Election
DR/BDR Overview
- Designation Router (DR)
  - Used in broadcast links to
    - Minimize adjacencies
    - Minimize LSA replication
- Backup Designation Router (BDR)
  - Used for redundancy of DR
- DROthers
  - All other routers on the link
  - Form full adjacency with DR and BDR
  - Stop at 2-Way adjacency with each other
- DR/BDR chosen through election process
LSA Replication with DR/BDR
- DROthers send LSUs to DR/BDR via multicast 224.0.0.6
- DR forwards LSUs to DROthers via multicast 224.0.0.5
- Prevents constant forwarding of unneeded LSAs on the segment
- BDR does not forward LSUs, only waits for DR to fail
- DR must have full L2 connectivity
  - 224.0.0.5 is a link local multicast with a TTL=1
DR/BDR Election
- Priority
  - 0-255
  - Higher is better
  - 0 = never
- Router-ID
  - Highest loopback / interface IP
  - Can be statically set
  - Higher is better
- No preemption unlike IS-IS’s DIS

OSPF Network Non-Broadcast
- ip ospf network non-broadcast
- Default on multipoint NBMA medias
  - Frame Relay / ATM
- Sends hellos as unicast
  - Manually defined addresses with neighbor command
- Performs DR/BDR Election
- Originally designed for legacy networks that didn’t support broadcast transmission
  - ie: X.25

OSPF Network Point-to-Point
- ip ospf network point-to-point
- Default on point-to-point medias
  - HDLC/PPP
- Sends hellos as multicast
  - 224.0.0.5
- No DR/BDR Election
- Supports only two neighbors on the link

OSPF Network Point-to-Multipoint
- ip ospf network point-to-multipoint
- Treats network as a collection of point-to-point links
- Sends hellos as multicast
  - 224.0.0.5
- No DR/BDR Election
- Special next-hop processing
- Usually best design option for partial mesh NBMA networks

OSPF Point-to-Multipoint Non-Broadcast
- ip ospf network point-to-multipoint non-broadcast
- Same as point-to-multipoint but sends hellos as unicast
- Sends hellos as unicast
  - Manually defined addresses with neighbor command
- No DR/BDR Election
- Special next-hop processing

OSPF Network Loopback
- Special case for Loopback and Looped-back interfaces
- Advertises link as /32 stub host route
- ip ospf network point-to-point used to disable this behaviour

—(INE 28)—

Single Area OSPF Implementation

Implementing Basic OSPF

Enable the OSPF process
- router ospf [process-id]
  - Process-id locally significant
  - Must be an up/up interface running IP to choose Router-ID from
- Enable the interface process
  - Process level
    - network [address] [wildcard] area [area-id]
  - Interface level
    - ip ospf [process-id] area [area-id]
- Like EIGRP, enables OSPF on the interface
- Wildacard mask does not relate to subnet mask
- Most specific match wins
  - network 0.0.0.0 255.255.255.255 area 0
  - network 1.0.0.0 0.255.255.255 area 1
  - network 1.2.0.0 0.0.255.255 area 2
  - network 1.2.3.0 0.0.0.255 area 3
  - network 1.2.3.4 0.0.0.0 area 4
- Source of common confusion, new versions support interface level enabling as alternative

Verifying Basic OSPF

Verify OSPF interfaces
- show ip ospf interface
Verify OSPF neighbors
- show ip ospf neighbors
Verify OSPF topology
- show up ospf database
Verify OSPF routes in routing table
- show ip route [ospf]

Configuring Basic OSPF

router ospf 1
network [network] [wildcard] area [area-id]
debug IP packet detail
- shows broadcast messages to 224.0.0.5 using ip protocol 89 (ospf hellos)
debug ip ospf adj
- shows adjacency events
show ip ospf neighbors
show ip ospf database

—(INE 29)—

OSPF Areas and LSA Types

OSPF areas add hierarchy and scalability to the routing domain
An area defined a flooding domain
- All devices in the area agree on the topology
- Changes inside the area require LSA flooding and full SPF
Routing between areas hides topology details
- Inter-area routing similar to distance vector
- Changes outside the area don’t always require LSA flooding or SPF
- Limits impact on router resources

OSPF Area Types

Backbone area
- Area 0 (0.0.0.0)
- Used to summarize topology information between other areas
- Traffic from one area to another must pass through area 0
  - Every non-0 area must somehow have a connection to area 0
- Must be contiguous
Non-transit areas
- All other areas 1-2^32 (0.0.0.1 – 255.255.255.255)

OSPF Router Types

Backbone router
- At least one link in area 0
Internal routers
- All links in one non-transit area
Area Border Router (ABR)
- At least one link in area 0 and one link in a non-transit area
- Used to summarize information between area 0 and non-transit area
  - Topology summarization, different from route summarization
Autonomous System Border Router (ASBR)
- At least one link in the OSPF domain
- At least one link outside the OSPF domain
  - EIGRP, IS-IS, BGP, etc.
- Used to redistribute information to/from other routing domains and OSPF

Area 0 Continuity

All inter-area traffic must pass through area 0
If a non-transit area loses connectivity to area 0, all inter-area connectivity is lost
- This state is called “discontiguous” areas or discontiguous area 0
Repairs to these broken designs come in the form of virtual area 0 adjacencies called “virtual links”
OSPF Virtual Links
- Used to connect area 0 over a non-transit area
  - Virtual area 0 adjacency between two ABRs over a non-transit area
  - Provides continuity to the OSPF database calculation
- Non-transit area must have full routing information
  - Cannot be a stub area and should not have filtering
- Not a tunnel in the traditional sense
  - Traffic does not flow over the virtual link itself
- Configured under the routing process of the ABRs
  - area [transit area-id] virtual-link [remote ABR area-id]

OSPF LSA Types

With different router types in the OSPF domain, different types of advertisements are required
- DR, ABR, ASBR, etc.
Different LSA formats used to represent this information
- Format is defined by type code
- Type 1, Type 2, etc.
Which LSA types are sent and received depends on
- Router’s type
- OSPF network type (broadcast, P2P, etc.)
- Area type (Stub, NSSA, etc.)
LSA Types Are:
- Type 1 – Router LSA
- Type 2 – Network LSA
- Type 3 – Network Summary LSA
- Type 4 – ASBR Summary LSA
- Type 5 – External LSA
- Type 7 – NSA External LSA
Other types exist outside this scope
- Type 6 – Multicast LSA
  - Not implemeted by Cisco
- Types 8, 9 10 – Opaque LSA
  - Used for extensibility

Ine ccnp routing & switching video course download torrent free

Routed that LSAs describe can be grouped together as
- Intra-Area Routes (O)
  - LSA Types 1 & 2
- Inter-Area Routes (O IA)
  - LSA Types 3 & 4
- External Routes
  - E1/E2
    - LSA Type 5
  - N1/N2
    - LSA Type 7

LSA Types in Detail

Type 1 – Router LSA
- Generated by every router in the OSPF domain
- Not flooded outside the area they originate in
- Describes it’s directly connected links
  - What are my link costs
  - Who are my neighbors
- Used to build graph for intra-area SPF
- show ip ospf database router [Link ID]
Type 2 – Network LSA
- Generated by DR on broadcast and non-broadcast network types
- Not flooded outside the area they originate in
- Describes who is adjacent with DR
- Used to reduce redundant information in the database
  - n*(n-1)/2 and flooding scalability issue
- shop ip ospf database network [Link ID]
Type 3 – Network Summary LSA
- Generated by ABR
- Flooded from area 0 into non-transit area and vice-versa
- Describes ABR’s reachability to links in other areas
- For intra-area routing, OSPF can be considered link-state within an area, and distance-vector for inter-area routing as routers trust the cost provided by the ABR for an area they are not part of.
  - INE 29 – 29:00
- SPF not run to reach ABR advertised routers, instead logic is…
  - ABR can reach link A via SPT in cost X
  - I can reach ABR via SPT in cost Y
  - I can reach link A via SPT in cost X+Y
- This is why inter-area routing is considered distance vector
- show ip ospf database summary [Link ID]
Type 4 – ASBR Summary LSA
- Generated by ABR
- Flooded from area 0 into non-transit area and vice-versa
- Describes ABR’s reachability to ASBRs in other areas
- Includes cost, but hides ABR’s actual path to destination
- SPF not run to reach inter-area ASBR, instead logic is…
  - ABR can reach ASBR via SPT in cost X
  - I can reach ABR via SPT in cost Y
  - I can reach ASBR via SPT in cost X+Y
- This is why inter-area external routing is also considered distance vector
- show ip ospf database asbr-summary [Link ID]
Type 5 – External LSA
- Generated by ASBR
- Flooded to all non-stub areas
- Describes routes ASBR is redistributing
  - Metric
  - Metric Type
    - Type 1 = E1
    - Type 2 = E2 (default)
  - Forward Address
    - Who should I route towards to reach the link?
    - Usually the ASBR itself but could be someone else in some designs
  - Route Tag
- External Type 1 vs. Type 2
  - Type 1 (E1)
    - Take the cost the ASBR reports in plus the cost to the ASBR
  - Type 2 (E2)
    - Take just the cost the ASBR reports in
    - If there is a tie, then take the cost to the ASBR as well
  - Type 1 is usually used when there are multiple ASBRs redistributing the same routes to OSPF
- OSPF External Route Calculation
  - Perfoms like distance vector routing similar to inter-area calculation
  - Intra-area externals
    - ASBR can reach link A in cost X
    - I can reach ASBR via SPT in cost Y
    - I can reach link A via SPT in cost X+Y
  - Inter-area externals
    - ASBR can reach link A in cost X
    - ABR can reach ASBR via SPT in cost Y
    - I can reach ABR via SPT in cost Z
    - I can reach link A via SPT in cost X+Y+Z

—(INE 30)—

Multi-Area OSPF Implementation

No notes here, but watch this video again.
- I think my brain just exploded.

—(INE 31)—

OSPF Features

OSPF Virtual Link

Used to extend area 0 to a non-ABR
- router ospf [process-id]
- area [x] virtual-link [router-id]
Routes created by this process are set with the DoNotAge flag
Unicast adjacency, using a virtual interface (OSPF_VL0)

OSPF Scalability

Less topology info & less routing info means lower resource utilization
OSPF areas add scalability by hiding topology information, but they don’t hide reachability information
NLRI can be reduced in OSPF by implementing
- Summarization
  - OSPF supports two types of summaries
    - Internal summarization (Type 3 LSAs)
    - External summarization (Type 5 & 7 LSAs)
  - Unlike RIPv2, EIGRP and BGP, OSPF summarization (aggregation) cannot be performed at arbitrary places in the topology
    - Internal summarization only on ABRs
    - External summarization only on ASBRs
  - OSPF Internal Summarization
    - Configured only on ABRs
    - Takes intra-area (O) routes and summarizes them into inter-area (O IA) routes as they move between areas
    - area [area-id] range [network] [mask]
  - OSPF External Summarization
    - Configured only on ASBRs
    - Takes routes external to OSPF domain and summarized them as OSPF external routes (E1/E2/N1/N2) when redistributed
    - summary-address [network] [mask]
    - Automatically generates routes to Null0
- OSPF Stub areas
  - Summarization saves resources by taking multiple longer match prefixes and combining them into a smaller amount of shorter matches
    - eg: two routes 100.0.0.0/16 and 100.1.0.0/16 become oue route 100.0.0.0/15
  - Using the same logic, OSPF stub areas reduce NLRI by taking prefixes of the same LSA type and combing them into the shortest match possible, a default route
  - Stub areas use the common transit point of the OSPF topology, the ABR, to stop LSAs from entering the area
    - Type 3, Type 4, and/or Type 5 filtered depending on stub type
  - The reachability information removed is then replaces with a default route
    - Still allows reachability to removed routes (in most cases)
  - Four stub area types control which routes (LSAs) can enter the area
    - Stub Area
      - Stops external routes
    - Totally Stubby Area
      - Stops inter-area and external routes
    - Not-So-Stubby Area (NSSA)
      - Stops external routes but allows local redistribution
    - Not-So-Totally-Stubby Area
      - Stops inter-area and external routes, but allows local redistribution
    - All routers in the area must agree on the stub flag
  - Stub Area Logic
    - I know how to get to ABR
    - My ABR knows how to get to the ASBRs
    - The ASBRs know how to get to the external routes
    - If I default to the ABR, I don’t need the specific external routes
  - area [area-id] stub (on all routers in the area)
  - Result
    - ABR removes LSAs 4 (ASBR) and 5 (External)
    - ABR originates default route
  - Totally Stubby Area Logic
    - I know how to get to my ABR
    - My ABR knows how to get to other areas and to the ASBRs
    - The ASBRs know how to get to the external routes
    - If I default to the ABR, I don’t need the specific inter-area or external routes
  - area [area-id] stub (on the internal routers in the area)
  - area [area-id] stub no-summary (on the ABR(s) of the area)
  - Result
    - ABR removes LSAs 3 (Inter-Area), 4 (ASBR) and 5 (External)
  - Not-So-Stubby Area Logic
    - Stub areas block external routes from coming from other areas
    - What if I want to redistribute directly into the stub area itself?
    - Filter like a stub area, but make an exception for local redistribution
  - This exception requires the new Type 7 LSA (NSSA External)
  - area [area-id] nssa (on all routers in area)
  - Result
    - Redistributing router in NSSA generates Type 7 external instead of Type 5
    - ABR changes Type 7 into Type 5 as it is sent into area 0
    - ABR removes LSAs 4 (ASBR) and 5 (External) from coming into the area
    - ABR does not originate default route
  - no-summary option for Totally-Not-So-Stubby

—(INE 32)—