1 / 16

CS 350

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.

nodin
Download Presentation

CS 350

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CS 350 Chapter-9,10

  2. 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

  3. Implementation of Connection-Oriented Service ISP’s equipment Routing within a virtual-circuit network A’s table C’s Table E’s Table

  4. Comparison of Virtual-Circuit and Datagram Networks Comparison of datagram and virtual-circuit networks

  5. The IP Routing Process • IP address, Mac address

  6. Routing Protocols Routing Dynamic Routing Static Routing EGP Protocols: BGP IGP Link State Protocols: OSPF, IS-IS Distance Vector Protocols: RIPv1&2, IGRP Hybrid Protocols: EIGRP

  7. Default Administrative Distance

  8. Distance Vector Routing (a) A network. (b) Input from A, I, H, K, and the new routing table for J.

  9. The Count-to-Infinity Problem The count-to-infinity problem

  10. Link State Routing • Discover neighbors, learn network addresses. • Set distance/cost metric to each neighbor. • Construct packet telling all learned. • Send packet to, receive packets from other routers. • Compute shortest path to every other router.

  11. Building Link State Packets (a) A network. (b) The link state packets for this network.

  12. Distributing the Link State Packets The packet buffer for router B in previous slide

  13. Hierarchical Routing Hierarchical routing.

More Related