````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````


Last modified: March 24, 2017, 3:11pm

This page is maintained by: Zygmunt J. Haas - haas(at)utdallas(dot)edu


CS/CE 6390  - Advanced Computer Networks -  Spring 2017


   

Course Announcements

Important Announcements

(Here, you'll find important and current announcements related to the course. Please check this section often.)

*   As discussed in class, the lecture on Monday, March 27, is cancelled. A makeup class has been scheduled for Wednesday, March 29, 4:00pm-5:15pm.

*   HW#4 is due on Wednesday, April 5, 11:30am, in class

*   Slide Set #11

*   Reading Assignment for week of March 27: Chapter 5

 

Permanent and Old Announcements

*   The TA’s Wednesday office hours this week (only) are moved to Friday, March 24, 2:00pm-3:00pm

*   WNL has opening for one Ph.D. student, to work on exciting topics in networks. If you are an interested Ph.D. student, or an excellent M.S. student interested in becoming a Ph.D. student, please send email with your CV to [email protected].

*   WNL is looking for a student for a 1-2 semester project. Strong background in probability is required. It’s a paid position, but could be for academic credit instead. If interested, please send email with your CV to [email protected]. 

*   Some additional slides: Slide Set #10

*   The course prelim will be held on Wednesday, March 8, in class. The material includes everything covered in class until March 6 (inclusive), including HW#1 – HW#3. The exam is closed books – no material is allowed - but you should bring a calculator. No cell phones (or any other communication devices) will be allowed. 

*   Class project registration: each student in the class needs to send an email to the TA (Ms. Riti Gour) no later than Monday, March 6, with the subject line: “CS6390: Project Registration”. The body of the email should include the following information only:

o   Student name:

o   Project number:

o   Team member name (for 2-student projects only):

The email should be sent from UTD account only.

*   HW#3 is due on Monday, March 6, 11:30am, in class

*   Slide Set #9

*   Reading Assignment for week of February 27: Chapter 4

*   HW#3 is due on Monday, March 6, 11:30am, in class

*   Slide Set #8

*   Class Projects

*   Slide Set #7

*   Please note: Independent work is assumed on all submitted HWs. Failure to do so violates UTD Code of Conduct.

*   Please be reminded that we cannot accept homeworks by email.

*   Clarification to problem 4 on HW#2: A transmission at time t will be successful if the previous transmission AND the one after time t will be at least one “slot” away. For each lambda (say, lambda =1.0, 1,1, 1,2, … 3.), your program should simulate many (say 1000) such “events” of transmitting a packet and seeing whether it was successful or not. To see whether a packet transmission event is successful, you “select” two numbers and see whether BOTH numbers are greater than 1 (the first number represents the time when the packet previous to time t was transmitted and the second number represents the time when the next packet after t was transmitted). To select the two number, use the formula x=-lambda*log u and the rand() function. The rand() function gives a random number u between 0 and 1. Plug this number u into the formula x=-lambda*log u and this gives you x, which is the time before/after the current packet was transmitted (in units of slots). (A note – the log function is natural log (i.e., log base e).)

*   HW#1 has been graded. Please pick it up from the TA during her office hours.

*   Socket Programming Presentation

*   HW#2 is due on Monday, February 13, 11:30am, in class

*   Correction to solution of HW#1 problem 6 (problem 23 in the textbook): “(s+2)” should read “(s+1)”.

*   Slide Set #6

*   Slide Set #5

*   Slide Set #4

*   Slide Set #3

*   The class’s TA is Ms. Riti Gour. Her office hours are on Mondays and Wednesdays, 3:00pm-4:00pm, in Open Lab 2.103B1.

*   Slide Set #2

*   Final exam for the course will be held on Friday, May 5, 2017, 11:00am-1:45pm. Please mark your calendars accordingly.

*   The course prelim will be held on Wednesday, March 8, in class.

*   Correction to HW#1 problem 6 (problem 23 in the textbook): should read “6 point-to-point links”.

*   HW#1 is due: Wednesday, January 25, 11:30am, in class

*   Welcome to CS/CE 6390 – Spring 2017.

*   Download the Course Information Sheet.

*   Slide Set #1

*   Link to RFC 2002

*   Link to RFC 1752

*   Link to RFC 3376

*   Link to RFC 4608


Course Description

This is an intermediate course in computer networks. In this course, we will cover both the classical/fundamental topics in computer networks and a number of current/recent research topics related to modern computer networks. Most, but not all, of the advanced topics will be relevant to Internet-related research and they will be mostly on the Layer 3 and above. Most of the classical topics will be covered following the Peterson and Davie book. Additional research topics will be covered through research papers, links to which will be provided to students in due time. In particular, toward the end of the semester, we will cover a number of recent and current networking research areas through relevant research papers. The main goal in this part will be to expose students to some ongoing active and challenging research areas in networking.

*  Number of Credits: 3

*  Prerequisites: CS 4390 or CS 5390 or equivalent. C/C++ or Java programming skills

 

*  Required Course Text

1.    L.L Peterson and B.S. Davie, "Computer Networks," /5th edition, Morgan Kaufmann, 1992

2.    References to articles will be provided during the course

*  Other References (not required)

1.  M. Donahoo and K. Calvert, "Pocket Guide to TCP/IP Sockets (C Version)", Morgan Kaufmann, 1st edition.

2.  M. Donahoo and K. Calvert, "TCP/IP Sockets in Java: Practical Guide for Programmers", Morgan Kaufmann, 1st edition.

3.  W. R. Stevens, "UNIX Network Programming, Volume 1: Networking APIs -- Sockets and XTI", 2nd edition.

4.  C. Huitema, "Routing in the Internet", Prentice Hall, 2nd edition.

5.  R. Perlman, “Interconnections, Bridges, Routers, Switches, and Internetworking Protocols”, Addison Wesley, 2nd edition.


 

Course Personnel

Instructor: Prof. Zygmunt J. Haas

ECSS 4.405; haas(at)utdallas(dot)edu

Office hours: Tuesdays, 2:00pm – 4:00pm, or by appointment.

TA: Ms. Riti Gour, email: [email protected]

Office:   Open Lab 2.103B1

Office Hours: Mondays and Wednesdays, 3:00pm-4:00pm

 

Course Schedule

Mondays, Wednesdays, 11:30am – 12:45pm, ECSS 2.201

 

 

Grading Policy

Exams (1 & 2) each

25%

Homework Assignments

25% (total)

Class Project

25%

Extra Credit

Will be awarded for active class participation

 


 
Grading Rules

*  All the components are essential for the final grade.

*  No one is exempt from the exams. If you have missed an exam due to a legitimate reason, you need to reschedule a makeup exam as soon as possible.

*  If you did not turn in up to 2 homework sets due to a legitimate reason, the turned-in assignments will carry the total of the 25% of the final score.

*  Final project requires an in-class demo. More details to follow.

*  Any final score component missed not due to a legitimate reason will count as no credits in the final score calculation.

*  See below for what constitute a legitimate reason.

*  Individual work is assumed on all grading components, with the exception of the final project.

*  Note (1): The date of the final exam is set by the University. It will not be changed and no exceptions will be given

*  Note (2): You have to complete and personally return to Prof. Haas the Course Pre-requisite Form by Wednesday, January 18, 2017. Failure to do so will cause your registration in the course to be dropped.

*  Note (3): You are expected to attend all classes of the course. Failure to attend the first 2 classes in the course may cause your registration in the course to be dropped.

*  Note (4): The CS department has a new attendance policy: three consecutive absences leads to one letter grade drop; four consecutive absences leads to an F.

 

 

What constitutes a "legitimate reason"?

Event

Grading component 

The event occurred

Required proof

you are out of town at a conference or on a job interview

homework

any one of the two days before the homework due date or on the homework due date

conference registration, airline ticket, interview invitation letter

-"-

exam

the day of the exam

conference registration, airline ticket, interview invitation letter

family emergency

homework

any one of the two days before the homework due date or on the homework due date

"reasonable proof" confirming that the emergency has occurred and specifying the emergency dates

-"-

exam

any one of the two days before the exam date or on the exam day

"reasonable proof" confirming that the emergency has occurred and specifying the emergency dates

you’re sick

homework

the day before the homework due date

a note from a health professional indicating that on these days you were unable to function

-"-

exam

one of the two days before the exam day or on the exam day

a note from a health professional indicating that on these days you were unable to function

*  Excuses will not be granted in any other cases or without satisfying the above requirements.

*   To be considered a legitimate reason, you need to provide Prof. Haas with the required proof as soon as possible.



Reading Assignments

(Unless specified otherwise, the source is the course textbook)

*  Week of January 9: Chapter 1

*  Week of January 16: Chapter 2

*  Week of January 23: Chapter 2

*  Week of January 30: Chapter 2 (again) + Chapter 3

*  Week of February 6: Section 1.4 + Chapter 3

*  Week of February 13: Chapter 3 (again) + Chapter 4

*  Week of February 20: Chapter 4

*  Week of February 27: Chapter 4 (again)

*  Week of March 20: Chapter 4 (again)

*  Week of March 27: Chapter 5

 

Homework Sets and Other Handouts

There will be about 6-8 assignments in this course. Each assignment is due in class two weeks after its distribution:

*  HW#1 is due: Wednesday, January 25, 11:30am, in class

*  HW#2 is due: Monday, February 13, 11:30am, in class

*  HW#3 is due: Monday, March 6, 11:30am, in class

*  HW#4 is due: Wednesday, April 5, 11:30am, in class

*  HW#5 is due:

*  HW#6 is due:

 

---
---
---
---