Skip to main content

Posts

Featured

CST 311 - Week 6

 This weeks module focused on the network layer and covered information on routing algorithms, the SDN control plane as well as the Internet Control Message Protocol (ICMP).  One of the sections I found interesting were the sections covering the link state routing algorithm and Dijkstra's algorithm. I found it surprisingly simple to measure the "least cost path" from the source node. This was further explored in the optional worksheets as well as the problem set for this module. I also found the lab for this module to be interesting, where we worked with OpenFlow rules in a Mininet topology. We examined the OpenFlow packets between the SDN controller using Wireshark to show the OpenFlow and TCP traffic across the hosts. Overall, I found this section to include a lot of information that will be helpful for the upcoming final taking place this week!   

Latest Posts

CST311 - Week 5

CST311 - Week 4

CST 311 - Week 3

CST 311 - Week 2

CST 311 - Week 1

CST 334 - Week 8

CST 334 Week 7

CST 334 - Week 6

CST 334 - Week 5

CST 334 - Week 4