SlideShare a Scribd company logo
1 of 31
Download to read offline
KhoaCNTT1/30PHẠMVĂNTÍNH01-2004
Switching Basics and
Intermediate Routing
CLASSLESS ROUTING
TS, PHẠM VĂN TÍNH
KhoaCNTT2/30PHẠMVĂNTÍNH01-2004
Objectives
• Define VLSM and briefly describe the reasons for its
use
• Divide a major network into subnets of different sizes
using VLSM
• Define route aggregation and summarization as they
relate to VLSM
• Configure a router using VLSM
• Identify the key features of RIP v1 and RIP v2
• Identify the important differences between RIP v1 and
RIP v2
• Configure RIP v2
• Verify and troubleshoot RIP v2 operation
• Configure default routes using the ip route and ip
default-network commands
KhoaCNTT3/30PHẠMVĂNTÍNH01-2004
Variable-Length Subnet
Masking (VLSM)
KhoaCNTT4/30PHẠMVĂNTÍNH01-2004
 GO TO COMPUTER NETWORK COURSE
KhoaCNTT5/30PHẠMVĂNTÍNH01-2004
Issues with IP Addressing
• IP addressing crisis
• As early as 1992, the IETF identified two
specific concerns:
–IP address exhaustion
–Routing table growth
U N I V E R S I T YU N I V E R S I T Y
Internet
KhoaCNTT6/30PHẠMVĂNTÍNH01-2004
IP Addressing Solutions
• Short term to extension to IPv4
– Subneting masking: RFCs 950, 1812
– Variable-Length Subnet Masks: RFC 1812
– Classless InterDomain Routing: RFCs 1518,
1519, 2050
– Address allocation for private Internets: RFC
1918
– Network Address Translation: RFC 1631
– Route summarization: RFC 1518
• Ultimate solution: IPv6 128-bit address
space
KhoaCNTT7/30PHẠMVĂNTÍNH01-2004
 What is VLSM ?
KhoaCNTT8/30PHẠMVĂNTÍNH01-2004
 VLSM is supported
• Open Shortest Path First (OSPF).
• Integrated Intermediate System to
Intermediate System (Integrated IS-IS).
• Enhanced Interior Gateway Routing
Protocol (EIGRP).
• RIP v2.
• Static routing.
KhoaCNTT9/30PHẠMVĂNTÍNH01-2004
A waste of space
KhoaCNTT10/30PHẠMVĂNTÍNH01-2004
When to use VLSM?
KhoaCNTT11/30PHẠMVĂNTÍNH01-2004
Sub - Subnets
KhoaCNTT12/30PHẠMVĂNTÍNH01-2004
Calculating subnets with VLSM
KhoaCNTT13/30PHẠMVĂNTÍNH01-2004
VLSM Example
KhoaCNTT14/30PHẠMVĂNTÍNH01-2004
Calculating subnets with VLSM
192.168.10.0/24.
KhoaCNTT15/30PHẠMVĂNTÍNH01-2004
Calculating subnets with VLSM
KhoaCNTT16/30PHẠMVĂNTÍNH01-2004
Route aggregation with VLSM
KhoaCNTT17/30PHẠMVĂNTÍNH01-2004
Route summarization example
KhoaCNTT18/30PHẠMVĂNTÍNH01-2004
Configuring VLSM
60 Hosts 12 Hosts 12 Hosts
192.168.10.0/24
KL
SydneyPerth Singapore
192.168.10.64/27
192.168.10.128/30
192.168.10.132/30
192.168.10.136/30
28 Hosts
192.168.10.0/26 192.168.10.96/28 192.168.10.112/28
S0
10.138
S0 10.137
KhoaCNTT19/30PHẠMVĂNTÍNH01-2004
RIP Version 2
KhoaCNTT20/30PHẠMVĂNTÍNH01-2004
RIP v1: Characteristics
• IGP protocol, is classful routing.
• It is a distance vector protocol that uses a hop
count metric.
• The maximum number of hops is 15.
• By default, routing updates are broadcast every
30 seconds.
• The router applies the one subnet mask that is
configured on the receiving interface to receive
network information.
• Load balancing over as many as six equal-cost
paths, with four paths as the default.
KhoaCNTT21/30PHẠMVĂNTÍNH01-2004
RIP v1: Limitations
• It does not send subnet mask information
in its updates.
• It sends updates as broadcasts on
255.255.255.255.
• It does not support authentication.
• It is not able to support VLSM or classless
interdomain routing (CIDR).
KhoaCNTT22/30PHẠMVĂNTÍNH01-2004
RIP v1: Configuration
KhoaCNTT23/30PHẠMVĂNTÍNH01-2004
RIP v2 features
• Send out subnet mask information with the route
update.
• Support VLSM or classless interdomain routing
(CIDR).
• Provides for authentication in its updates.
• Provides Multicast routing updates, using the
Class D address 224.0.0.9.
• Use external route tags
• Routing update is includes a next-hop route ip
address.
KhoaCNTT24/30PHẠMVĂNTÍNH01-2004
Comparing RIP v1 and v2
KhoaCNTT25/30PHẠMVĂNTÍNH01-2004
RIP v2: Configuration
KhoaCNTT26/30PHẠMVĂNTÍNH01-2004
Verifying RIP v2 : SHOW IP PROTOCOLS
KhoaCNTT27/30PHẠMVĂNTÍNH01-2004
Verifying RIP v2: SHOW IP ROUTE
KhoaCNTT28/30PHẠMVĂNTÍNH01-2004
Troubleshooting RIP v2 : DEBUG IP RIP
KhoaCNTT29/30PHẠMVĂNTÍNH01-2004
Default routes
InternetInternet
KhoaCNTT30/30PHẠMVĂNTÍNH01-2004
Q&A
KhoaCNTT31/30PHẠMVĂNTÍNH01-2004

More Related Content

What's hot

What's hot (20)

Multicasting and multicast routing protocols
Multicasting and multicast routing protocolsMulticasting and multicast routing protocols
Multicasting and multicast routing protocols
 
Ccna PPT
Ccna PPTCcna PPT
Ccna PPT
 
Multiprotocol label switching (mpls) - Networkshop44
Multiprotocol label switching (mpls)  - Networkshop44Multiprotocol label switching (mpls)  - Networkshop44
Multiprotocol label switching (mpls) - Networkshop44
 
RTP & RTCP
RTP & RTCPRTP & RTCP
RTP & RTCP
 
MPLS VPN
MPLS VPNMPLS VPN
MPLS VPN
 
Cisco ospf
Cisco ospf Cisco ospf
Cisco ospf
 
Access Control List & its Types
Access Control List & its TypesAccess Control List & its Types
Access Control List & its Types
 
Ospf.ppt
Ospf.pptOspf.ppt
Ospf.ppt
 
Day 1 INTRODUCTION TO IOS AND CISCO ROUTERS
Day 1 INTRODUCTION TO IOS AND CISCO ROUTERSDay 1 INTRODUCTION TO IOS AND CISCO ROUTERS
Day 1 INTRODUCTION TO IOS AND CISCO ROUTERS
 
ccna networking ppt
ccna networking pptccna networking ppt
ccna networking ppt
 
CCNA presentation.
CCNA presentation.CCNA presentation.
CCNA presentation.
 
Routing
RoutingRouting
Routing
 
MPLS L2VPN (VLL) Technology
MPLS L2VPN (VLL) TechnologyMPLS L2VPN (VLL) Technology
MPLS L2VPN (VLL) Technology
 
Routing Protocols
Routing Protocols Routing Protocols
Routing Protocols
 
Multicast Routing Protocols
Multicast Routing ProtocolsMulticast Routing Protocols
Multicast Routing Protocols
 
Bgp protocol
Bgp protocolBgp protocol
Bgp protocol
 
Ospf
 Ospf Ospf
Ospf
 
CCNA IP Addressing
CCNA IP AddressingCCNA IP Addressing
CCNA IP Addressing
 
CCNA Introducing Networks
CCNA Introducing NetworksCCNA Introducing Networks
CCNA Introducing Networks
 
Spanning Tree Protocol Cheat Sheet
Spanning Tree Protocol Cheat SheetSpanning Tree Protocol Cheat Sheet
Spanning Tree Protocol Cheat Sheet
 

Viewers also liked

Viewers also liked (6)

VLSM
VLSMVLSM
VLSM
 
Chapter6
Chapter6Chapter6
Chapter6
 
Vlsm exercises solutions
Vlsm exercises solutionsVlsm exercises solutions
Vlsm exercises solutions
 
Subnetting
SubnettingSubnetting
Subnetting
 
Subnetting (FLSM & VLSM) with examples
Subnetting (FLSM & VLSM) with examplesSubnetting (FLSM & VLSM) with examples
Subnetting (FLSM & VLSM) with examples
 
Subnetting
SubnettingSubnetting
Subnetting
 

Similar to Chapter 10 -Vlsm

RIP Routing Information Protocol Extreme Networks
RIP Routing Information Protocol Extreme NetworksRIP Routing Information Protocol Extreme Networks
RIP Routing Information Protocol Extreme NetworksDani Royman Simanjuntak
 
F01 beam forming_srs
F01 beam forming_srsF01 beam forming_srs
F01 beam forming_srsLuciano Motta
 
EUMETCast system & DVB-S2 migration - EUMETCast User Forum 2014
EUMETCast system & DVB-S2 migration - EUMETCast User Forum 2014EUMETCast system & DVB-S2 migration - EUMETCast User Forum 2014
EUMETCast system & DVB-S2 migration - EUMETCast User Forum 2014EUMETSAT
 
FYP - An Evaluation of MANET Performance Using AODV By Varying Mobility Speed...
FYP - An Evaluation of MANET Performance Using AODV By Varying Mobility Speed...FYP - An Evaluation of MANET Performance Using AODV By Varying Mobility Speed...
FYP - An Evaluation of MANET Performance Using AODV By Varying Mobility Speed...Hidayah101
 
Cisco discovery drs ent module 3 - v.4 in english.
Cisco discovery   drs ent module 3 - v.4 in english.Cisco discovery   drs ent module 3 - v.4 in english.
Cisco discovery drs ent module 3 - v.4 in english.igede tirtanata
 
ccna-discowey-final-100
 ccna-discowey-final-100 ccna-discowey-final-100
ccna-discowey-final-100junkut3
 
Track work presentation
Track work presentationTrack work presentation
Track work presentationKumar M.
 
Network Configuration Example: Configuring CoS to Support an MC-LAG on an FCo...
Network Configuration Example: Configuring CoS to Support an MC-LAG on an FCo...Network Configuration Example: Configuring CoS to Support an MC-LAG on an FCo...
Network Configuration Example: Configuring CoS to Support an MC-LAG on an FCo...Juniper Networks
 
vlsi qb.docx imprtant questions for all units
vlsi qb.docx imprtant questions for all unitsvlsi qb.docx imprtant questions for all units
vlsi qb.docx imprtant questions for all unitsnitcse
 
C20 20090615-019-alu csfb-performance_enhance
C20 20090615-019-alu csfb-performance_enhanceC20 20090615-019-alu csfb-performance_enhance
C20 20090615-019-alu csfb-performance_enhanceEmmanuel Msumali
 
Lteintro 131104065218-phpapp02
Lteintro 131104065218-phpapp02Lteintro 131104065218-phpapp02
Lteintro 131104065218-phpapp02mostafa lozoumi
 

Similar to Chapter 10 -Vlsm (20)

RIP Routing Information Protocol Extreme Networks
RIP Routing Information Protocol Extreme NetworksRIP Routing Information Protocol Extreme Networks
RIP Routing Information Protocol Extreme Networks
 
F01 beam forming_srs
F01 beam forming_srsF01 beam forming_srs
F01 beam forming_srs
 
Ripv2
Ripv2Ripv2
Ripv2
 
EUMETCast system & DVB-S2 migration - EUMETCast User Forum 2014
EUMETCast system & DVB-S2 migration - EUMETCast User Forum 2014EUMETCast system & DVB-S2 migration - EUMETCast User Forum 2014
EUMETCast system & DVB-S2 migration - EUMETCast User Forum 2014
 
mama.pdf
mama.pdfmama.pdf
mama.pdf
 
Call flow umts
Call flow umtsCall flow umts
Call flow umts
 
FYP - An Evaluation of MANET Performance Using AODV By Varying Mobility Speed...
FYP - An Evaluation of MANET Performance Using AODV By Varying Mobility Speed...FYP - An Evaluation of MANET Performance Using AODV By Varying Mobility Speed...
FYP - An Evaluation of MANET Performance Using AODV By Varying Mobility Speed...
 
Cisco discovery drs ent module 3 - v.4 in english.
Cisco discovery   drs ent module 3 - v.4 in english.Cisco discovery   drs ent module 3 - v.4 in english.
Cisco discovery drs ent module 3 - v.4 in english.
 
LTE INTRO
LTE INTROLTE INTRO
LTE INTRO
 
Umts signaling
Umts signalingUmts signaling
Umts signaling
 
overview for umts
overview for umts overview for umts
overview for umts
 
Ccna3 module 9 exams
Ccna3 module 9 examsCcna3 module 9 exams
Ccna3 module 9 exams
 
ccna-discowey-final-100
 ccna-discowey-final-100 ccna-discowey-final-100
ccna-discowey-final-100
 
Track work presentation
Track work presentationTrack work presentation
Track work presentation
 
Network Configuration Example: Configuring CoS to Support an MC-LAG on an FCo...
Network Configuration Example: Configuring CoS to Support an MC-LAG on an FCo...Network Configuration Example: Configuring CoS to Support an MC-LAG on an FCo...
Network Configuration Example: Configuring CoS to Support an MC-LAG on an FCo...
 
MPLS Presentation
MPLS PresentationMPLS Presentation
MPLS Presentation
 
vlsi qb.docx imprtant questions for all units
vlsi qb.docx imprtant questions for all unitsvlsi qb.docx imprtant questions for all units
vlsi qb.docx imprtant questions for all units
 
C20 20090615-019-alu csfb-performance_enhance
C20 20090615-019-alu csfb-performance_enhanceC20 20090615-019-alu csfb-performance_enhance
C20 20090615-019-alu csfb-performance_enhance
 
QTTS.pdf
QTTS.pdfQTTS.pdf
QTTS.pdf
 
Lteintro 131104065218-phpapp02
Lteintro 131104065218-phpapp02Lteintro 131104065218-phpapp02
Lteintro 131104065218-phpapp02
 

More from phanleson

Learning spark ch01 - Introduction to Data Analysis with Spark
Learning spark ch01 - Introduction to Data Analysis with SparkLearning spark ch01 - Introduction to Data Analysis with Spark
Learning spark ch01 - Introduction to Data Analysis with Sparkphanleson
 
Firewall - Network Defense in Depth Firewalls
Firewall - Network Defense in Depth FirewallsFirewall - Network Defense in Depth Firewalls
Firewall - Network Defense in Depth Firewallsphanleson
 
Mobile Security - Wireless hacking
Mobile Security - Wireless hackingMobile Security - Wireless hacking
Mobile Security - Wireless hackingphanleson
 
Authentication in wireless - Security in Wireless Protocols
Authentication in wireless - Security in Wireless ProtocolsAuthentication in wireless - Security in Wireless Protocols
Authentication in wireless - Security in Wireless Protocolsphanleson
 
E-Commerce Security - Application attacks - Server Attacks
E-Commerce Security - Application attacks - Server AttacksE-Commerce Security - Application attacks - Server Attacks
E-Commerce Security - Application attacks - Server Attacksphanleson
 
Hacking web applications
Hacking web applicationsHacking web applications
Hacking web applicationsphanleson
 
HBase In Action - Chapter 04: HBase table design
HBase In Action - Chapter 04: HBase table designHBase In Action - Chapter 04: HBase table design
HBase In Action - Chapter 04: HBase table designphanleson
 
HBase In Action - Chapter 10 - Operations
HBase In Action - Chapter 10 - OperationsHBase In Action - Chapter 10 - Operations
HBase In Action - Chapter 10 - Operationsphanleson
 
Hbase in action - Chapter 09: Deploying HBase
Hbase in action - Chapter 09: Deploying HBaseHbase in action - Chapter 09: Deploying HBase
Hbase in action - Chapter 09: Deploying HBasephanleson
 
Learning spark ch11 - Machine Learning with MLlib
Learning spark ch11 - Machine Learning with MLlibLearning spark ch11 - Machine Learning with MLlib
Learning spark ch11 - Machine Learning with MLlibphanleson
 
Learning spark ch10 - Spark Streaming
Learning spark ch10 - Spark StreamingLearning spark ch10 - Spark Streaming
Learning spark ch10 - Spark Streamingphanleson
 
Learning spark ch09 - Spark SQL
Learning spark ch09 - Spark SQLLearning spark ch09 - Spark SQL
Learning spark ch09 - Spark SQLphanleson
 
Learning spark ch07 - Running on a Cluster
Learning spark ch07 - Running on a ClusterLearning spark ch07 - Running on a Cluster
Learning spark ch07 - Running on a Clusterphanleson
 
Learning spark ch06 - Advanced Spark Programming
Learning spark ch06 - Advanced Spark ProgrammingLearning spark ch06 - Advanced Spark Programming
Learning spark ch06 - Advanced Spark Programmingphanleson
 
Learning spark ch05 - Loading and Saving Your Data
Learning spark ch05 - Loading and Saving Your DataLearning spark ch05 - Loading and Saving Your Data
Learning spark ch05 - Loading and Saving Your Dataphanleson
 
Learning spark ch04 - Working with Key/Value Pairs
Learning spark ch04 - Working with Key/Value PairsLearning spark ch04 - Working with Key/Value Pairs
Learning spark ch04 - Working with Key/Value Pairsphanleson
 
Learning spark ch01 - Introduction to Data Analysis with Spark
Learning spark ch01 - Introduction to Data Analysis with SparkLearning spark ch01 - Introduction to Data Analysis with Spark
Learning spark ch01 - Introduction to Data Analysis with Sparkphanleson
 
Hướng Dẫn Đăng Ký LibertaGia - A guide and introduciton about Libertagia
Hướng Dẫn Đăng Ký LibertaGia - A guide and introduciton about LibertagiaHướng Dẫn Đăng Ký LibertaGia - A guide and introduciton about Libertagia
Hướng Dẫn Đăng Ký LibertaGia - A guide and introduciton about Libertagiaphanleson
 
Lecture 1 - Getting to know XML
Lecture 1 - Getting to know XMLLecture 1 - Getting to know XML
Lecture 1 - Getting to know XMLphanleson
 
Lecture 4 - Adding XTHML for the Web
Lecture  4 - Adding XTHML for the WebLecture  4 - Adding XTHML for the Web
Lecture 4 - Adding XTHML for the Webphanleson
 

More from phanleson (20)

Learning spark ch01 - Introduction to Data Analysis with Spark
Learning spark ch01 - Introduction to Data Analysis with SparkLearning spark ch01 - Introduction to Data Analysis with Spark
Learning spark ch01 - Introduction to Data Analysis with Spark
 
Firewall - Network Defense in Depth Firewalls
Firewall - Network Defense in Depth FirewallsFirewall - Network Defense in Depth Firewalls
Firewall - Network Defense in Depth Firewalls
 
Mobile Security - Wireless hacking
Mobile Security - Wireless hackingMobile Security - Wireless hacking
Mobile Security - Wireless hacking
 
Authentication in wireless - Security in Wireless Protocols
Authentication in wireless - Security in Wireless ProtocolsAuthentication in wireless - Security in Wireless Protocols
Authentication in wireless - Security in Wireless Protocols
 
E-Commerce Security - Application attacks - Server Attacks
E-Commerce Security - Application attacks - Server AttacksE-Commerce Security - Application attacks - Server Attacks
E-Commerce Security - Application attacks - Server Attacks
 
Hacking web applications
Hacking web applicationsHacking web applications
Hacking web applications
 
HBase In Action - Chapter 04: HBase table design
HBase In Action - Chapter 04: HBase table designHBase In Action - Chapter 04: HBase table design
HBase In Action - Chapter 04: HBase table design
 
HBase In Action - Chapter 10 - Operations
HBase In Action - Chapter 10 - OperationsHBase In Action - Chapter 10 - Operations
HBase In Action - Chapter 10 - Operations
 
Hbase in action - Chapter 09: Deploying HBase
Hbase in action - Chapter 09: Deploying HBaseHbase in action - Chapter 09: Deploying HBase
Hbase in action - Chapter 09: Deploying HBase
 
Learning spark ch11 - Machine Learning with MLlib
Learning spark ch11 - Machine Learning with MLlibLearning spark ch11 - Machine Learning with MLlib
Learning spark ch11 - Machine Learning with MLlib
 
Learning spark ch10 - Spark Streaming
Learning spark ch10 - Spark StreamingLearning spark ch10 - Spark Streaming
Learning spark ch10 - Spark Streaming
 
Learning spark ch09 - Spark SQL
Learning spark ch09 - Spark SQLLearning spark ch09 - Spark SQL
Learning spark ch09 - Spark SQL
 
Learning spark ch07 - Running on a Cluster
Learning spark ch07 - Running on a ClusterLearning spark ch07 - Running on a Cluster
Learning spark ch07 - Running on a Cluster
 
Learning spark ch06 - Advanced Spark Programming
Learning spark ch06 - Advanced Spark ProgrammingLearning spark ch06 - Advanced Spark Programming
Learning spark ch06 - Advanced Spark Programming
 
Learning spark ch05 - Loading and Saving Your Data
Learning spark ch05 - Loading and Saving Your DataLearning spark ch05 - Loading and Saving Your Data
Learning spark ch05 - Loading and Saving Your Data
 
Learning spark ch04 - Working with Key/Value Pairs
Learning spark ch04 - Working with Key/Value PairsLearning spark ch04 - Working with Key/Value Pairs
Learning spark ch04 - Working with Key/Value Pairs
 
Learning spark ch01 - Introduction to Data Analysis with Spark
Learning spark ch01 - Introduction to Data Analysis with SparkLearning spark ch01 - Introduction to Data Analysis with Spark
Learning spark ch01 - Introduction to Data Analysis with Spark
 
Hướng Dẫn Đăng Ký LibertaGia - A guide and introduciton about Libertagia
Hướng Dẫn Đăng Ký LibertaGia - A guide and introduciton about LibertagiaHướng Dẫn Đăng Ký LibertaGia - A guide and introduciton about Libertagia
Hướng Dẫn Đăng Ký LibertaGia - A guide and introduciton about Libertagia
 
Lecture 1 - Getting to know XML
Lecture 1 - Getting to know XMLLecture 1 - Getting to know XML
Lecture 1 - Getting to know XML
 
Lecture 4 - Adding XTHML for the Web
Lecture  4 - Adding XTHML for the WebLecture  4 - Adding XTHML for the Web
Lecture 4 - Adding XTHML for the Web
 

Recently uploaded

Accessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impactAccessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impactdawncurless
 
Arihant handbook biology for class 11 .pdf
Arihant handbook biology for class 11 .pdfArihant handbook biology for class 11 .pdf
Arihant handbook biology for class 11 .pdfchloefrazer622
 
The basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptxThe basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptxheathfieldcps1
 
Mastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory InspectionMastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory InspectionSafetyChain Software
 
Sanyam Choudhary Chemistry practical.pdf
Sanyam Choudhary Chemistry practical.pdfSanyam Choudhary Chemistry practical.pdf
Sanyam Choudhary Chemistry practical.pdfsanyamsingh5019
 
PSYCHIATRIC History collection FORMAT.pptx
PSYCHIATRIC   History collection FORMAT.pptxPSYCHIATRIC   History collection FORMAT.pptx
PSYCHIATRIC History collection FORMAT.pptxPoojaSen20
 
Measures of Central Tendency: Mean, Median and Mode
Measures of Central Tendency: Mean, Median and ModeMeasures of Central Tendency: Mean, Median and Mode
Measures of Central Tendency: Mean, Median and ModeThiyagu K
 
Solving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptxSolving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptxOH TEIK BIN
 
Introduction to ArtificiaI Intelligence in Higher Education
Introduction to ArtificiaI Intelligence in Higher EducationIntroduction to ArtificiaI Intelligence in Higher Education
Introduction to ArtificiaI Intelligence in Higher Educationpboyjonauth
 
mini mental status format.docx
mini    mental       status     format.docxmini    mental       status     format.docx
mini mental status format.docxPoojaSen20
 
Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)eniolaolutunde
 
Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxEmployee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxNirmalaLoungPoorunde1
 
Concept of Vouching. B.Com(Hons) /B.Compdf
Concept of Vouching. B.Com(Hons) /B.CompdfConcept of Vouching. B.Com(Hons) /B.Compdf
Concept of Vouching. B.Com(Hons) /B.CompdfUmakantAnnand
 
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17Celine George
 
How to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptxHow to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptxmanuelaromero2013
 
Q4-W6-Restating Informational Text Grade 3
Q4-W6-Restating Informational Text Grade 3Q4-W6-Restating Informational Text Grade 3
Q4-W6-Restating Informational Text Grade 3JemimahLaneBuaron
 
CARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptxCARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptxGaneshChakor2
 

Recently uploaded (20)

Accessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impactAccessible design: Minimum effort, maximum impact
Accessible design: Minimum effort, maximum impact
 
Arihant handbook biology for class 11 .pdf
Arihant handbook biology for class 11 .pdfArihant handbook biology for class 11 .pdf
Arihant handbook biology for class 11 .pdf
 
The basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptxThe basics of sentences session 2pptx copy.pptx
The basics of sentences session 2pptx copy.pptx
 
Mastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory InspectionMastering the Unannounced Regulatory Inspection
Mastering the Unannounced Regulatory Inspection
 
Sanyam Choudhary Chemistry practical.pdf
Sanyam Choudhary Chemistry practical.pdfSanyam Choudhary Chemistry practical.pdf
Sanyam Choudhary Chemistry practical.pdf
 
PSYCHIATRIC History collection FORMAT.pptx
PSYCHIATRIC   History collection FORMAT.pptxPSYCHIATRIC   History collection FORMAT.pptx
PSYCHIATRIC History collection FORMAT.pptx
 
Measures of Central Tendency: Mean, Median and Mode
Measures of Central Tendency: Mean, Median and ModeMeasures of Central Tendency: Mean, Median and Mode
Measures of Central Tendency: Mean, Median and Mode
 
Solving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptxSolving Puzzles Benefits Everyone (English).pptx
Solving Puzzles Benefits Everyone (English).pptx
 
Staff of Color (SOC) Retention Efforts DDSD
Staff of Color (SOC) Retention Efforts DDSDStaff of Color (SOC) Retention Efforts DDSD
Staff of Color (SOC) Retention Efforts DDSD
 
Introduction to ArtificiaI Intelligence in Higher Education
Introduction to ArtificiaI Intelligence in Higher EducationIntroduction to ArtificiaI Intelligence in Higher Education
Introduction to ArtificiaI Intelligence in Higher Education
 
mini mental status format.docx
mini    mental       status     format.docxmini    mental       status     format.docx
mini mental status format.docx
 
Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)Software Engineering Methodologies (overview)
Software Engineering Methodologies (overview)
 
Employee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptxEmployee wellbeing at the workplace.pptx
Employee wellbeing at the workplace.pptx
 
Model Call Girl in Bikash Puri Delhi reach out to us at 🔝9953056974🔝
Model Call Girl in Bikash Puri  Delhi reach out to us at 🔝9953056974🔝Model Call Girl in Bikash Puri  Delhi reach out to us at 🔝9953056974🔝
Model Call Girl in Bikash Puri Delhi reach out to us at 🔝9953056974🔝
 
Concept of Vouching. B.Com(Hons) /B.Compdf
Concept of Vouching. B.Com(Hons) /B.CompdfConcept of Vouching. B.Com(Hons) /B.Compdf
Concept of Vouching. B.Com(Hons) /B.Compdf
 
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
Incoming and Outgoing Shipments in 1 STEP Using Odoo 17
 
How to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptxHow to Make a Pirate ship Primary Education.pptx
How to Make a Pirate ship Primary Education.pptx
 
Q4-W6-Restating Informational Text Grade 3
Q4-W6-Restating Informational Text Grade 3Q4-W6-Restating Informational Text Grade 3
Q4-W6-Restating Informational Text Grade 3
 
CARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptxCARE OF CHILD IN INCUBATOR..........pptx
CARE OF CHILD IN INCUBATOR..........pptx
 
Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝
Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝
Model Call Girl in Tilak Nagar Delhi reach out to us at 🔝9953056974🔝
 

Chapter 10 -Vlsm

Editor's Notes

  1. Overview A network administrator must anticipate and manage the physical growth of a network, perhaps by buying or leasing another floor of the building to house new networking equipment such as racks, patch panels, switches, and routers. The network designer must choose an addressing scheme that allows for growth. Variable-Length Subnet Masking (VLSM) is a technique that allows for the creation of efficient, scalable addressing schemes. With the phenomenal growth of the Internet and TCP/IP, virtually every enterprise must now implement an IP addressing scheme. Many organizations select TCP/IP as the only routed protocol to run on their network. Unfortunately, the architects of TCP/IP could not have predicted that their protocol would eventually sustain a global network of information, commerce, and entertainment. Twenty years ago, IP version 4 (IPv4) offered an addressing strategy that, although scalable for a time, resulted in an inefficient allocation of addresses. IP version 6 (IPv6), with virtually unlimited address space, is slowly being implemented in select networks and may replace IPv4 as the dominant protocol of the Internet. Over the past two decades, engineers have successfully modified IPv4 so that it can survive the exponential growth of the Internet. VLSM is one of the modifications that has helped to bridge the gap between IPv4 and IPv6.Networks must be scalable in order to meet the changing needs of users. When a network is scalable it is able to grow in a logical, efficient, and cost-effective way. The routing protocol used in a network does much to determine the scalability of the network. Therefore, it is important that the routing protocol be chosen wisely. Routing Information Protocol (RIP) is still considered suitable for small networks, but is not scalable to large networks because of inherent limitations. To overcome these limitations yet maintain the simplicity of RIP version 1 (RIP v1), RIP version 2 (RIP v2) was developed.
  2. © 2003, The SaigonCTT – A Regional Cisco Networking Academy CNAP Semester <x> – <Chapter name> <Chapter> - When IP addressing was first defined in 1981, it was a 32-bit number that had two components: a network address and a node (host) address. Classes of addresses were also defined—Class A, B, and C, and later, Classes D and E. Ultimately, the classful system of IP addressing, even with subnetting, could not scale to effectively handle global demand for Internet connectivity. As early as 1992, the Internet Engineering Task Force (IETF) identified two specific concerns: Exhaustion of the remaining, unassigned IPv4 network addresses. At the time, the Class B space was on the verge of depletion. The rapid and substantial increase in the size of the Internet's routing tables is because of its growth. As more Class C's came online, the resulting flood of new network information threatened Internet routers' capability to cope effectively. One source indicates that in 1990 only about 5000 routes were tracked in order to use the Internet. This number had grown to over 70,000 routes by the end of 1999. Combined with the exponential growth of the Internet, the random assignment of IP addresses throughout the world has contributed to the exponential growth of routing tables
  3. © 2003, The SaigonCTT – A Regional Cisco Networking Academy CNAP Semester <x> – <Chapter name> <Chapter> - Subnet Masking —RFCs 950 (1985), 1812 (1995)—Developed to add another level of hierarchy to an IP address. This additional level allows for extending the number of network addresses derived from a single IP address. (CCNA) Variable-Length Subnet Masks (VLSMs) —RFC 1812 (1995)—Developed to allow multiple levels of subnetworked IP addresses within a single network. This strategy can only be used when it is supported by the routing protocol inuse, such as OSPF and EIGRP. VLSMs are discussed later in this chapter. Classless Inter-Domain Routing (CIDR)— RFCs 1518, 1519 (1993), 2050 (1996)—Developed for ISPs. This strategy suggests that the remaining IP addresses be allocated to ISPs in contiguous blocks, with geography being a consideration. CIDR is discussed later in this chapter. Address Allocation for Private Internets —RFC 1918 (1996)—Developed for organizations that do not need much access to the Internet. The only reason to have a NIC-assigned IP address is to interconnect to the Internet. Any and all companies can use the privately assigned IP addresses within their organization, rather than using a NIC-assigned IP address unnecessarily. (CCNA) Network Address Translation (NAT) —RFC 1631 (1994)—Developed for those companies that use private addressing or use non-NIC-assigned IP addresses. This strategy enables an organization to access the Internet with a NIC-assigned address, without having to reassign the private or “illegal” addresses that are already in place. (NAT is discussed in chapter 14 of this course and in the BCRAN course). Route Summarization— RFC 1518 (1993)—A way of having a single IPaddress represent a collection of IP addresses when you employ a hierarchical addressing plan. Route summarization is discussed later in this chapter.
  4. © 2003, The SaigonCTT – A Regional Cisco Networking Academy CNAP Semester <x> – <Chapter name> <Chapter> - As IP subnets have grown, administrators have looked for ways to use their address space more efficiently. One technique is called Variable-Length Subnet Masks (VLSM). With VLSM, a network administrator can use a long mask on networks with few hosts, and a short mask on subnets with many hosts. VLSM allows an organization to use more than one subnet mask within the same network address space. Implementing VLSM is often referred to as "subnetting a subnet", and can be used to maximize addressing efficiency. Classful routing protocols require that a single network use the same subnet mask. Therefore, network 192.168.187.0 must use just one subnet mask such as 255.255.255.0. VLSM is simply a feature that allows a single autonomous system to have networks with different subnet masks. If a routing protocol allows VLSM, use a 30-bit subnet mask on network connections, 255.255.255.252, a 24-bit mask for user networks, 255.255.255.0, or even a 22-bit mask, 255.255.252.0, for networks with up to 1000 users.
  5. In order to use VLSM, a network administrator must use a routing protocol that supports it. Cisco routers support VLSM with Open Shortest Path First (OSPF), Integrated Intermediate System to Intermediate System (Integrated IS-IS), Enhanced Interior Gateway Routing Protocol (EIGRP), RIP v2, and static routing.
  6. In the past, it has been recommended that the first and last subnet not be used. Use of the first subnet, known as subnet zero, for host addressing was discouraged because of the confusion that can occur when a network and a subnet have the same addresses. The same was true with the use of the last subnet, known as the all-ones subnet. It has always been true that these subnets could be used. However, it was not a recommended practice. As networking technologies have evolved, and IP address depletion has become of real concern, it has become acceptable practice to use the first and last subnets in a subnetted network in conjunction with VLSM. In this network, the network management team has decided to borrow three bits from the host portion of the Class C address that has been selected for this addressing scheme. If management decides to use subnet zero, it has eight useable subnets. Each may support 30 hosts. If the management decides to use the no ip subnet-zero command, it has seven usable subnets with 30 hosts in each subnet. From Cisco IOS version 12.0, remember that Cisco routers use subnet zero by default. Therefore Sydney, Brisbane, Perth, and Melbourne remote offices may each have 30 hosts. The team realizes that it has to address the three point-to-point WAN links between Sydney, Brisbane, Perth, and Melbourne. If the team uses the three remaining subnets for the WAN links, it will have used all of the available addresses and have no room for growth. The team will also have wasted the 28 host addresses from each subnet to simply address three point-to-point networks. Using this addressing scheme one third of the potential address space will have been wasted. Such an addressing scheme is fine for a small LAN. However, this addressing scheme is extremely wasteful if using point-to-point connections.
  7. It is important to design an addressing scheme that allows for growth and does not involve wasting addresses. This section examines how VLSM can be used to prevent waste of addresses on point-to-point links. This time the networking team decided to avoid their wasteful use of the /27 mask on the point-to-point links. The team decided to apply VLSM to the addressing problem. To apply VLSM to the addressing problem, the team will break the Class C address into subnets of variable sizes. Large subnets are created for addressing LANs. Very small subnets are created for WAN links and other special cases. A 30-bit mask is used to create subnets with only two valid host addresses. In this case this is the best solution for the point-to-point connections. The team will take one of the three subnets they had previously decided to assign to the WAN links, and subnet it again with a 30-bit mask. In the example, the team has taken one of the last three subnets, subnet 6 (.192), and subnetted it again. This time the team uses a 30-bit mask. Figures and illustrate that after using VLSM, the team has eight ranges of addresses to be used for the point-to-point links.
  8. In Figure the subnet addresses used are those generated from subdividing the 172.16.32.0/20 subnet into multiple /26 subnets. The figure illustrates where the subnet addresses can be applied, depending on the number of host requirements. For example, the WAN links use subnet addresses with a prefix of /30. This prefix allows for only two hosts, just enough hosts for a point-to-point connection between a pair of routers. To calculate the subnet addresses used on the WAN links, further subnet one of the unused /26 subnets. In this example, 172.16.33.0/26 is further subnetted with a prefix of /30. This provides four more subnet bits and therefore 16 (2 4 ) subnets for the WANs. Figure illustrates how to work through a VLSM masking system. VLSM allows the subnetting of an already subnetted address. For example, consider the subnet address 172.16.32.0/20 and a network needing ten host addresses. With this subnet address, there are over 4000 (21 2 – 2 = 4094) host addresses, most of which will be wasted. With VLSM it is possible to further subnet the address 172.16.32.0/20 to give more network addresses and fewer hosts per network. For example, by subnetting 172.16.32.0/20 to 172.16.32.0/26, there is a gain of 64 (2 6 ) subnets, each of which could support 62 (2 6 – 2) hosts. Use this procedure to further subnet 172.16.32.0/20 to 172.16.32.0/26: Step 1: Write 172.16.32.0 in binary form. Step 2: Draw a vertical line between the 20th and 21st bits, as shown in Figure . /20 was the original subnet boundary. Step 3: Draw a vertical line between the 26th and 27th bits, as shown in Figure . The original /20 subnet boundary is extended six bits to the right, becoming /26. Step 4: Calculate the 64 subnet addresses using the bits between the two vertical lines, from lowest to highest in value. The figure shows the first five subnets available. It is important to remember that only unused subnets can be further subnetted. If any address from a subnet is used, that subnet cannot be further subnetted. In the example, four subnet numbers are used on the LANs. Another unused subnet, 172.16.33.0/26, is further subnetted for use on the WANs.
  9. When using VLSM, try to keep the subnetwork numbers grouped together in the network to allow for aggregation. This means keeping networks like 172.16.14.0 and 172.16.15.0 near one another so that the routers need only carry a route for 172.16.14.0/23. The use of Classless InterDomain Routing (CIDR) and VLSM not only prevents address waste, but also promotes route aggregation, or summarization. Without route summarization, Internet backbone routing would likely have collapsed sometime before 1997. Figure illustrates how route summarization reduces the burden on upstream routers. This complex hierarchy of variable-sized networks and subnetworks is summarized at various points, using a prefix address, until the entire network is advertised as a single aggregate route, 200.199.48.0/22. Route summarization, or supernetting, is only possible if the routers of a network run a classless routing protocol, such as OSPF or EIGRP. Classless routing protocols carry a prefix that consists of 32-bit IP address and bit mask in the routing updates. In Figure , the summary route that eventually reaches the provider contains a 20-bit prefix common to all of the addresses in the organization, 200.199.48.0/22 or 11001000.11000111.0011. For summarization to work properly, carefully assign addresses in a hierarchical fashion so that summarized addresses will share the same high-order bits. Remember the following rules: A router must know in detail the subnet numbers attached to it. A router does not need to tell other routers about each individual subnet if the router can send one aggregate route for a set of routers. A router using aggregate routes would have fewer entries in its routing table.
  10. VLSM allows for the summarization of routes and increases flexibly by basing the summarization entirely on the higher-order bits shared on the left, even if the networks are not contiguous. The graphic shows that the addresses, or routes, share each bit up to and including the 20th bit. These bits are colored red. The 21st bit is not the same for all the routes. Therefore the prefix for the summary route will be 20 bits long. This is used to calculate the network number of the summary route. Figure shows that the addresses, or routes, share each bit up to and including the 21st bit. These bits are colored red. The 22nd bit is not the same for all the routes. Therefore the prefix for the summary route will be 21 bits long. This is used to calculate the network number of the summary route.   
  11. If VLSM is the scheme chosen, it must then be calculated and configured correctly. In this example allow for the following: Network address: 192.168.10.0 The Perth router has to support 60 hosts. In this case, a minimum of six bits are needed in the host portion of the address. Six bits will yield 62 possible host addresses, 26 = 64 – 2 = 62, so the division was 192.168.10.0/26. The Sydney and Singapore routers have to support 12 hosts each. In these cases, a minimum of four bits are needed in the host portion of the address. Four bits will yield 14 possible host addresses, 24 = 16 – 2 = 14, so the division is 192.168.10.96/28 for Sydney and 192.168.10.112/28 for Singapore. The Kuala Lumpur router requires 28 hosts. In this case, a minimum of five bits are needed in the host portion of the address. Five bits will yield 30 possible host addresses, 25 = 32 – 2 = 30, so the division here is 192.168.10.64/27. The following are the point-to-point connections: Perth to Kuala Lumpur 192.168.10.128/30 – Since only two addresses are required, a minimum of two bits are needed in the host portion of the address. Two bits will yield two possible host addresses (22 = 4 – 2 = 2) so the division here is 192.168.10.128/30. Sydney to Kuala Lumpur 192.168.10.132/30 – Since only two addresses are required, a minimum of two bits are needed in the host portion of the address. Two bits will yield two possible host addresses (22 = 4 – 2 = 2) so the division here is 192.168.10.132/30. Singapore to Kuala Lumpur 192.168.10.136/30 – Since only two addresses are required, a minimum of two bits are needed in the host portion of the address. Two bits will yield two possible host addresses (22 = 4 – 2 = 2) so the division here is 192.168.10.136/30. There is sufficient host address space for two host endpoints on a point-to-point serial link. The example for Singapore to Kuala Lumpur is configured as follows: Singapore(config)# interface serial 0 Singapore(config-if)# ip address 192.168.10.137 255.255.255.252 KualaLumpur(config)# interface serial 1 KualaLumpur(config-if)# ip address 192.168.10.138 255.255.255.252
  12. The Internet is a collection of autonomous systems (AS). Each AS is generally administered by a single entity. Each AS will have its own routing technology, which may differ from other autonomous systems. The routing protocol used within an AS is referred to as an Interior Gateway Protocol (IGP). A separate protocol, called an Exterior Gateway Protocol (EGP), is used to transfer routing information between autonomous systems. RIP was designed to work as an IGP in a moderate-sized AS. It is not intended for use in more complex environments. RIP v1 is considered an interior gateway protocol that is classful. RIP v1 is a distance vector protocol that broadcasts its entire routing table to each neighbor router at predetermined intervals. The default interval is 30 seconds. RIP uses hop count as a metric, with 15 as the maximum number of hops. If the router receives information about a network, and the receiving interface belongs to the same network but is on a different subnet, the router applies the one subnet mask that is configured on the receiving interface: For Class A addresses, the default classful mask is 255.0.0.0. For Class B addresses, the default classful mask is 255.255.0.0. For Class C addresses, the default classful mask is 255.255.255.0. RIP v1 is a popular routing protocol because virtually all IP routers support it. The popularity of RIP v1 is based on the simplicity and the universal compatibility it demonstrates. RIP v1 is capable of load balancing over as many as six equal-cost paths, with four paths as the default.
  13. RIP v1 has the following limitations: It does not send subnet mask information in its updates. It sends updates as broadcasts on 255.255.255.255. It does not support authentication. It is not able to support VLSM or classless interdomain routing (CIDR).
  14. RIP v2 is an improved version of RIP v1 and shares the following features: It is a distance vector protocol that uses a hop count metric. It uses holddown timers to prevent routing loops – default is 180 seconds. It uses split horizon to prevent routing loops. It uses 16 hops as a metric for infinite distance. RIP v2 provides prefix routing, which allows it to send out subnet mask information with the route update. Therefore, RIP v2 supports the use of classless routing in which different subnets within the same network can use different subnet masks, as in VLSM. RIP v2 provides for authentication in its updates. A set of keys can be used on an interface as an authentication check. RIP v2 allows for a choice of the type of authentication to be used in RIP v2 packets. The choice can be either clear text or Message-Digest 5 (MD5) encryption. Clear text is the default. MD5 can be used to authenticate the source of a routing update. MD5 is typically used to encrypt enable secret passwords and it has no known reversal. RIP v2 multicasts routing updates using the Class D address 224.0.0.9, which provides for better efficiency.
  15. RIP uses distance vector algorithms to determine the direction and distance to any link in the internetwork. If there are multiple paths to a destination, RIP selects the path with the least number of hops. However, because hop count is the only routing metric used by RIP, it does not necessarily select the fastest path to a destination. RIP v1 allows routers to update their routing tables at programmable intervals. The default interval is 30 seconds. The continual sending of routing updates by RIP v1 means that network traffic builds up quickly. To prevent a packet from looping infinitely, RIP allows a maximum hop count of 15. If the destination network is more than 15 routers away, the network is considered unreachable and the packet is dropped. This situation creates a scalability issue when routing in large heterogeneous networks. RIP v1 uses split horizon to prevent loops. This means that RIP v1 advertises routes out an interface only if the routes were not learned from updates entering that interface. It uses holddown timers to prevent routing loops. Holddowns ignore any new information about a subnet indicating a poorer metric for a time equal to the holddown timer. Figure summarizes the behavior of RIP v1 when used by a router. RIP v2 is an improved version of RIP v1. It has many of the same features of RIP v1. RIP v2 is also a distance vector protocol that uses hop count, holddown timers, and split horizon. Figure compares and contrasts RIP v1 and RIP v2.
  16. RIP v2 is a dynamic routing protocol that is configured by naming the routing protocol RIP Version 2, and then assigning IP network numbers without specifying subnet values. This section describes the basic commands used to configure RIP v2 on a Cisco router. To enable a dynamic routing protocol, the following tasks must be completed: Select a routing protocol, such as RIP v2. Assign the IP network numbers without specifying the subnet values. Assign the network or subnet addresses and the appropriate subnet mask to the interfaces. RIP v2 uses multicasts to communicate with other routers. The routing metric helps the routers find the best path to each network or subnet. The router command starts the routing process. The network command causes the implementation of the following three functions: The routing updates are multicast out an interface. The routing updates are processed if they enter that same interface. The subnet that is directly connected to that interface is advertised. The network command is required because it allows the routing process to determine which interfaces will participate in the sending and receiving of routing updates. The network command starts up the routing protocol on all interfaces that the router has in the specified network. The network command also allows the router to advertise that network. The router rip version 2 command specifies RIP v2 as the routing protocol, while the network command identifies a participating attached network.
  17. The show ip protocols command displays values about routing protocols and routing protocol timer information associated with the router. In the example, the router is configured with RIP and sends updated routing table information every 30 seconds. This interval is configurable. If a router running RIP does not receive an update from another router for 180 seconds or more, the first router marks the routes served by the non-updating router as being invalid. In Figure , the holddown timer is set to 180 seconds. Therefore, an update to a route that was down and is now up could stay in the holddown state until the full 180 seconds have passed. If there is still no update after 240 seconds the router removes the routing table entries. In the figure, it has been 18 seconds since Router A received an update from Router B. The router is injecting routes for the networks listed following the Routing for Networks line. The router is receiving routes from the neighboring RIP routers listed following the Routing Information Sources line. The distance default of 120 refers to the administrative distance for a RIP route. The show ip interface brief command can also be used to list a summary of the information and status of an interface.
  18. The show ip route command displays the contents of the IP routing table. The routing table contains entries for all known networks and subnetworks, and contains a code that indicates how that information was learned. The output of key fields from this command and their function is explained in the table. Examine the output to see if the routing table is populated with routing information. If entries are missing, routing information is not being exchanged. Use the show running-config or show ip protocols privileged EXEC commands on the router to check for a possible misconfigured routing protocol.
  19. Use the debug ip rip command to display RIP routing updates as they are sent and received. The no debug all or undebug all commands will turn off all debugging. The example shows that the router being debugged has received updates from one router at source address 10.1.1.2. The router at source address 10.1.1.2 sent information about two destinations in the routing table update. The router being debugged also sent updates, in both cases to broadcast address 255.255.255.255 as the destination. The number in parentheses is the source address encapsulated into the IP header. Other outputs sometimes seen from the debug ip rip command includes entries such as the following: RIP: broadcasting general request on Ethernet0 RIP: broadcasting general request on Ethernet1 These outputs appear at startup or when an event occurs such as an interface transition or a user manually clears the routing table. An entry, such as the following, is most likely caused by a malformed packet from the transmitter: RIP: bad version 128 from 160.89.80.43
  20. By default, routers learn paths to destinations three different ways: Static routes – The system administrator manually defines the static routes as the next hop to a destination. Static routes are useful for security and traffic reduction, as no other route is known. Default routes – The system administrator also manually defines default routes as the path to take when there is no known route to the destination. Default routes keep routing tables shorter. When an entry for a destination network does not exist in a routing table, the packet is sent to the default network. Dynamic routes – Dynamic routing means that the router learns of paths to destinations by receiving periodic updates from other routers. The ip default-network command establishes a default route in networks using dynamic routing protocols: Router(config)# ip default-network 192.168.20.0 Generally after the routing table has been set to handle all the networks that must be configured, it is often useful to ensure that all other packets go to a specific location. One example is a router that connects to the Internet. This is called the default route for the router. All the packets that are not defined in the routing table will go to the nominated interface of the default router. The ip default-network command is usually configured on the routers that connect to a router with a static default route.  In Figure , Hong Kong 2 and Hong Kong 3 would use Hong Kong 4 as the default gateway. Hong Kong 4 would use interface 192.168.19.2 as its default gateway. Hong Kong 1 would route packets to the Internet for all internal hosts. To allow Hong Kong 1 to route these packets it is necessary to configure a default route as: HongKong1(config)# ip route 0.0.0.0 0.0.0.0 192.168.20.1 The zeros represent any destination network with any mask. Default routes are referred to as quad zero routes. In the diagram, the only way Hong Kong 1 can go to the Internet is through the interface 192.168.20.1.  
  21. _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________
  22. _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________ _________________________________________________________________________