2. Overview
• What's Router?
• What does a router do?
• What's Routing & How do packets get from A to B in the
Internet?
• Routing Table.
• Connectionless Forwarding
• ISP Routing Tasks
2
3. What's Router?
• A router consists of a computer networking device that
determines the next network point to which a data packet has
to be forwarded on its way to its destination
3
4. What does a router do?
• find path
• forward packet
• find alternate path
• forward packet
• repeat until powered off
4
5. What's Routing Protocol?
• Routing Protocol decide on routes to be taken data and transmit
• How do packets get from A to B in the Internet?
A B
Internet
5
6. Routing Protocols
• Distribute the knowledge of the current topology
state of the network to all routers
• This knowledge is used by each router to
generate a forwarding table, which contains the
local switching decision for each known
destination address
6
7. Routing Protocols
• correct operation of the routing state of a
network is essential for the management
of a quality network service
• accuracy of the routing information
• dynamic adjustment of the routing
information
• matching aggregate traffic flow to network
capacity
7
8. The routing table
One routing table is needed for each router
The routing table consists of at least three information
fields:-
the Network ID : i.e. the destination network id
Cost: i.e. the cost or metric of the path through which
the packet is to be sent
Next Hop: The next hop, or gateway, is the address of
the next station to which the packet is to be sent on the
way to its final destination
8
10. Connectionless Forwarding
• Each router (switch) makes a LOCAL decision to forward the
packet towards B
A B
R1 R4
R2
R3
R6
R7
R5
R8
10
11. Connectionless Forwarding
• This is termed destination-based connectionless forwarding
• How does each router know the correct local forwarding
decision for any possible destination address?
• Through knowledge of the topology state of the network
• This knowledge is maintained by a routing protocol
11
14. Cont…
• describe the current network topology.
• Routing protocols function through either
• distributed computing model (distance
vector)
• parallel computing model (link state)
14
15. Routing Protocols
• Distance Vector Routing Protocols
• RIP is the main laible to choice the best way to
transmit data from A to B
• Each node sends its routing table (dest,
distance) to all neighbors every 30 seconds
• Lowest distances are updated with the
neighbor as next hop
15
16. Routing Protocols
• Link State Routing Protocols
• Each router re-computes the routing
table in parallel using the common link
state database
16
Halbzhradne bashtren rega bo halgrtn u nardne data
Bash bash krdny hamu aw data yanay ka danerdren la sourcseke dyare kraw lo destenation ba hoy rawter
Aw zanyareyana ba karde la layan rawtarakanawa bo badehenay forwarding table har table local swiching tedaya =swiching table lo zanene destention addreesaw datay ley haldagere
Bashtren operation la routing state la networkekda ba shewayke bnchenay ba karde bo dyare krdny quilty xzmat guzare network
1-nardny zanyare ba shewayki rek be kamu kurty
2-la katy nardne zanyareyakan har keshak habe automatic chay daka
3-dagunje la gal sarjam groupakny trafek folw
Dozenaway topologeya(star ,mesh,ring ,etc) la network la operationek da da la katy dabash krdn krdny routing protocol
Jore network topology dyare daka
2 jor fun jya haya bo roting protocol
Kurtkrway rowting intenet protocol (RIP) barprsa la halbzhardne bashtren rega bo guwastnawa data
Har nodek roting table danere bo hawsnoerakany la amway 30 chrka da
kamtrin dwry halabzherdret la har updet bunawaiakda
Har rawtarek dubara hazhmary rowting table dakatwa ba sheway parallel ba bakarhenay common link state data base (aw linkay rastawaw bastrwatawa ba ba database ka kamtren techuy haya )