Computer Networks (Fall 2016)
Course: Computer Networks (320301)
Instructor: Jürgen Schönwälder
Tuesday 11:15 - 12:30 West Hall 5
Friday 11:15 - 12:30 West Hall 6
Start: September 2nd, 2016

The course discusses network protocols in some depth in order to enable students to understand the core issues involved in network protocol design. Fundamental algorithms and principles are explained in the context of existing IEEE / Internet protocols in order to demonstrate how they are applied in real-world scenarios. This course is recommended for all students with a strong interest in communication networks and distributed systems.

The course covers topics such as local area networks (IEEE 802), Internet protocols, routing algorithms and protocols, flow and congestion control mechanisms, data representation, application layer protocols, remote procedure calls, network security.

Course Materials:
  • A.S. Tanenbaum, "Computer Networks", 4th Edition, Prentice Hall, 2002
  • W. Stallings, "Data and Computer Communications", 6th Edition, Prentice Hall, 2000
  • F. Halsall, "Data Communications, Computer Networks and Open Systems", 4th Edition, Addison-Wesley, 1996
  • C. Huitema, "Routing in the Internet", 2nd Edition, Prentice Hall, 1999
  • W.R. Stevens, "TCP/IP Illustrated Volume 1: The Protocols", Addison Wesley, 1994.
  • D. Comer, "Internetworking with TCP/IP Volume 1: Principles Protocols, and Architecture", 4th Edition, Prentice Hall, 2000
  • J.F. Kurose, K.W. Ross, "Computer Networking: A Top-Down Approach Featuring the Internet", 3rd Edition, Addison-Wesley 2004.
  • O. Bonaventure, "Computer Networking : Principles, Protocols and Practice", 2nd Edition, online
Wed (09:45)Fri (11:15)Topics
2016-09-02 Introduction, Internet Concepts and Principles, Internet Services Today
2016-09-06 2016-09-09 Media Access Control, Cyclic Redundancy Checks, Flow and Congestion Control, OSI 7-Layer Model
2016-09-13 2016-09-16 Local Area Networks (Ethernet, Bridges)
2016-09-20 2016-09-23 Local Area Networks (VLANs, Port Access Control, WLAN)
2016-09-27 2016-09-30 Internet Network Layer (IPv4/IPv6)
2016-10-04 2016-10-07 Internet Routing Protocols (RIP, OSPF, BGP)
2016-10-11 2016-10-14 Internet Routing Protocols (BGP)
2016-10-18 2016-10-21 Internet Transport Layer (UDP/TCP)
2016-10-25 2016-10-28 Firewalls, Network Address Translators
2016-11-01 2016-11-04 Security at the Network and Transport Layer (IPsec, TLS, SSH)
2016-11-08 2016-11-11 Internet Application Layer (DNS)
2016-11-15 2016-11-18 Internet Application Layer (SMTP, IMAP, PGP, S/MIME, DKIM)
2016-11-22 2016-11-25 Internet Application Layer (HTTP, SPDY, FTP)
2016-11-29 2016-12-02 Internet Application Layer (RTP, SDP, SIP)
2016-12-06 Summary and Course Review
2016-09-09Quiz #1terminology, design principles, media access control
2016-09-16Problem Sheet #1transmission error detection, ARQ protocols
2016-09-23Quiz #2local area networks, spanning trees
2016-09-30Problem Sheet #2VLANs and bridges, IP addresses and prefixes
2016-10-07Quiz #3IPv4 and IPv6
2016-10-14Problem Sheet #3IP layer forwarding
2016-10-21Quiz #4Internet routing protocols
2016-11-07Problem Sheet #4mininet experiments
2016-11-11Quiz #5Transmission Control Protocol (TCP)
2016-11-18Problem Sheet #5Secure Shell (SSH)
2016-11-25Quiz #6Domain Name System (DNS)
2016-12-05Problem Sheet #6HTTP (cnds.pcap)
2016-12-17Final Exam09:00-11:00 Conference Hall (closed book)

The final grade is made up of the final exam (40 %), biweekly quizzes (30 %) and homework assignments (30 %). It is required to submit the solution for homeworks assignments electronically. Late submissions will not be accepted. Homeworks may need to be defended in an oral interview.

Any programs which have to be written will be evaluated based on the following criteria:

  • correctness including proper handling of error conditions
  • proper use of programming language constructs
  • clarity of the program organization and design
  • readability of the source code and any output produced

Source code must be accompanied with a README providing an overview of the source files and giving instructions how to build the programs. A suitable Makefile is required if the build process involves more than a single source file.

For any questions stated on assignment sheets, quiz sheets, exam sheets or during makeups, we by default expect a reasoning for the answer given, unless explicitely stated otherwise.

The policy on makeup quizzes is the following: There won't be any quiz makeups. If you (a) get an official excuse for a quiz from the registrar's office or (b) approach we well in advance of the quiz with a very good reason for not being able to participate (e.g., because you take a GRE computer science subject test at the day of a quiz), then the weight of the final exam will be increased according to the weight of the quiz you got excused for.