Our third course in this specialization is on packet-switching networks and
associated algorithms.
In this course,
we deal with the general issues regarding packet-switching networks.
We started this course by elaborating on the two perspectives on networks,
and we discussed the functions of the network layer.
Next we introduce the two basic approaches to operating at a packet-switching
network, and we use IP and ATM as examples of this approach.
We further introduced the basic approach for
selecting routes across the network, and examined how routing
tables in a network steal packets from the source to the destination.
We continue our discussion of routing,
focusing on two shortest path routing algorithms, the Bellman-Ford algorithm for
distance vector routing and Dijkstra algorithm for link-state routing.
We also studied the applications in Internet routing protocols, RIP and OSPF.
Furthermore, we discussed packet level traffic management
operating in a short time scale.
This type of traffic management is mainly concerned with packet and
packet scheduling to provide a differentiated treatment for
packets belonging to different quality of service classes.
Finally, we continue with traffic management at the flow level.
Common approaches including machine control and congestion control.
We have four primary learning objectives.
After taking this class, the student will elaborate two basic approaches to
operating a packet-switching network, datagrams, and the virtual circuits.
The student will apply two shortest-path routing algorithms,
the Bellman-Ford algorithm, and Dijskstra algorithm,
to produce the shortest path tree in a given network topology.
The student will discuss traffic management at the packet level and
at the flow level, and perform traffic policing and
shaping by token bucket and leaky bucket.
The student will summarize the functions of the network layer, and
explain the applications of the shortest
path routing algorithms in the Internet routing protocols.