picture of campanile reflected in window

picture of campanile reflected in window

Home
Research
Teaching
Biography
Publications
Links

TCOM-5213: Network Design and Management

This is a graduate course in network design and management. This offering will be quite a bit different from the previous two as I will spend more time to the new developement of network design since the seminar paper by Kelly. Since then, network design research has been driven by global optimization formulations. I will cover some basic topics described in Bersekas and Gallager and then I will move on with Srikant to attempt to give an overview of this new development on network design. Background on stochastic math is required. I will give a quick overview. But it is advised that you should have taken Dean Ray's math class before this one.

For projects and homework (that may involve ns-2 or ns-3 simulator), it is preferred that you have a linux machine to play with. Either a real linux system or an emulated one using cygwin, virtualbox, andlinux or any other software (all three aforementioned ones are free and of course so does Linux). Some programming skills are very helpful for this course. I suggest you using Python for your course work. The language is quite easy to learn and is designed for readability. You can dig up some tutorials from the links below.

Textbooks

  • Data Networks by D. Bertsekas and R. Gallager
  • The Mathematics of Internet Congestion Control by R. Srikant
  • Network Optimization and Control by S. Shakkottai and R. Srikant
Auxiliary and Reference Material:
  • Foundations of Python Network Programming by John Goerzen
  • Computer Networks: Fundamental Concepts and Key Architectures by A. Leon-Garcia and I. Widjaja
  • Computer Networks by A.S. Tanenbaum
  • Data and Computer Commmunications by W. Stallings
  • 802.11 tutorial
  • Understanding TCP/IP

Project

Please note that project amount to 40% of your overall grade and I take it very seriously (summarizing a paper is not enough and definitely gives you a low grade). Group project is encouraged with maximum two per team.

Grading is based roughly on the actual quality of the work, i.e., originality, amount of work actually involved, relevancy to the subject, difficulty in conducting the work, etc. (25%), and the quality of the report, i.e., organization, readablility, style, etc. (15%). Some project suggestions are given here.

Grading

  • Homework: 30%
  • Quiz 1: 15%
  • Mini-project: 15%
  • Final project: 40%

Homework may include mini-projects and paper reports, details yet to be determined.

Late Policy

Late assignment is generally subjected to 10% penalty per day.

Useful Links Course Calendar

  Coverage Slides/Notes Supplementary
1-20-2009 Overview 1. Introduction.ppt, 2. Applications and layered architectures.ppt  
1-22-2009 Line coding; FEC; ARQ 3. Digital transmission fundamentals.ppt, 5. P2P protocols and data link layer.pp, arq performance.pdf hw1.html
1-27-2009 Ice Storm    
1-29-2009 Python overview; ARQ performance analysis   hw2.html
2-3-2009 Probability review; Poisson process poisson procss.pdf
2-5-2009 Little's Theorm queueing theory1.pdf hw3.html
2-10-2009 M/M/1; M/M/m queueing theory2.pdf hw2_soln.pdf
2-12-2009 M/M/m/m; P-K formula queueing theory3.pdf hw4.html
2-17-2009 Kleinrock Independent Approximation; Jackson's Theorem; Burke's Theorem queueing theory4.pdf hw3_soln.pdf
2-19-2009 Introduction to MAC; Aloha aloha.pdf hw5.html
2-24-2009 Analysis of slotted Aloha aloha2.pdf hw4_soln.pdf
2-26-2009 Matlab Tutorial    
3-3-2009 CSMA CSMA.pdf  
3-5-2009 CSMA analysis, Dijkstra algorithm CSMA2.pdf, dijkstra algorithm.ppt  
3-10-2009 Bellman-Ford algorithm bellman ford algorithm.ppt  
3-12-2009 Routing problem routing.pdf  
3-17-2009 Spring Break    
3-19-2009 Spring Break    
3-24-2009 Google App Engine (by Samer)    
3-26-2009 Routing problem (con't) routing2.pdf Mini-project due
3-31-2009 Frank Wolfe algorithm frankwolfe.pdf  
4-2-2009 Introduction to congestion control congestion_control.pdf, optimization.pdf hw5_soln.pdf, 2007 exam.pdf, 2008 quiz 1.pdf, 2008 quiz 2.pdf
4-7-2009 Fairness in traffic allocation fairness.pdf  
4-9-2009 Max-min fairness fairness2.pdf  
4-14-2009 Lyapunov stability stability.pdf  
4-16-2009 Primal algorithm congestion_control2.pdf  
4-21-2009 Quiz    
4-23-2009 No class (ICASSP)    
4-28-2009 Dual algorithm    
4-30-2009 Research Day    
5-5-2009 Exact penalty for primal algorithm; Primal dual algorithm exact_penalty.pdf, primal-dual.pdf quiz solution
5-7-2009 Random early marking; Pricing interpretation rem.pdf, pricing.pdf