cs 350
DESCRIPTION
CS 350. Chapter-9,10. Implementation of Connectionless Service. ISP ’ s equipment. Routing within a datagram network. A ’ s table (initially) A ’ s table (later) C ’ s Table E ’ s Table. Implementation of Connection-Oriented Service. ISP ’ s equipment. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: CS 350](https://reader036.vdocuments.mx/reader036/viewer/2022062520/568161da550346895dd1e420/html5/thumbnails/1.jpg)
CS 350Chapter-9,10
![Page 2: CS 350](https://reader036.vdocuments.mx/reader036/viewer/2022062520/568161da550346895dd1e420/html5/thumbnails/2.jpg)
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
![Page 3: CS 350](https://reader036.vdocuments.mx/reader036/viewer/2022062520/568161da550346895dd1e420/html5/thumbnails/3.jpg)
Implementation of Connection-Oriented Service
Routing within a virtual-circuit network
ISP’s equipment
A’s table C’s Table E’s Table
![Page 4: CS 350](https://reader036.vdocuments.mx/reader036/viewer/2022062520/568161da550346895dd1e420/html5/thumbnails/4.jpg)
Comparison of Virtual-Circuit and Datagram Networks
Comparison of datagram and virtual-circuit networks
![Page 5: CS 350](https://reader036.vdocuments.mx/reader036/viewer/2022062520/568161da550346895dd1e420/html5/thumbnails/5.jpg)
The IP Routing Process• IP address, Mac address
![Page 6: CS 350](https://reader036.vdocuments.mx/reader036/viewer/2022062520/568161da550346895dd1e420/html5/thumbnails/6.jpg)
Routing ProtocolsRouting
Static Routing
Dynamic Routing
IGP EGPProtocols: BGP
Distance VectorProtocols: RIPv1&2, IGRP
Link StateProtocols: OSPF, IS-IS
HybridProtocols: EIGRP
![Page 7: CS 350](https://reader036.vdocuments.mx/reader036/viewer/2022062520/568161da550346895dd1e420/html5/thumbnails/7.jpg)
Default Administrative
DistanceRoute Source Default ADConnected interface
0
Static route 1EIGRP 90IGRP 100OSPF 110RIP 120External EIGGRP 170Unknown 255(this route will never be
used)
![Page 8: CS 350](https://reader036.vdocuments.mx/reader036/viewer/2022062520/568161da550346895dd1e420/html5/thumbnails/8.jpg)
(a) A network. (b) Input from A, I, H, K, and the new routing table for J.
Distance Vector Routing
![Page 9: CS 350](https://reader036.vdocuments.mx/reader036/viewer/2022062520/568161da550346895dd1e420/html5/thumbnails/9.jpg)
The Count-to-Infinity Problem
The count-to-infinity problem
![Page 10: CS 350](https://reader036.vdocuments.mx/reader036/viewer/2022062520/568161da550346895dd1e420/html5/thumbnails/10.jpg)
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.
![Page 11: CS 350](https://reader036.vdocuments.mx/reader036/viewer/2022062520/568161da550346895dd1e420/html5/thumbnails/11.jpg)
Building Link State Packets
(a) A network. (b) The link state packets for this network.
![Page 12: CS 350](https://reader036.vdocuments.mx/reader036/viewer/2022062520/568161da550346895dd1e420/html5/thumbnails/12.jpg)
Distributing the Link State Packets
The packet buffer for router B in previous slide
![Page 13: CS 350](https://reader036.vdocuments.mx/reader036/viewer/2022062520/568161da550346895dd1e420/html5/thumbnails/13.jpg)
RIPv1 RIPv2Distance vector Distance vectorMaximum hop count 15 Maximum hop count 15Classful ClasslessBroadcast based Uses Multicast 224.0.0.9No support for VLSM Supports for VLSMNo Authentication Allow for MD5
authenticationNo support for discontiguous networks
Supports discontiguous networks
![Page 14: CS 350](https://reader036.vdocuments.mx/reader036/viewer/2022062520/568161da550346895dd1e420/html5/thumbnails/14.jpg)
Characteristic OSPF RIPv2 RIPv1Type of protocol Link state Distance
vectorDistance vector
Classless support Yes Yes NoVLSM support Yes Yes NoAuto summarization
No Yes Yes
Manual summarization
Yes No No
Discontiguous support
Yes Yes No
Rout propagation Multicast on change
Periodic multicast
Periodic broadcast
![Page 15: CS 350](https://reader036.vdocuments.mx/reader036/viewer/2022062520/568161da550346895dd1e420/html5/thumbnails/15.jpg)
Characteristic OSPF RIPv2 RIPv1Path metric Bandwidth Hops HopsConvergence Fast Slow SlowPeer 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
![Page 16: CS 350](https://reader036.vdocuments.mx/reader036/viewer/2022062520/568161da550346895dd1e420/html5/thumbnails/16.jpg)
Hierarchical Routing
Hierarchical routing.