ECE-257A (Communication Networks)



This course is an introductory course in networking. The content of this course compromises of basic mathematical topics used in analysis/design of communication and computer networks.

Networking is an exciting area of communications in which a (potentially large) set of users are to communicate information over a network. Networking, then, is the science and design of regulatory mechanisms (protocols) which enable a cohesive usage environment for all users. As such, modern network science and engineering rely on and borrow from basic topics in optimization, mathematical economics, and stochastic scheduling (and, in turn, also contribute to and motivate new problems in these fields) . The goal of this course is to expose the students to these connections and overlaps, and help them appreciate the cross-disciplinary nature of the field.

The course will focus on three of many problems arising in design and analysis of the networks: end-end congestion/rate control, switching/scheduling, and routing. As we will see, mathematical study of these problems requires knowledge of convex constrained optimization theory, game theory, Markov decision theory, and queueing theory. Each of these topics, in and by itself, merits careful and deliberate investigations in one or multiple courses. However, exposing first and second year ECE graduate students to these basic topics, ECE257A is designed as an introductory course that sheds light on the connections between these fields and the fundamental problems in network science/engineering.

Communications and Computer Networks

Credit: 4 Units

Time: TTH 3:30-5:00

Location: Center Hall 217B

Instructor: Professor T. Javidi

    Office: EBU1 6405,

    email: tjavidi at ucsd dot edu

    Office Hours: TTH 5:00pm-6:00pm