This course provides an analytical study of communication networks that covers many of the major advances made in this area. Students will be introduced to the mathematical preliminaries in queueing theory, optimization and control, followed by a rigorous treatment of network architectures, protocols and algorithms, including resource allocation, congestion control, routing, and scheduling that are essential to existing and future communication networks and the Internet. PREREQUISITE: ELEC 326 (Probability and Random Processes) or equivalent.
This course provides an analytical study of communication networks that covers many of the major advances made in this area. Students will be introduced to the mathematical preliminaries in queueing theory, optimization and control, followed by a rigorous treatment of network architectures, protocols and algorithms, including resource allocation, congestion control, routing, and scheduling that are essential to existing and future communication networks and the Internet. PREREQUISITE: ELEC 326 (Probability and Random Processes) or equivalent.
