Professional Documents
Culture Documents
HCIP Datacom - Core Technology D2D Activity
HCIP Datacom - Core Technology D2D Activity
cc/hcip-dat
Trainer: Tony Khoo
Email: khoo.yik.heng@huawei.com
Background: HCIE Datacom, Security, CloudService
ner)
cert/product-details?certifiedProductId=355&authenticationLevel=CTYPE_CARE_HCIP&techni
ator/
Day1:
ISIS Level-1-2 Router:
Tugas khusus untuk inject/generate default route ke Level1 router, caranya
adalah dengan Set Attached bit di L1 LSP, tp ada syaratnya yaitu dia terhubung ke area lain
Kalau di OSPF fungsinya seperti router ABR
OSPF
Fundamental Knowledge
-OSPF Protocol Packet (Hello, DD, LSR, LSU, LSAck)
DR & BDR Election
Timer
Advanced Knowledge
-Type of LSA (T1,2,3,4,5,7, stub, nssa)
Summarization
Authentication
OSPF
Fundamental Knowledge
-OSPF Protocol Packet (Hello, DD, LSR, LSU, LSAck)
DR & BDR Election
Timer
Advanced Knowledge
-Type of LSA (T1,2,3,4,5,7, stub, nssa)
Summarization
Authentication
---------------------------------------------------
ISIS Checklist
Structure of ISIS
structure of network entity
-concept of level, area
Election of DIS
ISIS vs OSPF
Protocol Packet
Route Leaking
Day2:
BGP Checklist:
BGP peering (EBGP/IBGP peering using physical/loopback)
BGP Protocol Packet (OPEN, KEEPALIVE, UPDATE, NOTIFICATION, ROUTE REFRESH)
BGP Advertisement Principle
BGP Attributes
BGP Route Selection (Route
https://bgp.he.net/
https://drive.google.com/drive/folders/15IFzwYL6dUu6EpxuhrTaRTBewhzUlZr7
HCIP-Datacom Core Technology (Fast Track)
No Session Content
AM OSPF
1
PM ISIS
AM BGP Basics
2
BGP Path Attributes and RRs
PM
Preferred BGP Route Selection
AM Routing Policy and Route Control
3
RSTP & MSTP
PM
Stack and CSS Features of Switches
AM Multicast
4
PM Huawei Firewall Technology
BFD
AM
VRRP
5
PM WLAN
Trainer:Tony Khoo Email: tony.khoo@infosyte.com
(Fast Track)
Method Instructor Material Link
PU-SFU-LPU
ation and send the summary entries to LPU. LPU will forward accordingly
routing protocol
direct IP configuration on interfaces = IP Routing Table
1. Manual Configuration
OSPF
Router ID (can be configure globally or protocol level) 2. Loopback Interface (Highest)
Protocol > Global 3. Physical Interface (Highest)
32 bits
area 0 = backbone area
Area ID area N = non-backbone area
Bandwidth / Link-Speed
th default value = 100M
P2MP/NBMA
30s
120s
Special Area Stub Area T1, T2, T3 Added a default route of T3 and maint
Totally Stubby Area T1, T2 + default route (ABR) Remain only a T3 default route genera
Remark:
LSA update is perform every 1800s (30min)
Imported route has
LSA will expire 2 cost(1hour)
in 3600s type if it is not updated
Type-4 LSA1 only
Cost Type exist after
= External RouteType-5
Cost appear in the
+ Internal OSPF
Route Costtopology
Cost Type 2 (default) = External Route Cost only
Description
The router that participate in the intra-area
It tells who is the DR
The list of network route from other OSPF areas
How to get to ASBR
The list of network route from outside of OSPF topology
Similar to T5, but with additional feature to replace all inter-area route with default route
ult route of T3, 7 and maintain the other T3 LSA. Added with external route
route remove. Use default route only. Added with external route
Local Router Peer Router
L1 L1
L1 L1/2
L1/2 L1/2
result to
L2 L2
L2 L1/2
L1 L2
1. Broadcast
2. P2P
DR DIS
(to reduce LSA flooding) (to create
pseudonode.
Pseudonode will
responsible for
LSDB
synchronization
with all ISIS
routers.)
OSPF dr-priority = 0 ISIS dis-priority = 0
(do not join election) (still join election)
OSPF is non-preemptive
ISIS is preemptive
(cannot force election)
Remark:
The level of ISIS router can be configure in protocol mode or interface mode
Interface level > Protocol level
ISIS Hello
Complete Sequence Number PDU
Partial Sequence Number PDU
Link State PDU
Partial Sequence Number PDU
DIS election:
1. DIS Priority (default = 64, highest wins)
2. MAC Address (highest wins)
2 methods
BGP to advertise
Advertisement (to route:
build BGP Protocol Table (display bgp routing-table)
1. network command
2. import-route command
Advertisement
Tips: We can usePrinciples:
"network" command to manually advertise 1 by 1. Applicable to small amount of route advertisement.
1.
In Only
case best > and
of large valid of
amount * routes can be
route need toadvertise to other
be advertise, BGP peer.will be better choice. You can apply route policy tools to fil
"import-route"
2. EBGP -> EBGP, IBGP
3. IBGP ---X---> IBGP
4. IBGP routes = IGP routes, in order for IBGP --> EBGP (Route Sychronization rule - doesnt apply anymore)
BGP Attributes
Well Known Mandatory Must be supported by all vendors and must be carried in every UPDATE message
Discretionary Must be supported by all vendors and may/may not be carried in every UPDATE message
Optional Transistive May not be supported by all vendors. But still can accept/influence by UPDATE message
Non-transistive May not be supported by all vendors. Router can ignore if not supported and not recognize.
ave only TTL=1
oute advertisement.
apply route policy tools to filter/choose which routes to advertise.
DATE message
ery UPDATE message
by UPDATE message
orted and not recognize.
Priority of BGP route selection
*Next Hop must be valid.
1. Preferred Value (highest wins)
2. Local Preference (highest wins) Influence internal peer on how they can leave the AS (leaving A
3. Manual Summarize > Auto Summarize > Detail Routes
4. AS_Path (shortest wins)
5. Origin ( i > e > ?)
6. MED (lowest wins) Influence external peer on how they can come to the AS (comin
7. EBGP > IBGP
8. IGP metric (lowest wins)
9. Cluster_List (RR, shortest wins)
10. Router ID/Originator ID (RR, smallest wins)
11. Peer's IP address (smallest wins)
Route Reflector
Reflection Principles:
1. Non-client --> RR --> Client
2. Client --> RR --> Client & Non-Client
3. EBGP --> RR --> Client & Non-Client
4. Non-client --> RR --X--> Non Client (deduce from first rule)
BGP EVPN
Issue with L2VPN: consume many bandwidth while learning the remote sites' MAC address using ARP broadcast mechanism
Solution: EVPN as the control plane
2. Campus Network
3. SD-WAN
PBR Interface PBR for traffic that passes through the router apply on incoming interface
Local PBR for traffic that is originating from the router apply globally
By controlling the root bridge and port role, we can decide which port to be blocked.
Step 1: Elect a root bridge Reason: How:
A root bridge will have all its' port in forwarding. Based on ROOT ID (Root Bridge ID in every sw
All the ports will be in Designated port role and in
Step 2: Define the root port Reason:
forwarding state. How:
Bridge ID = Bridge Priority (by default 32768) fo
Root port is the shortest back for a non-root bridge Based on Root Path Cost.
to send TCN BPDU back to Root Bridge. The cost generated based on bandwidth of the
Step 3: Define the designated Reason: How:
Varies according different calculation standard.
port for each link. Designated
Only one rootport
portwilper
help to forward
switch exceptConfiguration
Root BridgeBased on bridge ID
BPDU from Root Bridge to Non-Root Bridge
Step 4: Define the alternate Reason: How:
port This port will be blocked from data forwarding but The worst bridge ID among all
RSTP Improvement based on STP
1. BPDU forwarding at every hello time regardless receiving from uplink
MSTP Role Election: CIST ROOT --> Master Bridge ( choose master port) -> Internal Region Root -> MSTI Root
Stack/CSS
Stacking can be perform through a dedicated stack card or through service port(supported by selected model)
CSS can be performing through SFU or MPU/LPU
Stack Split detection to overcome multiple master stacks that using same IP address and Mac Address. The technology is calle
l be tagged according to PVID.
Unicast 1:1
Broadcast 1:everyone/all
Multicast 1:group
Multicast Mac -> ignore taking only the last 23 bits. Counting from
right.
01-00-5E 00 01 01
01-00-5E 00 01 01
The multicast address for 224.0.0.1, 225.0.0.1, 226.0.0.1 ~~~~ 239.0.0.1 is totally the same multicast address
General Query / / /
Membership Report / / /
with specific
source
Querier Election X / /
Leave Message X / Use the report
Group Specific Query X / /
with specific
source
Remark:
IGMPv1 do not support election. Only can depend on DR assigned through PIM.
PIM-DM
Only for small size of network
Flooding mechanism + pruning
mechanism
Assert Mechanism To prevent multiple router forward the same multicast traffic by selecting only one router throug
Election is based on unicast routing table ( route preference > cost > highest IP)
Graft Mechanism To allow a previous prune state multicast router to request the upstream multicast to resume th
traffic forwarding.
PIM-SM
RPT establishment Last hop router must form a MDT towards RP
Source registration First hop router register to RP by using SPT (shortest distance to reach RP)
DR Election First hop router = Source DR
Last hop router= Receiver DR
DR Election
cting only one router through election.
> highest IP)
ream multicast to resume the multicast
ach RP)
IPv6
Anycast 1 : nearest
SLAAC Default router (prefix) + EUI64 M=0, O=0 if the router is the one
DHCPv6 (prefix + other parameters) + EUI64 M=1, O=1 if the current router is not dhcp
FTP active (legacy) Client initiate TCP (control connection) to port 21, server initiate Data (ftp connection) on port 20
passive Client can initiate both TCP (port 21) and Data connection (random port).
Direct Forwarding The data packet received from STA will be forwarded to AP and AP will forward to destina
Tunnel Forwarding The data packet received from STA will be forwarded to AP and AP will forward the data p
Before roaming
Layer 2 Roaming Tunnel ForwardingSTA --> HAP --> HAC --> destination
Layer 2 Roaming Direct Forwarding STA --> HAP --> destination
Layer
Layer 3
3 Roaming
Roaming Tunnel ForwardingSTA --> HAP --> HAC --> destination
Direct Forwarding
(HAP
Layer as Home Agent)
3 Roaming Direct Forwarding STA --> HAP --> destination
(HAC as Home Agent) STA --> HAP --> destination
ed to AP and AP will forward to destination without send through AC
ed to AP and AP will forward the data packet to AC, AC will forward it to destination.
After roaming
STA --> FAP --> FAC --> destination
STA --> FAP --> destination
STA --> FAP --> FAC --> HAC --> destination
STA --> FAP --> FAC --> HAC --> HAP --> destination
STA --> FAP --> FAC --> HAC --> destination