CS 4380 - Data Communications
Spring 1999
Room IC. 211
Instructor:Prof. Mani Subramanian
TA for course: Minaxi Gupta
Room 264, GCATT Building
Tel: 894-6562
email: manis@cc.gatech.edu
Office Hours: Tue. 3:15-3:45 & Thu. 3:15-3:45 (CCB 215)
Room: 265, GCATT Building
Tel: 894-1916
email: minaxi@cc.gatech.edu
Office Hours: Mon. 2:00 -3:00pm and Wed. 2:00 - 3:00pm @Commons
Objectives:
Reading Assignment: Read sections of textbook to be covered in the next class.
Attendance Policy: Be on time for the class. I take attendance irregularly. Send me email ahead if you will be missing a class.Homework Policy: Submit in class on due-date. Late submission (maximum 24 hours) to TA accepted with 20% penalty in grade.
Textbook:
Andrew Tanenbaum, Computer Networks, Third edition, Prentice Hall 1996
References Books:
Schedule:
|
Date |
Chapter.Section |
Subject |
|
3/30 |
Ch.1 |
Introduction |
|
4/1 |
Ch2 |
Physical Layer |
|
4/6 |
3.1-3.2.1 |
Error detection and correction |
|
4/8 |
3.2.2 |
Error detection and correction |
|
4/13 |
3.3 |
Stop and wait |
|
4/15 |
3.4 |
Sliding Window Protocols / Go back n |
|
4/20 |
3.4 |
Selective Repeat Protocol |
|
4/22 |
3.6 |
HDLC |
|
4/27 |
Midterm |
|
|
4/29 |
4.1-4.2.1 |
MAC Protocols / Aloha |
|
5/4 |
4.2.2 |
CSMA & CSMA/CD |
|
5/6 |
4.3.1 |
Local Area Network / IEEE 802.3 & Ethernet |
|
5/11 |
4.3.3 |
IEEE 802.5 Token Ring |
|
5/13 |
4.4 - 4,5 |
Bridges High & Speed LANs |
|
5/18 |
5.1-5.2.4 |
Routing Algorithms: Dijkstra's algorithm |
|
5/20 |
5.2.5 |
Bellman-Ford algorithm |
|
5/25 |
5.3 |
Congestion control |
|
5/27 |
5.4-5,5 |
Internetworking & IP |
|
6/1 |
5.5, 5.6, 6.1-6.2 |
IP, ATM & Transport protocols |
|
6/3 |
Ch 7 |
Application Protocols |
Communication of Information:
Links to Homeworks: