OSI Model Routing Connection-oriented/Connectionless Network Services.
CS 350 Chapter-9,10. Implementation of Connectionless Service Routing within a datagram network...
-
Upload
buck-fowler -
Category
Documents
-
view
216 -
download
1
Transcript of CS 350 Chapter-9,10. Implementation of Connectionless Service Routing within a datagram network...
CS 350Chapter-9,10
Implementation of Connectionless Service
Routing within a datagram network
ISP’s equipment
A’s table (initially) A’s table (later) C’s Table E’s Table
Implementation of Connection-Oriented Service
Routing within a virtual-circuit network
ISP’s equipment
A’s table C’s Table E’s Table
Comparison of Virtual-Circuit and Datagram Networks
Comparison of datagram and virtual-circuit networks
The IP Routing Process
• IP address, Mac address
Routing Protocols
Routing
Static Routing
Dynamic Routing
IGP EGPProtocols: BGP
Distance VectorProtocols: RIPv1&2, IGRP
Link StateProtocols: OSPF, IS-IS
HybridProtocols: EIGRP
Default Administrative
DistanceRoute Source Default AD
Connected interface
0
Static route 1
EIGRP 90
IGRP 100
OSPF 110
RIP 120
External EIGGRP 170
Unknown 255(this route will never be used)
(a) A network. (b) Input from A, I, H, K, and the new routing table for J.
Distance Vector Routing
The Count-to-Infinity Problem
The count-to-infinity problem
Link State Routing1. Discover neighbors, learn network addresses.
2. Set distance/cost metric to each neighbor.
3. Construct packet telling all learned.
4. Send packet to, receive packets from other routers.
5. Compute shortest path to every other router.
Building Link State Packets
(a) A network. (b) The link state packets for this network.
Distributing the Link State Packets
The packet buffer for router B in previous slide
RIPv1 RIPv2
Distance vector Distance vector
Maximum hop count 15 Maximum hop count 15
Classful Classless
Broadcast based Uses Multicast 224.0.0.9
No support for VLSM Supports for VLSM
No Authentication Allow for MD5 authentication
No support for discontiguous networks
Supports discontiguous networks
Characteristic OSPF RIPv2 RIPv1
Type of protocol Link state Distance vector
Distance vector
Classless support Yes Yes No
VLSM support Yes Yes No
Auto summarization
No Yes Yes
Manual summarization
Yes No No
Discontiguous support
Yes Yes No
Rout propagation Multicast on change
Periodic multicast
Periodic broadcast
Characteristic OSPF RIPv2 RIPv1
Path metric Bandwidth Hops Hops
Convergence Fast Slow Slow
Peer authentication
Yes Yes No
Hierarchical Yes (using area)
No (flat only) No (flat only)
Update Event triggered
Rout table updates
Rout table updates
Rout computation
Dijkstra Bellman-Ford Bellman-Ford
Hierarchical Routing
Hierarchical routing.