This is not a course in network protocols, the TCP/IP suite, etc. It is, rather, a course in programming implementation of graph algorithms--specifically, network flow algorithms (e.g. shortest path, critical path, max flow, min cost flow, etc) with an emphasis on parallel implementation. Most of these algorithms do have relevance for what usually pops into mind as networks--FDDI, the UTK backbone, etc. For example, if one needs to wire up a campus (or building), connecting buildings with fiberoptic cable as cheaply as possible, then spanning tree alogorithms are vital. The OSPF (Open Shortest Path First) routing (widely used, including the UTK backbone) employs shortest path algorithms. Max flow algorithms are important tools for helping ease congestion in the internet (and other networks). And so on.

Texts:

Ahuja, Magnanti, and Orlin: Network Flows: Theory, Algorithms,
and Applications (P-H)

Tarjan: Data Structures and Network Algorithms (SIAM)

Prereqs: at least 140 & 160 (if you had 140 with me, you've had a bit of MPI), 302 or 311 are helpful.