4003-541-70/4005-741-70 Data Communications and Networks II
Course Schedule and Topics

Time: Tuesdays and Thursdays, 6:00pm-7:50pm, Room 13-1360

Final Exam: Tuesday 23-May-2006, 6:00pm-8:00pm, Room 13-1360

Sun	Mon	Tue	Wed	Thu	Fri	Sat
Mar. 12	Mar. 13	Mar. 14 Introduction	Mar. 15	Mar. 16 Module 1. High Perf. Network Programming	Mar. 17	Mar. 18
Mar. 19	Mar. 20	Mar. 21 -- Drop/add deadline* Module 1. High Perf. Network Programming	Mar. 22	Mar. 23 Module 1. High Perf. Network Programming	Mar. 24	Mar. 25
Mar. 26	Mar. 27	Mar. 28 Module 2. Network Routing Project 1 assigned	Mar. 29	Mar. 30 Module 2. Network Routing	Mar. 31	Apr. 1
Apr. 2	Apr. 3	Apr. 4 Module 2. Network Routing	Apr. 5	Apr. 6 Module 2. Network Routing	Apr. 7	Apr. 8
Apr. 9	Apr. 10	Apr. 11 Module 3. Network Connectivity Analysis Project 1 due	Apr. 12	Apr. 13 Module 3. Network Connectivity Analysis	Apr. 14	Apr. 15
Apr. 16	Apr. 17	Apr. 18 Midterm Exam Project 2 assigned	Apr. 19	Apr. 20 Module 4. Network Delay Analysis	Apr. 21 Last Day to W**	Apr. 22
Apr. 23	Apr. 24	Apr. 25 Module 4. Network Delay Analysis	Apr. 26	Apr. 27 Module 4. Network Delay Analysis	Apr. 28	Apr. 29
Apr. 30	May 1	May 2 Module 5. Transport Algorithms Project 3 assigned -- Project 2 due	May 3	May 4 Module 5. Transport Algorithms	May 5	May 6
May 7	May 8	May 9 Module 5. Transport Algorithms	May 10	May 11 Module 5. Transport Algorithms	May 12	May 13
May 14	May 15	May 16 Module 6. Data Signal Analysis Project 3 due	May 17	May 18 Module 6. Data Signal Analysis	May 19	May 20
May 21	May 22 Finals	May 23 Final Exam, 6:00pm-8:00pm Room 13-1360	May 24 Finals	May 25 Finals	May 26 Finals	May 27

*Last date to drop/add courses: Monday 21-Mar-2006
**Last date to withdraw with a grade of W: Friday 21-Apr-2006
**Last date to request final exam rescheduling due to scheduling conflicts: Friday 21-Apr-2006

Introduction

Topics Course introduction Course policies

Reading Course Description and Objectives Course Grading and Policies

Module 1. High Performance Network Programming

Topics Overlay networks and peer-to-peer networks Java New I/O (NIO) An Overlay Network Layer using Java NIO Manually configured routing

Reading New I/O APIs (Sun Java web site) Module 1 Lecture Notes

Module 2. Network Routing

Topics Graph theory; shortest path algorithms Point-to-point routing algorithms; link state, distance vector Multicast/broadcast routing algorithms Address resolution LAN bridge routing

Reading Comer, Chapters 13, 18, 19, 20, 27 Module 2 Lecture Notes Transparent Bridges (PDF -- 697,834 bytes)

Module 3. Network Connectivity Analysis

Topics Graph theory Network traffic capacity analysis; max-flow algorithm, min-cut algorithm Network connectivity analysis; edge connectivity, vertex connectivity Probabilistic analysis of network connectivity Monte Carlo analysis of network connectivity

Reading Module 3 Lecture Notes Connectivity Analysis (PDF -- 975,632 bytes)

Module 4. Network Delay Analysis

Topics Queuing theory Network packet delay analysis; queuing theoretical models Network packet delay analysis; experimental measurements Network packet delay analysis; simulation models

Reading Module 4 Lecture Notes Queuing Theory (PDF -- 144,633 bytes) Delay Analysis (PDF -- 494,336 bytes)

Module 5. Transport Algorithms

Topics Transport services; connection-oriented vs. connectionless, message- vs. stream-oriented Packet loss recovery algorithms Flow control algorithms Congestion control algorithms

Reading Comer, Chapters 24, 25, 28 Module 5 Lecture Notes RFC 793, Transmission Control Protocol RFC 2988, Computing TCP's Retransmission Timer

Module 6. Data Signal Analysis

Topics Modulation Broadband signaling; telephone and cable modem signals Baseband signaling; wired Ethernet signals Wireless signaling; wireless Ethernet signals

Reading Comer, Chapters 4, 5, 6, 12 Module 6 Lecture Notes Data Signal Analysis (PDF -- 1,762,624 bytes)

Data Communications and Networks II 4003-541-70/4005-741-70 Spring Quarter 2006

Course Page

Alan Kaminsky • Department of Computer Science • Rochester Institute of Technology • 4486 + 2220 = 6706

Home Page

Copyright © 2006 Alan Kaminsky. All rights reserved. Last updated 16-May-2006. Please send comments to ark­@­cs.rit.edu.