Routing Book W PDF

Packet Forwarding Process
A-PDF Watermark DEMO: Purchase from www.A-PDF.com to remove the watermark
1. PC Packet Forwarding
2. Frame Receiving (Layer 2 Checksum)
TC
3. De-encapsulation
4. Packet Header Checksum
5. Path Selection
6. Packet Switching
7. Encapsulation
8. Frame Transmission
KB
1. PC Packet Forwarding
1. PC compared Destination Address and it’ assigned address. (Binary AND Operation)
2. Not matching, PC send packet to default router.
3. PC need to know the L2 address of their default router so, it make ARP Request.
4. After getting default router L2 address, PC encapsulate frame with its mac address.
2. Frame Receiving (Layer 2 Checksum)

T C
1. Router receive frame with its L2 address, when frame arrived router do error checking to sure
no error in frame. (Accepting)
KB
 FCS fail (Discard Frame & no error recovery) (never asked resend)
 FCS success (De-encapsulate frame to view L3 contents)
○ In Router,
 Runt Frame & Giant Frames are also discard
 L2 address of its interface (Accept)
 Known L2 Multicast Address (Accept)
 Known L2 Broadcast Address (Accept) (Not Forward)
TC
 L2 address of others interface (Accept) (Not Forward)
3. De-encapsulation
1. Router de-encapsulate packet from frame to view L3 contents. (De-Encapsulation)

(Discard L2 Header and Tailor )
KB
Routing Book Page 1

4. Packet Header Checksum
1. Later Router perform Layer 3 Header Checksum Calculation.

(Header > Header Checksum)
TC
KB
5. Path Selection
C
1. Router view L3 Header and make path selection. (routing)
In Router,
1. Compare the IP packet’s destination IP address to the routing table, start
T
from longest mask.
 Router never check source ip address in packet if the
destination ip address is unicast.
KB
2. After best matches, selected route path identifies outgoing interface.

3. Router detect its Next-Hop Address.
TC
Path Selection Priority
1. Longest Mask Route Path (/30 vs /24 = /30 is prefer route path)
KB
2. AD Value (Lower AD Value Prefer)
3. Metric Value (Lower Metric Value Prefer)

 (Same Metric Value = Equal-Cost Load Balancing)
Routing Book Page 2

6. Packet Switching
1. Process Switching
2. Fast Switching
TC
3. CEF
7. Encapsulation
1. Router encapsulate packet in a New Frame (Frame Rewrite)
KB
Composed frame type can be different.
 In Serial, PPP or HDLC frame create.
 In Ethernet,
 Encapsulate the IP packet inside a new data-link header and tailer.
 L2 Destination Address become Next-Hop L2 Address via ARP or
Proxy ARP.
 L2 Source Address become router’ outgoing interface.
 CRC / Checksum re-calculated value.
 Fragmentation
C
 Each output port on a network device has an associated maximum transmission
T
unit (MTU).
 MTU indicates the largest frame size (measured in bytes) that can be carried on
KB
the interface.
 The MTU is in use, such as Ethernet, Token Ring, or Point-to-Point Protocol
(PPP). PPP is used with Internet connections.
 Over frame is fragmented into smaller pieces for transmission.
 Hosts and routers can learn the maximum MTU available along a network path
through the use of MTU discovery.
 Encryption
TC
 Tunneling (IP tunnels, GRE, etc..)
8. Transmitting the Frame
○ After the frame has been prepared, the router check again packet header before transmit
the frame.
KB
○ The router might have to wait, particularly if other frames are already waiting their turn to
exit the interface. (Queuing)
Routing Book Page 3

Understanding Packet-Switching Modes (Routers and Multilayer Switches)
• Cisco routers and multilayer switches support the following three primary modes of packet
switching:
TC
1. Process switching
2. Fast switching (route caching)
3. Cisco Express Forwarding (topology-based switching)
1. Process Switching
○ The router examines the L3 address, and decides how to forward the packet. Every packets
KB
must be process.
T
2. Fast Switching (Route Caching)
C
○ Fast switching uses a fast cache maintained in a router’s data plane.
KB
○ The fast cache contains information about how traffic from different data flows should be
forwarded.
○ First packet in a data flow is process-switched by a router’s CPU, after the router determines
how to forward the first packet of a data flow, that forwarding information is stored in the
fast cache.
○ Subsequent packets in that same data flow are forwarded based on information in the fast
cache
TC
KB
Routing Book Page 4

3. Cisco Express Forwarding (Topology-Based Switching)
○ Cisco Express Forwarding (CEF) maintains two tables in the data plane.
TC
1. Forwarding Information Base (FIB) maintains Layer 3 forwarding information
2. Adjacency Table maintains Layer 2 information for next hops listed in the FIB
KB
efficiently make forwarding decisions.
T C
○ Using these tables, populated from a router’s IP routing table and ARP cache, CEF can
○ Unlike fast switching, CEF does not require the first packet of a data flow to be process-
switched.
KB
Verifying CEF State on Device
Router #show ip cef
%CEF not running (CEF Disabled)
Prefix Next Hop Interface (CEF Enabled)

TC
0.0.0.0/32 receive
192.168.0.0/30 attached Serial2/0/0:1
Confirm that CEF is enabled on a particular interface.
Router#show cef interface fastEthernet 0/0/0

Router#show ip interface fastEthernet 0/0/0
KB
IP Distributed CEF switching enabled (CEF Enabled)
No CEF (CEF Disabled)
Routing Book Page 5

Enabling CEF
Router (config)# ip cef (Global CEF Enabled)
TC
Router (config)# no ip cef (Global CEF Disabled)
Router (config-if)# ip route-cache cef (Specific Interface CEF Enabled)
Router (config-if)# no ip route-cache cef (Specific Interface CEF Disabled)
KB
Viewing CEF Table
Router # show ip cef
Prefix Next Hop Interface

0.0.0.0/32 receive
192.168.0.0/30 attached Serial2/0/0:1
192.168.0.0/32 T receive
C
KB
TC
KB
Routing Book Page 6

Verifying Fast Switching
Router # show ip cache
TC
Enabling Route Cache
Router(config)# ip route-cache
Router(config)# no ip route-cache
KB
Router(config-if)# ip route-cache
Router(config-if)# no ip route-cache
 Disabling route-cache also disabled CEF.
Viewing Route Cache
Router# show ip cache
Router# clear ip cache

T C
(Clearing Route Cache Entries)
KB
TC
KB
Routing Book Page 7

Verifying Process Switching & Route-Cache / CEF
• Determine the number of packets and bytes that the router forwarded through "Processor"
instead of "Route cache".
TC
• "Route cache" includes both fast-switched and CEF-switched packets.
Router# show interface stats
FastEthernet0/0
KB
Switching path Pkts In Chars In Pkts Out Chars Out
Processor 95084 26211621 33493 3386174
Route cache 24581 1132797 24542 13297583
Distributed cache 0 0 0 0
Total 119665 27344418 58035 16683757
Viewing Routing Table

T C
KB
TC
KB
• L means router interface current assigned IP Address. (/32)
• C means directly connected network, appeared after assigned IP Address to router interface.
Routing Book Page 8

Viewing Route for Specific Network
TC
Viewing ARP Table
KB
• When forwarding a packet to a host on the same subnet, the router encapsulates the packet, with
a destination MAC address as found in the ARP table.
Router# show ip arp
Router# show arp
Router# clear arp-cache (Deletes all dynamic entries from the ARP cache)
T C
• Router own IP Address are arp entries aging time of 'Never Timeout’.
>> An age of " - " meaning that this entry does not time out.
KB
TC
• Dynamically learned ARP table entries have an upward counter, like the 35-minute value.
• IOS will timeout (remove) an ARP table entry after 240 minutes in which the entry is not used.
• IOS resets the timer to 0 when an ARP table entry is used.

KB
>> To empty all dynamic entries (clear ip arp *)
>> To empty specific entry (clear ip arp <ip address>)
Routing Book Page 9

Types of Routing
1. Static Routing
2. Dynamic Routing
TC
Static Routes
• Manual Added Route Paths are called "Static Routes".
• "Static Routes" are called (network routes) or (subnet routes) because the command defines a
route to an IP network or subnet.
KB
Static Route Uses Environments
○ Small Network Environment
○ Extra / Backup Routes
○ Point to Point / Multipoint
○ Hub & Spoke Network
• Viewing Static Routes Only
Router# show ip route static
• Static Route Types

1. Static Route with Next-Hop Address
T C
2. Static Route with Exit Interface (Egress Interface)
KB
(ip route "DestinationNetworkIP" "SubnetMask" "Next-hopAddress")
(ip route 192.168.1.0 255.255.255.0 10.0.0.254)
(ip route "DestinationNetworkIP" "SubnetMask" "exit-Interface")
(ip route 192.168.1.0 255.255.255.0 fa0/1)

TC
Static Route with Next-Hop Address

KB
Routing Book Page 10

Static Route with Exit Interface (Egress Interface)
TC
KB
Null Routes (Black Hole Routes)
hole.
T C
• A black hole route is used to forward unwanted or undesirable traffic into a black hole.
• In Cisco terminology, a special logical interface, called a null interface, is used to create the black
• Static routes configuration points to the null interface.

• Any traffic that has a destination address that has a best match of the black hole static route
automatically is dropped.
KB
• Unlike with ACLs, all switching processes of the Cisco IOS, including CEF, can handle black hole
routes without any performance degradation.
Router(config)# ip route "DestinationNetwork" "SubnetMask" null0

Router(config)# ip route 10.0.0.0 255.255.255.0 null0
No ip unreachables
TC
• When using the null0 interface for black hole routing, router still reply ICMP unreachable
messages to sender.
• To prevent router from sending ICMP unreachable messages to the sender of the packet,
Router(config)# interface null0

KB
Router(config-if)# no ip unreachables

Routing Protocol vs. Routed Protocol
IP, IPX, (Routed Protocol)

RIP, EIGRP, OSPF, IS-IS, BGP (Routing Protocol)
TC
Dynamic Routing Process
KB
Dynamic Routing Protocols and Timeline
T C
KB
TC
KB

Dynamic Routing Protocols Timeline
○ ကမာၻမွာ ယေန႔အခ်ိန္ထိ ထြက္ခဲ့တဲ့ အသံုးျပဳခဲ့တဲ့ Dynamic Routing Protocols ေတြသည္
TC
 EGP (1982)
 IGRP (1985)
 RIPv1 (1988)
 IS-IS (1990)
 OSPFv2 (1991)
 EIGRP (1992)
KB
 RIPv2 (1994)
 BGP (1995)
 RIPng (1997)
 BGPv6 & OSPFv3 (1999)
 IS-ISv6 (2000)
Autonomous System (AS)
T C
KB
○ Public IP Address ျဖန္႔ေဝတဲ့ Cover Area အလိုက္ နိဳင္ငံတစ္နိဳင္ငံရဲ့ Internet Service Provider တစ္ခုစီကို
သက္ဆိုင္ရာ Region အလိုက္ IANA ရဲ့ Group (APNIC.net) ေတြက Autonomous System Number (AS
TC
Number) တစ္ခုစီ သတ္မွတ္ေပးတယ္။
○ Internet Service Provider တစ္ခုရဲ့ AS Number ကိုသိရင္ ၄င္း Service Provider ရဲ့ Contact Detail အခ်
က္အလက္ေတြကို ယူၾကည့္နိဳင္တယ္။
○ AS Number ေတြသည္ AS xxxxx Form ပဲျဖစ္တယ္။ Number တစ္ခုသည္ ေရွ႔မွာ AS ပါျပီဆိုရင္ ၄င္းသည္
AS Number ျဖစ္တယ္။
KB
 16-bits AS (65536)
 32-bits AS (4.3 Billions)

Looking Service Provider AS Number
○ Linux / MAC မွာဆိုရင္ Internet ခ်ိတ္ထားျပီး MAC ရဲ့ Terminal မွာ
TC
(whois -A "ASNumber")
(whois -A AS18399) ရိုက္ထည့္လိုက္တာနဲ႔ Service Provider ရဲ့ Information ျပေပးတယ္။
○ Windows မွာေတာ့ Windows Command Prompt မွာ Microsoft သည္ Default ထည့္မေပးထားဘူး။
သက္သက္ Download ဆြဲျပီးမွ အသံုးျပဳနိဳင္တာျဖစ္တယ္။
KB
https://technet.microsoft.com/en-us/sysinternals/bb897435
 Whois Folder ထဲမွာ Command Prompt နဲ႔ဝင္သံုးရတာျဖစ္တယ္။
AS Links
T C
○ Internet ၾကီးသည္ Service Provider (AS Number) ရွိတဲ့ Sites ေတြအခ်င္းခ်င္းခ်ိတ္ဆက္ထားတဲ့ Network
ၾကီးျဖစ္တယ္။
○ မိမိလက္ရွိသံုးေနတဲ့ Service Provider Name နဲ႔ Service Provider AS Number တို႔ကိုၾကည့္ခ်င္ရင္ ဒါမွမဟု
တ္
မိမိရွာလိုတဲ့ AS သည္ Internet ၾကီးနဲ႔ခ်ိတ္ဆက္နိဳင္ဖို႔ ဘယ္ Service Providers (ASs) ေတြနဲ႔ခ်ိတ္ထားလဲသိ
KB
ခ်င္ရင္
(http://bgp.he.net/) Website ထဲကိုသြား ၄င္း Website ထဲမွာ AS Number ရိုက္ထည့္။ "Graph V4"
Tab ထဲမွာၾကည့္။ ဒါဆိုရင္ မိမိ AS နဲ႔ အျခား ASs ေတြနဲ႔ ခ်ိတ္ဆက္ထားပံုအေသးစိတ္ကိုေတြ႔ရလိမ့္မယ္။
TC
KB

What is Peering ?
○ သေဘာတူညီခ်က္ယူျပီးအျပန္အလွန္ခ်ိတ္ဆက္ထားတဲ့ Networks နွစ္ခုကို Peering လို႔ေခၚတယ္။ ေငြလဲမယူ

ဘူး။
TC
○ (တစ္ခုနဲ႔တစ္ခု Network ခ်ိတ္ဆက္ထားတာကို Peering လုပ္ထားတယ္လို႔ေခၚနိဳင္တယ္။
○ Computer တစ္လံုးနဲတစ္လံုးခ်ိတ္ဆက္ျခင္းကို Peering လုပ္တယ္လို႔ေျပာလို႔ရတယ္။
○ Network တစ္ခုနဲ႔တစ္ခုခ်ိတ္ဆက္ျခင္းသည္လည္း Peering ျဖစ္တယ္။)
○ AS တစ္ခုနဲ႔တစ္ခု ခ်ိတ္ဆက္ထားတာသည္လည္း Peering ျဖစ္တယ္။
○ Company တစ္ခုသည္ AS တစ္ခုျဖစ္ပါက ၄င္း Company ရဲ့ AS Number ကိုသိခ်င္ရင္ Company Website ရဲ့
ေနာက္မွာ /peering/ လို႔ထည့္ေပးလိုက္။ ဒါဆိုရင္ Standard အေနနဲ႔ Website Company ရဲ့ AS Number လာ
KB
ေပၚလိမ့္မယ္။
www.microsoft.com/peering/
IGP and EGP
ယ္။
1. Interior Gateway Protocols

T C
○ Routing Protocols သည္အသံုးျပဳတဲ့ေနရာေပၚမူတည္ျပီး (၂) မ်ိဳးရွိတယ္။ AS ေပၚမူတည္ျပီးလို႔လဲ ေျပာနိဳင္တ
2. Exterior Gateway Protocols

KB
TC
KB

Interior Gateway Protocols (IGPs)
 IGP (Interior Gateway Protocol) ေတြသံုး Routers ေတြသည္ AS တစ္ခုအတြင္းမွာပဲရွိတယ္။
TC
 Autonomous System (AS) တစ္ခုအတြင္းမွာရွိတဲ့ Routers ေတြအျပန္အလွန္ခ်ိတ္ဆက္နိဳင္ေအာင္ Routing
Information ေတြဖလွယ္ေပးတဲ့ Routing Protocols ေတြျဖစ္တယ္။
 AS Number တူတဲ့ Routers ေတြအခ်င္းခ်င္းပဲ Routing Information Exchange လုပ္တယ္။
 AS Number မတူရင္ Routers ေတြဟာ အခ်င္းခ်င္း Routing Information Exchange မလုပ္ဘူး။
KB
 ထိုသို႔ AS Number တစ္ခုအတြင္းမွာပဲ အလုပ္လုပ္ေနတဲ့ Routing Protocols ေတြကို IGPs ေတြလို႔ေခၚတယ္။
 Interior Gateway Protocols ေတြသည္ Distance Vector Routing Protocols ေတြ ဒါမွမဟုတ္ Link State
Routing Protocols ေတြျဖစ္တယ္။
 Interior Gateway Protocols ေတြသည္

 RIP
 RIPv2
 RIPng
 IGRP
 EIGRP
 EIGRP for IPv6
T C
 OSPFv2
KB
 OSPFv3
 IS-IS
 IS-IS for IPv6 တို႔ျဖစ္တယ္။
Exterior Gateway Protocols (EGPs)
 EGP (Exterior Gateway Protocol) ေတြကေတာ့ မတူညီတဲ့ AS ေတြတစ္ခုနဲ႔တစ္ခု Routing Information

TC
ေတြဖလွယ္ေပးတဲ့ Routing Protocols ေတြျဖစ္တယ္။
 EGP သည္ AS ေတြတစ္ခုနဲ႔တစ္ခုၾကားမွာ အလုပ္လုပ္တဲ့ Routing Protocol လို႔ေျပာလဲရတယ္။
 Exterior Gateway Protocols ေတြသည္

 BGPv4
 BGPv4 for IPv6 တို႔ျဖစ္တယ္။
KB

Convergence (Network Convergence Time)
TC
KB
Administrative Distance (AD)
• Believability of a Route (A Route Path)
C
• Administrative distance (AD) is a number of arbitrary unit assigned to dynamic routes, static
T
routes and directly-connected routes.
• The value is used by vendor-specific routers to rank routes from most preferred (low
KB
administrative distance value) to least preferred (high administrative distance value).
• When multiple paths to the same destination are available in its routing table, the router uses the
route with the lowest administrative distance.
• Router vendors typically design their routers to assign a default administrative distance to each
kind of route that is used, however, this value can usually be adjusted manually by a network
administrator.
TC
• AD Value = 0 to 255
0 (Best) Manual Assign Range (1 to 150)

255 (Worst)
KB
• An administrative distance of 255 will cause the router to remove the route from the routing table
and not use it.

TC
KB
T C
KB
TC
KB

AD Values
• Directly connected routes have an administrative distance of 0
TC
• Only the interface itself has an administrative distance of 0, since a route cannot have a
distance of less than 1.
• An administrative distance of 255 will cause the router to remove the route from the routing
table and not use it.
KB
• The administrative distance is a value that is always only referenced by the local router itself.
• The administrative distance is not advertised on the network.
• The administrator can arbitrarily reconfigure the administrative distances, which affects the
ranking of the preferred routes by the routing process.
C
Manual defined Administrative Distance in Static Route
R1>ip route 192.168.1.0 255.255.255.0 10.0.0.254 <ADValue>

T
R1>ip route 192.168.1.0 255.255.255.0 10.0.0.254 122
KB
Modify the administrative distance in Dynamic Routing Protocol
• The network administrator may modify the administrative distance to change the desired
ranking of router protocols.
• This may be necessary in cases where routing redistribution has to be used, otherwise,
TC
routing loops could occur.
R1> enable
R1# configure terminal
R1(config)# router rip
R1(config-router)# distance 89
KB

Routing Metric
• A routing metric is a unit calculated by a routing algorithm for selecting or rejecting a routing
path.
TC
• Metrics are used to determine whether one route should be chosen over another.
• Metrics are assigned to each different route available in the routing table and are calculated
using many different techniques and methods based on the routing algorithms in use.
• Some of the parameters used for calculating a routing metric are as follows:
 Hop count
KB
 Bandwidth
 Delay (Latency)
 Reliability
 Load
 Maximum transmission unit (MTU)
 Cost
Hop count
C
• Hop count is the number of routers (called number of hops) from source router through
destination network.
T
• The hop count refers to the number of intermediate network devices through which data must
KB
pass between source and destination.
• Known as Time To Live (TTL) in IPv4, and hop limit in IPv6, this field specifies a limit on the
number of hops a packet is allowed before being discarded.
• Each time a router receives a packet, it modifies the packet, decrementing the time to
live (TTL). The router discards any packets received with a zero TTL value.
TC
KB

Determining Path Hop Count
PC#tracert -d 192.168.0.1
TC
Router#traceroute 192.168.0.1
KB
Hop Value in RIP Route Paths
Router#sh ip route rip
T C
Bandwidth
KB
• Protocols that consider the capacity of a link.
• Bandwidth is measured in terms of bits per second. (bps)
• Links that support higher transfer rates like gigabit are preferred over lower capacity links like
56Kb. The path with the overall higher bandwidth is chosen as the best route.
TC
KB

Verifying Interface Bandwdith
Router#show interfaces fastethernet 0/0
TC
KB
Changing Bandwidth on Interface
• Bandwidth is a static value which can be changed by using the bandwidth command. Keep in
mind this doesn’t change the actual bandwidth of the interface!
C
• This command is ONLY used to influence routing protocols like EIGRP. It’s not like you can slow
down electric signals through a wire…if you want to limit the traffic on an interface you’ll need
QoS (Quality of Service).
T
Router(config)#interface fa0/0
Router(config-if)#bandwidth <Value in Kilobits>
KB
TC
KB

Delay (Latency)
• Delay represents the amount of time it takes for a router to process, queue, and transmit a
datagram out an interface.
TC
• Delay is measured in microseconds (the symbol μs is used to indicate this).
○ A microsecond is an unit of time equal to one millionth (0.000001 second or 10−6 or 1⁄
1,000,000) of a second. 1 μs means 10 p (-6) second.
• Router uses delay value from Interface Bandwidth. Physical Interface Bandwidth Only. (Delay not
changes for changing bandwidth value of Interface)
• Cisco have default delay values for the different types of interfaces. Cisco IOS default delay
KB
value :
Interface Bandwidth (kbps) Delay (microseconds)
Serial 1544 kbps 20,000 μs
Ten Gigabit Ethernet 10,000,000 kbps 10 μs
Gigabit Ethernet 1,000,000 kbps 10 μs
Fast Ethernet 100,000 kbps 100 μs
Ethernet
T 10,000
C kbps 1000 μs
KB
Cumulative Delay
• Protocols that use this metric must determine the delay values for all links along the path end to
end, considering the path with the lowest (cumulative) delay to be a better route.
Verifying Interface Delay Value

TC
Router#show interfaces fastethernet 0/0

KB

Configuring Delay Value
• Delay can be configured manually on exit interface. For path delay value, value must be
modify in every routers exit interfaces.
TC
• IOS take delay value as tens of microseconds,
 Manual Configured Delay Value = 50

 IOS take Delay Value = 500 μs
KB
• If you use the delay command you can change this value to influence routing protocols like
EIGRP. It doesn’t actually change the delay for this interface but it is only used to influence
routing protocols.
T C
KB
Reliability
• Although this metric may be configured as a fixed value by an administrator, it is generally

measured dynamically over a specific time frame, such as five minutes.
• Routers observe attached links, reporting problems , such as link failures, interface errors, lost
TC
datagrams and so on.
• Links experiencing more problems would be considered less reliable than others making them
less desirable paths—the higher the reliability the better the path. Because network conditions
are constantly changing, link reliability will change.
KB
• This value is generally measured as a percentage of 255, with 255 being the most reliable and
1 being least reliable. Reliability at 255/255 is 100%.

Verifying Interface Reliability
Reliability is calculated via:
TC
Reliability = number of packets / number of total frames.
 The value of 255 is the highest value meaning that the interface is very reliable at
the moment.
 The calculation above is done every 5 minutes.
KB
 255/255 is 100% Reliability
Load
T C
Load is a variable value, generally measured over a five-minutes indicating the traffic load over a
specific link.
KB
Load measures the amount of traffic occupying the link over this time frame as a percentage of
the link's total capacity.
The value 255 is equivalent to 100% utilization or load—the higher the value the higher the
traffic load (bandwidth utilization) across this link. 1 is Best (No Load) 1/255
As traffic increases, this value increases. Values approaching 255 indicate congestion.
TC
There are two types of Load per interface, Txload 1/255 and Rxload 1/255.
This value may be manually configured as a static value by an administrator or it may be

dynamically tracked allowing it to adjust as traffic patterns within the network change.
KB
It is important to remember that as traffic increases load across a link will increase. This value
changes as traffic patterns change. Routing protocols using this value can recognize when a
path is becoming congested and use an alternate path during that time.

Routing Protocols and Load Value
• The upper path contains three links. The last two show a 128 load value, which represents 50%
bandwidth utilization.
TC
• The lower path has lower load values and is the preferred path.
(1 = best to 255 = Worst)
1/255 = 0.004 % (1 percent Loading)
KB
255/255 = 100 % Loading
T C
KB
Verifying Interface Load

TC
KB

MTU (Maximum Transmission Unit)
• The largest unit size allowed to be transmitted on all routes from source to destination.
TC
• MTU is the layer 3 MTU, which means the entire length of IPv4 or IPv6 packet.
• The value shown doesn't include the layer 2 overhead, such as the size of the Ethernet header
and trailer itself.
• Not used in metric calculation, but available to underlying protocols.
KB
Cost
T C
• Network administrators can affect the way routers make path decisions by setting arbitrary
metric values on links along the path end to end.
KB
• These arbitrary values are typically single integers with lower values indicating better paths.
• Router use the cost to decide which route is the best for a destination.
• In OSPF terminology, uses cost which is calculated from interface bandwidth.

TC
 Formula for OSPF cost calculation :
Interface Cost= Reference bandwidth/interface bandwidth

KB

Metrics Used by Routing Protocols
• Different routing protocols calculate their routing metrics from different parameters and with
different formulas.
TC
• Some use simple metrics (such as RIPv1 and RIPv2), and some use complex metrics (such as
EIGRP).
RIP Metric
KB
• RIP metric = Hop Count
• RIPv1 and RIPv2 use only the hop count to determine the best path (the path with the smallest
hop count is preferred).
• Because they do not consider bandwidth, RIPv1 and RIPv2 are not suitable for networks that
have significantly different transmission speeds on redundant paths.
EIGRP Metric
T C
• For networks that use diverse media on redundant paths, routing protocols must account for
bandwidth and possibly the delay of the links.
KB
• By default EIGRP uses the minimum bandwidth and accumulated delay of the path toward the
destination network in its metric calculation.
• Other parameters (reliability and load) can also be used, but they should be configured only if
the consequences are fully understood. If misconfigured, they might affect convergence and
cause routing loops.
TC
• On Cisco routers, the bandwidth and delay metrics can be manually configured and do not
necessarily reflect the link's true speed.
• These bandwidth and delay metrics should be changed only if the consequences are well
understood.
• For example, a bandwidth change might affect the QoS provided to data.
KB

EIGRP Bandwidth
• EIGRP used Leased Bandwidth of path. (Minimal bandwidth in the path).
TC
10 Mbps = 10,000 kbps = 10,000,000 bps = 107
100 Mbps = 100,000 kbps = 100,000,000 bps = 108
1 Gbps = 1,000 Mbps = 1,000,000 kbps = 1,000,000,000 bps = 109
KB
10 Gbps = 10,000 Mbps = 10,000,000 kbps = 10,000,000,000 bps = 1010
Bandwidth = 107 (kbps) / Minimal Bandwidth in Path (kbps)
EIGRP Bandwdith Formula = BW * 256
Bandwidth = { 107 (kbps) / 10,000 (kbps) } * 256

T C
Bandwidth = 100 * 256 = 25,600
 EIGRP know another router’ link bandwidth value via EIGRP Update Message.
KB
TC
• For Path 1, Bandwidth Value;
Bandwidth = { 10,000,000 / 50,000 kbps } * 256 = 200 * 256 = 51,200

KB
• For Path 2, Bandwidth Value;
Bandwidth = { 10,000,000 / 100,000 } * 256 = 100 * 256 = 25,600

EIGRP Delay
• EIGRP' Route Path uses Cumulative Delay. (Sum of All Exist Interfaces Delay Values)
TC
• 1 Router = 1 Delay Value,
If a route path (Source to Destination) has 4 routers, there were 4 delay values.
(including source router and destination router)
EIGRP Delay = (InterfaceShowDelayValue) / 10
KB
 / 10 = (Because of tens of microseconds)
EIGRP Cumulative Delay = R1 + R2 + R3 + R4 'InterfaceShowDelayValues / 10
T C
KB
• Path 2 (R1 to R4) Path Delay is;

TC
Delay = R1 Interface Delay + R5 ID + R6 ID + R7 ID + R4 ID / 10
Delay = 100 + 100 + 100 + 100 + 100 / 10
Delay = 500 / 10
Delay = 50
KB

EIGRP Delay Formula
Path 2 (R1 to R4) Path Delay,
TC
EIGRP Delay Formula = { Cumulative Delay / 10 } * 256
Delay = { R1 Interface Delay + R5 ID + R6 ID + R7 ID + R4 ID / 10 } * 256
Delay = { 100 + 100 + 100 + 100 + 100 / 10 } * 256

Delay = { 500 / 10 } * 256
KB
Delay = 50 * 256 = 12,800
T C
KB
TC
KB

EIGRP Metric Calculation
• EIGRP calculates the metric by adding weighted values of different link characteristics to a
destination network. The formula used is as follows:
TC
• The K values in the previous formulas are constants with default values of
KB
K1 = 1, K2 = 0, K3 = 1, K4=0, K5=0
• Therefore, by default, the formula is the following:
Metric = Bandwidth + Delay

T C
Metric = [ Bandwidth + Delay ] * 256
Metric = (BW * 256) + (C.Delay * 256)

KB
EIGRP Metric Example
Interface = 100 Mbps and Delay = 2

TC
KB

EIGRP Metric Calculation Example
TC
KB
OSPF Metric
T C
KB
• OSPF uses cost for path calculation, usually reflecting the link's bandwidth.
• As a result, the highest accumulated bandwidth (lowest cost) is used to select the best path.
• Uses a Reference Bandwidth of 100 Mbps for cost calculation.
OSPF Default RF Bandwidth 100 Mbps (100,000 Kbps) (100,000,000 bps)

TC
• The formula to calculate the cost is Reference Bandwidth divided by interface bandwidth.
Cost = Reference Bandwidth (bps) / Interface Bandwidth (bps)

KB
• To calculate, Ethernet Interface (10 Mbps) Cost;
Cost = 100,000,000 / 10,000,000

Cost = 10

Default OSPF Cost Values
TC
KB
OSPF End-To-End Metric
T C
KB
TC
KB

IS-IS Metric
• The IS-IS metric is known as the metric; the IS-IS specification defines four different types of
metrics.
TC
• All routers support Cost (the default metric), Delay, Expense, and Error are optional metrics.
• The default Cisco implementation of IS-IS uses Cost only, but the Cisco IOS does allow all four
metrics to be set with optional parameters in the isis metric command. The IS-IS interface
metric defaults to 10 on Cisco routers; this value can be changed.
KB
Default Metric: every interface has a default metric of 10.
Delay: similar to how EIGRP uses delay.
Expense: the actual monetary cost of a link.
Error: similar to how EIGRP uses reliability.
• By default, IS-IS uses narrow metrics which means the highest metric on an interface can be 63.
The total metric can be 1023.
• Wide metrics support a metric up to 16777214.

T C
KB
TC
KB

BGP Metric
• BGP uses the AS-path attribute as part of its metric.
TC
• The length of this attribute is the number of autonomous systems that must be traversed to
reach a destination and is usually a factor that influences the path selection.
• BGP incorporates additional path attributes that can influence routing decisions; these can be
manually configured.
KB
T C
Routing Protocols Types (Depending on Characteristics)
Distance Vector Routing Protocols (DVR)

KB
Link State Routing Protocols (LSR)

Hybrid Routing Protocols
Path-Vector Routing Protocols (PVR)
TC
KB

Differences between Distance Vector and Link State Routing Protocols
• The fundamental difference between distance vector and link state routing protocols is in the
nature of the routing information routers send to each other.
TC
Distance Vector
• In distance vector protocols, each router sends its neighbors a list of all known networks along
with its own distance to each one of these networks.
KB
• A list is also called a vector, the list of networks and distances is sometimes called the vector of
networks and distances, hence the name distance vector routing protocol.
• A router running a distance vector routing protocol only knows its directly connected
neighbors, and it knows about the lists of networks these neighbors have advertised, but it
does not really know where those networks really are.
Link State
T C
• Distance vector protocols were much easier to design and implement in software.
• In link state routing protocols, each router describes itself and its interfaces to its directly
KB
connected objects; these objects can be either neighboring adjacent routers, or they can be
directly attached networks.
• This information is passed unchanged from one router to another, so that in the end, every
router knows about every other router, its interfaces and what exactly they connect to.
• In essence, in link state routing protocols, each router knows the entire network topology
down to every single router and every single interconnection, also called the state of a link,
TC
hence the name link state routing protocol.
• Link state routing protocols allow a router to have a complete map of the network, and use
specific algorithms to find shortest paths to every object in the network, including destination
IP networks.
• Link state protocols are much more complex and require more processing power and memory,
KB
but as the resources in routers improved over time, link state routing protocols slowly took
over.

Distance-Vector Routing Protocol
Distance – the cost of reaching the destination.

Vector – direction (which interface) to forward traffic.
TC
Pro’s
Only have receive updates from neighbors.
Simple to use and smaller overhead.
Con’s
KB
Updates are spread node-by-node.
Count-to-infinity problem.
Link State Routing Protocol
Link – the speed of the link (10 Meg / 100 Meg / 1 Gb / 10 Gb)
State – Is the interface up or down?
Pro’s
Each router has a full network topology.
C
Convergence after a topology change is quicker.
T
Con’s
KB
Requires more processing power and memory.
Hybrid Routing Protocol
• A hybrid routing protocol has some characteristics of a link state routing protocol, and some
characteristics of a distance vector routing protocol.
TC
• EIGRP is Cisco’s Enhanced Interior Gateway Routing Protocol. It can look at bandwidth, and
load, and delay, and reliability, and MTU, and hop count, and it can use all of those or a
number of these to make a decision on what the best route might be to a location.
• Cisco themselves say that this is a distance vector routing protocol, so called Advanced
Distance Vector Routing Protocol.
KB

Path-Vector Routing Protocol
• A path vector protocol is a network routing protocol which maintains the path information that
gets updated dynamically.
TC
• Border Gateway Protocol (BGP) is an example of a path vector protocol.
• In BGP, the autonomous system boundary routers(ASBR) send path vector messages to
advertise the reachability of networks.
KB
• Each router that receives a path vector message must verify the advertised path according to its
policy.
• If the message complies with its policy, the router modifies its routing table and the message
before sending the message to the next neighbor.
• It modifies the routing table to maintain the autonomous systems that are traversed in order to
reach the destination system.
C
Distance Vector Routing Protocols and Routing Loop Issues
T
• Distance Vector Routing Protocols (RIP & EIGRP) suffer from possible routing loop.
KB
• Routing Loops can cause major network problems, from packets getting lost (blackholed) in
network.
TC
KB

Routing Loop Occur Situations
• Routing loops can occur when there are..
TC
 Incorrect or inconsistent routing updates due to slow convergence after a topology change.
 Incorrect or incomplete routing information
 Static routes incorrectly configured with an intermediate address which does not become
resolved in the routing table.
KB
Distance-vector Loop Prevention Mechanisms
1. Route Poisoning
2. Split Horizon
3. Hold Down Timer
4. Split Horizon with Poison Reverse
Route Poisoning
T C
• Route poisoning is a method to prevent a router from sending packets through a route that has
become invalid within computer networks.
KB
• Distance-vector routing protocols in computer networks use route poisoning to indicate to other
routers that a route is no longer reachable and should not be considered from their routing
tables.
• When the protocol detects an invalid route, all of the routers in the network are informed that
the bad route has an infinite (∞) route metric.
TC
• This makes all nodes on the invalid route seem infinitely distant, preventing any of the routers
from sending packets over the invalid route.
• Each routing protocol has its own definition of an infinite metric. In the case of RIP the infinite
metric is 16.
• Route Poisoning mainly used in RIP.

KB

Route Poisoning Working Flows
TC
• We have a network of two routers. Both routers are running RIP. R2 has advertised
the 10.0.0.0/24 network to R1.
KB
• Now consider what happens when the network 10.0.0.0/24 fails:
1. R2 removes the route to 10.0.0.0/24 from its routing table.
2. R2 advertises the 10.0.0.0/24 network with an infinitive metric (16) to R1 (“route

poisoning”).
Split Horizon
from its routing table.
T C
3. R1 receives the update and knows that the network has failed. It will remove the route
• Split-Horizon is a method of preventing routing loops in distance vector routing protocols by

KB
prohibiting a router from advertising a route back onto the interface from which it was learned.
(Don't advertise a route out of the same interface it was learned on)
• Thus when a device that participates in such route advertisements receives an update from an
interface, it (the device) does not forward updates through the same interface out. By doing so,
routing loops are prevented.
• Split Horizon was enabled in all router interfaces by default.

TC
• Distance Vector Routing Protocols, RIP and EIGRP uses Split Horizon featured to avoid routing
loop.
KB

Split Horizon Disabled
• The point-to-multipoint frame relay network (non-broadcast multiaccess (NBMA) frame relay
network) is comprised of two virtual circuits, one between R1 and R2 and one between R2 and
TC
R3.
KB
R2(config)# interface s1/0
R2(config-if)# no ip split-horizon eigrp 1
Hold Down Timer
C
• By initiating the hold down timer, a router can prevent itself and the network from a possible
T
routing loop. Distance Vector Protocol RIP uses hold down timer.
• Flash (or triggered) updates allowed fast convergence but hold down timers introduces
KB
uncertainty to reduce the acceptance of bad routing information.
• If an advertisement is received with increased metric (or hop count), the router set a hold down
timer before accepting the new routing information.
• Until the hold down timer expires, router will not accept any route for the specified destination
with equal or worst metric.
TC
KB

Split Horizon with Poison Reverse
• Poison reverse is another way of avoiding routing loops.
TC
• “ Once you learn of a route through an interface, when received an Update with
"Infinity/Maximum Hop" Metric, send an Update with "Infinity/Maximum Hop" Metric back.
(Poison Reverse Feature)
• Split Horizon says not to advertise a network out the same interface it was learned from.
However, Split Horizon with Poison Reverse will advertise the network out the same interface it
KB
learned the route from but it will mark the network as unreachable.
• By default, EIGRP uses Split Horizon with Poison Reverse.
T C
Autosummarization
KB
• Distance Vector Routing Protocols (RIP and EIGRP) that uses Autosummarization automatically
creates a summary route under certain conditions. That automatic process happens when
1. That one router connects to subnets of multiple different classful networks
2. That router uses a routing protocol that uses the autosummary feature. (Note that classful
routing protocols had to use this feature and could not disable it.)
TC
KB
 OSPF doesn't support automatic summarization.

Summarization Advantages
Saves memory: routing tables will be smaller which reduces memory requirements.
TC
Saves bandwidth: there are less routes to advertise so we save some bandwidth.
Saves CPU cycles: less packets to process and smaller routing tables to work on.
Stability: Prevents routing table instability due to flapping networks.
KB
Summarization Disdvantages
Forwarding traffic for unused networks: a router will drop traffic when it doesn’t have a
matching destination in its routing table. When we use summarization, it’s possible that the
summary route covers networks that are not in use. The router that has a summary route will
forward them to the router that has advertised the summary route.
Sub-optimal routing: routers prefer the path with the longest prefix match. When you use
C
summaries, it’s possible that your router prefers another path where it has learned a more
specific network from. The summary route also has a single metric.
Continuous network
T
KB
• A network topology in which subnets of network X are not separated by subnets of any other
classful network.
TC
Discontinuous network
• A network topology in which subnets of network X are separated by subnets of some other
classful network .
KB

Disabling Autosummarization
• Disabling Autosummarization with the no auto-summary subcommand.
TC
• This command is needed on the router that connects to both classful networks (Routers R1
and R3), because those are the routers that automatically create summary routes.
KB
Manual Summarization
T C
• The ip summary-address rip router configuration command causes the router to summarize a
given set of routes learned via RIPv2 or redistributed into RIP.
KB
• Only one summary command can be applied to each interface.
• Only the summary route is advertised and all routes that match the summary route will no be
advertised.
TC
KB

RIP
• Routing Information Protocol (AD value 120)

• Distance Vector Routing Protocol
TC
• RFC 1058
• RIP Versions
○ RIPv1
○ RIPv2
○ RIPng
KB
• Metric = Hop Count
• Hop Range (1 to 15)
(1 = Best) (Above 15 = Drop) (16 & Above is Unreachable)
(1 = Directed Connected Network)
• Send routing table every 30 seconds. (The Whole Routing Table)

○ RIPv1 (Broadcast Update)
○ RIPv2 (Multicast Update)
○ RIPng (Multicast Update)
number 520.
T
• Based on the Bellman–Ford algorithm.
C
• Uses User Datagram Protocol (UDP) as its transport protocol, and is assigned the reserved port
• Loop prevention method Split-Horizon.

KB
Bellman–Ford Algorithm
• The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source
vertex to all of the other vertices in a weighted digraph.
• The algorithm is distributed because it involves a number of nodes (routers) within an

Autonomous system, a collection of IP networks typically owned by an ISP. It consists of the
TC
following steps:
1. Each node calculates the distances between itself and all other nodes within the AS and
stores this information as a table.
2. Each node sends its table to all neighboring nodes.

KB
3. When a node receives distance tables from its neighbors, it calculates the shortest routes to
all other nodes and updates its own table to reflect any changes.

TC
KB
RIP version 1
C
• The original specification of RIP (1988), defined in RFC 1058. (IPv4 Only)
• Broadcast Update (255.255.255.255) UDP Port (520)

T
○ RIPv1 implementation broadcasts to 255.255.255.255 a request message through every
KB
RIPv1 enabled interface. Neighbouring routers receiving the request message respond with
a RIPv1 segment, containing their routing table.
○ RIPv1 can be configured into silent mode, so that a router requests and processes
neighbouring routing tables, and keeps its routing table and hop count for reachable
networks up to date, but does not needlessly sends its own routing table into the network.
• RIPv1 uses Classful routing.

TC
○ The periodic routing updates do not carry subnet information, lacking support for variable
length subnet masks (VLSM).
○ Auto-Summarization Feature not included.
○ Split Horizon included. Route Poisoning included.

KB
• There is also no support for router authentication,

○ Making RIP vulnerable to various attacks

RIP version 2
• RIP version 2 (RIPv2) was developed in 1993 and Last standardized in 1998 in RFC 2453.
• IPv4 Support Only. Backward Compatibility to RIPv1.
TC
• Multicast Update (224.0.0.9) , UDP Port (520)
○ RIPv2 multicasts the entire routing table to all adjacent routers.
• Uses Classful Routing and Classless Routing

○ RIPv2 included the ability to carry subnet information, thus supporting (CIDR).
KB
○ Auto-Summarization Support
○ Split Horizon included. Route Poisoning included.
• Support Authentication
○ Plaintext
○ (MD5) authentication for RIP was introduced in 1997.
• Route tags were also added in RIP version 2.
• Next Hop Specification

T C
○ This functionality allows a distinction between routes learned from the RIP protocol and
routes learned from other protocols.
○ This Field Can Be Used When the Efficient Route To A Network Is through A Router that Is
Not Running RIP. Since, That A Router Will Not Exchange RIP Messages.
KB
RIPng
• RIP next generation, defined in RFC 2080.
• An extension of RIPv2 for support of IPv6.
• The main differences between RIPv2 and RIPng are:

TC
○ Support of IPv6 networking.

○ IPv6 routers were, supposed to use IPsec for authentication.
○ Uses UDP Port 521.
○ RIPng Is Not Backward Compatible To RIPv2 & RIPv1.
○ RIPng the next hop needs a specific encoding for a set route of entries.
○ Route tags not supported in RIPng.
○ Multicast Update (FF02::9)
KB
• Cisco Routers Running 12.2(2)T And Later Support RIPng.

RIP Messages
TC
KB
• RIP defined two types of messages:
1. Request Message: asking a neighbor router to send its routing table.
2. Response Message: carries the routing table of a router.

T C
KB
TC
KB

RIP Routes Updating Conditions
• Routing updates are only transmitted for the following conditions:
TC
 A request for a routing update has been received.
 The routing database is modified by new information from another interface.
 The circuit manager indicates that a destination has changed from an unreachable to a
reachable state.
KB
 When a unit is first powered on to ensure that at least one update is sent. This can be
thought of as a transition from unreachable to reachable.
RIP Timers
Timers Description
Update Timer
Invalid Timer
interface.
T C
• Controls the interval between two gratuitous Response Messages. By default the
value is 30 seconds. The response message is broadcast to all its RIP enabled
• The invalid timer specifies how long a routing entry can be in the routing table
without being updated. This is also called as expiration Timer. By default, the
value is 180 seconds. After the timer expires the hop count of the routing entry
KB
will be set to 16, marking the destination as unreachable.
Flush Timer • The flush timer controls the time between the route is invalidated or marked as
unreachable and removal of entry from the routing table. By default the value is
240 seconds. This is 60 seconds longer than Invalid timer. So for 60 seconds the
router will be advertising about this unreachable route to all its neighbors. This
timer must be set to a higher value than the invalid timer.
Holddown Timer • The hold-down timer is started per route entry, when the hop count is changing
TC
(Cisco from lower value to higher value. This allows the route to get stabilized. During
Implement) this time no update can be done to that routing entry. The default value of this
timer is 180 seconds.
KB

RIP Route Summarization
• Summarizing routes in RIP Version 2 improves scalability and efficiency in large networks.
TC
• Summarizing IP addresses means that there is no entry for child routes (routes that are created
for any combination of the individual IP addresses contained within a summary address) in the
RIP routing table, reducing the size of the table and allowing the router to handle more routes.
• Cisco routers can summarize routes in two ways:
KB
 Automatically, by summarizing subprefixes to the classful network boundary when crossing
classful network boundaries (automatic summary).
 As specifically configured, advertising a summarized local IP address pool on the specified

interface (on a network access server) so that the address pool can be provided to dialup
clients. (ip summary-address rip) command.
T C
KB
TC
KB

RIP Configuration
1. Enabling RIP and declared running Interfaces
TC
Router(config)# router rip
Router(config-router)# network <ip-address>
KB
When RIP Running on Interface
• The following are the three actions:

T C
1. The router sends routing updates out the interface.
KB
2. The router listens for and processes incoming updates on that same interface.
3. The router advertises about the subnet connected to the interface.
Symptoms with Missing and Incorrect network Commands

TC
• When a router is missing a network command, or the command was incorrect so that it does not
match an interface or interfaces. Basically, two things happen:
1. The router does not advertise about the subnets on those interfaces.
2. The router does not exchange routing information with other routers on those interfaces.
KB

2. Specify RIP Version,
• By default, the software receives RIP Version 1 and Version 2 packets, but sends only Version 1
packets.
TC
Router(config-router)# version {1 or 2}
• Configuring a particular interface to behave differently. To control which RIP version an interface
sends
KB
Router(config-if)# ip rip send version 1 (Send only RIP v1 packets)
Router(config-if)# ip rip send version 2
Router(config-if)# ip rip send version 1 2
• Control how packets received from an interface are processed, use the following commands in
interface configuration mode:
Router(config-if)# ip rip receive version 1
C
Router(config-if)# ip rip receive version 2
Router(config-if)# ip rip receive version 1 2
Show Running Routing Protocol and Information

T
(sh ip protocols) Display RIP Configuration & Neighbor IP Address
KB
TC
KB

Show RIP Routes Only in Global RIB
(sh ip route rip)
TC
KB
 The update RIP timer that measures how long it has been since Router (R1) has last
heard about this route in a periodic RIP update is 21 seconds ago in this case.
Show RIP Protocol RIB
interfaces
T
(sh ip rip database)
C
• show ip rip database command lists both learned routes and connected routes for RIP-enabled
KB
TC
KB

Controlling RIP Updates with the passive-interface Command
• The RIPv2 passive-interface command can be used to stop all RIPv2 updates from being sent
out the interface that is matched by a network command.
TC
• By making an interface passive to RIP, the RIP process no longer sends RIP updates out that
interface.
• RIP will still process any received updates and will still advertise about the connected subnet.
KB
• Make all interfaces passive by default, with the passive-interface default RIP command, and
then selectively make interfaces not be passive, with the no passive-interface type number RIP
subcommand.
T C
KB
TC
KB

Equal Cost Load Balancing and RIP Maximum-Paths
• If rip’ router has multiple paths for the same network, with the same metric, it will use all
possible paths and load balance over them. This is called equal cost load balancing.
TC
KB
T C
• RIP will load balance on all paths with same metric, the default setting (depending on your Cisco
IOS version) Default is 4.
• The minimum is 1, which disables load balancing. The maximum value will depend on your IOS
version.
KB
• When you set it to 1, RIP prefers to use the first entry that it has installed in its routing table.
TC
KB

RIP Default Routes
• All the routers in that part of the network would need to forward their packets to the one router
that has a WAN link connected to another part of the enterprise or to the Internet.
TC
KB
• One router, directly connected to the link of the true default route, configures a static default
route as normal.
• That router then uses RIPv2 to advertise a default route—a route to 0.0.0.0, mask /0—to the
other routers.
T C
KB
RIPv2 to Advertise Default Routes
• The key to making the process work is the addition of the default-information originate command
to the RIP configuration on the router where the static default route is configured.
• This new RIP subcommand tells the router simply this:

TC
If the IPv4 routing table has a default route in it, advertise a default route with RIP, with
this local router as the eventual destination of those default routes.
KB

TC
• The route also has an * beside it, meaning that this route is a candidate to be the default route
for this router.
• The Gateway of Last Resort (which is the chosen default route for this router) lists the same
KB
next-hop IP address listed in the RIP-learned default route.
Default Route Using DHCP Assign Address

T C
KB
• By dynamically learning the address of the ISP router, R1 can dynamically add a default route
to its routing table. R1’s new default route will use the default gateway IP address from the
DHCP message which is the ISP router’s IP address.
• Then, using the same RIPv2 methods and the default-information originate RIP subcommand
TC
configured on Router R1, R1 will advertise a default route to the other routers.
KB
• When adding a route to the default gateway, as learned with DHCP, IOS uses a default
administrative distance of 254.

Key chain
• Key chain is a set of keys associated with an interface.
TC
• Key chain includes Key IDs, Keys and Key Lifetime.
• A Key chain may contain more than one key.
KB
T C
KB
• The key chain determines the set of keys that can be used on the interface.
• If a key chain is not configured, no authentication is performed on that interface.

TC
KB

RIP Authentication
• Cisco implementation of RIPv2 supports two modes of authentication:

1. Plain text authentication and
TC
2. Message Digest 5 (MD5) authentication.
• Plain text authentication mode is the default setting in every RIPv2 packet, when authentication
is enabled.
• Plain text authentication should not be used when security is an issue, because the unencrypted
KB
authentication password is sent in every RIPv2 packet.
• MD5 authentication works similarly to plain text authentication, except that the key is never sent
over the wire. Instead, the router uses the MD5 algorithm to produce a "message digest" of the
key (also called a "hash"). The message digest is then sent instead of the key itself. This ensures
that nobody can eavesdrop on the line and learn keys during transmission.
• RIP version 1 (RIPv1) does not support authentication. If you are sending and receiving RIPv2
•
C
packets, you can enable RIP authentication on an interface.
In addition, invalid route updates might end up in the routing table due to poor configuration
(such as not using the passive interface command on the network boundary), or due to a
malfunctioning router.
T
KB
Configure Authentication in RIPv2
1. Define a key chain with a name. The key chain determines the set of keys that can
be used on the interface. If a key chain is not configured, no authentication is performed
on that interface.
G>key chain <KeyChainName>

G>key chain MyLock
TC
2. Define the key or keys on the key chain.
KM>key <key-idName>
KM>key 1
3. Specify the password or key-string to be used in the key.

KB
KM>key-string <password>
KM>key-string p@sswd

4. Specify whether the interface will use plain text or MD5 authentication.
○ The default authentication used in RIPv2 is plain text authentication, when authentication is
enabled in the previous step. So, if using plain text authentication, this step is not required.
TC
G>int e0/0
IM>ip rip authentication mode md5
5. Enable authentication on an interface and specify the key chain to be used.
KB
IM>ip rip authentication key-chain <keychainName>
IM>ip rip authentication key-chain MyLock
Verifying Authentication
T C
KB
TC
KB

Split Horizon
• Split-Horizon is a method of preventing routing loops in distance vector routing protocols by

prohibiting a router from advertising a route back onto the interface from which it was learned.
TC
(Never send route path to from that interface)
• Thus when a device that participates in such route advertisements receives an update from an
interface, it (the device) does not forward updates through the same interface out. By doing so,
routing loops are prevented.
KB
• Split Horizon was enabled in all router interfaces by default.
T C
KB
Enabling or Disabling Split Horizon
• Default split horizon is enabled on all interfaces, but on IOS Frame-Relay split-horizon is
disabled by default, so updates can come out and come in on the same interface.
G>int e0/0
TC
IM>ip split-horizon (Enabled) (Default is Enabled)
IM>no ip split-horizon (Disabled)

KB

EIGRP
• Enhanced IGRP, Enhanced Interior Gateway Routing Protocol
TC
• Cisco Proprietary 1990s to 2013 > Open Standard
• Distance-Vector Protocol > Hybrid Routing Protocol (Link State Algorithm)
• Advanced Distance Vector Protocol via Cisco Defined (Faster Convergence)
KB
• Best Path Selection > DUAL (Diffusing Update Algorithm)
• Support IPv4 and IPv6 > Supporting CIDR & VLSM (Class Less Routing Protocol)
• Full Update (Initial) > Partial Update (Only Incremental) (Later if changes)
• Multiple Network Layer Support > Protocol Dependent Modules (PDM)
C
• Composite Metric (Math Equation) / Infinite Metric (2^32 - 1)
• Neighbor Discovery (Unicast or Multicast 224.0.0.10)

T
• AD Value (Internal = 90 ) (External Routes = 170) (Another Routes in EIGRP = 170)
KB
EIGRP Operation Steps
• EIGRP uses three-step model :
1. Neighbor Discovery
TC
2. Topology Exchange
3. Choosing Routes > After Maintain Neighborship

KB

Neighbor Discovery
• EIGRP routers send ‘Hello messages’ to discover potential neighboring EIGRP routers and
perform basic parameter checks to determine which routers become neighbors called
TC
Adjacency.
• Neighbors that pass all parameter checks are added to the EIGRP neighbor table.
Topology Exchange
• Neighbors exchange full topology updates when the neighbor relationship comes up, and then
KB
only partial updates as needed based on changes to the network topology.
• The data learned in these updates is added to the router’s EIGRP topology table.
Choosing Routes > After Maintain Neighborship
• Each router analysis its respective EIGRP topology tables, choosing the lowest-metric route to
reach each subnet.
• EIGRP places the route with the best metric for each destination into the IPv4 routing table.
EIGRP Neighbors Discovery

T C
• EIGRP uses Hello Messages to dynamically discover potential neighbors, sending those updates
to multicast address 224.0.0.10 or Unicast.
KB
• One another EIGRP router is discovered using Hello messages, routers must perform some
basic check of each potential neighbor before that router becomes an EIGRP neighbor.
• Router checks the following settings to become Neighbor:
1. It must pass the authentication process if used.

TC
2. It must uses the same configured autonomous system number.
3. The source IP address used by the neighbors Hello Message must be in the
same subnet as the local router’s interface (IP address /SM).
4. The routers’ EIGRP K-Values must match.

KB
• Once, two EIGRP routers become neighbors, two routers begin exchanging topology
information using EIGRP Messages.
• After exchanging EIGRP Hello Messages each others, neighbors become Adjacency.

EIGRP Hello Message
• EIGRP Hello messages include the following fields;
TC
Version: currently, version 2 is used
Opcode: type of the EIGRP packet. 5 means Hello
Checksum: verifies the packet contents
KB
Flags: Used to describe special treatment for this packet or its sender.
Currently, 4 bits are defined: Init, Conditional Receive, Restart, End Of Table
Autonomous system: the AS of the router that sent this message
Parameters: a set of Type-Length-Value triplets to carry additional information,

K-values and Hold time are advertised here.
EIGRP Packet Types

T C
Software version: additional information about the IOS version
Hello
KB
Update
Query
Reply
ACK
Hello
TC
• Hello packets are used for neighbor discovery.
• As soon as you send hello packets and receive them your EIGRP routers will try to form the
neighbor adjacency.
• Hello packets don’t have to be acknowledged since EIGRP uses a hold down time.
KB
• If a router doesn’t receive hello packets in an X amount of time it will drop the neighbor
adjacency.

Update
• Update packets have routing information and are sent reliable to whatever router that requires
this information.
• Update packets can be sent to a single neighbor using unicast or to a group of neighbors using
TC
multicast.
Query
• Query packets are used when your EIGRP router has lost information about a certain network
and doesn’t have any backup paths.
• What happens is that your router will send query packets to its neighbors asking them if they
KB
have information about this particular network.
Reply
• Reply packets are used in response to the query packets and are reliable.
ACK
• ACK packets are used to acknowledge the receipt of update, query and reply packets. ACK
packets are sent by using unicast.
C
EIGRP Neighbor Discovery and Adjacency Process Detail
T
KB
TC
KB

TC
KB
T C
KB
TC
KB

Maintaining Neighbors Process (Hello Timer & Hold Timer)
• EIGRP using Hello Packet to identify neighbor status.
TC
• Hello Packet send on each running interface with ‘Periodically’. Periodic Timer called Hello
Interval, Default > 5 Seconds (60 seconds for low-speed NBMA network).
• EIGRP hold timer is renewed when it receives a hello packet from a neighbor, however the hello
packet is not the only packet that renew it…all EIGRP packets do.
KB
• ‘Hold Interval’ for waiting ‘Hello Message’. Default > 15 Seconds (After that use new routes)
(180 seconds for NBMA networks)
• The hold time is typically three times the hello interval.
• EIGRP doesn’t required ‘Hello and Hold Timers’ same on two neighbors because EIGRP noted
Hold Timer from its neighbors advertisement. The hold time is included in the hello packets so
each neighbor should stay alive even though the hello interval and hold timers do not match.
C
• Two routers to become EIGRP neighbors even though the hello and hold timers do not match.
T
KB
TC
KB

Verifying EIGRP Interface Timers
TC
KB
EIGRP Topology Exchange
• EIGRP uses Update Messages to send topology information (Routes) to neighbors.
• Update Messages were sent to multicast IP address 224.0.0.10 if the sending router needs to
update multiple routers on the same subnet; otherwise, Update Messages are sent to unicast IP
Address of neighbor (Neighbor’ IP).
C
• EIGRP use a protocol called Reliable Transport Protocol (RTP) to send Update Messages.
T
• RTP provides a mechanism to resend any EIGRP messages that are not received by a neighbor.
KB
• By using RTP, EIGRP can better avoid loops because a router knows for sure that the
neighboring router has received any updated routing information.
• EIGRP neighbors use Full Update and Partial Updates.
• Full update means that a router send information about all known routes and Partial update
means include only recently changed routes.
TC
• Full update occur when neighbors first come up. After that only partial updates in changes.
KB

RTP (Reliable Transport Protocol)
• EIGRP uses IP protocol number 88.
TC
• EIGRP uses RTP (Reliable Transport Protocol) (Own Layer 4 Protocol) and its function is to deliver
EIGRP packets between neighbors in a reliable and ordered way.
• RTP started after neighborship to transfer EIGRP Routes Information. Neighbor Discovery process
doesn’t use RTP.
KB
• Reliable means that when we send a packet we want to get an acknowledgment from the other
side to make sure that they received it.
• It can use multicast or unicast and to keep things efficient not all packets are sent reliable.
Unicast (Neighbor IP) or Multicast (For IPv4 224.0.0.10) / (For IPv6 FF02::A)
• Not all EIGRP Packets are send via Multicast, they are depending on EIGRP Packet Type.
C
• As well as, not all EIGRP Packets have to be acknowledge, depending on EIGRP Packet Type.
• RTP has retransmission timeout (2 minutes) to know packet loss.

T
KB
TC
KB

EIGRP Metric Calculation Example
TC
KB
EIGRP Metric Form 2
T C
KB
TC
KB

EIGRP Serial Link Default Bandwidth Value Problem
TC
KB
• In particular, serial links default to a bandwidth of 1544 kbps and a delay of 20,000
microseconds.
• So that situation, change interface default bandwidth with (bandwidth) command in serial
interface.
T C
EIGRP Convergence and Loops Free Process
KB
• Loop avoidance poses one of the most difficult problems with any dynamic routing protocol.
• Link State Protocols also overcome this problem but by using SPF Algorithm to avoid any loop.
• Distance Vector Routing Protocols overcome this problem with a variety of tools.
• EIGRP avoids loops and converges faster by use of DUAL algorithm.

TC
KB

DUAL
• Diffusing Update Algorithm
• The DUAL finite-state machine takes the decision process for all route computations by tracking
TC
all routes advertised by all neighbors.
• DUAL uses distance information to select efficient, loop-free paths and selects routes for
insertion in a routing table based on feasible successors.
• A feasible successor is a neighboring router used for packet forwarding that is a least-cost path
to a destination that is guaranteed not to be part of a routing loop.
KB
• When a neighbor changes a metric, or when a topology change occurs, DUAL tests for feasible
successors. If one is found, DUAL uses it to avoid recomputing the route unnecessarily.
• When no feasible successors exist but neighbors still advertise the destination, a recomputation
(also known as a diffusing computation) must occur to determine a new successor.
• Although recomputation is not processor-intensive, it does affect convergence time, so it is
advantageous to avoid unnecessary recomputations.
Feasible Distance and Reported Distance
• These are EIGRP Metric Terms,

T C
Feasible Distance (FD) : The local router’s composite metric of the best route to reach
KB
a subnet, as calculated on the router.
(Local Router’ Route to Destination)
Reported Distance (RD) : The next-hop router’s best composite metric for that same
subnet. (Neighbor to Destination)
The Advertised distance is also called the Reported distance.
(Next-Hop Router’ FD Route to same Destination)
TC
KB

Feasible Distance and Reported Distance Process
TC
KB
T C
Successor Routes / Non-successor Routes / Feasible Successors Routes
• These are EIGRP Route Terms (Route Markable Name),

KB
Successor Route
○ After EIGRP metric calculation, the route with the best metric is called the successor.
○ This route’ metric is called Feasible Distance (FD).
○ The successor will be copied from the topology table to the routing table.
TC
(Successor also existing in Topology Table)

KB

Non-successor Routes & Feasible Successor Route
• The other routes to reach same subnet (that routes whose metrics were larger than the Feasible
Distance (FD Value) of successor routes are called Non-successor routes.
TC
• EIGRP used Feasible Successor Route as alternate route (backup route) to reach destination if
the current best route (called Successor Route) failed.
• One of these alternatively, immediately usable route (Feasible Successor Route) become a new
successor route when the successor route fail.
KB
Feasibility Condition
T C
• Not all non-successor routes become feasible successor route.
KB
• A router determines whether a route is a feasible successor based on the feasible condition;
 If a non-successor route’ RD is less than Successor’ FD, the route is a feasible successor
route. (NS route’ RD < S route’ FD = FS Route)
TC
KB
• Based on metric matching of RD & FD (RD < FD) calculation, Feasible Successor Route can be
more than one. But electing least metric value route become Feasible Successor Route.
• DUAL uses feasible condition to prevent routing loop.

TC
KB
T C
KB
TC
KB

EIGRP Query Message and Reply Message
• When a route fails and the route has no Feasible Successor, EIGRP uses a distributed algorithm
called Diffusing Update Algorithm (DUAL) to choose a replacement route.
TC
• DUAL sends queries looking for a loop-free route to the subnet in question.
• When the new route is found, DUAL adds it to the Routing Table.
• If successor route’ physical path and selection feasible successor route’ physical path have been
KB
failed, EIGRP router send Query Message to its working path (to its neighbor) for enquiry of
available path.
• The router which received Query Message reply with EIGRP Reply Message by confirming that it
is still available.
• Replacing a failed route with Feasible Successor Route take a very short amount of time.
(usually less than a second or two)
still occur in less than 10 seconds)

T C
• When Query and Reply Process required, convergence can take slightly longer. (most networks
KB
TC
KB

EIGRP Tables
• When EIGRP enabled on interface, EIGRP uses 3 tables,
TC
1. Neighbor Table
2. Topology Table
3. Routing Table
KB
Verifying EIGRP Tables
T C
KB
TC
KB

Neighbor Table
• Each router keeps state information about adjacent neighbors.

• When newly discovered neighbors are learned, the address and interface of the neighbor is
TC
recorded. This information is stored in the neighbor data structure.
• When a neighbor sends a hello, it advertises a Hold Timer.
• There is one neighbor table for each protocol dependent module.
KB
• The neighbor table entry also includes information required by the reliable transport mechanism.
• Sequence numbers are employed to match acknowledgments with data packets. The last
sequence number received from the neighbor is recorded so out of order packets can be
detected.
Verifying Neighbor Table

T C
KB
TC
KB

Resetting EIGRP Neighbors (Adjacencies)
• To remove and reestablish the EIGRP Neighbor entries from the appropriate table, use the
clear ip eigrp neighbors command. (Removing Old Adjacencies)
TC
KB
EIGRP Static Neighbor
C
• EIGRP by default uses multicast for neighbor discovery but it also allows to configure EIGRP
neighbors statically.
• Once you do this, EIGRP will only use unicast and disables EIGRP multicast on the selected
interface.
T
KB
• This could be useful where multicast is not supported or want to reduce the overhead of
multicast traffic. (Frame-relay hub and spoke network)
TC
KB

Static Neighbor Configuration
• Use the neighbor command to specify the remote neighbor and the interface to reach it.
TC
KB
Verifying Static Neighbor
T C
KB
TC
KB

Topology Table
• The Topology Table is populated by the protocol dependent modules and acted upon by the
DUAL finite state machine.
TC
• It contains all destinations advertised by neighboring routers.
• Associated with each entry is the destination address and a list of neighbors that have
advertised the destination.
• For each neighbor, the advertised metric is recorded. This is the metric that the neighbor
stores in its routing table.
• If the neighbor is advertising this destination, it must be using the route to forward packets.
KB
• This is the sum of the best advertised metric from all neighbors plus the link cost to the best
neighbor. This is the metric that the router uses in the routing table and to advertise to other
routers.
• EIGRP topology table is very important when you are troubleshooting missing routes.
EIGRP topology table for AS 1
T C
KB
TC
KB

TC
KB
T C
KB
TC
KB

(show ip eigrp topology all-links) command show routes, even those are neither successor nor feasible
successor routes.
TC
KB
Routing Table (EIGRP)
T C
KB
TC
KB

TC
KB
EIGRP Configuration
T C
KB
TC
KB

EIGRP AS Number
• ASN actually functions as a process id / process number in terms of EIGRP, also called EIGRP
Process ID.
TC
• The only difference is, with OSPF, every router can be configured with a different process ID.
• In EIGRP, all router's that will be exchanging internal routing information must all have the same
process ID / ASN. (Different ASN, EIGRP Routers can’t shared routes each others / Can’t
Adjacency) (AS Number must be same in all Routers)
KB
• ASN is any arbitrary number between 1 and 65535 that is assigned to a router's EIGRP routing
process. All routers that are to exchange interior routes should have the same ASN.
• Note that EIGRP's ASN is locally significant and is not the same with the AS numbers assigned
by IANA.
• These AS numbers that are assigned to service providers and organizations must be globally
unique and are connected via BGP. The EIGRP ASN on the other hand has no significance
outside of the AS.
C
Running Multiple AS or Multiple Processes in Single Router
• EIGRP can configure more than one EIGRP autonomous system on the same router.
T
• This is typically done at a redistribution point where two EIGRP autonomous systems are
KB
interconnected.
• Cisco does not recommend running multiple EIGRP autonomous systems on the same set of
interfaces on the router.
• If multiple EIGRP autonomous systems are used with multiple points of mutual redistribution, it
can cause discrepancies in the EIGRP topology table if correct filtering is not performed at the
redistribution points.
TC
KB

Verifying EIGRP AS Number
TC
KB
T C
KB
TC
KB

TC
KB
Finding EIGRP Enabled Interfaces
T C
KB
TC
KB

Verify Protocol EIGRP (show ip protocols)
TC
KB
T C
KB
Verifying EIGRP Running Interfaces

TC
KB
 (show ip eigrp interfaces) command doesn’t list information for Passive Interfaces.

Router ID
• Each EIGRP router has a unique 32-bit router ID (RID) number that is represented the same way
as an IP address. (4.4.4.4 or 100.100.100.0)
TC
• Any IP address with two exceptions; 0.0.0.0 and 255.255.255.255 are not legal values and
cannot be entered.
• The router ID is selected from the highest IP address assigned to a loopback interface.
KB
• If no loopback addresses are configured, the router ID is selected from the highest IP address
assigned to any other interface.
T
Router ID : Locally Significant or not
C
• Router ID is locally significant in Internal EIGRP. (In same AS)
KB
• Routers with Identical / Overlap Router IDs can be neighborship.
• When routes (another routing protocol’ routes) are redistributed into the EIGRP AS, external
routes are tagged with the Originating router field. This field is the router ID of redistributing
Router.
• When multiple routers have the same Router ID in redistribution or different AS environment, the
TC
routes are not installed in the routing table, resulting in redistribution routing failures. (Because of
EIGRP Loop Prevention Method)
• Routers with same Router ID can’t shared external routes each other. To prevent duplicate router
IDs, ensure that the IP address on the interface being used as the router ID is unique between
the EIGRP routers.
KB
• To manually configure a router ID for EIGRP, issue the eigrp router-id <ID> command from the
router configuration mode of EIGRP.

TC
KB
 No auto-summary is needed because by default EIGRP will behave like a classful routing protocol
C
which means it won’t advertise the subnet mask along the routing information.
T
KB
 Hello-Interval & Hold-time Value is in (second) and range is 1 to 65535
 (no ip hello-interval eigrp 12 300) change to default value.

TC
KB

Verifying Current EIGRP K Values
TC
KB
Configuring EIGRP K Values
T C
KB
 Use the metric weights command to change the K values.
 All K1 to K5 available 0 to 255, 0 is disabled, 1 is enabled.
 The first value is for the TOS byte but as you can see it only supports a value of 0. The next
values are for the actual K values:
TC
KB

K-value Mismatch Problem
• K-value mismatch causes Neighbor Flapping (doesn’t establish adjacency)
TC
• When changing the weight values,
KB
Verifying Interface Bandwidth
T C
KB
Changing Interface Bandwidth

TC
• Bandwidth command doesn’t change the actual bandwidth of the interface.

KB

Verifying Interface Current Load Value (Load is Dynamic Value)
TC
KB
Verifying Interface Current Delay Value (Static Value depending on Interface)
T
Changing Interface Delay Value
C
KB
TC
KB

Verifying Interface Current Reliability Value (Reliability is Dynamic Value)
• Reliability at 255/255 is 100%.
TC
• This means that you don’t have issues on the physical or data-link layer.
• If you are having issues this value will decrease.
• Since this is something that can change it’s a dynamic value.
KB
Verifying Interface MTU Size
C
• MTU or Maximum Transmission Unit is being exchanged between EIGRP neighbors but not used
T
for the metric calculation.
KB
TC
KB

EIGRP Passive Interface
• EIGRP support Passive Interfaces.
TC
• On passive interface, EIGRP does not discover and form neighbor relationships because passive
interface doesn’t send Hello Packet.
• Adjacency not established, no routing updates are sent from that passive interface.
• However, EIGRP still advertises about the subnet connected to passive interface.
KB
T C
KB
TC
KB

Verifying Passive Interface
TC
KB
EIGRP Auto-summarization
T C
• Depending on your IOS version, auto-summary might be enabled or disabled by default.
KB
TC
KB

Disabling Auto-summarization
TC
KB
T C
EIGRP Manual Summarization
KB
 EIGRP can summarized on every eigrp routers. When manual summarize, auto-summarization
must be disabled.
TC
KB

Configuring EIGRP Manual Summarization
TC
KB
Configuring Summary Metric
T C
KB
TC
KB

EIGRP Equal-Cost Load Balancing
• When EIGRP calculates the metrics for all possible routes, sometimes one clear winner exists, so
EIGRP choose one successor route.
TC
• In the other cases, the metrics for computing routes for the same subnet tie.
• EIGRP support a feature called Equal-Cost Load Balancing which tells EIGRP to treat all the
routes that tie as successor routes.
KB
• EIGRP defaults to 4 paths for load balancing but the maximum that can be set is 16.
• To disable equal cost load balancing, use maximum-path 1 command.

T C
Unequal-Cost Load Balancing (Load Balancing over Feasible Successor)
KB
• Also called Unequal Cost Path Load Balancing
• Every routing protocol supports equal cost path load balancing.
• In addition, Interior Gateway Routing Protocol (IGRP) and EIGRP also support unequal cost path
load balancing.
• Use the (variance n ) command in order to instruct the router to include routes with a metric of
TC
less than n times the minimum metric route for that destination.
• The variable n can take a value between 1 and 128.
• The default is 1, which means equal cost load balancing.

KB
• Traffic is also distributed among the links with unequal costs, proportionately, with respect to the
metric.
• Note: If a path is not a feasible successor, the path is not used in load balancing.

TC
KB
T C
KB
TC
KB

TC
KB
T C
KB
EIGRP Default Route Propagation
• Configure a default route in EIGRP, basically there are two methods:

TC
1. Create a static route and advertise it into EIGRP (Static Default Route)
2. Flag an EIGRP route as the default network (IP Default Network)

KB

Configuring EIGRP Static Default Route
1. Static Default route will be Exit Interface or Next Hop IP.

2. In EIGRP, network 0.0.0.0 must be declared.
TC
KB
Configuring EIGRP Default Route with IP Default Network
C
• ip default-network command to tell other EIGRP routers that this is a network of “last resort”.
This means that they can use it as a default route.
T
• It is EIGRP Route Flag method. The ip default-network command works on IOS 12.4 but it doesn’t
work on IOS 15 anymore. It’s better to stick to the static default route and advertise or
KB
redistribute it into EIGRP.
TC
KB

Verifying Default Network
TC
KB
Configuring EIGRP Authentication
• EIGRP uses two types of authentication:
1. MD5 authentication
2. SHA authentication (Since IOS 15.x)
T C
Configuring MD5 authentication
KB
TC
KB

Debug-able EIGRP Packet Types
TC
KB
Debugging EIGRP Messages
T C
KB
TC
KB

Debugging EIGRP Hello Messages
TC
KB
Debugging EIGRP ACK Messages
T C
KB
TC
KB

Debugging EIGRP FSM (Finite State Machine)
• Display EIGRP Feasible Successor Activities.
TC
• When an EIGRP router is not performing any local computations, each entry in the topology
table is considered to be in the passive state.
• When an EIGRP router receives and input event, such as the reception of an EIGRP query
packet, the state change of an interface, a reply packet, etc., the router will begin to perform
local computations and move to the active state if it needs to recalculate the metrics for each of
KB
it's routes.
• An easy way to put it is that you can see the query and reply process among other things.
T C
KB
TC
KB

EIGRP Queries and SIA (Stuck in Active)
TC
KB
T C
KB
TC
KB

TC
KB
T C
KB
TC
KB

With SIA Query and Reply
TC
KB
EIGRP Neighbor Adjacency Problems
T C
KB
TC
KB

EIGRP Uncommon Subnet
• Causes of different subnets on each interfaces (neighbors doesn’t in same subnet).
TC
KB
EIGRP K-values Mismatch
T C
KB
EIGRP AS Number Mismatch

TC
• Unlike the other EIGRP configuration mistakes this one doesn’t produce an error message.
KB

EIGRP Passive Interface Problem
• Unlike the other EIGRP configuration mistakes this one doesn’t produce an error message.
TC
KB
EIGRP Multicast Traffic Filtered Problem
T C
KB
TC
KB

NBMA (EIGRP Frame Relay Map) Problem
• Unlike the other EIGRP configuration mistakes this one doesn’t produce an error message. EIGRP
unicast configuration first:
TC
KB
T
EIGRP Redistribution on Different ASs
C
KB
TC
KB

EIGRP for IPv6
TC
KB
EIGRP for IPv6 Lab
T C
KB
TC
KB

Router 1 Configuration
TC
KB
Router 2 Configuration
T C
KB
TC
KB

Verify IPv6 EIGRP Route
TC
KB
Verify IPv6 EIGRP Neighbors
T C
KB
Verify IPv6 EIGRP Topology Table

TC
KB

Verifying EIGRP IPv6 Successor Routes
TC
KB
Configuring IPv6 EIGRP Multi-Path & Variance
T C
KB
Configuring IPv6 EIGRP Timers

TC
Configuring IPv6 EIGRP Passive Interface

KB

Verify EIGRP IPv6 Tables
TC
KB
Verify IPv6 Protocols EIGRP
T C
KB
TC
KB

OSPF (Open Shortest Path First)
 Open Standard
○ OSPF သည္ Open Standard ျဖစ္ျပီး IETF (Internet Engineering Test Force) ကေန Developed လု
TC
ပ္ထားတာျဖစ္တယ္။ (RFC 2328)
 Link State Routing Protocol

○ Link State Routing Protocol ျဖစ္တယ္။ Link State Routing Protocol ျဖစ္တာေၾကာင့္ Entire
Network ထဲက Destinations တိုင္း ကိုသြားနိဳင္တဲ့ Network Map တစ္ခုလံုးသိေအာင္ အရင္ရွာတယ္။
အဲ့ထဲကမွ အေကာင္းဆံုး Route Paths ေတြကို ေရြးခ်ယ္အသံုးျပဳတာျဖစ္တယ္။
KB
 Identical Database
○ The whole network paths Network map
OSPF Routers
 Using Dijkstra Algorithm

○ Dijkstra Algorithm သံုးျပီး အေကာင္းဆံုး Network Paths ေတြကိုရွာျပီးေရြးထုတ္တာျဖစ္တယ္။
C
○ OSPF Dijkstra Algorithm သည္ Network Paths ေတြရဲ့ Metrics Values ေတြကိုအသံုးျပဳျပီး အေကာင္
းဆံုး Network Paths ေတြကိုေရြးထုတ္ေပးတာျဖစ္တယ္။
 AD Value (Internal = 110 ) (External Routes = 110) (Another Routes in OSPF = 110)
T
○ O < OIA < E1 < E2 < N1 < N2 (O is the First Selection) (In Multi Area)
KB
 Using Area , Easy for Loading and Management
○ Internetwork ၾကီးအား Load သက္သာေစရန္နွင့္ Management လုပ္ရတာလြယ္ကူေစရန္ Network
အား Multiple Areas (OSPF Area) ေတြအျဖစ္ခြဲျပီးအလုပ္လုပ္ေစတယ္။
 Hierarchical Design
OSPF ရ့ဲအေကာင္းဆံုးအသံုးဝင္တဲ့အခ်က္သည္ ၄င္းရဲ့ Design သည္ Hierarchical ပံုစံက်တယ္။ OSPF
သည္ Larger Internetwork ၾကီးကို Smaller Internetworks အျဖစ္ပိုင္းလိုက္တယ္ ၄င္းကို Areas လို
႔သတ္မွတ္တယ္။
TC
 Network Convergence as fast as EIGR

○ The Whole Network ၾကီးတစ္ခုလံုးရဲ့ Paths ေတြကို အရင္ရွာေဖြျပီးမွ Shortest Path Tree တည္ေဆာ
က္တာေၾကာင့္ OSPF ကို Network Convergence Time ၾကာတယ္ထင္ၾကတယ္။
○ ဒါေပမဲ့ OSPF သည္ EIGRP ေလာက္ Network Convergence Time ျမန္တယ္။
○ ဘာေၾကာင့္လဲဆိုရင္ Area ခြဲျပီးအလုပလ
္ ပ
ု တ
္ ာေၾကာင့္ Network Size ေသးတယ္။ ဒါ့ေၾကာင့္ Network
Convergence Time ျမန္တာျဖစ္တယ္။
KB

 Changes Path Only Update
 Periodically Update and Changes Update
TC
 Unicast and Multicast Update
 OSPF Versions and IP Versions

○ OSPF version 1 နဲ႔ OSPF version 2 တို႔သည္ Routing လုပ္တဲ့ေနရာမွာ IPv4 Protocol တစ္ခုထဲမွပဲ
Carry လုပ္နိဳင္တယ္။ IPv4 ပဲ Support လုပ္တယ္။
○ OSPF version 3 မွစျပီး IPv4 Protocol ေရာ IPv6 Protocol ကိုပါ Support လုပ္လာတယ္။ ဒါ့ေၾကာင္
KB
့ IPv6 Routing သံုးခ်င္ရင္ OSPF Version 3 ကိုသံုး။
 Support VLSM and CIDR

 Auto-summarization Not Included (Manual Summarization Supported)
 Support Multiple and Equal Costs Routes
 Support Unlimited Hop Count (Also depending on RAM)
OSPF and RIP Comparison

T C
KB
TC
KB

TC
KB
T C
KB
TC
KB

TC
KB
T C
KB
TC
KB

Looking OSPF Topology Database
○ (show ip ospf database) Command သည္ OSPF ရဲ့ Topology Database အားၾကည့္တာျဖစ္တယ္။
တနည္းအားျဖင့္ Link State Advertisement Database (LSDB) အား ၾကည့္တယ္လို႔လဲေျပာနိဳင္တယ္။
TC
○ ၄င္း Command သည္ လက္ရွိ OSPF Router က OSPF Area တစ္ခုနဲ႔ပဲ Connect လုပ္ထားရင္ OSPF Area
တစ္ခုအတြင္းမွာျဖစ္ေပၚေနတဲ့ Link State Database (Network Map) တစ္ခုကိုပဲျပေပးနိဳင္သကဲ့သို႔ လက္ရွိ
OSPF Router သည္ Multiple OSPF Areas ေတြၾကားခ်ိတ္ဆက္ေပးေနတဲ့ Area Border Router (ABR)
ျဖစ္ခဲ့မယ္ဆိုရင္ေတာ့ OSPF Areas အားလံုးရဲ့ Link State Database (Network Map) တစ္ခုစီကို Area ID
အလိုက္ခြဲျခားျပေပးနိဳင္တယ္။
KB
○ OSPF Topology Database ထဲမွာ Autonomous System (AS) တစ္ခုအတြင္းမွာရွိတဲ့ OSPF Routers အား
လံုးလာေပၚျပီး ၄င္း Routers ေတြကို ၄င္းတို႔ရဲ့ Router ID နဲ႔ ၄င္း Routers ေတြရဲ့ (မိမိဆီကေနေရာက္နိဳင္တဲ့)
Interface IP Address ေတြကိုပါျပေပးတယ္။
T C
KB
TC
"Link ID" သည္ မိမိနဲ႔ Connect လုပ္ထားတဲ့ Remote Router ရဲ့ Interface IP Address ကို ျပေပး
တာျဖစ္ျပီး Next Hop Address လို႔လဲေျပာနိဳင္တယ္။
"ADV Router" သည္ (Advertising Router) ျဖစ္ျပီး Remote Router ရဲ့ Router ID ျဖစ္တယ္။
KB

OSPF Operation Steps
• အဓိကအားျဖင့္ Router တစ္လံုးရဲ့ Routing Table ထဲကို Internetwork ထဲက Destination တိုင္းကိုသြား
နိဳင္တဲ့ Route Paths (Routes) ေတြထည့္နိဳင္ရန္ OSPF Protocol အလုပ္လုပ္သြားတဲ့အဓိက အပိုင္း 5 ပိုင္
TC
းရွိတယ္။
1. Neighbor Discovery and Neighborship
2. Forming Adjacency
KB
3. LSA Flooding (LSA Messages Exchange)
4. SPF Tree Calculation
5. Injecting to Routing Table
T C
KB
TC
KB

TC
KB
T C
KB
Hello Protocol Offer Information (Inside Hello Message)
○ Hello Protocol Offer လုပ္ေပးတဲ့ Information ေတြသည္ (Hello Message

Information …
 Area ID
 Subnet (Network Mask)
 Router ID
TC
 Router Priority
 Hello/dead Interval
 Known Neighbors
 DR IP Address
 BDR IP Address
 Authentication Data
KB

TC
KB
T C
KB
TC
KB

Hello and Dead Interval Mismatch Problem
○ Hello Timer နဲ႔ Dead Timer Mismatch ေၾကာင့္ Adjacency မျဖစ္သျဖင့္ Routing Information
Exchange လုပ္လို႔မရတဲ့ ျပႆနာေတြသည္
TC
1. Different Network Type
 OSPF Routing Information Exchange လုပ္မယ့္ Router သည္ ABR Router ျဖစ္ေနျပီး ၄င္
း ABR Router ရဲ့ Interfaces တစ္ဖက္တစ္ခ်က္သည္ မတူညီတဲ့ OSPF Network Type ျဖစ္
ေနခဲ့မယ္ဆိုရင္လဲ ABR Router သည္ ၄င္းရဲ့ တစ္ဖက္ Interface က OSPF Routing
Information ကိုက်န္တစ္ဖက္က Interface သို႔ Shared မရတဲ့ ျပႆနာတက္တက္တယ္။
 ဘာလုိ႔ Shared လို႔မရတာလဲဆိုရင္ ABR Router ရဲ့ Interface နွစ္ခုမွာသတ္မွတ္ထားတဲ့ Hello
KB
Timer နဲ႔ Dead Timer မတူလို႔ Adjacency မျဖစ္တဲ့အတြက္ Shared မရျခင္းျဖစ္သည္။
2. Multivendors
 ဒါမွမဟုတ္ေနာက္တစ္ခုသည္လည္း Multi Vendor Network မွာ Router တစ္လံုးနဲ႔တစ္လံ
ုး Neighborship မျဖစ္လို႔ Adjacency မျဖစ္တဲ့ Error သည္ Vendor တစ္ခုနဲ႔တစ္ခု Hello
Timer နဲ႔ Dead Timer တို႔ Mismatch ျဖစ္တဲ့ Problem ျဖစ္တယ္။
Verifying Hello Interval and Dead Interval in OSPF Interface
Router#show ip ospf int fa 0/0 or
Router#show ip ospf int fa 0/0 | include interval

T C
KB
Configuring Hello Interval and Dead Interval
○ ထိုျပႆနာေတြမွာ Adjacency ျဖစ္ျပီး Routing Information Exchange လုပ္နိဳင္ေအာင္ Hello Timer နဲ

႔ Dead Timer တို႔အား Manually ျပန္သတ္မွတ္ေပးရမယ္။
○ Interface Configuration Mode မွာ
TC
 (ip ospf hello-interval "Value) Command
 (ip opsf dead-interval "Value") Command

KB

Mismatched MTU Settings
• Two OSPFv2 Routers can actually become neighbors and reach 2-way state even if they happen
to use different IPv4 MTU settings on their interfaces.
TC
• However, they fail to exchange their LSDB.
• Eventually, after trying and failing to exchange their LSDBs, the neighbor relationship also fails.
• The Neighborship will be formed but it not form "FULL" Adjecency. LSDB exchange might not
KB
happen and the neighborship will be stuck in "EXSTART / EXCHANGE" state.
T C
KB
Changing MTU Size in Router Interface
R2(config)#interface fastEthernet 0/0

R2(config-if)#mtu 1400 (value in bytes)
TC
MTU Size Mismatched Ignored Command
R2(config)#interface fastEthernet 0/0

R2(config)#ip ospf mtu-ignore
KB

Neighborship Database
○ Neighborship Database ကိုေနာက္တစ္မ်ိဳး Neighbor Table လို႔လဲေခၚတယ္။
(show ip ospf neighbor) or (show ip ospf neighbor neighborRouterID)
TC
KB
○ "Neighbor ID" မွာ Neighbor Router ရဲ့ Router ID အားျပေပးတယ္။
○ "Pri" သည္ Priority Field ျဖစ္တယ္။ Neighbor Router ရဲ့ Priority Value အားျပေပးတာျဖစ္တယ္။
လက္ရွိမွာ Default Priority ျဖစ္တဲ့ 1 ျဖစ္ေနေၾကာင္းေတြ႔ရတယ္။
 Priority Value 1 ျဖစ္ေနရင္ လက္ရွိ Neighbor Router သည္ Multi Point OSPF Network Type
ျဖစ္တာေၾကာင့္ DR / BDR Election လုပ္မည္ျဖစ္ေၾကာင္းသိနိဳင္တယ္။
 Priority Value 0 ျဖစ္ေနရင္ေတာ့ ၄င္း Neighbor Router သည္ Point to Point OSPF Network
T C
အမ်ိဳးအစားျဖစ္တာေၾကာင့္ DR/BDR Election မလုပ္ေၾကာင္းသိနိဳင္တယ္။
○ "State" မွာ ေရွ႔ကသည္ လက္ရွိ ၄င္း Router Interface ရဲ့လုပ္ေဆာင္ေနတဲ့အေျခအေန State (ေလာ
ေလာဆယ္ Interface သည္ Full State ျဖစ္ေနတယ္။) အားျပေပးျပီး ေနာက္ကသည္ ၄င္း Neighbor
Router သည္ DR လား BDR လား ဒါမွမဟုတ္ ကိုယ့္ Neighbor သည္ DR ေရာ BDR ေရာ ဟုတ္မဟုတ္ပါ
ျပေပးတယ္။
KB
 "State" မွာ Full /- လို႔ျပရင္ Neighbor Router သည္ Network ထဲကအျခား Routers ေတြန႔ဲ LSDB
Database အား Fully Synchronize လုပ္ျပီးေၾကာင္းျပတာျဖစ္တယ္။
 "State" မွာ /- လို႔ျပရင္ လက္ရွိ Interface ကေနေရြးခ်ယ္ထားတဲ့ DR မရွိဘူးလို႔ျပတာျဖစ္တယ္။ ဘာ
လို႔ DR မရွိတာလဲဆိုတာသည္ လက္ရွိ Neighbor သည္ Ethernet Type (Broadcast OSPF
Network Type) မဟုတ္ဘဲ Point to Point Network Type ျဖစ္ေနလို႔ျဖစ္တယ္။
○ "Address" သည္ မိမိ (လက္ရွိ) Router နဲ႔ခ်ိတ္ထားတဲ့ Neighbor Router ရဲ့ မိမိနဲ႔ Directly Connected
Interface ရဲ့ IP Address အားျပေပးတာျဖစ္တယ္။ (Next Hop Address ျဖစ္တယ္။)
TC
○ "Dead Time" သည္ Hello Messages ေတြရဲ့ Dead Time အား Count လုပ္ေနတာျဖစ္တယ္။
○ "Interface" သည္လည္း မိမိနဲ႔ Connect လုပ္ထားတဲ့ Neighbor Router ရဲ့ Interface ကိုလာျပေပးတာ
ျဖစ္တယ္။ လက္ရွိ Router ရဲ့ Interface မဟုတ္ဘူး။
Resetting Neighbor Relationships

KB
• Reset the OSPF process to make a choice of OSPF RID.
Router#clear ip ospf process

TC
KB
T C
KB
TC
Verifying Adjacency Information

○ OSPF Router တစ္လံုးနဲ႔တစ္လံုး Network ထဲက Route Paths ေတြအားလံုး Exchange လုပ္ထားျပီး
Adjacency ျဖစ္ျပီးေနျပီလားသိခ်င္ရင္ Privileged Mode မွာ (show ip ospf neighbor) Command ရိုက္
ျပီးၾကည့္နိဳင္တယ္။
KB

LSA Messages and Steps
1. Hello Message
2. LSA Message
3. DBD Message (DD Message)
TC
4. LSR Message
5. LSU Message
6. LSAck Message
KB
T C
KB
TC
KB

TC
KB
T C
KB
TC
KB

OSPF Interface States
○ OSPF Router 2 လံုး Neighbor Discovery လုပ္တဲ့အခ်ိန္ကစျပီး LSDB Complete ျဖစ္သြားျပီးတဲ့အခ်ိန္အ

ထိ ပို႔တဲ့ Messages အမ်ိဳးအစားေတြနဲ႔ ၄င္းတို႔ရဲ့ Interface States ေတြသည္
TC
1. Neighbor Discovery State
 DOWN State
 ATTEMPT State (Only in NBMA)
 INIT State
KB
2. Neighborship State (Neighbor Relationship State)
 2WAY State
3. Link State Information Exchange State

 EXSTART State
 EXCHANGE State
 LOADING State
 FULL State
T C
4. LSDB Complete State (Fully Synchronized State)
KB
TC
KB

1. Neighbor Discovery States
○ Neighbor States ဆိုသည္မွာ အနီးအနားက OSPF Routers ေတြအခ်င္းခ်င္း OSPF Routing

Processes လုပ္နိဳင္ဖို႔ ဦးစြာမိမိေဘးနားမွာ OSPF Router ရွိမရွိ Discovery လုပ္တဲ့ Step by Step
TC
အဆင့္ေတြကိုေျပာတာျဖစ္တယ္။
○ Discovery State Neighbor Relationship မတည္ေဆာက္ရေသးတဲ့အတြက္ Neighborship မျ
ဖစ္ေသးဘူး။
○ OSPF Routers ေတြ Neighborship ျဖစ္ေအာင္ လုပ္ေဆာင္သြားရတဲ့အဆင့္ေတြသည္
1. DOWN State
KB
2. ATTEMPT State
3. INIT State
DOWN State
○ Hello Message DOWN State OSPF Router

Hello Message
○ Neighbor Router OSPF Interface (DOWN State)

Hello Message
T C
KB
TC
KB

2. Neighborship State
○ Directly Connected လုပ္ထားတဲ့ OSPF Routers 2 လံုးအျပန္လွန္ Neighbors ေတြျဖစ္ေၾကာင္းသိသြား
တဲ့ အေျခအေနသည္ Neighborship State ျဖစ္တယ္။
○ တနည္းအားျဖင့္ OSPF Router ကိုယ္စီကုိယ္စီရဲ့ Neighbor Tables ေတြထဲမွာ အျပန္အလွန္ Router
TC
Addresses ေတြသိမ္းထားျပီးတဲ့အေျခအေနျဖစ္တယ္။
○ OSPF Router Interface State 2WAY State Neighborship
2WAY State
○ OSPF Router Interface သည္ Neighbor Router ကေပးတဲ့ Hello Packet ကိုလဲလက္ခံရရွိတယ္။ ၄င္
း Hello Packet ထဲမွာ မိမိရဲ့ Router ID ပါဝင္တာေၾကာင့္ မိမိအား ပို႔တဲ့ OSPF Router သည္ မိမိကို သိ
KB
ေၾကာင္း သိရတယ္။
○ ေနာက္တစ္ခါလဲ မိမိကလဲမိမိအား Hello Packet ပို႔တဲ့ Router ကို ၄င္း Router ရဲ့ Router ID ပါဝင္တဲ့
Hello Packet အားထပ္မံေပးပို႔တယ္။ ဟိုဘက္က Router ကလဲ ေအာ္ငါ့ေပးတဲ့ Hello Packet ထဲမွာလဲ ငါ့
Router ID ပါလားဆိုျပီးသိရတယ္။
○ ထိုသို႔ Network တစ္ခုအတြင္းမွာရွိတဲ့ OSPF Routers 2 လံုးအျပန္အလွန္သိေနတဲ့ Interfaces ေတြရဲ့အေ
ျခအေနကို 2Way State လို႔ေခၚတယ္။ OSPF Routers ေတြသည္ တစ္ခုနဲ႔တစ္ခု အျပန္အလွန္ သိသြားျပီး
Neighborship တည္ေဆာက္ၾကတယ္။
3. Link State Information Exchange State

C
○ Link State Database (LSDB) Create လုပ္နိဳင္ဖို႔ Link State Information ေတြ Sharing & Collection
လုပ္
T
○ Link State Information Exchange State မွာ OSPF Routers ေတြရဲ့ Interfaces ေတြလုပ္ေဆာင္သြား
တဲ့ States ေတြသည္
KB
 EXSTART State
 EXCHANGE State
 LOADING State တို႔ပဲျဖစ္တယ္။
TC
EXCHANGE State
○ LSA Information ေတြပါတဲ့ LSA Messages ေတြစပို႔ျပီဆိုတာနဲ႔ OSPF Routers ေတြသည္ ၄င္းတို႔ရဲ့
KB
Interfaces ေတြကို EXCHANGE State သို႔ေျပာင္းပစ္တယ္။

○ Interface ရဲ့ EXCHANGE State မွာ LSA Information (Routing Information) ေတြကို DD Packets
ေတြ LSA Packets ေတြနဲ႔ Carry လုပ္တယ္။

LOADING State
○ DD Packets ေတြ LSU Packets ေတြနဲ႔ Link State Database (LSDB) တည္ေဆာက္ျပီးသြားလို႔ OSPF
Routers ေတြသည္ Changes Routes ေတြနဲ႔ Missing or Corrupted Routes ေတြက်န္မက်န္ စစ္ေဆး
TC
ရန္ LSR Packets အား Send လုပ္တယ္။
○ ထိုသို႔ LSR Packet Send လုပ္တဲ့ အေျခအေနမွာ LSR Send လုပ္တဲ့ Router Interface သည္ Loading
State ျဖစ္ေနတာျဖစ္တယ္။
○ LSR Packet ကိုလက္ခံရရွိတဲ့ တစ္ဖက္က Router သည္လည္း Loading State နဲ႔ LSU Packets (အထဲ
KB
မွာ Update LSA Information ေတြပါတယ္။) နဲ႔ Reply ျပန္ေပးတယ္။
○ Reply အားလက္ခံရရွိေၾကာင္းကို LSAck Packet နဲ႔ Acknowledge ျပန္လုပ္ေပးတယ္။ ထိုအေျခအေ

နမွာလဲ Router ရဲ့ Interface သည္ Loading State ပဲျဖစ္ေနမွာျဖစ္တယ္။
○ ဒါ့ေၾကာင့္ Link State Database မွန္ကန္ေၾကာင္း Re-acknowledge လုပ္ေနတဲ့ အခ်ိန္သည္ LOADING

State ျဖစ္တယ္။
T C
KB
Verifying OSPF Interface State

TC
KB

TC
KB
Network Network Type DR & BDR Neighbor Multicast/Unicast Hello/Dead
Ethernet
T Carrier,
Frame Relay (MP)
BMA
(More Devices)
NBMA
T
(More Devices)
Elects
Yes
Yes
C AutoDiscovery
Yes
No (Manual)
Multicast (.5 or .6) 10/40
Unicast 30/120
FR P2P, PPP, P2P No No (Manual) Multicast (.5) 10/40

KB
HDLC, Serial Link, (Only two Dev)

Tunnel (GRE)
T Carrier, Optical, P2M Broadcast No Yes Multicast (.5) 30/120

DMVPN (MGRE), (More Devices)
T Carrier, P2M NBMA No No Unicast 30/120

FR Multipoint(MP), (More Devices)
Loopback Interface (L) - No - - -

TC
(OSPF noted as /32)

(Host Route)
 Multicast Traffic = No Need to manual neighbor configuration (Multicast Message)

 No Multicast = No Auto Neighbor (Static Neighbor Config Req) (Unicast Message)
 DR / BDR Election = LSA Type 2 Message
KB
 No DR / BDR Election = No LSA Type 2 Message

 DR to others = 224.0.0.6
 Non DR to Non DR = 224.0.0.5
 Loopback Noted /32 = If you want /24 Advetisement changed loopback to Point to Point

TC
KB
T C
KB
TC
KB

TC
KB
T C
KB
TC
KB

TC
KB
Looking OSPF Network Types
T C
○ လက္ရွိ OSPF Router သည္ ဘယ္လို Network Type အမိ်ဳးအစားနဲ႔ Network မွာ အျခား OSPF Router နဲ႔ခ်ိ
တ္ထားလဲ သိခ်င္ရင္ (Point to Point Type လား NBMA Type လား သိခ်င္ရင္) Privileged Mode မွာ
(show ip ospf interface "InterfaceName")
KB
Command နဲ႔ၾကည့္ျပီး "Network Type Field" မွာၾကည့္လို

႔ရတယ္။
TC
KB
 "BROADCAST" လို႔ျပရင္ OSPF Network Type သည္ BROADCAST Network Type ျဖစ္တယ္။
 "POINT_TO_POINT" လို႔ျပရင္ OSPF Network Type သည္ POINT_TO_POINT Network Type ျဖစ္တ
ယ္။

TC
KB
T C
KB
TC
KB

OSPF Network Types and Adjacency
TC
○ တူညီတဲ့ OSPF Area တစ္ခုအတြင္းမွာရွိတဲ့ OSPF Routers ေတြသည္ တူညီတဲ့ Link State Database
(Network Map) ျဖစ္ေပၚလာရန္ တစ္လံုးနဲ႔တစ္လံုး Adjacency လုပ္ျပီး Link State Information ေတြ Shared
လုပ္ၾကတယ္။
KB
○ ပံုမွန္ Same Network (Same Subnet) တစ္ခုအတြင္းမွာ Routers 2 လံုးပဲရွိတတ္တယ္။ Point to Point
Network ျဖစ္မယ္ဆိုလွ်င္ Link တစ္ခုရဲ့ ထိပ္မွာ Router တစ္လံုး .. ။ Link ရဲ့ အျခား ဆန္႔က်န္ဘက္ ထိပ္မွာ
Router တစ္လံုး။
○ Router 2 လံုးပဲရွိျပီး Point to Point Link OSPF Network အမ်ိဳးအစားျဖစ္မယ္ဆိုရင္ Priority or Router ID
Router DR(Master) BDR(Slave)
Neighborship INIT to 2WAY State Hello Messages
Neighbor Router Priority or Router ID Detect
T C
KB
TC
KB

TC
KB
T C
KB
TC
KB

TC
KB
T C
KB
TC
KB

Always DR Site
○ ေနာက္တစ္ခုကေတာ့ LAN နဲ႔ခ်ိတ္ထားတဲ့ Router ရဲ့ Interface သည္ အျမဲတမ္း DR ပဲျဖစ္ေနတယ္။ ဘာလို႔လဲ
ဆိုရင္
TC
(1) LAN သည္ Ethernet ျဖစ္တဲ့အတြက္ OSPF Broadcast Network Type ျဖစ္တယ္။ ဒါ့ေၾကာင့္
(2) DR / BDR Election လုပ္ျပီး Adjacency လုပ္ရမယ္။ ဒါေပမဲ့
(3) ၄င္း LAN Subnet (Network) ထဲမွာ OSPF Router တစ္လံုးပဲရွိတာေၾကာင့္ ၄င္း Router သည္ Auto
DR ျဖစ္ေနတာျဖစ္တယ္။
Backup Designated Router
KB
○ Same Network ထဲက Designated Router အျဖစ္သတ္မွတ္ခံရတဲ့ Router down သြားရင္ က်န္ Router
တစ္လံုးလံုးက Network Delay မျဖစ္ေအာင္ ခ်က္ခ်င္း Designated Router အျဖစ္လုပ္ေပးနိဳင္ရန္ OSPF
Protocol သည္ Backup Designated Router ကိုပါသတ္မွတ္ထားတယ္။
○ Same Network ထဲမွာ Router ID ဒုတိယအျမင့္ဆံုး Router သည္ Backup Designated Router ျဖစ္တယ္။
○ Backup Designated Router သည္ Neighbor Routers ေတြနဲ႔ Adjacency လုပ္တာေၾကာင့္ LSA
Information Update ေတြလက္ခံရရွိတယ္။ သို႔ေသာ္ မိမိ (Backup Designated Router) ထဲမွာရွိတဲ့ Link
State Database ကိုေတာ့ အျခား Routers ေတြကို Shared မေပးဘူး။ (Synchronize မလုပ္ဘူး။)
 BDR
Down
Router
DR Down
DR
T C
KB
TC
KB

TC
KB
T C
KB
TC
KB

Looking Who's Designated Router (DR)
○ မိမိ Router သည္ Designated Router (DR) လား Backup Designated Router (BDR) လားသိခ်င္ရင္ မိမိ
Router ရဲ့ Privileged Mode မွာ (show ip ospf interface "ၾကည့္ခ်င္တဲ့ Interface") Command နဲ႔ၾကည္
့လို႔ရတယ္။ ဒါဆိုရင္ State မွာ DR or BDR လို႔ျပလိမ့္မယ္။
TC
KB
C
○ တကယ္လို႔ လက္ရွိ OSPF Router ရဲ့ OSPF Network Type သည္ Point to Point Network Type ျဖစ္
ေနမယ္ဆိုရင္ေတာ့ Network Type မွာ POINT_TO_POINT လို႔ျပတဲ့အျပန္ State မွာလဲ
T
POINT_TO_POINT လို႔ျပတယ္။ ေအာက္မွာ "No designated router on this network" လုိ႔ပါျပေပးတယ္။
KB
TC
 Neighbor Router State

KB

TC
KB
T C
KB
TC
KB

TC
KB
T C
KB
TC
KB

Verifying OSPF Priority Value
○ OSPF Interface မွာလက္ရွိျဖစ္ေနတဲ့ OSPF Priority Value ကိုၾကည့္ခ်င္ရင္

(show ip ospf int "InterfaceName") Command နဲ႔ၾကည့္လို႔ရတယ္။
TC
KB
T C
KB
TC
KB

TC
KB
Router ID Prefer List
(Best Practice = Manual Defined Router ID)

T C
 Cisco Router မွာ Router ID သည္ Automatically Assign ျဖစ္သလို Manually လဲ Assign လုပ္လို႔ရတယ္။
1. Router ID Manually Assign လုပ္ထားရင္ေတာ့ ၄င္း Assign လုပ္ထားတဲ့ IP Address ကို Router
ID အျဖစ္ယူျပီး အလုပ္လုပ္တယ္။ (Manual Prefer First)
KB
1. Manually Assign လုပ္ထားတာမဟုတ္ရင္ ေတာ့ Automatically ဆိုရင္ အရင္ဦးစြာ Router မွာ

Loopback Interface ရွိမရွိနွင့္ ၄င္း Loopback Interface မွာ IP Assign လုပ္ထားမထားၾကည့္တယ္။
(Loopback Second)
2. Loopback Interface မွာ IP Address Assign လုပ္ထားရင္ ၄င္း Assign လုပ္ထားတဲ့ IP Address ကို
Router ID အျဖစ္ယူတယ္။ တကယ္လို႔ Multiple Loopback Interfaces ေတြရွိတယ္ဆိုရင္ ၄င္
း Loopback Interfaces ေတြမွာ Assign လုပ္ထားတဲ့ Highest IP Address (192.168.…. vs 10.0.
= 192 Select) ..အျဖစ္ဆံုး Interface အား Router ID အျဖစ္ယူတယ္။
TC
4. Loopback Interface မရွိရင္ေတာ့ လက္ရွိ OSPF Routing Process မွာပါဝင္ျပီး Up ျဖစ္ေနတဲ့

Interface ေတြထဲကမွ IP Address Highest ျဖစ္တဲ့ Interface ရဲ့ IP Address ကို Router ID အျ
ဖစ္ယူတယ္။ (Physical Interface Third)
 Loopback Interface or Physical Interface OSPF Process (OSPF

KB
Running Interface ) Router ID

Verifying Router ID
○ လက္ရွိ Router မွာ Router ID ဘယ္ေလာက္လဲသိခ်င္ရင္ Privileged Mode မွာ (show ip ospf)
Command နဲ႔ၾကည့္နိဳင္တယ္။
TC
○ OSPF Routers ေတြရဲ့ Neighbor Table ထဲမွာ မိမိရဲ့ Neighbor OSPF Router ကိုမွတ္ထားတဲ့ Neighbor
ID သည္လည္း ၄င္း Neighbor' Router ရဲ့ Router ID ပဲျဖစ္တယ္။
KB
Configuring Router ID on OSPF (Router ID Manual Configuration)
1. OSPF Router မွာ Manually Router ID Assign လုပ္ခ်င္ရင္ OSPF Process ID နဲ႔ OSPF Routing
ယ္။
T C
Engine Mode ထဲကိုဝင္ (router-id "RouterIDIPAddress") Command နဲ႔ Assign လုပ္ေပးရတာျဖစ္တ
2. Command ရိုက္တာနဲ႔ OSPF Router ရဲ့ Router ID သည္ တန္းျပီးမေျပာင္းသြားဘူး။ ေျပာင္းေအာင္ OSPF
Process Routers Restart
KB
TC
 (router-id) Command နဲ႔ Manually ေပးတဲ့ Router ID သည္ အျခား Logical Interface အား Auto
Router ID ယူေပးတာနဲ႔ Physical Active Interface အား Auto Router ID အျဖစ္ယူေပးတဲ့ Router IDs
ေတြအား Overwrite ျဖစ္တယ္။
KB

TC
KB
T C
KB
TC
KB

Configuring Loopback Interface & IP Address on OSPF Router
○ OSPF Routing Protocol Run ေနတဲ့ Router မွာ Router ID ျဖစ္ေစခ်င္တဲ့အတြက္ Loopback Interface အား
IP Address Assign လုပ္ေပးခ်င္ရင္
TC
1. ေပးခ်င္တဲ့ Loopback Interface Configuration Mode ထဲဝင္ (int "InterfaceName")
2. (ip address "IP" "Subnet") Command နဲ႔ေပး။
 Loopback Interface မွာ Assign လုပ္တဲ့ IP Address သည္ Router ရဲ့ Physical Interfaces ေတြ
KB
မွာ Assign လုပ္ထားတဲ့ IP Address ေတြနဲ႔ မတူညီရဘူး။ Subnet လဲမတူရဘူး။
 Routers ေတြမွာ Loopback Interfaces ေတြသည္အျမဲတမ္း Up ျဖစ္ေနျပီး Manual Down မွသာ

Down တာျဖစ္တယ္။ Default အတိုင္းေတာ့အျမဲ Up ျဖစ္ေနတယ္။ ဒါ့ေၾကာင့္ Loopback Interface
မွာ IP Address Assign လုပ္ျပီးသြားရင္ (no shutdown) Command နဲ႔ Up လုပ္စရာမလိုဘူး။
T C
/32 (255.255.255.255) Subnet Mask and Loopback IP Address
KB
○ IP Address တစ္ခုရဲ့ Subnet Mask အား /32 Prefix ျဖစ္တဲ့ 255.255.255.255 ေပးမယ္ဆိုရင္ ၄င္း Subnet
Mask သည္ Host Mask ျဖစ္တယ္။ /32 Subnet လို႔လဲေခၚေသးတယ္။
○ အဓိကအားျဖင့္ Routers ေတြရဲ့ Loopback Interfaces ေတြမွာ IP Address Assign လုပ္ရင္ ၄င္း IP Address
ရဲ့ Subnet Mask ကို /32 Prefix (255.255.255.255) ေပးေလ့ရွိတယ္။
○ ဘာလို႔ Host Mask ေပးရလဲဆိုရင္ Real အသံုးျပဳနိဳင္တဲ့ Subnets ေတြ IP Addresses ေတြ Reduce မျဖစ္ေအာ
င္ Router တစ္လံုးရဲ့ Loopback Interfaces ေတြအား Single IP Address Host Route
TC
Routing Protocols Loopback Interface Single Host

KB

TC
KB
T C
KB
TC
KB

Viewing Process ID
○ လက္ရွိ Router မွာ Run ေနတဲ့ OSPF Process တိုင္းရဲ့ Information တစ္ခုစီကို Process ID နဲ႔တြဲျပီးၾကည့္ခ်
င္ရင္ Privileged Mode မွာ (show ip protocols) Command နဲ႔ၾကည့္လို႔ရတယ္။
TC
KB
Shutdown OSPF Process
T C
KB
TC
KB

TC
KB
T C
KB
TC
KB

TC
KB
T C
KB
TC
KB

TC
KB
T C
KB
TC
KB

Area may be One Router or One Interface
○ Internetwork တစ္ခုအတြင္းက OSPF Protocol Run ေနတဲ့ Router တစ္လံုးလဲျဖစ္နိဳင္တယ္။ ဒါမွမဟုတ္

Router တစ္လံုးရဲ့ Interface တစ္ခုလဲျဖစ္နိဳင္တယ္။ ဒါ့ေၾကာင့္ Router တစ္လံုးမွာ Interfaces ေတြအမ်ားၾကီး
TC
ရွိမယ္ဆိုရင္ ၄င္း Router ရဲ့ Interface တစ္ခုစီသည္ မတူညီတဲ့ OSPF Area တစ္ခုစီျဖစ္နိဳင္တယ္။
○ ဆိုလိုတာသည္ Router မွာ Interfaces 4 ခုရွိမယ္ဆိုရင္ ၄င္း Router သည္ OSPF Areas 4 ခုရဲ့ Member
ျဖစ္နိဳင္တယ္။ တကယ္လို႔ Router ရဲ့ Interface တစ္ခုမွာပဲ OSPF Protocol Run ေနျပီး က်န္ Router ရဲ့
Interfaces ေတြမွာ အျခား Routing Protocols ေတြ Run ေနမယ္ဆိုရင္ ၄င္း Router သည္ OSPF Area
KB
တစ္ခုရဲ့ Member ပဲျဖစ္တယ္။
○ တကယ္လို႔ Router တစ္လံုးသည္ OSPF Area 2 ခုလံုး ရဲ့ Member ျဖစ္ေနခဲ့ျပီဆိုလွ်င္ ၄င္း Router သည္
မတူညီတဲ့ Dijkstra Algorithm Process 2 ခုကို Router ရဲ့ Interfaces တစ္ခုစီမွာ သီးျခားစီ Run ေနတယ္။
T C
KB
TC
KB

TC
KB
T C
KB
TC
KB

OSPF Virtual Link
TC
KB
○ Backbone Area (Area 0) နဲ႔တိုက္ရိုက္ခ်ိတ္ဆက္ထားတဲ့ OSPF Areas ေတြသည္ Backbone Area (Area 0) နဲ
႔ေရာ အျခား Areas (Area 1 , Area 2) တို႔နဲ႔ပါ အျပန္အလွန္ Communication လုပ္လို႔ရတာျဖစ္တယ္။
○ ထိုသို႔ Area 0 (Backbone Area) နဲ႔ ကပ္လ်က္မဟုတ္ ဘဲ ၾကားမွာ OSPF Area တစ္ခုျခား ေနရင္ေတာ့ ၄င္
း ပထမ Area (Backbone Area) နဲ႔ တတိယ Area , Area 2 ခု Communication လုပ္လို႔မရဘူး။
○ ထိုအခါ ၄င္း Areas 2 ခုၾကား (ပထမ Area (Backbone Area) နဲ႔ တတိယ Area တို႔ၾကား) မွာ OSPF Virtual
Link တည္ေဆာက္ျခင္းျဖင့္ OSPF Areas ေတြ Communication လုပ္နိဳင္တယ္။
○ Area 0 Directly Connected OSPF Areas Backbone Area
Non-backbone Area Router (Edge Router) Backbone Area
ABR Virtual Link
T C
KB
TC
KB

OSPF Router Roles (Router Terms)
○ Multiple Area မွာခ်ိတ္ဆက္ထားတဲ့ OSPF Routers ေတြကို ၄င္းတို႔ရဲ့ခ်ိတ္ဆက္ထားတဲ့ Positions နဲ႔ ၄င္းတို႔ လု
ပ္ေဆာင္ေပးရတဲ့ Processes ေတြေပၚမူတည္ျပီး အမည္ခြဲျခားသတ္မွတ္ျပီးေခၚဆိုၾကတယ္။ OSPF Router
TC
Roles ေတြလို႔လဲေျပာနိဳင္တယ္။
○ OSPF Router Roles ေတြသည္
 Internal Router
 Backbone Router
KB
 ABR
 ASBR
 OSPF Router တစ္လံုးသည္ တစ္ခ်ိန္ထဲမွာ တစ္ျပိဳင္နက္အထက္ပါ Roles ေတြအားလံုးကို ျပိဳင္တူပါ လုပ္ေဆာ

င္နိဳင္တယ္။
T C
KB
Backbone Router
○ Backbone Area ျဖစ္တဲ့ Area 0 ထဲက Routers ေတြအားလံုးကို Backbone Routers ေတြလို႔ေခၚတယ္။
TC
KB

ABR (Area Border Router)
TC
KB
T C
KB
TC
KB

TC
KB
 Area Routes O IA (OSPF Inter Area)
 Multi-Area (Area 0 and Others) Run Multi-Area Configuration
 Route Summarization OSPF Router Role ABR

Summarization
ASBR (Autonomous System Boundary Router)

T C
KB
TC
KB

Looking OSPF Router Role
○ လက္ရွိ OSPF Router သည္ Internetwork မွာ ဘာ Router Role နဲ႔လုပ္ေဆာင္ေနလဲသိခ်င္ရင္ (show ip
protocols) Command နဲ႔ၾကည့္လို႔ရတယ္။
TC
KB
C
○ "Router ID .. " ရဲ့ေအာက္တစ္ေၾကာင္းမွာ "It is an area border router" ဆိုျပီးလာျပလိမ့္မယ္။
T
KB
TC
KB

LSA Types
TC
KB
○ OSPF relies on several types of Link State Advertisements (LSAs) to communicate link
state information between neighbors.
○ LSA Messages ေတြကို Classification ခြဲမယ္ဆိုရင္ LSA အမိ်ဳးအစား (6) ိဳးရွိတယ္။
Type 1 LSA (Router Link Advertisement) (RSA)
C
Type 2 LSA (Network Link Advertisement) (NLA)
Type 3 LSA (Summary Link Advertisement) (SLA)
Type 4 LSA (ASBR Summary LSA)
Type 5 LSA (AS External Link Advertisements)
T
Type 7 LSA (Used in Stub Areas in place of a type 5 LSA)
○ ၄င္း LSA Types ေတြသည္ OSPF Area အမ်ိဳးအစားနဲ႔ အသံုးျပဳတဲ့ Routers ေတြရဲ့ Roles (Internal Router
KB
/ ABR ..) စတာေတြေပၚမူတည္ျပီးေျပာင္းလဲသြားတာျဖစ္တယ္။
○ LSA Types Routing Table OSPF Route Types
Intra-Area (O)
Inter-Area (O IA)
External Type 1 (E1)
TC
External Type 2 (E2)

NSSA Type 1 (N1)
NSSA Type 2 (N2)
 AD Value (Internal = 110 ) (External Routes = 110) (Another Routes in OSPF =

110)
KB
○ O < OIA < E1 < E2 < N1 < N2 (O is the First Selection) (In Multi Area)

Type 1 LSA
TC
KB
T C
KB
TC
KB
○ Routing Table O Routes Type 1 LSA

Routes Type 2 LSA
Routes

Type 1 LSA (Router LSA) Message
(show ip ospf database router)
TC
KB
T C
KB
TC
KB

Type 2 LSA
TC
KB
T C
KB
TC
KB

TC
KB
T C
KB
TC
KB

Type 3 LSA
TC
KB
T C
KB
TC
KB

Type 3 LSA (Network Summary LSA) Message
(show ip ospf database summary)
TC
KB
T C
KB
TC
KB

Type 4 LSA
TC
KB
T C
KB
TC
KB

Type 4 LSA (ASBR Summary LSA) Message
(show ip ospf database asbr-summary)
TC
KB
T C
KB
TC
KB

Type 5 LSA
TC
KB
Differences beteween E1 and E2
T C
KB
TC
R4(config-router)#redistribute eigrp 10 subnets metric-type 1 metric 100

KB

Type 5 LSA (External LSA) Message
(show ip ospf database external)
TC
KB
T C
KB
TC
KB

Type 7 LSA
TC
KB
T C
 N2 routes tell OSPF routers to set the metric as the metric at the point of redistribution.
KB
(External Metric Only)
 N1 routes tell OSPF routers to add the internal costs to reach the ASBR to the cost set at
the point of redistrbution (Both Internal and External)
TC
KB

Type 7 LSA (External LSA) Message
(show ip ospf database nssa-external)
TC
KB
T C
KB
TC
KB

OSPF Standard Area
 Normal Areas like Area 1, 2, etc.. and also Backbone (Area 0) are called OSPF
Standard Area.
TC
 Standard Area accept the following LSA Types;
 Type 1 LSA (Router LSA)

 Type 2 LSA (Network LSA)
 Type 3 LSA (Network Summary LSA)
KB
 Type 4 LSA (ASBR Summary LSA)
 Type 5 LSA (External LSA)
T C
KB
TC
KB

OSPF Special Area Types
 There are also another special areas which purpose is to filter Type 5 LSA (External LSA)
(External Routes). There are 4 special area types;
TC
1. Stub area (Stub = ) (Nothing left after that..)
2. Totally stubby area
3. Not-so-stubby area (NSSA)
4. Totally Not-so-stubby area (Totally NSSA)
KB
 Special Area can be defined manually to filter external route. The area who doesn't want
to receive any external routes, but also want to communicate with external networks.
That area become special areas.
 OSPF Backbone Area (Area 0) will not send Type 5 LSA (External Routes) to that special
areas instead it will send default route using Type 7 LSA Message.
T C
KB
TC
KB

Stub Area
○ Stub area can't accept any Type 5 LSA (External LSA) and Stub area member router also
can't send Type 5 LSA to other.
TC
○ Type 5 LSA are generated by ASBR, so Stub Area member router can't be ASBR
anymore. (No ASBR means no redistribution, behind stub area networks can't reach to
internal)
○ Stub area still accept type 1, 2, and 3 LSAs. A default route is substituted for external
routes. OSPF Default route is distributed by Type 3 LSA.
KB
○ Stub Area accept the following LSA Types;
 Type 3 LSA (Network Summary LSA)
T C
 Stub Area uses OSPF Default Router (O *IA) is for external network access.
KB
Configuring Stub Area
 Directly connected router interfaces must be same area type. If area type mismatch
ospf neighborship will down.
TC
R1(config)#router ospf 1
R1(config-router)#area 3 stub (In ABR/ASBR Router or Central Router)
R3(config-router)#area 4 stub (In Non-ABR Router or Edge Router)
KB

Totally Stubby Area
○ Invented by Cisco for more efficient.
TC
○ Not only Type 5 LSA (can't be ASBR), but also can't accept Type 3 LSA.
○ In Totally Stubby Area, OSPF Default Route (O* IA) is only method to connect another
Areas or external networks.
KB
○ Totally Stub Area accept the following LSA Types;
T C
Configuring Totally Stubby Area
KB
 Directly connected router interfaces must be same area type. If area type mismatch ospf
neighborship will down.
 Totally Stubby Area Filter Type 3 LSA and Type 5 LSA Messages. Actually Type 3 and Type 5
Messages are filter by ABR Router or ASBR Router.
TC
R1(config-router)#area 4 stub no-summary (In ABR/ASBR Router or Central Router)
R4(config-router)#area 4 stub (In Non-ABR Router or Edge Router)
KB

Not-So-Stubby Area (NSSA)
○ Also can't accept any Type 5 LSA but NSSA Area routers can be ASBR.
TC
○ ASBR means NSSA Area member routers can send Type 5 LSA (External Routes) to
others.
○ External Routes can still send via NSSA Area member router, differences is NSSA Area
member ASBR send external routes with Type 7 LSA Message instead of Type 5 LSA
Message.
KB
○ NSSA Area accept the following LSA Types;
 Type 1 LSA (Router LSA) (O)
 Type 2 LSA (Network LSA) (O)
 Type 3 LSA (Network Summary LSA) (OIA)
T C
KB
Configuring NSSA Area
 Directly connected router interfaces must be same area type. If area type mismatch
ospf neighborship will down.
 NSSA Area Router accept Type 3 LSA (Network Summary LSA) with (O IA)Routes.
TC
 NSSA Area is not propagated ospf default route automatically (O N2) .
R1(config)#router ospf 1 (In ABR/ASBR Router or Central Router)

R1(config-router)#area 5 nssa
R1(config-router)#area 5 nssa default-information-originate (for OSPF Default Route)
KB
R5(config-router)#area 5 nssa (In Non-ABR Router or Edge Router)

Totally Not-So-Stubby Area (Totally NSSA)
○ Same as NSSA but extra filtering for Type 3 LSA. (No Type 5 LSA but can be ASBR.)
TC
○ Totally NSSA Area accept the following LSA Types;
○ OSPF Default Route (O* IA) is only method to connect another Areas or external
KB
networks.
T C
Configuring Totally NSSA
KB
 Directly connected router interfaces must be same area type. If area type mismatch ospf
neighborship will down.
R1(config)#router ospf 1 (In ABR/ASBR Router or Central Router)

R1(config-router)#area 6 nssa no-summary
TC
R6(config-router)#area 6 nssa (In Non-ABR Router or Edge Router)

KB

TC
KB
T C
KB
TC
KB

Dijkstra Algorithm (SPS Algorithm)
TC
KB
○ အေပၚမွာျပထားတဲ့ Dijkstra Algorithm Graph ကို Directed and Weighted Graph လို႔လဲေခၚတယ္။ ဘာလို
႔လဲဆိုရင္ ျမွားတစ္ခုခ်င္းဆီမွာ Direction လဲရွိတယ္ ၄င္းတို႔ရဲ့တန္ဖိုး Cost (Weight) လဲရွိလို႔ျဖစ္တယ္။
○ A , B , C , D , E တို႔သည္ Routers ေတြပဲျဖစ္ျပီး၄င္းတို႔ကို Node လို႔ေခၚတယ္။ Dijkstra Algorithm မွာဆိုရင္
ေတာ့ Vertex လို႔ေခၚတယ္။
○ Nodes (Vertexs) နွစ္ခုၾကား Link OR Connection ကို Edge လို႔လဲေခၚတယ္။ ဒါ့ေၾကာင့္ Nodes (Vertexs) နွ
စ္ခုၾကား Link ရဲ့ Cost သည္ Edge Cost ျဖစ္တယ္။
Dijkstra Calculation Table
CDCF = Calculate Directly Connected From
From A
From A
CDCF
A
To B
20 (A via B)
T
To C
10 (A via C)
C
To D
∞ (A via D)
To E
∞ (A via E)
From A C 20 (A via B) 10 (A via C) 30 (A to D via C) 60 (A to E via C)

KB
From A B 20 (A via B) 10 (A via C) 50 (A to D via B) Cancel 90 (A to E via B) Cancel

30 (A to D via C) Choose 60 (A to E via C) Choose
From A D 20 (A via B) 10 (A via C) 50 (A to D via B) Cancel 70 (A to E via D) Cancel

30 (A to D via C) Choose 60 (A to E via C) Choose
From A E 20 (A via B) 10 (A via C) 30 (A to D via C) Choose 60 (A to E via C) Choose
 Dijkstra Algorithm သည္ Node (Vertex) တစ္ခုမွ Network မွာရွိတဲ့ အျခား Nodes (Vertexs) တိုင္
TC
းကို သြားတဲ့ Links တိုင္းကိုရွာတာျဖစ္တယ္။ ထို Links ေတြထဲကမွ အေကာင္းဆံုး Link ကိုေရြးထုတ္တာျဖစ္တ
ယ္။ ဒါ့ေၾကာင့္ Dijkstra Algorithm အလုပ္လုပ္ရန္ တဆင့္ခ်င္းျဖစ္တဲ့ Node A မွ Node B , Node C , Node
D , Node E တို႔ကိုသြားမယ့္ လမ္းေၾကာင္းတစ္ခုခ်င္းကိုအရင္ရွာတယ္။ ရလာတဲ့ လမ္းေၾကာင္းတစ္ခုခ်င္းဆီရဲ့
Direction နဲ႔ Cost ကို Dijkstra Calculation Table ထဲကို အစားသြင္းသြင္းျပီးမွတ္ထားတာျဖစ္တယ္။
 Dijkstra Algorithm သည္ Directed Connected ျဖစ္တဲ့ Node ဆီသြားတဲ့ Cost ကိုပဲ အတိအက် သိတယ္။
တကယ္လို႔ သြားမယ့္ Node သည္ Directed Connected Node မျဖစ္ဘူးဆိုရင္ Cost ကိုမသိနိဳင္ေတာ့ဘူး။ ထို
KB
အခါ Dijkstra Algorithm သည္ Cost အတိအက်မသိတဲ့ Directly Connected Node မဟုတ္တဲ့ Node ဆီ
သြားတဲ့ Cost ကို Infinity Cost (အကန္႔အသတ္မရွိ) အျဖစ္ယာယီသတ္မွတ္ျပီး တြက္ခ်က္တယ္။ ဒါ့ေၾကာင့္ ၄င္
း Directly Connected Node မဟုတ္တဲ့ Nodes ေတြကို Infinite Nodes ေတြလို႔ေခၚတယ္။

 Node A မွက်န္တဲ့ Nodes ေတြအားလံုးဆီသြားတဲ့ Direction နဲ႔ Cost ရျပီဆိုတာနဲ႔ ဒုတိယအေနနဲ႔ Node A နဲ
႔ Directly Connected လုပ္ထားတဲ့ Nodes (B or C) ထဲကမွ အသင့္ေတာ္ဆံုး (Cost အနည္းဆံုး) Node ျဖစ္တဲ့
Node C ကိုေရြးခ်ယ္တယ္။
TC
 Node C ကိုေရြးခ်ယ္ျပီးရင္ Node A မွတဆင့္ Node C ကိုျဖတ္ျပီး Node C နဲ႔ Directly Connected Nodes ေတြ
ျဖစ္တဲ့ Node D နဲ႔ Node E တို႔ဆီသြားတဲ့ Cost ကိုရွာတယ္။ ဒါ့ေၾကာင့္ ရွာတာသည္ Node A to D via C နဲ႔ Node A
to E via C တို႔ရဲ့ Cost ျဖစ္သြားတယ္။ ရွာလို႔ရတဲ့ Cost ကို Dijkstra Calculation Table ထဲထည့္ထားတယ္။
 Node C နဲ႔ Directly Connected Nodes ေတြျဖစ္တဲ့ (Node D , Node E) တို႔ရဲ့ Costs ေတြပဲသိနိဳင္ျပီး Node C နဲ
KB
႔ Directly Connected မဟုတ္တဲ့ (Node B) ရဲ့ Cost ကိုေတာ့ မသိနိဳင္ေခ်။ ထိုအခါ Dijkstra Algorithm သည္
Node B ရဲ့ Cost ကို ပထမ Node A မွာရွာခဲ့တဲ့ Value ကိုပဲျပန္ယူတယ္။
 Node A သည္ Node C မွတဆင့္ Node D နွင့္ Node E တို႔ကိုသြားတဲ့ Costs ေတြရွာျပီးတဲ့အခါ Dijkstra Algorithm
သည္ Node A မွ က်န္တဲ့ Nodes ေတြျဖစ္တဲ့ Node B , Node C , Node D , Node E တို႔ဆီသြားတဲ့အထဲကမွ ဒုတိ
ယေျမာက္ Cost အနည္းဆံုးျဖစ္တဲ့ Node B ကိုယူတယ္။ ဆိုလိုတာသည္ Node A သည္ Node D နွင့္ Node E တို
႔ဆီသြားရန္ Node B မွျဖတ္သြားမယ့္ လမ္းေၾကာင္းေတြရဲ့ Costs ေတြကိုရွာမွာျဖစ္တယ္။
Calculation Table) ထဲထည့္တယ္။

T C
 A to D via B နဲ႔ A to E via B တို႔ကို ရွာလို႔ရတဲ့ Costs ေတြသည္ A to D via C ရဲ့ Cost နဲ႔ A to E via C တို႔ရဲ့ Costs
ေတြထပ္မ်ားေနခဲ့ရင္ Cost နည္းတဲ့ A to D via C ရဲ့ Cost နဲ႔ A to D via C တို႔ရ့ဲ Cost ကိုပဲျပန္ေရးတယ္ (Dijkstra
 ေနာက္ဆံုး Node A မွ က်န္တဲ့ Nodes တိုင္းကို သြားတဲ့ Lowest Cost ရွိတဲ့ Paths တိုင္းရွိလာျပီဆိုလွ်င္ ၄င္း Paths
ေတြကိုသံုးျပီး Shortest Path Tree တည္ေဆာက္တယ္။
KB
 OSPF Protocol သည္ အလုပ္လုပ္တဲ့အခါမွာ ၄င္း Shortest Path Tree မွာ Connect လုပ္ထားတဲ့ Path လမ္းေၾကာ
င္း အတိုင္းပဲ Route လုပ္ေတာ့တာျဖစ္တယ္။
TC
KB
 Shortest Path Tree နဲ႔ Calculation လုပ္တာေၾကာင့္ OSPF ရဲ့ Dijkstra Algorithm ကို Shortest Path First
(SPF) Algorithm လို႔လဲေခၚတယ္။

Routing Information Base (RIB) (Also called OSPF RIB)
TC
KB
T C
KB
TC
KB

Looking RIB Database
○ Routing Information Base (RIB) ကို Privileged Mode မွာ (show ip ospf rib) Command နဲ႔ၾကည့္လို
႔ရတယ္။
TC
KB
ထဲကိုထည့္တာျဖစ္ျပီး *
C
 *> (Star Sign နဲ႔ Greater Than Sign) ျပထားတဲ့ Routes ေတြကိုပဲ OSPF သည္ Router ရဲ့ Routing Table
T
ခုထဲျပထားရင္၄င္း Route သည္ Best Route ေတာ့ တယ္ ဒါေပမဲ့
မသံုးတဲ့ Route ျဖစ္တယ္။
KB
TC
KB

OSPF Metrics
○ OSPF သည္ Route Decision လုပ္တဲ့အခါမွာ Metric အေနနဲ႔ Cost ကိုအသံုးျပဳတယ္။
TC
○ OSPF မွာအသံုးျပဳတဲ့ Metric (Cost) သည္ Bandwidth ေပၚအေျခခံတဲ့ Measurement Unit ျဖစ္တယ္။
○ OSPF ရဲ့ Cost Calculate လုပ္တဲ့ပံုစံ သည္ RFC 2338 အရသတ္မွတ္ထားတာျဖစ္တယ္။
○ OSPF ရဲ့ Cost ပံုေသနည္းသည္

OSPF Cost = Reference Bandwidth / Interface Bandwidth
KB
Cost = 100 Mbps / 100 Mbps
Cost = 1
 ၄င္းထြက္လာတဲ့ Cost Value တစ္ခုသည္ Route Path ထဲမွာပါဝင္တဲ့ Router တစ္ခုစီရဲ့ Interface တစ္ခုစီ
အတြက္ ျဖစ္တယ္။ ဒါ့ေၾကာင့္ Route Path တစ္ခုသည္ Interfaces 4 ခုကိုျဖတ္သြားရလွ်င္ Cost Values 4 ခု
ေပါင္းမွ ထြက္လာတဲ့ စုစုေပါင္း Cost သည္ အမွန္တကယ္ Route Path တစ္ခုလံုးရဲ့ Cost ျဖစ္တယ္။
Reference Bandwidth
C
○ Reference Bandwidth ဆိုသည္မွာ OSPF Cost ရွာလို႔ရေအာင္ အသံုးျပဳတဲ့ Default Value တစ္ခုျဖစ္တယ္။
○ Reference Bandwidth သည္ Route သြားမယ့္ Link ရဲ့ Speed ကို OSPF Protocol က စံနွဳန္းနဲ႔ ခန္႔မွန္းျပီးယူ
T
ထားတဲ့ Value တစ္ခုျဖစ္တယ္။
○ OSPF Protocol တိုင္းမွာ Automatically Default သတ္မွတ္ထားတဲ့ Reference Bandwidth သည္
KB
100,000,000 bits per second (108 bps) (100 Mbps) ျဖစ္တယ္။ ၄င္း Reference Bandwidth ျဖစ္တဲ့
(100 Mbps) ကိုပဲယူျပီး Cost Calculation လုပ္တာျဖစ္တယ္။
○ Route သြားမယ့္ Link ရဲ့ Actual (Physical) Speed သည္ 10 Mbps or 1 Gbps or 10 Gbps ျဖစ္ေနပါ
ေစ OSPF Protocol မွာ Auto Default Configure လုပ္ထားတဲ့ Reference Bandwidth သည္ 100 Mbps နဲ
႔ပဲ Cost ရွာတယ္။
Interface Bandwidth
TC
○ Interface Bandwidth ကေတာ့ Route လုပ္တဲ့အခါ OSPF Router ကေနထြက္သြားတဲ့ OSPF Router ရဲ့
Packet ထြက္တဲ့ Interface Bandwidth Value ျဖစ္တယ္။
○ Route လုပ္ဖို႔ OSPF Router ရဲ့ 100 Mbps Speed ရွိတဲ့ Interface ကေန Packet စထြက္လာရမွာဆိုလွ်င္ ထို
Route လုပ္တဲ့ Route Path ရဲ့ Cost ကိုတြက္တဲ့အခါမွာ Interface Bandwidth သည္ 100 Mbps နဲ႔တြက္တ
ယ္။
○ OSPF Protocol သည္ Route Paths ေတြရဲ့ Cost ကိုတြက္ခ်က္တဲ့အခါမွာ OSPF Protocol သည္ Router မွာ
KB
ပဲ Run ျပီး Router ကပဲ Routing Decision လုပ္တာေၾကာင့္ Destination တစ္ခုစီသြားတဲ့ Route Path
တစ္ခုရဲ့ Cost ကို Router ကေန စတင္တြက္တယ္။

Route Path Total Cost
○ Route Path သြားတဲ့ Router တစ္လံုးခ်င္းစီကထြက္တဲ့ Cost ေတြကိုရွာတယ္။

○ ေနာက္ဆံုး Router မွ Layer 2 Device Switch ထဲေရာက္သည္အထိ Cost Values ေတြကို ေပါင္းတယ္။
TC
○ ရလာတဲ့ Value သည္ OSPF Route Path (Route) တစ္ခုရဲ့ Cost ျဖစ္တယ္။
 ထြက္လာတဲ့ Total Cost ေတြထဲကမွ Cost အနည္းဆံုး Route Path ကို Best Route အျဖစ္ OSPF က ေရြးခ်
ယ္ အသံုးျပဳတယ္။
KB
OSPF Default Reference Bandwidth Problem
T C
KB
○ ျပသနာသည္ Route သြားမယ့္ Links ေတြရဲ့ Actual Speed ဟာ 100 Mbps (Fast Ethernet) ထပ္ပို ျမန္
ေနတဲ့ Links ေတြျဖစ္ခဲ့မယ္ဆိုရင္ေတာ့ စျပီးျပသနာရွိလာျပီ။
TC
R 1 to R2 Cost = 100 Mbps / 1 Gbps

= 100 / 1000
= 0.1
= 1
KB
 အေရးၾကီးဆံုးအခ်က္သည္ OSPF Cost ေတြကို ကိန္းျပည့္နဲ႔ပဲယူတယ္။ ဘယ္ေတာ့မွ ဒသမ နဲ႔ယူျပီး မတြ

က္ဘူး။ တကယ္လို႔ ဒသမ နဲ႔ထြက္လာရင္လဲ ၄င္း ဒသမ နဲ႔အနီးဆံုးကိန္းျပည့္ကိုယူတယ္။
 (0.1) ဆိုေတာ့ Cost Value 1 လို႔ယူဆတယ္။

OSPF Default Reference Bandwidth Problem
TC
KB
○ OSPF ရဲ့ Route Paths ေတြရဲ့ Cost တြက္ရာမွာအသံုးျပဳတဲ့ Auto Default Reference Bandwidth သည္
နည္းနည္းျပသနာရွိတယ္။
○ OSPF သည္ Default အရ Cost တြက္ရာမွာ "Reference Bandwidth" ကို 100 Mbps အျဖစ္ထားတယ္။ ၄င္
း Value နဲ႔ Cost တြက္ရင္ Route သြားမယ့္ Links ေတြရဲ့ Actual Speed ဟာ 10 Mbps (Ethernet) OR 100
C
Mbps (Fast Ethernet) ျဖစ္ရင္ ျပသနာမရွိဘူး။ Cost Value အမွန္ကို "Reference Bandwidth" Value 100
Mbps နဲ႔ တြက္ထုတ္ေပးနိဳင္တယ္။
○ ဒါေပမဲ့ ျပသနာသည္ Route သြားမယ့္ Links ေတြရဲ့ Actual Speed ဟာ 100 Mbps (Fast Ethernet) ထပ္ပို
T
ျမန္ေနတဲ့ Links ေတြျဖစ္ခဲ့မယ္ဆိုရင္ေတာ့ စျပီးျပသနာရွိလာျပီ။
○ ပံုမွာျပထားသည့္အတိုင္း PC 1 မွ ပို႔လိုက္တဲ့ Packet ကို Router 1 (R1) မွ PC2 ဆီေရာက္ေအာင္ Route လု
ပ္လို႔ရတဲ့ Route Paths (Routes) 2 ခုရွိတယ္။ R 1 to R2 to R3 သြားမွာလား ဒါမွမဟုတ္ R1 to R3 သြားမွာ
KB
လား ဆိုတဲ့ Route Paths (Routes) 2 ခုျဖစ္တယ္။
○ အရင္ဦးစြာ R 1 to R2 to R3 လမ္းေၾကာင္းရဲ့ Cost ကိုရွာတယ္။ OSPF Default "Reference Bandwidth"
ျဖစ္တဲ့ 100 Mbps ကို "Interface Bandwidth" ျဖစ္တဲ့ 1 Gbps နဲ႔စားတယ္။ (Router ရဲ့ Link Speed သည္
1 Gbps ျဖစ္တာေၾကာင့္ Router ရဲ့ Interface Speed သည္လည္း 1 Gbps ျဖစ္တယ္။)
R 1 to R2 Cost = 100 Mbps / 1 Gbps

= 100 / 1000
= 0.1
TC
= 1
○ စားလိုက္တဲ့အခါ "Reference Bandwidth" သည္ "Interface Bandwidth" ထပ္ငယ္ေနတာေၾကာင့္ R1 to

R2 Cost Value သည္ (0.1) ဆိုျပီး ဒသမ နဲ႔ထြက္လာတယ္။
 အေရးၾကီးဆံုးအခ်က္သည္ OSPF Cost ေတြကို ကိန္းျပည့္နဲ႔ပဲယူတယ္။ ဘယ္ေတာ့မွ ဒသမ နဲ႔ယူျပီး မတြ
က္ဘူး။ တကယ္လို႔ ဒသမ နဲ႔ထြက္လာရင္လဲ ၄င္း ဒသမ နဲ႔အနီးဆံုးကိန္းျပည့္ကိုယူတယ္။
KB
 (0.1) ဆိုေတာ့ Cost Value 1 လို႔ယူဆတယ္။

OSPF Reference Default Link Cost
TC
KB
T C
KB
TC
KB

OSPF Maximum Bandwidth Limit
• ဒါ့ေၾကာင့္ OSPF Cost Value ေၾကာင့္ Route Path ေရြးတာမမွားေအာင္ ကြ်န္ေတာ္တို႔သည္ မိမိအသံုးျပဳထား
တဲ့ Network Bandwidth (Link Bandwidth or Interface Bandwidth) 10 Mbps or 100 Mbps or 1 Gbps
TC
or 10 Gbps တို႔ေပၚမူတည္ျပီး OSPF Protocol ရဲ့ Default "Reference Bandwidth" ကို ေျပာင္းထားသင္
့တယ္။
• "Reference Bandwidth" ေၾကာင့္ OSPF Route Path Selection ျပသနာမျဖစ္ရန္ ပံုေသနည္းမွာ "Reference
Bandwidth" ကို Maximum Reference Bandwidth ထားျခင္းပင္ျဖစ္တယ္။
KB
• OSPF Protocol တစ္ခုမွာေပးလို႔ရတဲ့ Maximum Reference Bandwidth သည္ 4 Tbps (4 Tera bits per
second) ျဖစ္တယ္။ ဒါ့ေၾကာင့္ေပးခ်င္ရင္ Maximum Reference Bandwidth ကို 4 Tbps အထိေပးနိဳင္တယ္။
• (auto-cost reference-bandwidth value) Command မွာ value ေနရာမွာ Network Feature Plan အတြက္
ေကာင္းေအာင္ "Reference Bandwidth" အား အျမင့္ဆံုးျဖစ္တဲ့ 4 tbps အထိတန္ဖိုး ေပးလို႔ရတယ္။သို႔ေသာ
္လည္း OSPF Default Reference Bandwidth သတ္မွတ္ေပးတဲ့ေနရာမွာေနာက္ထပ္ ျပသနာ တစ္ခုရွိေသး
တယ္။
• ၄င္းျပသနာကေတာ့ တြက္ထုတ္လိုက္လို႔ထက
ုး OSPF Protocol က Support လုပ္တာျဖစ္တယ္။
C
ြ ္လာတဲ့ OSPF ရဲ့ Cost Value သည္ 16 bits အထိပဲ အမ်ားဆံ
• Cost မွာထြက္တဲ့ ကိန္းတန္ဖိုးသည္ 16 bits ဆိုေတာ့ ၄င္းသည္ 2 Power 16 = 65,536 Value ပဲရွိတယ္။ ဒါ့
T
ေၾကာင့္ တြက္ထုတ္လိုက္လို႔ထြက္လာတဲ့ Cost ရဲ့ ကိန္း သည္ အမ်ားဆံုး Maximum 65,536 ျဖစ္တယ္။ (2
Power 16 သည္ 65,536 ျဖစ္ေသာ္လည္း OSPF Cost Value သည္ ဘယ္ေသာအခါမွ 0 ျဖစ္နိဳင္တဲ့အတြက္
KB
65,536 ထဲကေန 0 Value အတြက္ေနရာ 1 နွဳတ္ေတာ့ OSPF ရဲ့ Maximum Value သည္ 65,535 ျဖစ္လာ
တယ္။)
• OSPF Protocol အလုပ္လုပ္တဲ့ အျမင့္ဆံုး OSPF Cost သည္ 1 to 65,535 အတြင္းပဲျဖစ္နိဳင္တယ္။ အမ်ားဆံ
ုး Maximum 65,535 ထပ္ေက်ာ္ျပီး ထြက္လာတဲ့ OSPF Cost Calculation Value ေတြကို OSPF သည္
Maximum Cost Value ျဖစ္တဲ့ 65,535 လို႔ပဲယူတယ္။
• ဒါ့ေၾကာင့္ Default Reference Bandwidth ေပးတဲ့ေနရာမွာ 4 Tbps အထိေပးလို႔ရတယ္ဆိုေသာ္လည္း မိမိ

TC
သာ Configure လုပ္ထားေပမယ့္ OSPF Protocol သည္ 65535 Mbps လို႔ပဲယူဆျပီးအလုပ္လုပ္တယ္။

KB

Reference Bandwidth Value Range Problem
○ "Reference Bandwidth" ကို Maximum Value ေပးမိတဲ့အခါ မိမိ Network ထဲမွာ အရမ္းကို Speed နည္းတဲ့
64 Kbps တို႔ 128 Kbps တို႔ရွိတဲ့ Links ေတြပါခဲ့ျပီဆိုလွ်င္ ၄င္း Speed နည္းတဲ့ Links ေတြရဲ့ Interface
TC
Bandwidth ေတြသည္ အနည္းငယ္ကြာေသာ္လည္း OSPF Calculation လုပ္လိုက္တဲ့အခါ ၄င္းတို႔ရဲ့ Cost
Value ထြက္လာတာသည္ OSPF အမ်ားဆံုးလက္ခံနိဳင္တဲ့ Maximum Cost Value ျဖစ္တဲ့ 65,535 Value ကို
ေက်ာ္လြန္ ေနတာေၾကာင့္ OSPF သည္ ထို Links 2 ခုရဲ့ Speed ကို 65,535 စီလို႔ပဲယူဆတယ္။
○ ထိုအခါ Maximum "Reference Bandwidth" Value ေၾကာင့္ Speed မတူတဲ့ 64 Kbps နဲ႔ 128 Kbps တို႔ရဲ့
Cost သည္ Same Cost အျဖစ္ထြက္လာတယ္။
KB
○ Example If
 Manual Configure "Reference Bandwidth" is 10 Gbps
 R1 to R3 "Interface Bandwidth" is 64 Kbps
 R1 to R2 "Interface Bandwidth" is 128 Kbps
R1 to R3 = 10 Gbps / 64 Kbps
= 10,000,000,000 bps / 64,000 bps
= 156,250 (Invalid)
R1 to R3 = 65,535 (OSPF Decision)
 R1 to R3 Route Path Cost = 65,535 ျဖစ္တယ္။

T C
 R1 to R3 Cost မွာ "Reference Bandwidth" သည္ Too Large ျဖစ္ေနျပီး တြက္တဲ့ "Interface
KB
Bandwidth" ေတြသည္ Too Small ျဖစ္ေနတဲ့အတြက္ ထြက္လာတဲ့ Cost Value သည္ 156,250 ျဖစ္
ေနတယ္။ ၄င္း 156,250 သည္ OSPF Protocol ရဲ့အမ်ားဆံုးလက္ခံနိဳင္တဲ့ Cost Value ျဖစ္တဲ့ 65,535
ထပ္မ်ားေနတာေၾကာင့္ Invalid ျဖစ္တယ္။ ဒါ့ေၾကာင့္ OSPF Protocol သည္ ၄င္း Invalid ျဖစ္တဲ့ Cost
Value အား Maximum Cost Value ျဖစ္တဲ့ 65,535 လို႔ပဲယူတယ္။
R1 to R2 = 10 Gbps / 128 Kbps

= 10,000,000,000 bps / 128,000 bps
TC
= 78,125 (Invalid)
R1 to R2 = 65,535 (OSPF Decision)
 R1 to R2 Route Path Cost = 65,535 ျဖစ္လာတယ္။

 "R1 to R3 Route Path" Cost နဲ႔ "R1 to R2 Route Path" Cost တို႔ဟာ 65,535 ျဖစ္တာခ်င္း တူညီ
ေနတာ ေၾကာင့္ OSPF Protocol သည္ Actual (Link Bandwidth) Speed မတူတဲ့ R1 to R3 (64Kbps)
နဲ႔ R1 to R2 (128Kbps) တို႔ကို Cost အတူတူရွိတဲ့ Route Paths ေတြအျဖစ္သာယူဆျပီး အလုပ္လုပ္
KB
ေတာ့တယ္။

Looking OSPF Default Reference Bandwidth
○ Router တစ္လံုးမွာ Run ေနတဲ့ OSPF Protocol အသံုးျပဳေနတဲ့ Reference Bandwidth အားၾကည့္ခ်င္ရင္
(show ip ospf) Command နဲ႔ OR (show ip protocols) Command နဲ႔ၾကည့္နိဳင္တယ္။
TC
KB
Changing OSPF Default Reference Bandwidth
○ OSPF ရဲ့ Default "Reference Bandwidth" ကို Manually ေျပာင္းခ်င္ရင္ OSPF Router သည္ "Global
Configuration Mode" ထဲမွာ OR "Routing Protocol Configuration Mode" ထဲမွာ
(auto-cost reference-bandwidth value) Command နဲ႔သတ္မွတ္ေပးတာျဖစ္တယ္။

T C
○ Default Reference Bandwidth ေပးတဲ့အခါမွာ "value" မွာ မိမိသတ္မွတ္ေစခ်င္တဲ့ Bandwidth Value
KB
ထည့္ရမွာျဖစ္တယ္။ value" ရဲ့ Unit သည္ Mbps (Mega bit per second) ျဖစ္တယ္။
○ ဒါ့ေၾကာင့္ 100 Mbps ေပးခ်င္ရင္ "auto-cost reference-bandwidth 100" လို႔ပဲေပးတယ္။ 1 Gbps ေပးခ်င္ရ
င္ "auto-cost reference-bandwidth 1000" လို႔ေပးတယ္။
○ "auto-cost reference-bandwidth 10000" လို႔ေပးရင္ 10 Gbps ျဖစ္တယ္။
○ OSPF Area တစ္ခုအတြင္းမွာပါဝင္တဲ့ OSPF Routers တိုင္းကိုပါ လိုက္ေျပာင္းေပးရတာျဖစ္တယ္။ ဒါမွသာ မိ

TC
မိ တို႔ေျပာင္းလိုက္တဲ့ Default Reference Bandwidth အတိုင္းအလုပ္လုပ္မွာျဖစ္တယ္။

KB

Viewing Interface Bandwidth
○ Router ရဲ့ Interface မွာ Currently ျဖစ္ေပၚေနတဲ့ Interface Bandwidth Value ကိုၾကည့္ခ်င္ရင္ (show
interface "InterfaceName") Command နဲ႔ၾကည့္လို႔ရတယ္။
TC
KB
 Bandwidth Value အား kilo bit per second (Kbit) နဲ႔ျပတာျဖစ္တ့ဲအတြက္ bit per second (bps) နဲ႔ျ
မင္ခ်င္ရင္ ေနာက္မွာ 000 ထည့္ေပး။ (100 000 Kbit = 100 000 000 bit = 100 Mbps)
Changing Interface Bandwidth
○ OSPF Metric (Cost) တြက္ရာမွာအသံုးျပဳတဲ့ Interface Bandwidth သည္ Physical Interface Type
T C
(Ethernet , Serial , ..) တို႔ေပၚမူတည္ျပီး Cisco IOS က Auto Assign လုပ္တဲ့ Bandwidth ျဖစ္တယ္။
○ ထိုသို႔မဟုတ္ဘဲ OSPF Metric (Cost) Value ေျပာင္းေအာင္ မိမိဘာသာ Interface ရဲ့ Bandwidth ကို သတ္မွ
တ္ေပးခ်င္ရင္ Interface Configuration Mode ထဲဝင္ျပီး (bandwidth "Value") Command နဲ႔သတ္မွတ္ေပးလို
႔ရတယ္။
KB
(bandwidth "Value kbps")
Changing or Reset to Default Interface Bandwidth
○ OSPF Interface တစ္ခုရဲ့ Bandwidth Value အား Customize လုပ္ထားရာကေန Cisco IOS သတ္မွတ္တဲ့
TC
Default Bandwidth သို႔ျပန္ေျပာင္းခ်င္ရင္ ၄င္း Interface Configuration Mode မွာ (default bandwidth)
Command ရိုက္ေပး။
(default bandwidth)
KB

Configuring OSPF Cost Manually
○ ပံုမွန္အားျဖင့္ OSPF Interface တစ္ခုရဲ့ Cost သည္ OSPF Protocol ရဲ့ Default Cost Equation မွာထည့္ျပီး
Auto Assign လုပ္ေပးတာျဖစ္တယ္။
TC
○ ထိုသို႔မဟုတ္ဘဲ မိမိက Network Link နွစ္ခုအား Load Balancing လုပ္ခ်င္တယ္။ ၄င္း Links နွစ္ခုကလဲ
Cable Bandwidth ေတြမတူညီၾကဘူးဆိုလွ်င္ ၄င္း Links ေတြခ်ိတ္ထားတဲ့ Interfaces (Interfaces 4 ခုစလံ
ုးမွာ) ေတြမွာ တူညီတဲ့ OSPF Cost Value ေတြအား Manual Assign လုပ္ေပးလိုက္ရင္ရတယ္။
○ OSPF Interface တစ္ခုအား Automatic Cost Value မတြက္ခိုင္းဘဲ မိမိ Assign လုပ္ခ်င္တဲ့ Cost Value ေပး
KB
ခ်င္ရင္ ေျပာင္းမယ့္ Interface ရဲ့ Interface Configuration Mode ထဲမွာ
(ip ospf cost "Value") Command နဲ႔သတ္မွတ္ေပးနိဳင္တယ္။
C
○ OSPF မွာ Assign လုပ္လို႔ရတဲ့ Cost Range သည္ 1 to 65,535 အထိပဲရွိတယ္။
T
KB
TC
KB

OSPF Load Balancing
○ OSPF Protocol သည္ တူညီတဲ့ Destination တစ္ခုစီသြားဖို႔ တစ္ခုထပ္ပိုေသာ Route Paths ေတြရွိလာျပီး ၄င္
း Route Paths ေတြရဲ့ Metric (Cost) Value သည္ တူညီေနခဲ့မယ္ဆိုရင္ ၄င္း Route Paths ေတြအားလံုးကို
TC
Routing Table ထဲထည့္ျပီး Load Balancing လုပ္ေပးတယ္။
○ Route Paths ဘယ္နွခုအထိ တစ္ခ်ိန္ထဲမွာ တျပိဳင္နက္အသံုးျပဳျပီး Routing လုပ္နိဳင္လဲကိုသိခ်င္ရင္ Privileged
Mode မွာ (show ip protocols) Command ရိုက္ျပီး "Maximum Path" Field မွာၾကည့္။
KB
T
Modifying Load Balancing Paths
C
○ Default သည္ 4 ျဖစ္တယ္။ Route Paths 4 ခုလံုးကို တျပိဳင္နက္ Load Balancing လုပ္နိဳင္တယ္။
○ OSPF သည္ တူညီတဲ့ Metric (Cost) Value ရွိတဲ့ Route Paths 4 ခုအထိ Load Balancing လုပ္တယ္။ ဒါ့
KB
ေၾကာင့္ ၄င္း Route Paths 4 ခုသည္ ျပိဳင္တူလက္ရွိအလုပ္လုပ္ေနတယ္။

○ ထိုသို႔မဟုတ္ဘဲ မိမိသည္ Load Balancing 4 ခုမလုပ္ေစခ်င္တဲ့အျပင္ က်န္တဲ့ တူညီတဲ့ Metric (Cost) Value ရွိ
တဲ့ Route Paths 3 ခုကိုလဲ Backup Route Paths ေတြအျဖစ္ထားခ်င္ရင္ေတာ့ လုပ္နိဳင္တဲ့နည္း 2 နည္းရွိ
တယ္။
1. OSPF ရဲ့ Maximum Load Balancing Route Paths အေရအတြက္ကို ျပင္ေပးလိုက္ရမယ္။

 Maximum Load Balancing Route Paths အေရအတြက္ျဖစ္တဲ့ "Maximum Path:" ကို 4 ကေ
န 1 လို႔ထားလုိက္ရင္ က်န္တဲ့ Metric (Cost) Value တူတဲ့ Route Paths 3 ခုသည္ Automatic
TC
Backup Routes ေတြအျဖစ္ေျပာင္းသြားတယ္။
2. Route Paths ေတြကိုမတူညီတဲ့ Metric (Cost) Value ျဖစ္ေအာင္ Interface ေတြရဲ့ Interface
Bandwidth အားျပင္ေပးလိုက္ရတယ္။
 Default Interface Bandwidth အား Modify လုပ္ေပးလိုက္ျခင္းပဲျဖစ္တယ္။
KB
 ဥပမာ Ethernet ရဲ့ Default Bandwidth 100,000,000 bits per second (100 Mbps) အား ပို
မ်ားတဲ့ Value ေပးလိုက္ျခင္းပင္ျဖစ္သည္။ ေျပာင္းခ်င္တဲ့ Interface Configuration Mode ထဲမွာ
(bandwidth "Value") Command နဲ႔ေျပာင္းေပးျခင္းျဖစ္တယ္။

OSPF Configuration
○ Router တစ္လံုးမွာ OSPF Configuration လုပ္ရမည့္အဆင့္ေတြသည္
TC
1. OSPF Protocol အား Enabled လုပ္ရင္းနဲ႔ Process ID သတ္မွတ္ေပး
2. OSPF Protocol Run ရမည့္ Router ရဲ့ Interfaces ေတြကိုေၾကညာေပး။ (Interfaces ေတြကို
ေၾကညာေပးတယ္ဆိုတာ Interfaces ေတြမွာ Assign လုပ္ထားတဲ့ IP Address ပါတဲ့ Network
IP Address အား OSPF Protocol မွာေၾကညာေပးရတာျဖစ္တယ္။)
a. OSPF Process (OSPF Configuration Mode
KB
) network Command Running Interface
b. Router Run Interface (Interface

Configuration Mode ) ip ospf Command OSPF Process
OSPF Enabled

Interface Process Interface
Configuring OSPF
IP Address OSPF Process
Secondary IP Address
(Running)
T C Interface
OSPF Process
KB
 In Global Mode,
Router(config)#router ospf "OSPF Process ID"
Router(config)#router ospf 1
R1(config-router)#network "NetworkIP" "NetworkIPWildcardMask" area "AreaID"

R1(config-router)#network 192.168.1.0 0.0.0.255 area 0
R1(config-router)#network 192.168.1.1 0.0.0.0 area 0
 Network 1 ခုေၾကညာရင္ တစ္ခါတည္းေနာက္မွာ ၄င္း Network အလုပ္လုပ္မယ့္ OSPF Area ID ပါ

TC
ထည့္ေပးရတယ္။ ဘာလို႔လဲဆိုရင္ OSPF သည္ Process ID တစ္ခုထဲမွာ မတူညီတဲ့ Networks ေတြ နဲ

႔ မတူညီတဲ့ Areas ေတြကို ျပိဳင္တူအလုပ္လုပ္ေပးနိဳင္လို႔ျဖစ္တယ္။
 In Interface Mode,
 Enabled Router Interface (Interface Configuration Mode)
KB
R1(config)#int e0/0
R1(config-if)#ip ospf <process-id> area <area-id>
R1(config-if)#ip ospf 1 area 0

TC
KB
T C
KB
TC
KB

Configuring OSPF on All Interfaces
○ လက္ရွိ Router မွာရွိရွိသမွ် Interfaces တိုင္း Up Interfaces

OSPF Protocol Run ေၾကညာေစ ခ်င္ရင္
TC
Router(config-router)#network 0.0.0.0 255.255.255.255 area 0
Command နဲ႔ေၾကညာေပးလို႔ရတယ္။
Router(config-router)#network 0.0.0.0 0.0.0.0 area 0
KB
 EIGRP network 0.0.0.0 0.0.0.0 OSPF network
0.0.0.0 0.0.0.0 RAM 0.0.0.0 255.255.255.255
T C
KB
TC
KB

Looking OSPF Protocol Running Interfaces
○ လက္ရွိ Router မွာ OSPF Protocol Run ေနတဲ့ Interfaces ေတြနဲ႔ ၄င္းတို႔ရဲ့ IP Address (Interface IP) တို႔ကို
ၾကည့္ခ်င္ရင္ Privileged Mode မွာ (show ip ospf interface brief) Command နဲ႔ၾကည့္လို႔ရတယ္။
TC
KB
○ ၄င္းထဲမွာျမင္ရတဲ့ Interfaces ေတြအားလံုးသည္ လက္ရွိ Router မွာ OSPF Protocol Run ေနတဲ့ Interfaces
ေတြကိုပဲျပေပးတာျဖစ္တယ္။
○ PID မွာ ၄င္း Interface တစ္ခုစီမွာ Run ေနတဲ့ OSPF Process ID ေတြကိုပါျပေပးတယ္။
T C
KB
TC
KB

Looking OSPF Protocol Running Specific Interface
○ OSPF Protocol အလုပ္လုပ္ေနတဲ့ Specific Interface တစ္ခုရဲ့ Information ကိုၾကည့္ခ်င္ရင္ Privileged

Mode မွာ (show ip ospf interface "InterfaceName") Command နဲ႔ၾကည့္လို႔ရတယ္။
TC
KB
T
 Interface IP Address
C
 လက္ရွိ Interface ရဲ့အလုပ္လုပ္ေဆာင္ေနတဲ့ State
 OSPF Area Assign

 Process ID
KB
 Router ID
 Network Type
 Cost (လက္ရွိ Interface Cost)
 Priority
 DR/BDR Information
 Hello and Dead Interval
 Adjacent Neighbor Information
TC
○ တကယ္လို႔ (show ip ospf interface "InterfaceName") Command နဲ႔ၾကည့္လိုက္လို႔ ၾကည့္တဲ့ Interface

သည္ OSPF Protocol အလုပ္မလုပ္တဲ့ Interface ျဖစ္ေနမယ္ဆိုရင္
"%OSPF: OSPF not enabled on ...Interface" ဆိုျပီးလာျပလိမ့္မယ္။
KB

Looking OSPF Routing Table
TC
KB
○ အထက္ပါ Routing Table ထဲက OSPF Route Path တစ္ခုမွာ
 "O" သည္ OSPF ေၾကာင့္ျဖစ္ေပၚလာတဲ့ OSPF Dynamic Route Path ျဖစ္ေၾကာင္းေျပာတာျဖစ္တယ္။
 192.168.10.0/24 သည္ Destination Network IP ျဖစ္တယ္။
 ေရွ႔က 110 သည္ OSPF ရဲ့ Administrative Distance (AD) Value ျဖစ္တယ္။
C
 ေနာက္က 65 သည္ OSPF ရဲ့ Shortest Path First (SPF) Calculation ေၾကာင့္ျဖစ္ေပၚလာတဲ့ လက္ရွိ
Route Path ရဲ့ OSPF Cost / OSPF Metric Value ျဖစ္တယ္။
T
 1d17h သည္ လက္ရွိ Route Path ရဲ့ Up time ျဖစ္တယ္။
KB
Looking OSPF Routes Only in Routing Table
○ အဲ့လိုမဟုတ္ဘဲ ကိုယ္က OSPF Protocol ေၾကာင့္ Routing Table ထဲမွာ ျဖစ္ေပၚေနတဲ့ Routes ေတြကိုပဲ ေရြး
ၾကည့္ခ်င္ရင္ (show ip route ospf) Command သံုးျပီးၾကည့္ရတာျဖစ္တယ္။
TC
KB

Looking OSPF Protocol Running Network
○ (show ip protocols) Command သည္လည္းလက္ရွိ Router မွာ Run ေနတဲ့ Routing Protocol နဲ႔ ၄င္
း Routing Protocol အလုပ္လုပ္ေပးေနတဲ့ Network (Network IP Address) ေတြကိုပါျပေပးတယ္။
TC
KB
T C
KB
○ ၄င္းထဲမွာ
 "Routing Protocol is .. " မွာ OSPF Process ID အားျပေပးတယ္။
 "Router ID … " မွာ လက္ရွိ Router ရဲ့ Router ID အားျပေပးတယ္။
 "Maximum Path : 4 " သည္ တူညီတဲ့ Destination Network ဆီသြားဖို႔ OSPF Metrics (Cost) Value
တူညီတဲ့ Route Paths ေတြရွိလာခဲ့ရင္ OSPF သည္ Route Paths 4 ခုအထိ Load Balancing လုပ္နိဳ
င္တယ္လို႔ျပတာျဖစ္တယ္။
TC
 "Routing for Networks .. " မွာ လက္ရွိ OSPF Router Route လုပ္ေပးေနတဲ့ Networks ေတြျပေပး
တယ္။
 "Routing Information Sources .. " မွာ လက္ရွိ OSPF Router နဲ႔ခ်ိတ္ထားတဲ့ Neighbor Routers
ေတြရဲ့ Interface IP Address ေတြျပေပးတယ္။ Next Hop Address လို႔လဲေျပာလို႔ရတယ္။
KB
 "Distance .. " မွာ Administrative Distance (AD) Value အားျပေပးတယ္။

Looking All OSPF Processes Information
○ OSPF Router တစ္လံုးမွာ Run ေနတဲ့ OSPF Processes ေတြအားလံုးရဲ့ Information ေတြကိုၾကည့္ခ်င္ရင္
Privileged Mode မွာ (show ip ospf) Command နဲ႔ၾကည့္လို႔ရတယ္။
TC
KB
T C
KB
TC
KB

Configuring OSPF Passive Interface
TC
KB
○ OSPF အလုပ္လုပ္ေနတဲ့ Interface သည္ OSPF Routers ေတြမရွိတဲ့ LAN Network နဲ႔ ေျပာင္းခ်ိတ္တဲ့
Interface ျဖစ္ပါက ၄င္း Interface ကေန Routing Update ေတြ Send / Receive မလုပ္ေစခ်င္ရင္ Passive
Interface အျဖစ္ေၾကညာေပးရတယ္။
C
 (passive-interface default) Command make all ospf router interfaces to passive state.
 (no passive interface e0/0) Command make specific ospf router interface to non passive state.
T
KB
TC
KB

OSPF Authentication
• OSPF Authentication Type
TC
1. Plain Text (Password Clear Text)
2. MD5 (Password Hash)
3. SHA
Plain Text Authentication in Specific Interface
KB
Router(config)#int e0/0
Router(config-if)#ip ospf authentication (Authentication Enabled, Default Type = Plain Text)
Router(config-if)#ip ospf authentication-key cisco
MD5 Authentication in Specific Interface
C
Router(config-if)#ip ospf authentication message-digest (Authentication Method Type Enabled)
Router(config-if)#ip ospf authentication-key 1 md5 cisco
T
MD5 Authentication in All Interfaces
KB
Router(config)#router ospf 10
Router(config-router)#area 0 authentication message-digest (Authentication Method in All Interfaces)
Router(config-if)#ip ospf authentication-key 1 md5 cisco
SHA Authentication
TC
Router(config)#key chain RoutingKey

Router(config-keychain)#key 1
Router(config-keychain-key)#key-string cisco
Router(config-keychain-key)#cryptographic-algorithm hmac-sha-256
Router(config-if)#ip ospf authentication key-chain RoutingKey
KB

Verifying Password Authentication Enable or Disable
○ OSPF Router တစ္လံုးရဲ့ Interface မွာ Neighbor Authentication လုပ္ထားလား မလုပ္ထားလား သိခ်င္ရင္
Privileged Mode မွာ (show ip ospf interface "InterfaceName") Commmand ရိုက္ၾကည့္။
TC
○ ေအာက္ဆံုးမွာ "… Password authentication enabled" လို႔ျပရင္ ၄င္း Interface မွာ Neighbor
Authentication Enabled လုပ္ထားတယ္။
KB
Configuring Default Route in OSPF
 Edge Router
T C
Default Route Configured
1. Router မွာ Default Route ထည့္ျပီး Default Route အား Shared ေပးဖို႔ ေၾကညာေပးျခင္း။
KB
2. Default Route Configure လုပ္ျပီးေနာက္ Router ရဲ့ Routing Table ထဲကို ဝင္ၾကည့္လိုက္တဲ့
အခါ Default Route အား Route Path တစ္ခုအျဖစ္ ရယူထားေၾကာင္းေတြ႔ရတယ္။
TC
KB
 (default-information originate always) 'always' Keyword Router Routing Table

Default Route Default Route

TC
KB
T
Internal Routes Summarization
C
KB
ABR_Router(config)#router ospf 10
ABR_Router(config-router)#area 0 range 192.168.0.0 255.255.252.0
External Routes Summarization
ASBR_Router(config)#router ospf 10
ABR_Router(config-router)#summary-address 192.168.0.0 255.255.252.0
TC
KB

OSPF Debugging
Router#debug ip ospf packet

Router#debug ip ospf hello
TC
Router#debug ip ospf adj
Router#debug ip ospf events
Router#undebug all
KB
T C
KB
TC
KB

OSPF Version 3
○ IPv6 Network မွာ OSPF သံုးခ်င္ရင္ OSPF Version 3 ကိုအသံုးျပဳတယ္။ IPv4 Routing Protocol ျဖစ္တဲ့
OSPFv1 နဲဲ႔ OSPFv2 တို႔နဲ႔အကုန္အတူတူပဲ။
TC
○ မတူတာသည္ OSPFv3 မွာ Route ID သည္ OSPFv1 နဲ႔ OSPFv2 တို႔မွာလို Highest IP သည္ Router ID
ျဖစ္လာတာမဟုတ္ဘဲ (Automatic Router ID Selection and Assign လုပ္တာမဟုတ္ဘဲ) မိမိကုိယ္တိုင္
Manually နည္းျဖင့္ Router ID သတ္မွတ္ေပးရတယ္။ Manually Assign မလုပ္ေပးရင္ Router ID မရွိဘူး။
Router ID ကိုလဲ IPv4 RID ပဲအသံုးျပဳတယ္။ 32 bits Router ID ကိုပဲအသံုးျပဳတယ္။
KB
○ OSPFv3 သည္ နဂို OSPFv1 , OSPFv2 တို႔နဲ႔မတူတဲ့ဘဲ အပိုပါလာတဲ့ ပိုေကာင္းတဲ့အခ်က္သည္ OSPFv3 အသံ
ုးျပဳတဲ့ Packet Header ပဲျဖစ္တယ္။
○ OSPFv1 နဲ႔ OSPFv2 တို႔မွာ IP Address Information သည္ Packet Header ထဲမွာပါဝင္ေပမဲ့ OSPFv3 မွာ
ေတာ့ IP Address Information ကို Packet Header ထဲ
ဒါ့ေၾကာင့္ OSPFv3 သည္ Network Layer Protocol အမ်ားအျပားနဲ႔ Compatible ျဖစ္သြားတယ္။
C
○ OSPF v3 Protocol သည္ Neighbor Routers ေတြအခ်င္းခ်င္း Communication လုပ္တဲ့အခါ Unicast IPv6
Address ေတြအသံုးမျပဳဘဲ Link Local Address ေတြနဲ႔သာ အခ်င္းခ်င္း Communication လုပ္ၾကတယ္။
○ Hello Packets ေတြ Send လုပ္ဖို႔ကို IPv6 Multicast IP Address ျဖစ္တဲ့ FF02::5 နဲ႔ FF02::6 တို႔ကိုအသံုးျပဳ
T
တယ္။ Normal (Primary & Secondary) OSPF Routers ေတြအခ်င္းခ်င္းဆိုရင္ FF02::5 ကေန Multicast
Hello Packets ေတြေပးပို႔ျပီး Designated Router နဲ႔ အျခား OSPF Routers ေတြနဲ႔ ေပးပို႔တဲ့အခါမွာေတာ့
KB
FF02::6 အားအသံုးျပဳတယ္။
OSPFv3 Brief Configuration

TC
KB

OSPFv3 Neighborship Requirements
TC
KB
T C
KB
TC
KB

Configuring OSPF v3
TC
KB
1. Router မွာ OSPFv3 IPv6 Routing ကို Global Configuration Mode ကေန Enable လုပ္ေပး။ (OSPFv3
အား Router မွာ Enabled လုပ္တာျဖစ္တယ္။)
T C
Corp(config)#ipv6 unicast-routing
2. IPv6 Packets ေတြ Routing (Forwarding) လုပ္ရာတြင္ျမန္ဆန္ေစရန္ Cisco ရဲ့ Cisco Expert Forwarding
(CEF) ကိုပါတပါတည္း Enable လုပ္ခုိင္းလို႔ရတယ္။
KB
Corp(config)#ipv6 cef
3. OSPFv3 အသံုးျပဳမယ့္ (OSPFv3 ရဲ့ Routing Process မွာပါဝင္မယ္)့ Router ရဲ့ Interface ထဲကို Interface
Configuration Mode နဲ႔ဝင္။
Corp(config)#int fa 0/0
TC
4. "Interface Configuration Mode" ထဲေရာက္သြားျပီဆိုမွ OSPF Process ID နဲ႔ Area ID တို႔ေပးျပီး တခါတည္
းလက္ရွိ Interface အား OSPFv3 Run ခိုင္းလိုက္။ (တနည္းအားျဖင့္ OSPFv3 အား လက္ရွိ Interface ရွိတဲ့
Subnet (Network) အား Routing လုပ္ေပးပါလို႔ေၾကညာလိုက္ျခင္းျဖစ္တယ္။)
Corp(config-if)#ipv6 ospf "ProcessID" area "AreaID"

KB
Corp(config-if)#ipv6 ospf 1 area 0 (ipv6 ospf 1 area 0.0.0.0)

Configuring IPv6 OSPFv3 Router ID
○ OSPFv3 Router မွာ Router ID သတ္မွတ္ေပးခ်င္ရင္ IPv6 Routing Engine Mode ထဲမွာပဲ သတ္မွတ္ေပး
ရတာျဖစ္တယ္။
TC
1. ဒါ့ေၾကာင့္ Global Configuration Mode ထဲကေန (ipv6 router ospf "ProcessID") Command ရိုက္ျပီး
IPv6 Routing Engine Mode ထဲကိုဝင္။
2. IPv6 Routing Engine Mode ထဲကိုေရာက္သြားမွ (router id "IPv4Address") နဲ႔ Router ID ေၾကညာေပး
ရတာျဖစ္တယ္။
KB
 IPv6 OSPFv3 Configuration လုပ္တဲ့ေနရာမွာအေရးၾကီးမွတ္စရာသည္ IPv6 Routing လုပ္မယ့္ Router မွာ
IPv4 Addresses ေတြဘာမွ Assign မလုပ္ထားရင္ IPv4 OSPFv2 မွာလို Router ID သည္ Auto ျဖစ္ေပၚမွာ
မဟုတ္ေပ။ ဒါ့ေၾကာင့္ Router မွာ IPv4 IP Address မရွိရင္ IPv6 Routing အတြက္ Router အား Manually
နည္းျဖင့္ Router ID ထည့္ေပးရတယ္။
OSPFv3 Reference Bandwidth Configuration

T C
1. OSPFv3 အား Reference Bandwidth Configure လုုပ္ခ်င္ရင္ေတာ့ OSPFv3 ရဲ့ Routing Protocol
Configuration Mode ထဲဝင္ျပီး Configure လုပ္မွရတယ္။ OSPFv3 ရဲ့ Routing Protocol Configuration
Mode ထဲကို "Global Configuration Mode" မွာ (router ospfv3 "ProcessID") Command ရိုက္ျပီးဝင္လို
KB
႔ရတယ္။
R1(config)#router ospfv3 1
2. OSPFv3 Routing Protocol Configuration Mode ထဲေရာက္သြားျပီဆိုမွ (auto-cost reference-bandwidth

value) Command နဲ႔ Reference Bandwidth သတ္မွတ္ေပးရတာျဖစ္တယ္။
R1(config-router)#auto-cost reference-bandwidth 10000

TC
OSPFv3 Passive Interface Configuration
○ End Nodes ေတြျဖစ္တဲ့ PCs ေတြ Switches ေတြဆီ OSPFv3 ရဲ့ Hello Packets ေတြ Security Reasons နဲ
႔ Traffic Loading Reasons ေတြအရ မပို႔ေစခ်င္ရင္လဲ "OSPFv3 Routing Protocol Configuration" Mode
ထဲက မွတဆင့္သာဝင္ျပီးသတ္မွတ္ေပးလို႔ရတယ္။
KB
R1(config)#router ospfv3 1
R1(config-router)#passive-interface fa 0/0

Looking IPv6 Routing Protocol
○ Router မွာ Run ေနတဲ့ IPv6 Routing Protocols ေတြရဲ့ Information ေတြကိုၾကည့္ခ်င္ရင္ Privileged
Mode မွာပဲ (show ipv6 protocol) or (show ipv6 protocols) Command နဲ႔ၾကည့္တယ္။
TC
 ထူးထူးျခားျခားမွတ္ထားရန္မွာ IPv6 Network အတြက္ OSPFv3 ကိုအသံုးျပဳတဲ့အခါ OSPFv3 ရဲ့ Router ID
(RID) သည္ IPv4 Address ပဲျဖစ္တယ္။
KB
Looking IPv6 Interfaces
(show ipv6 interface brief)

T C
○ လက္ရွိ Router မွာ IPv6 Routing အလုပ္လုပ္ေနတဲ့ Interfaces ေတြကိုၾကည့္ခ်င္ရင္ Privileged Mode မွာ
KB
TC
Looking IPv6 OSPFv3 Running Interfaces
○ Router မွာရွိတဲ့ OSPFv3 running Interfaces ေတြရဲ့ IPv6 Information ကိုၾကည့္ခ်င္ရင္ (show ipv6 ospf
interface brief) Command နဲ႔ၾကည့္တယ္။
KB

Looking IPv6 OSPF Specific Interface Details
○ OSPFv3 အသံုးျပဳေနတဲ့ IPv6 Interface တစ္ခုရဲ့ Details Information ေတြကိုၾကည့္ခ်င္ရင္ Privileged

Mode မွာ
TC
(show ipv6 ospf interface "InterfaceName") Command နဲ႔ၾကည့္တယ္။
R1#show ipv6 ospf interface s1/0
KB
C
 ၄င္းထဲမွာ OSPFv3 ရဲ့ Network Type ကို State မွာေတြ႔ရတယ္။ Router ID လဲေတြ႔ရတယ္။
T
KB
TC
KB

Looking IPv6 OSPF Neighbors
○ Privileged Mode မွာပဲ (show ipv6 ospf neighbor) Command နဲ႔ၾကည့္တယ္။
TC
Looking IPv6 Routing Table
○ Privileged Mode မွာ (show ipv6 route) Command နဲ႔ၾကည့္တယ္။
KB
T C
KB
Looking IPv6 Routing Table with OSPF Route Only

○ (show ipv6 route ospf) Command သည္လည္း OSPFv2 မွာလို OSPF Protocol ေၾကာင့္ျဖစ္ေပၚလာတဲ့
Routing Table ထဲက Route Paths ေတြကိုပဲေရြးၾကည့္တာျဖစ္တယ္။
TC
○ Route Paths ေတြရဲ့ေရွ႔ဆံုးက 0 လို႔ျပရင္ ၄င္း Route Path သည္ Intra-Area (လက္ရွိ Router ရွိတဲ့ OSPF
Area အတြင္းက Route Path) လို႔ေျပာတာျဖစ္ျပီး 0I လို႔ျပရင္ ၄င္း Route Path သည္ Inter-Area (လက္ရွိ
KB
Router ရွိတဲ့ OSPF Area ထဲကမဟုတ္ဘဲ အျခား OSPF Area က Route Path) ျဖစ္ေၾကာင္းေျပာတာျဖစ္တ
ယ္။

Debugging IPv6 OSPF
○ IPv6 Dynamic Routing လုပ္ေပးေနတဲ့ OSPFv3 Router အား Debugging လုပ္ခ်င္ရင္
TC
KB
C
○ Hello messages ေတြကိုပဲ Debugging လုပ္ခ်င္ရင္
T
KB
TC
KB

OSPF Commands References
TC
KB
T C
KB
TC
KB

TC
KB
T C
KB
TC
KB

TC
KB
T C
KB
TC
KB

Routing Book W PDF

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Routing Book W PDF

Загружено:

Авторское право:

Доступные форматы

Packet Forwarding Process

A-PDF Watermark DEMO: Purchase from www.A-PDF.com to remove the watermark

2. Frame Receiving (Layer 2 Checksum)

 L2 address of others interface (Accept) (Not Forward)

1. Router de-encapsulate packet from frame to view L3 contents. (De-Encapsulation)

Routing Book Page 1

1. Later Router perform Layer 3 Header Checksum Calculation.

2. After best matches, selected route path identifies outgoing interface.

Path Selection Priority

2. AD Value (Lower AD Value Prefer)

3. Metric Value (Lower Metric Value Prefer)

Routing Book Page 2

1. Router encapsulate packet in a New Frame (Frame Rewrite)

 Tunneling (IP tunnels, GRE, etc..)

8. Transmitting the Frame

Routing Book Page 3

Routing Book Page 4

Verifying CEF State on Device

Router #show ip cef

%CEF not running (CEF Disabled)

Prefix Next Hop Interface (CEF Enabled)

Confirm that CEF is enabled on a particular interface.

Router#show cef interface fastEthernet 0/0/0

IP Distributed CEF switching enabled (CEF Enabled)

No CEF (CEF Disabled)

Routing Book Page 5

Router (config)# ip cef (Global CEF Enabled)

Router (config-if)# ip route-cache cef (Specific Interface CEF Enabled)

Router (config-if)# no ip route-cache cef (Specific Interface CEF Disabled)

Router # show ip cef

Prefix Next Hop Interface

Routing Book Page 6

Router # show ip cache

 Disabling route-cache also disabled CEF.

Viewing Route Cache

Router# show ip cache

Router# clear ip cache

Routing Book Page 7

Router# show interface stats

Viewing Routing Table

• L means router interface current assigned IP Address. (/32)

Routing Book Page 8

Router# show ip arp

Router# show arp

• IOS resets the timer to 0 when an ARP table entry is used.

>> To empty all dynamic entries (clear ip arp *)

>> To empty specific entry (clear ip arp <ip address>)

Routing Book Page 9

• Viewing Static Routes Only

Router# show ip route static

• Static Route Types

(ip route 192.168.1.0 255.255.255.0 10.0.0.254)

(ip route "DestinationNetworkIP" "SubnetMask" "exit-Interface")

(ip route 192.168.1.0 255.255.255.0 fa0/1)

Static Route with Next-Hop Address

Routing Book Page 10

• Static routes configuration points to the null interface.

Router(config)# ip route "DestinationNetwork" "SubnetMask" null0

Router(config)# interface null0

Routing Book Page 11

IP, IPX, (Routed Protocol)

Routing Book Page 12

○ ကမာၻမွာ ယေန႔အခ်ိန္ထိ ထြက္ခဲ့တဲ့ အသံုးျပဳခဲ့တဲ့ Dynamic Routing Protocols ေတြသည္