Documente Academic
Documente Profesional
Documente Cultură
No
Send ICMP MAC No Send ARP
Decremental
To Address Request & wait
TTL>=0? Found
Originator for response
Yes Yes
Route table
Lookup Discard
Based on Original Build new packet Received ARP
Destination with MAC address
Address
Message Reply Insert MAC
No Found, route packet and IP Address
No
through port found into ARP table
Default route In routing table
Route found
Available
D.C.Sonkhla,SDE(Computer)
Internet Routing
Hosts and Gateways are presented with
datagram addressed to some host.
Routing is the method by which the host or
Gateway decides, where to send the datagram.
It may be able to send the Datagram directly to
the destination if it is connected to that n/w or
gateway directly.
If the destination is not directly reachable, then it
will try to send the datagram to a gateway that
is nearer to the destination.
Internet Routing
1
2
134.3.0.0
1Hop
2Hop
134.5.0.0
IP Header IP Data
DA SA TF Data CRC
RIP Operational Types
RIP can operate in either ACTIVE or
PASSIVE mode
Active means that it builds routing tables and
response to RIP requests.
Passive means that it can build a routing
table for its own use, but it does not respond
to any RIP requests.
Most works stations (PCs) use a default
gateway (I.e., router) and not a routing update
protocol like RIP
RIP Algorithm
RIP defines the “best” route as the one with least number of
routing hops
Once a router is installed, or started, it should send messages
to all of its neighbors
A B C D
A B C D
E
A Bigger Update
Z 1 Route Hop
Route Hop
Y 1
X 1
Y 1
Router A Z 2
Z Y
Route HopX
Route Hop
Route Hop
Network Hop Router Port
W 1 Local 2 W 1
X 1
X 1 Local 1
Y 2
Y 2 B 1 Z 3
Z 3 B 1
Which Rout is chosen by RIP
E1
10.1.2.0 E1
E3
Router A Router B
160.1.0.0 150.1.3.0
Supports
•VLSM (Variable Length Subnet Mark), CIDR super netting
(It won’t Support RIP)
•Route Summarization
•OSPF uses IP multicast to send link state updates.
This ensures less processing on routers that are not
listening to OSPF packets.
•Updates are sent only in case of routing changes occur instead
Of periodically.
•Better use of Bandwidth
•Better convergence
•No Limitation of hop count
•The intelligent use of VLSM & Super netting & efficient
IP address allocation.
•Supports fully class less behaviors
•Uses IP multicast to send link state updates.
•Better convergence than RIP, this is because routing
changes are propagated instance only and not periodically.
•Routing authentication by different method of password
authentication.
•Keeps tracks of external routes injected by external
Protocol such as BGP
Link State
OSPF is a link state, we can think of a link as being an
Interface and of its relationship to its neighboring routers
A descriptions of interface include:
IP address of interface, the Mark, the type of N/W it is connected to,
routers connected to that N/W.
The collection of all these link state, would from Link State Database.
Link State Algorithm
OSPF uses link state Algorithm to build and calculate the shortest
path to all its known destination.
Upon initialization or due to any change in routing information, a
router will generate a link state advertisement
All router will exchange link states by means of flooding.
Each router that receives a link state update should store
a copy In its link state database and then propagate
the update to other routers.
After the database of each router is completed the router
6. with calculate the shortest path Tree for all destinations
(using Digastrics Algorithm )
• In case of no changes in the OSPF N/W occur such as
cost of link or a N/W being added or deleted, OSPF should
be very quite.
• Any changes that are occur are communicated via link
state packets, and the Digastrics algorithm is recalculated
to find shortest path.
Shortest Path Algorithm:
OSPF cost:
AS 2
Contain AS2
Route entries
Does not
Contain AS2 Area 2
Area 1 Route entries
•An area that has only one entry and one exit point (must be the
same area).
•Used to reduce the number of external advertisements.
•A stub area blocks AS external link advertisements.
Stub Network: A network which is connected to only one router
e.g. a LAN to a router.
Network Types: OSPF Media Support
OSPF Defines 5 Network Types
• Broadcast Networks- Networks such as Ethernet, Token Ring, and FDDI
• Non-broadcast Multi access (NBMA) Networks-access that does not support
broadcast but allows for multiple station access such as ATM, Frame Relay, and
X.25.
• Point-to-Point Networks-Links that only have two networks attachments, such
as two routers connected by a serial line.
• Point to Multipoint Networks
• Virtual Links
— Not all neighbors become adjacent-whether an adjacency is formed or not
depends on type of network to which two neighbors are attached
— Network type also influence the way in which OSPF packets are transmitted.
Two routers are neighbors when connected by physical link (or logical link)
virtual link)
Hello packet (Router ID + Network address of link + Hello interval)
After Hello, the two neighbor should synchronies their database (i.e. protocol
parameters, firms, optional capabilities etc.) to establish ‘adjacency’.
•LSA Received
•Is Entry in topological Database? Link State Protocol
Yes-Reset Timer for entry
No-Add to database
•Flood LSA
•Run SPF to calculate new table
Routing table
Topological Database Link State advertisements
5
2 3
SPF Algorithm 4
Area 1
Area 2
1.1.1.1 ABR
RTA 2.2.2.2
RTB
Summarization
ABR
Area 0
Backbone Area
RC 2 2
RF
E0: E0:
S0: SI:
10.1.1.1 10.1.3.1
10.1.2.1 10.1.6.1
S0:
10.1.4.2
S0:
S0: 10.1.6.2
CARROLL
10.1.2.2 E0:
LEWIS 10.1.7.1
SI:
NETWORK NEXT HOP 10.1.4.1
NETWORK NEXT HOP
NETWORK NEXT HOP
DAHI BAUM
10.1.1.0 directly connected
10.1.2.0 directly connected 10.1.1.0 10.1.4.1
10.1.3.0 10.1.2.2 NETWORK NEXT HOP 10.1.2.0 10.1.4.1
10.1.4.0 10.1.2.2 10.1.3.0 10.1.4.2 NETWORK NEXT HOP
10.1.5.0 10.1.2.2 10.1.2.0 directly connected 10.1.4.0 directly connected
10.1.6.0 10.1.2.2 10.13.0 directly connected 10.1.5.0 directly connected 10.1.1.0 10.1.6.1
10.1.7.0 10.1.2.2 10.14.0 directly connected 10.1.6.0 directly connected 10.1.2.0 10.1.6.1
10.1.5.0 10.1.4.2 10.1.6.0 10.1.6.2 10.1.3.0 10.1.6.1
10.1.6.0 10.1.4.2 10.1.4.0 10.1.6.1
10.1.7.0 10.1.4.2 10.1.5.0 10.1.6.1
10.1.6.0 directly connected
10.1.7.0 directly connected
Lewis # show IP route
Codes: C-Connected, S-static, I =GRP,
R- RIP, M-Mobile, B = BGP, D= EIGRP
O- OSPF
Lewis #
- Default route not defined
(1/0) (Administrate distance/ Lost metric)
192.168.1.65/27
192.168.1.193/27 10.1.5.1/16
192.168.1.1/27
TIGGER
POOH
192.168.1.66/27 192.168.1194/27
10.4.6.1/24
10.4.6.2/24
10.4.7.1/27
STARIC ROUTE CONTRIBUTION
Internetwork has six subnets
•10.1.0.0/16 Procedure
•10.4.6.0/24
1. For each datalink, identify all addresses (subnet or network)
•10.4.7.0/24
2. For each ROUTER identify all routes NOT directly connected
•192.168.1.192/27
3. For each router, write route statement for each data link
•192.168.164/27
not directly connected
•192.168.1.0/27
• Path Vector comes from the fact that BGP routing information's carries
a sequence of AS numbers
AS2
AS1
AS3
AS n-1
AS4
AS n
AS5
Autonomous System
• An, AS is a way of reporting to “Someone Network” (VSNL, BSNL, MTNL etc.)
• And one or multiple “Border Routers” (Where Routers in that ‘AS’ peer and
exchange routes with other ASs)
• When you “advertise” routes to other ‘AS’, One way of thinking of those route
“advertisements” is as “promise” to carry data to the IP space represented in the route
Being advertised.
e.g. if you advertise 192.202.4.0/24, the class ‘C’ starting at 192.202.4.0 and
Ending at 192.202.4.255.
You promise that if someone send you data destined for any address in 192.202.4.0/24,
You know how to carry that data to its ultimate destination
How BGP Works
•Path Vector Protocol carry information between Ass.
•Path Vector comes form the fact that BGP routing information carries
a sequence of AS numbers
•Which indicates the path a route has transferred. BGP user TCP (Port 179)
•Two BGP routers forms a transport protocol connection between each other are peers
or neighbors
•Peer routers exchange multiple message to open and each confirm the connection
parameters
•In case of disagreement, notification errors are sent and peer connection does not get established
•In case of information changes, such as route being unreachable or having a better path,
BGP informs its neighbors by with drawing invalid routes and injecting new routing
information
•Keep alive message sent periodically every 60 seconds (if no routing change)