CST311 Module 6

 This week covered topics of the network control plane which heavily deals with how routing tables are managed such as either through per-router methods or logically centralized methods. Along side this we covered some of the forwarding table creation algorithms which included Dijkstra's algorithm and the distance-vector algorithm. Dijkstra's algorithm was super easy to understand due to its generally straight forward workings, but distance-vector algorithm is still a big foggy to me. We also touched on autonomous systems and the way that routers can communicate between them. Some of these protocols that involve it are still a bit vague to me but throughout further coverage on them they will probably make more sense. We also touched on the idea of a traceroute such as the command for it built into windows. A traceroute is similar to a simple ping where it returns the round-trip delay from a host to a target system, but it also keeps track of all of the hops the packet had to take in order to reach the destination.