ECE-547 Basic Course Information

ECE 547: Introduction to Computer Communication Networks

School of Electrical and Computer Engineering

Fall Semester 2009

When and where

Teaching staff

Professor: Xiaojun Lin
Office: MSEE 340
Tel: +1 765 494-0626
Email: linx@ecn.purdue.edu
Office Hours: MW 10-11AM (or email for appointment)
                     
Secretary: Bonnie Misner, MSEE 330, Ph. +1 765 494-3554.
Class Helpers: see homepage
 

Textbooks (Required, in addition to the class notes)

  • Mischa Schwartz, "Telecommunication Networks: Protocols, Modeling, and Analysis," Addison Wesley, 1987. (ISBN-10: 20116423X)
  • A. Leon-Garcia and I. Widjaja "Communication Networks, Fundamental Concepts and Key Architectures," McGraw Hill, 2nd edition 2003. (ISBN-10: 0-07-246352-X, 0-07-119848-2(ISE))

Highly Recommended References

  • D. Bertsekas and R. Gallagher, "Data Networks," Second Edition, Prentice Hall, 1992. (ISBN-10: 0132009161)
  • James F. Kurose, Keith W. Ross "Computer Networking: A Top-Down Approach Featuring the Internet," Addison Wesley, July 2000. (4th Edition, 2007. ISBN-10: 0321497708)

Other References

  • Papers distributed in class, and class notes.
  • R. Wolff, "Stochastic Modeling and the Theory of Queues," Prentice Hall, 1989.
  • L. Kleinrock, "Queueing Systems, Vol I," John Wiley, 1975.

Homeworks

Homework is a very important part of the course.
  • For on-campus students, homeworks will be collected at the beginning of the class in which they are due. Late homework will not be accepted.
  • For off-campus students, please scan your homework and email a pdf file to the TA by the due-date.
  • You may discuss the homework with other students. However, your submitted homework must be your own work, and you are strongly advised to solve independently as much of the homework as you possibly can. This will serve you well come exam time.
  • Solution will be posted after the homework is due. Homework will only be graded minimally (based mainly on effort). Hence, it is very important that you check the posted solution carefully to make sure you get all answers right.

Grading

  • Homework 5%
  • Project 20%
  • Midterms 45%
  • Final 30%

* No late project will be accepted under any circumstance

Exams

  • Midterm 1: Thursday, Oct. 15th, 8-9:30pm, ARMS 1109
  • Midterm 2: Thursday, Nov. 12th, 8-9:30pm, ARMS 1109
  • Final Exam: TBA

Course Policies

  • All exams will be closed book exams.
  • There will be no make-up exams.
  • Regrade requests must be filed in writing within one week after the exam has been returned to you.
  • No cheating allowed. Any form of cheating will result in an immediate failure of the course.
  • No late project will be accepted under any circumstance.
  • If you have any questions regarding the homework, please see the TA first. You are welcomed to ask me questions regarding the course, but regarding specific homework questions, please see me only after you have asked the TA first (and not found his answer satisfactory).
  • Suggestions: Attend all classes, solve homework problems independently, and discuss extra problems in groups.

Prerequisites

Prerequisite or Corequisite: EE 302.  (Students are encouraged to take ECE 600 before or at the same time as ECE 547.)

Objective

To learn the fundamentals of networking. Focus on an analytical approach to network design, dimensioning, and controls followed by examples implemented on the current Internet.

Description

Fundamental understanding of basic network design, routing, dimensioning and control; here we will study various network functions such as error-recovery algorithms, flow control, congestion control, routing, multi-access, switching, etc. We will also study these in the context of current Internet solutions (e.g. TCP, IP, etc.) and future open problems, and possible solutions.

Course Outcome (for undergraduate students only):

A student who successfully fulfills the course requirements will have demonstrated:
  • an understanding of the fundamental principles underlying computer communication networks [1,3,4;a,e]
  • an ability to obtain mathematical models of networking systems. [1,2,4;a,e]
  • an ability to perform queueing analysis of simpler queueing networks, convergence analysis of routing protocols, and stability analysis of random access mechanisms. [1,2,4;a,e,k]
  • an ability to solve simple network design and optimization problems to meet specifications in thoughput and delay. [1,4;a,c,e,k]
  • an ability to use simulation tools for network analysis and design. [1,3,4;a,c,e,k]

Tentative course structure

  • Historical Perspective of Networking
  • Important Problems in Networking
  • Error Recovery Mechanisms: Examples and Performance Analysis
  • Elementary Queueing Theory for Network Design and Admission Control
  • Main Issues in Network Design and Engineering
  • Flow Control (Rate based and Window based)
  • TCP Congestion Control (TCP Reno, TCP Vegas, AQM, etc.)
  • Fundamentals of Network Routing (Dijkstra, Bellman Ford, etc.)
  • Routing in the current Internet (IP routing)
  • Multiaccess Communication (Polling and Random Access)
  • Open Problems and Possible Solutions.

Procedures under a Pandemic

In the event of a major campus emergency, course requirements, deadlines and grading percentages are subject to changes that may be necessitated by a revised semester calendar or other circumstances. In such an event, information will be provided through the following means:
  • Announcements will be posted on the course homepage.
  • On-campus students will be notified via Blackboard.
  • Off-campus students will be notified by email.