1. NATIONAL INSTITUTE OF TECHNOLOGY KURUKSHETRA
Computer Engineering Department
Submitted to
Ms Dipti Goel
Assistant professor
Computer department
Routing Basics
concepts
Submitted by
Navin Budania
1130608
Co-4
3. INTRODUCTION
• Forwarding the packets from one network to
the other network choosing the best path from
the routing table.
• Routing makes possible for two or more
networks to communicate with each other
• Routing table only consist of only the best
routes for each destination.
• Routing is done by router.
4. ROUTER
• Router is a device which makes connection
possible between two or more different
networks present at same or different
geographical locations.
• It does two basic things:.
1. Select the best path from the routing table.
2. Forward the packet on that path.
5. ROUTER
• Routers are classified in two classes.
1. Fixed Routers
2. Modular Routers
• There are three types of ports on the router.
1. LAN ports :Ethernet ports, fast Ethernet ports
2. WAN ports: Serial interfaces
3. Administrative Ports
9. ROUTER
• Internal components of router
– ROM(Read Only Memory)
– POST(Power on self Test)
– Mini-IOS
– RAM(Random Access Memory)
– Flash Memory
– NVRAM(Non-Volatile RAM)
10. Router
• Modes of the router
– Set up mode
• Continue with configuration dialog[yes/no]
– User mode
• Router>
– Privileged mode
• Router#
– Global configuration mode
• Router(config)#
– Interface mode
• Router(config-if)#
11. IPv4
• Internet uses IPv4
Addresses are 32 bits long
Range from 1.0.0.0 to 223.255.255.255
• Classification in classes
• Class A : 1 to 127
• Class B : 128 to 191
• Class C : 192 to 223
12. IPv4 subnet mask
• Subnet mask
mask represents the number of network
bits in the 32 bit address
the remaining bits are the host bits
• Default subnet mask
Class A : 255.0.0.0
Class B : 255.255.0.0
Class C : 255.255.255.0
13. Static Routing
• It is configured manually by the administrator.
• Mandatory need for the destination network
ID
• Used for small organizations
• In static routing the administrator decide the
best path
• Administrator should know that what is the
destination ID and how many routes to reach
that destination
14. Static Routing
• Advantage
– No overhead on the router CPU
– No bandwidth use
– Security
• Disadvantage
– Used for small network
16. Configuring Static Routing
• Router0(config)#ip route <destination
network ID> <destination subnet mask>
<next hop ip address>
17. Dynamic Routing
• Routing tables are automatically update
• Two types
– Distance vector routing algorithms
– Link –state routing algorithm
18. Distance vector routing Algorithm
• Calculate distance between routers based on hop
count.
• Updates are sent to directly connected neighbour
only
• Routers don`t have end to end visibility of entire
network
• Routing loops
• Use Bellman Ford Algorithm
• Example : RIP (Routing Information Protocol)
19. RIP
• Use hop count as metric
• Supports hop count limit 15
• AD value is 120
• More convergence time
• Periodic – 30sec update
22. Link –state Routing Algorithm
• Updates are sent to entire network
• Routers have visibility of entire network
• No routing loops
• Use Dijkshtra Algorithm
• Link State Database
• Example : OSPF (Open Shortest Path First)
23. OSPF
• Standard protocol
• Administrative distance is 110
• Unlimited hop count
• Must have one area called as area 0
• All the areas must connect to area 0
• Faster convergence
25. Configure OSPF
• The syntax for configuring OSPF is :
– Process ID
– Network IP Address
– Wildcard mask
– Area
• Configuration
router(config)#router ospf 10
router(config-router)#network <network IP
address of own router> <wildcard mask> area
area_no