CST 311 - Week 6
Week six topic studied was the network layer: control plane. The control plane is one of the two functions of the network layer, routing, which determines the route taken by packets from the sender source to the receiver destination. Determining the "best" path relies on routing protocols and routing algorithms.
A routing protocol's goal is to determine the "good" paths from the sending host to the receiving host through a network of routers. The term "good" means least cost, fastest, least congested, etc. Routing algorithms can be global or decentralized, and static or dynamic. One type of algorithm is called a link-state algorithm where the routers all have a complete topology of the network and know the cost info for each link. Dijkstra's shortest path algorithm is an example of a link-state algorithm.
To make the internet more scalable, routers are grouped into regions known as autonomous systems (AS). These AS are split up into two different groups, intra-AS routing and inter-AS routing. Intra-AS routing refers to the routing that happens among the host/routers in the same AS or network. A gateway router at the "edge" of this AS will have links to connect to other routers in different AS. This gateway router falls into the inter-AS routing, which is routing among all the different AS. BGP (Broder Gateway Protocol) is the protocol used in inter-AS routing and is referred to as, "the glue that holds the internet together." Communication between all of these routers and host is done through the ICMP (Internet Control Message Protocol). ICMP is used to communicate network-level information such as error reporting and queries.
Comments
Post a Comment