CST 311 Week 6

 

WELCOME TO WEEK 6

Learning Journal


This week was a bit shorter than the rest in terms of lectures. However, there is another project assignment coming up, and I started checking that out to see the requirements. I also started studying for the final exam by reviewing previous chapters and trying to grasp this week’s lectures as well. This week’s content will also be on the final exam. I feel like the weeks are going by really fast—just two more weeks, and we’re done.

This week, I learned more about the network layer, specifically the control plane. In this chapter, we learned about the principles and protocols needed for routing. We also covered the traditional algorithms used in the control plane. These are Link-State, which uses the OSPF protocol, and Distance Vector, which uses the BGP protocol. It is important to note that there are two approaches to structuring the network control plane: 1. Per-router control and 2. Logically centralized control.

The per-router control plane involves individual algorithm components in each router working together to form forwarding tables. On the other hand, the logically centralized control plane is managed by a remote controller that interacts with CAs (Control Agents) in routers to create the forwarding tables.


Another thing I learned is that routing algorithms are classified based on how the computation is carried out. For example, if it is global, then all the routers have complete topology and link cost information, as seen in link-state algorithms. If it is decentralized, then a router knows only the link cost to its physically connected neighbors. This is what we call distance vector algorithms. Other classifications include dynamic vs. static and load-sensitive vs. load-insensitive.

Comments

Popular posts from this blog

CST 300 Week 4

CST 300 Week 3

CST 300 Week 1