CSEE W4119 - Computer Networks

Call number 73333

[Course Info][Assignments] [Discussion Board (via Courseworks)][Grading Info]

Course Information (Also available in pdf)

Professor Dan Rubenstein

Spring 2010

Contact Information
	Dan Rubenstein (Instructor)	Tarun Sharma (TA)	Berk Birand (TA)
Office	CEPSR 816	CEPSR 8LE5	CEPSR 910
Phone	(212) 854-0050	TBD	TBD
e-mail	danr@cs.columbia.edu	ts2579@columbia.edu	berk@ee.columbia.edu
Mailbox	CS Main Office	CEPSR 8LE5	CEPSR 910
Office Hours	Tu, Th 11am-12pm or by appt.	M 4-5, F 4:30-5:30	Tu, Th 3-4pm

Course URL: http://wwww.cs.columbia.edu/~danr/4119
This course has a Discussion Board. Login via Courseworks to access it.
Course meeting time / location: 1:10 - 2:25 on M,W in 644 Mudd
Pre-Requisites: C or Java programming, course in Algorithms, course in Probability.
Description: Topics: Introduction to computer networks and the technical foundations of the Internet, including applications, protocols, local area networks, algorithms for routing and congestion control, security, elementary performance evaluation. Several programming assignments required.
Info on grading
Required Texts: Note that we will really only be following the textbook loosely, i.e., the course is not contained entirely within the required text.
Required: James F. Kurose and Keith W. Ross, Computer Networking: A Top-Down Approach Featuring the Internet, 5th ed. Addison-Wesley, 2009, ISBN 0-13-607967-9 (ISBN-13: 978-013-6079675)
Optional: Dimitri Bertsekas and Robert Gallager Data Networks (2nd ed.), Prentice Hall, 1992. ISBN 0-13-200916-1. Significant mathematical treatment (graduate 6000 level - practical stuff a bit out of date).
Optional: Andrew S. Tanenbaum, Computer Networks } (4th ed.), Prentice Hall, 2003. ISBN 0-13-066102-3. A lot like Kurose/Ross
Optional: Alberto Leon-Garcia and Indra Widjaja, Communication Networks: Fundamental Concepts and Key Architectures, 2nd ed., McGraw-Hill, 2004. ISBN 0-07-246352X. A bit more mathematical than Kurose-Ross, but less than B&G.
Computing Accounts: You need access to a computer with Berekley Sockets or the Java equivalent.

Date	\#	Topics/chapters covered	Reading	Assigned	Due
1/20	1	Course Overview; Protocol Layers & Encapsulation	1
1/25	2	IP, Connection-oriented and connectionless flows; Socket Programming;	2.1, 2.7, 2.8	PA #1
1/27	3	APP: DNS/http	2.2, 2.5
2/1	4	APP: P2P: Search & DHTs	2.6
2/3	5	APP: P2P: BitTorrent		HW #2	PA #1
2/8	6	* Catchup *
2/10	7	TRA: MUX/DeMux; Reliable Data Transfer: Alternating-Bit Protocol	3.1-3.4		HW #2
2/15	8	TRA: Pipelined Reliable Data Transfer: Selective Repeat / Go-Back-N / Parity & Network Coding Techniques PA #3
2/17	9	TRA: Flow and Congestion Control	3.6
2/22	10	TRA: Connection Setup & Teardown; TCP case study	3.5, 3.7
2/24	11	TRA: Inter-flow fairness (max-min, proportional, TCP)		HW #4	PA #3
3/1	12	* Catchup *
3/3	13	* Catchup *			HW #4
3/8	14	* Catchup and/or Midterm review *
3/10	15	MIDTERM (in class)
3/15	--	Spring Break - no class
3/17	--	Spring Break - no class
3/22	16	NET: Switching / Fast Lookups / Flow Identification	4.1-4.4
3/26	17	NET: Routing I	4.5
3/29	18	NET: Rounting II
3/31	19	NET: Case Studies (BGP, etc.)	4.6
4/5	20	NET: Multicast and Anycast	4.7
4/7	21	LINK: Bit error Detection/Correction techniques	5.1, 5.2
4/12	22	LINK: Bit error cont'd
4/14	23	LINK: MAC	5.3
4/19	24	LINK: MAC II
4/21	25	* Catchup and/or review *
4/26	26	* Catchup and/or review *
4/28	27	* Catchup and/or review *
5/3	28	* Catchup and/or review *
5/10 at 1:10pm		FINAL EXAM: Location Mudd 644