Day1 Iprouting Teori Isat Template
-
Upload
abdulazizkurniastianto -
Category
Documents
-
view
31 -
download
3
Transcript of Day1 Iprouting Teori Isat Template
-
Presented by :
Sugeng JadmokoPT. INDOSAT Tbk.
Jakarta, Indosat Building 17th FloorJl. Medan Merdeka Barat 21
IP/MPLS SERVICES TRAINING
-
ICND v2.05-2
AgendaDay 1 session 1
- IP Routing Overview- Break- Lab 1 : Building IP Core NetworkObjective :Peserta mengerti tentang cara setting ip address di interface,menjalankan routing protocol static dan ospf, dan tekniktroubleshootingdasar
Day 1 session 2- Introduction to MPLS- Break- Lab 2 : Enabling MPLS Network (On top of IP Core Network)Objective :Peserta mengerti tentang konsep dasar dari MPLS, cara membangunjaringan MPLS sederhana, dan teknik troubleshooting dasar
-
ICND v2.05-3
AgendaDay 1 session 3
- Introduction to MPLS Virtual Private Network (VPN)- Break- Lab 3 : Building MPLS-VPN enabled NetworkObjective :Peserta mengerti tentang setting P dan PE router, menjalankanrouting protocol MP-BGP dan teknik troubleshooting dasar
Day 2- Lab 4 : Creating MPLS L2VPN & L3VPN Services- Break- Continue Lab 4Objective :Peserta mengerti tentang konsep dasar dari MPLS-VPN, caramembangun layanan MPLS-VPN sederhana, mengerti cara setting router P, PE dan CE, dan teknik troubleshooting dasar
-
IP ROUTINGOVERVIEW
-
ICND v2.05-5
KONSEP JARINGAN DATA
LAN (Local Area Network) MAN (Metropolitan Area Network) WAN (Wide Area Network)
-
ICND v2.05-6
PERANGKAT JARINGAN
HOST (PC, SERVER, VOIP GATEWAY, DLL)
ROUTER ETHERNET HUB ETHERNET SWITCH ETHERNET BRIDGE
-
ICND v2.05-7
Struktur 7 layer OSI
-
ICND v2.05-8
TCP/IP VS 7 LAYER OSI
-
ICND v2.05-9
IP PACKET (IP DATAGRAM)
4 byte (32 bit)
-
ICND v2.05-10
To route, a router needs to do the following: Know the destination address Identify the sources it can learn from Discover possible routes Select the best route Maintain and verify routing information
What Is Routing?
-
ICND v2.05-11
Routers must learn destinations that are not directly connected.
What Is Routing? (Cont.)
-
ICND v2.05-12
Static Route Uses a route that a
network administrator enters into the router manually
Dynamic RouteUses a route that a network routing protocol adjusts automatically for topology or traffic changes
Static and Dynamic Routes
-
ICND v2.05-13
Static Routes
Configure unidirectional static routes to and from a stub network to allow communications to occur.
-
ICND v2.05-14
Defines a path to an IP destination network or subnet or host
Router(config)#ip route network [mask] {address | interface}[distance] [permanent]
Static Route Configuration
-
ICND v2.05-15
Static Route Example
This is a unidirectional route. You must have a route configured in the opposite direction.
-
ICND v2.05-16
Default Routes
This route allows the stub network to reach all known networks beyond router A.
-
ICND v2.05-17
Verifying the Static Route
router#show ip routeCodes: C - connected, S - static, I - IGRP, R - RIP, M - mobile, B - BGP
D - EIGRP, EX - EIGRP external, O - OSPF, IA - OSPF inter areaE1 - OSPF external type 1, E2 - OSPF external type 2, E - EGPi - IS-IS, L1 - IS-IS level-1, L2 - IS-IS level-2, * - candidate defaultU - per-user static route
Gateway of last resort is 0.0.0.0 to network 0.0.0.010.0.0.0/8 is subnetted, 1 subnets
C 10.1.1.0 is directly connected, Serial0S* 0.0.0.0/0 is directly connected, Serial0
-
ICND v2.05-18
Routing protocols are used between routers to determine paths and maintain routing tables.
Once the path is determined, a router can route a routed protocol.
What Is a Routing Protocol?
-
ICND v2.05-19
An autonomous system is a collection of networks under a common administrative domain.
IGPs operate within an autonomous system. EGPs connect different autonomous systems.
Autonomous Systems: Interior or Exterior Routing Protocols
-
ICND v2.05-20
Administrative Distance: Ranking Routes
-
ICND v2.05-21
Classes of Routing Protocols
-
ICND v2.05-22
Classful Routing Overview
Classful routing protocols do not include the subnet mask with the route advertisement.
Within the same network, consistency of the subnet masks is assumed.
Summary routes are exchanged between foreign networks.
Examples of classful routing protocols: RIP Version 1 (RIPv1) IGRP
-
ICND v2.05-23
Classless Routing Overview
Classless routing protocols include the subnet mask with the route advertisement.
Classless routing protocols support variable-length subnet masking (VLSM).
Summary routes can be manually controlled within the network.
Examples of classless routing protocols: RIP Version 2 (RIPv2) EIGRP OSPF IS-IS
-
ICND v2.05-24
Routing Protocol Comparison Chart
-
ICND v2.05-25
Using the IP classless Command
-
ICND v2.05-26
Routers pass periodic copies of routing table to neighbor routers and accumulate distance vectors.
Distance Vector Routing Protocols
-
ICND v2.05-27
Routers discover the best path to destinations from each neighbor.
Sources of Information and Discovering Routes
-
ICND v2.05-28
Selecting the Best Route with Metrics
-
ICND v2.05-29
Updates proceed step-by-step from router to router.
Maintaining Routing Information
-
ICND v2.05-30
Each node maintains the distance from itself to each possible destination network.
Inconsistent Routing Entries
-
ICND v2.05-31
Slow convergence produces inconsistent routing.
Inconsistent Routing Entries (Cont.)
-
ICND v2.05-32
Router C concludes that the best path to network 10.4.0.0 is through router B.
Inconsistent Routing Entries (Cont.)
-
ICND v2.05-33
Router A updates its table to reflect the new but erroneous hop count.
Inconsistent Routing Entries (Cont.)
-
ICND v2.05-34
Hop count for network 10.4.0.0 counts to infinity.
Count to Infinity
-
ICND v2.05-35
Define a limit on the number of hops to prevent infinite loops.
Defining a Maximum
-
ICND v2.05-36
Packets for network 10.4.0.0 bounce (loop) between routers B and C.
Routing Loops
-
ICND v2.05-37
It is never useful to send information about a route back in the direction from which the original information came.
Split Horizon
-
ICND v2.05-38
Routers advertise the distance of routes that have gone down to infinity.
Route Poisoning
-
ICND v2.05-39
Poison reverse overrides split horizon.
Poison Reverse
-
ICND v2.05-40
The router keeps an entry for the networks possible downstate, allowing time for other routers to recompute for this topology change.
Holddown Timers
-
ICND v2.05-41
The router sends updates when a change in its routing table occurs.
Triggered Updates
-
ICND v2.05-42
Distance Vector Operation
-
ICND v2.05-43
Distance Vector Operation (Cont.)
-
ICND v2.05-44
Distance Vector Operation (Cont.)
-
ICND v2.05-45
Distance Vector Operation (Cont.)
-
ICND v2.05-46
Distance Vector Operation (Cont.)
-
ICND v2.05-47
Distance Vector Operation (Cont.)
-
ICND v2.05-48
After initial flood, pass small event-triggered link-state updates to all other routers
Link-State Routing Protocols
-
ICND v2.05-49
Minimizes routing table entries Localizes impact of a topology change within
an area
Link-State Network Hierarchy Example
-
ICND v2.05-50
Link-State Routing Protocol Algorithms
-
ICND v2.05-51
Benefits of Link-State Routing
Fast convergence: changes are reported immediately by the source affected.
Robustness against routing loops: Routers know the topology. Link-state packets are sequenced and
acknowledged. By careful (hierarchical) network design, you
can utilize resources optimally.
-
ICND v2.05-52
Caveats of Link-State Routing
Significant demands for resources: Memory (three tables: adjacency, topology, forwarding) CPU (Dijkstras algorithm can be intensive, especially
when a lot of instabilities are present.) Requires very strict network design (when more
areasarea routing) Problems with partitioning of areas Configuration generally simple but can be complex
when tuning various parameters and when the design is complex
Troubleshooting easier than in distance vector routing
-
ICND v2.05-53
Drawbacks to Link-State Routing Protocols
Initial discovery may cause flooding. Memory- and processor-intensive.
-
ICND v2.05-54
Shares attributes of both distance vector and link-state routing
Balanced Hybrid Routing
-
ICND v2.05-55
Maximum is 6 paths (default = 4) Hop-count metric selects the path Routes update every 30 seconds
RIP Overview
-
ICND v2.05-56
Router configuration Select routing protocols. Specify networks or
interfaces.
IP Routing Configuration Tasks
-
ICND v2.05-57
Defines an IP routing protocol
Router(config)#router protocol [keyword]
Mandatory configuration command for each IP routing process
Identifies the physically connected network that routing updates are forwarded to
Router(config-router)#network network-number
Dynamic Routing Configuration
-
ICND v2.05-58
Starts the RIP routing process
Router(config)#router rip
Router(config-router)#network network-number Selects participating attached networks Requires a major classful network number
RIP Configuration
-
ICND v2.05-59
RIP Configuration Example
-
ICND v2.05-60
Verifying the RIP Configuration
-
ICND v2.05-61
Displaying the IP Routing Table
-
ICND v2.05-62
debug ip rip Command
-
ICND v2.05-63
More scalable than RIP Sophisticated metric Multiple-path support
Introducing IGRP
-
ICND v2.05-64
Configuring IGRP
Router(config-router)#network network-number
Selects participating attached networks
Router(config)#router igrp autonomous-system
Defines IGRP as the IP routing protocol
-
ICND v2.05-65
BandwidthDelayReliabilityLoadingMTU
IGRP Composite Metric
-
ICND v2.05-66
Maximum 6 paths (default = 4) Within metric variance Next-hop router closer to destination
IGRP Unequal Multiple Paths
-
ICND v2.05-67
Configuring IGRP (cont.)
Router(config-router)#traffic-share {balanced | min}
Controls how load-balanced traffic is distributed
Router(config-router)#variance multiplier
Controls IGRP load balancing
-
ICND v2.05-68
IGRP Configuration Example
-
ICND v2.05-69
Verifying the IGRP Configuration
-
ICND v2.05-70
Displaying the IP Routing Table
-
ICND v2.05-71
debug ip igrp transaction Command
-
ICND v2.05-72
debug ip igrp events Command
RouterA#debug ip igrp eventsIGRP event debugging is onRouterA#00:23:44: IGRP: sending update to 255.255.255.255 via Ethernet0 (172.16.1.1)00:23:44: IGRP: Update contains 0 interior, 2 system, and 0 exterior routes.00:23:44: IGRP: Total routes in update: 200:23:44: IGRP: sending update to 255.255.255.255 via Serial2 (10.1.1.1)00:23:45: IGRP: Update contains 0 interior, 1 system, and 0 exterior routes.00:23:45: IGRP: Total routes in update: 100:23:48: IGRP: received update from 10.1.1.2 on Serial200:23:48: IGRP: Update contains 1 interior, 1 system, and 0 exterior routes.00:23:48: IGRP: Total routes in update: 2
-
ICND v2.05-73
Updating Routing Information Example
-
ICND v2.05-74
Updating Routing Information Example (Cont.)
-
ICND v2.05-75
Updating Routing Information Example (Cont.)
-
ICND v2.05-76
Updating Routing Information Example (Cont.)
-
ICND v2.05-77
Introducing EIGRP
EIGRP supports: Rapid convergence Reduced bandwidth usage Multiple network-layer protocols
-
ICND v2.05-78
EIGRP Terminology
-
ICND v2.05-79
Comparing EIGRP and IGRP
Similar metric Same load balancing Improved convergence time Reduced network overhead
-
ICND v2.05-80
Configuring EIGRP
Router(config-router)#network network-number
Selects participating attached networks
Router(config)#router eigrp autonomous-system
Defines EIGRP as the IP routing protocol
-
ICND v2.05-81
EIGRP Configuration Example
-
ICND v2.05-82
Verifying the EIGRP Configuration
Router#show ip protocols
Router#show ip route eigrp
Router#show ip eigrp traffic
Router#show ip eigrp neighbors
Router#show ip eigrp topology Displays the neighbors discovered by IP EIGRP
Displays the IP EIGRP topology table
Displays the number of IP EIGRP packets sent and received
Displays current EIGRP entries in the routing table
Displays the parameters and current state of the active routing protocol process
-
ICND v2.05-83
debug ip eigrp Command
Router#debug ip eigrpIP-EIGRP: Processing incoming UPDATE packetIP-EIGRP: Ext 192.168.3.0 255.255.255.0 M 386560 - 256000 130560 SM 360960 -256000 104960IP-EIGRP: Ext 192.168.0.0 255.255.255.0 M 386560 - 256000 130560 SM 360960 -256000 104960IP-EIGRP: Ext 192.168.3.0 255.255.255.0 M 386560 - 256000 130560 SM 360960 -256000 104960IP-EIGRP: 172.69.43.0 255.255.255.0, - do advertise out Ethernet0/1IP-EIGRP: Ext 172.69.43.0 255.255.255.0 metric 371200 - 256000 115200IP-EIGRP: 192.135.246.0 255.255.255.0, - do advertise out Ethernet0/1IP-EIGRP: Ext 192.135.246.0 255.255.255.0 metric 46310656 - 45714176 596480IP-EIGRP: 172.69.40.0 255.255.255.0, - do advertise out Ethernet0/1IP-EIGRP: Ext 172.69.40.0 255.255.255.0 metric 2272256 - 1657856 614400IP-EIGRP: 192.135.245.0 255.255.255.0, - do advertise out Ethernet0/1IP-EIGRP: Ext 192.135.245.0 255.255.255.0 metric 40622080 - 40000000 622080IP-EIGRP: 192.135.244.0 255.255.255.0, - do advertise out Ethernet0/1
-
ICND v2.05-84
Introducing OSPF
Open standard Shortest path first (SPF) algorithm Link-state routing protocol (vs. distance vector)
-
ICND v2.05-85
OSPF as a Link-State Protocol
OSPF propagates link-state advertisements rather than routing table updates.
LSAs are flooded to all OSPF routers in the area.
The OSPF link-state database is pieced together from the LSAs generated by the OSPF routers.
OSPF uses the SPF algorithm to calculate the shortest path to a destination.
Link = router interface State = description of an interface and its
relationship to neighboring routers
-
ICND v2.05-86
OSPF Hierarchical Routing
Consists of areas and autonomous systems Minimizes routing update traffic
-
ICND v2.05-87
Shortest Path First Algorithm
Places each router at the root of a tree and calculates the shortest path to each destination based on the cumulative cost
Cost = 108/bandwidth (bps)
-
ICND v2.05-88
Configuring Single Area OSPF
Router(config-router)#network address mask area area-id
Assigns networks to a specific OSPF area
Router(config)#router ospf process-id
Defines OSPF as the IP routing protocol
-
ICND v2.05-89
OSPF Configuration Example
-
ICND v2.05-90
Configuring Loopback Interfaces
Router ID: Number by which the router is known to OSPF Default: The highest IP address on an active interface at
the moment of OSPF process startup Can be overridden by a loopback interface: Highest IP
address of any active loopback interface
-
ICND v2.05-91
Router#show ip ospf interface
Verifying the OSPF Configuration
Displays area-ID and adjacency information
Router#show ip protocols Verifies that OSPF is configured
Router#show ip route Displays all the routes learned by the router
Router#show ip ospf neighbor Displays OSPF-neighbor information on a per-interface basis
-
ICND v2.05-92
OSPF debug commands
Router#debug ip ospf eventsOSPF:hello with invalid timers on interface Ethernet0hello interval received 10 configured 10net mask received 255.255.255.0 configured 255.255.255.0dead interval received 40 configured 30Router# debug ip ospf packetOSPF: rcv. v:2 t:1 l:48 rid:200.0.0.117
aid:0.0.0.0 chk:6AB2 aut:0 auk:Router#debug ip ospf packetOSPF: rcv. v:2 t:1 l:48 rid:200.0.0.116
aid:0.0.0.0 chk:0 aut:2 keyid:1 seq:0x0
-
ICND v2.05-93
Variable-Length Subnet Masks
-
ICND v2.05-94
What Is a Variable-Length Subnet Mask?
Subnet 172.16.14.0/24 is divided into smaller subnets: Subnet with one mask (/27) Then further subnet one of the unused /27 subnets into multiple /30
subnets
-
ICND v2.05-95
Calculating VLSMs
-
ICND v2.05-96
A Working VLSM Example
-
ICND v2.05-97
What Is Route Summarization?
Routing protocols can summarize addresses of several networks into one address
-
ICND v2.05-98
Summarizing Within an Octet
-
ICND v2.05-99
Summarizing Addresses in a VLSM-DesignedNetwork
-
ICND v2.05-100
Implementation Considerations
Multiple IP addresses must have the same highest-order bits.
Routing decisions are made based on the entire address.
Routing protocols must carry the prefix (subnet mask) length.
-
ICND v2.05-101
Route Summarization Operation in Cisco Routers
Supports host-specific routes, blocks of networks, default routes
Routers use the longest match
192.16.5.33 /32 Host192.16.5.32 /27 Subnet192.16.5.0 /24 Network192.16.0.0 /16 Block of Networks0.0.0.0 /0 Default
192.16.5.33 /32 Host192.16.5.32 /27 Subnet192.16.5.0 /24 Network192.16.0.0 /16 Block of Networks0.0.0.0 /0 Default
-
ICND v2.05-102
Summarizing Routes in a DiscontiguousNetwork
RIPv1 and IGRP do not advertise subnets, and therefore cannot support discontiguous subnets.
OSPF, EIGRP, and RIPv2 can advertise subnets, and therefore can support discontiguous subnets.