net.png
  • Days and Times: Tuesday, Thursday, 10:10 am-11:25 am
  • Location:Mudd 1024
  • Instructor: Javad Ghaderi
  • Office Hours: Mondays 4-5pm, or by appointment, CEPSR 718.
  • TA:
    • Tashrif Billah (tashrif.billah@columbia.edu), Office hours: Friday 3-5pm, student lounge, Mudd 13th floor

  • Prerequisites: Knowledge of probability at the level of IEOR E3658 is required. Prior exposure to computer network protocols at the level of CSEE 4119 is recommended.

  • Description: The course provides an analytical approach to the design of (data) communication networks. Necessary tools are discussed for performance analysis and design of network protocols and algorithms. The analysis is supported by practical engineering applications in layered Internet protocols in Data link layer, Network layer, and Transport layer. The necessary analytical background is provided during the class by review of relevant aspects of stochastic processes, control, and optimization.
  • Textbook: The course is primarily based on the lecture notes provided during the class. Most of the topics are selected from the following textbooks:
    • Communication Networks: An Optimization, Control and Stochastic Networks Perspective by R. Srikant and Lei Ying, Cambridge University Press, 2014.
    • Data Networks by Dimitri Bertsekas and Robert G. Gallager, Prentice Hall; 2nd edition, 1992. Available freely online at here!
    • Communication Network Analysis by Bruce Hajek, Available freely online at here!

  • FAQ: What is the difference between ELEN E6761 vs CSEE 4119?: If you are looking for an introductory course to learn how the Internet works, then CSEE 4119 is a better choice for you. If ''you have passed a networking course before and are looking for a more advanced course'' OR ''are interested in mathematical modeling and algorithm design'' then this course is the right choice.

  •  Grades: Homework: 20%, Midterm: 35% (October , 2017), Final: 45% (December , 2017).
  •  Syllabus:
    • Overview of Internet Architecture
    • Fundamentals of Performance Evaluation: Operational Laws, Markov Chains, Queuing Theory
    • Link Layer: Medium Access Algorithms
    • Network Layer: Packet Switch Routers, Scheduling Algorithms, Routing Algorithms
    • Transport Layer: TCP, Congestion Control
    • Layering as Optimization Decomposition: Network Utility Maximization
    • Other Networks: Telephone Networks, Server Farms

Announcements:
  • 09/05/2017:Homework 0 (probability warm-up) is out. Its due date is 09/12/2017. This should give you an idea of the level of probability that you need in this course.