: Routing algorithms (Dijkstra’s, Distance Vector), congestion control, and the transition from IPv4 to IPv6. The Transport Layer
: Manages error detection and correction (e.g., Hamming codes) and handles point-to-point communication between directly connected nodes. Computer Networks Tanenbaum Slides
Andrew S. Tanenbaum's Computer Networks (currently in its 6th Edition : Routing algorithms (Dijkstra’s
The definitive source for the slides is the Pearson Education instructor site. These PowerPoint decks are organized by chapter: Computer Networks Tanenbaum Slides
This is where the slides earn their keep. Topics like and Cyclic Redundancy Check (CRC) are notoriously math-heavy. A good Tanenbaum slide will show a simple example of a corrupted frame and step through the XOR process.