Syllabus

1. CS 370: System Architecture & Software with a grade of C or better. (Strictly enforced)
2. Programming experience with C or C++. Note that if you have not programmed in one of these languages before, you should not take this course! Spend this semester learning one of these languages instead. It is unlikely that you will pick up these languages well enough during the course to be able to complete your programming assignments successfully.
3. STAT 301 or STAT 303/ECE 303 or STAT 307/ERHS 307 or STAT 311 or STAT 315 with grade of C or better.

This course covers the core concepts in the design of computer networks and network protocols. The course schedule lists specific topics and the lecture schedule.

Upon completion of this course, students will be able to:

• Understand the structure and organization of computer networks; including the division into network layers, role of each layer, and relationships between the layers.
• Understand the basic concepts of application layer protocol design; including client/server models, peer to peer models, and network naming.
• In depth understanding of transport layer concepts and protocol design; including connection oriented and connection-less models, techniques to provide reliable data delivery, and algorithms for congestion control and flow control.
• In depth understanding of network layer concepts and protocol design; including virtual circuit and datagram network designs, datagram forwarding, routing algorithms, and network interconnections.
• Understand the basic concepts of link layer properties; including error-detection and correction techniques, multiple access protocols, point to pint protocols, and characteristics of link layer media (including wireless links).
• Understand the basic concepts of network security concepts; including authentication, integrity, key distribution, and system security design challenges.

Required Textbook: Larry Peterson & Bruce Davie, Computer Networking: A Sysems Approach , 4th edition, Morgan Kaufmann, ISBN: 978-0-12-370548-8 ISBN10: 0-12-370548-7.

Textbook Webiste : Peterson and Davie, 4th Edition

CS 457 Home Web Page: http://www.cs.colostate.edu/~cs457/

Lectures will be a combination of slide presentations, whiteboard presentations, discussions of students' questions, and some student presentations.

Instructor: Dan Massey

Final letter grades are based on the relative distribution of total scores and not on any preset numerical scale.

No late homeworks will be accepted. Absolutley no exceptions. The homework is primarily designed to help you learn the material and prepare you for the exams. In the case you absolutely cannot turn in a homework, note that each homework assignment is worth less than 1 percent of your grade.

There will be substantial programming projects.

No late projects will be accepted. If you have not completed the project by the due date, be sure to submit whatever results you have for partial credit. If you submit nothing by the due date, you will receive no credit for the project.

There will be a midterm exam and comprehensive final exam.

Midterm Exam: will be given in lecture.

Comprehenisive Final Exam: will be given on the CSU assigned final exam time.

No make-up exams will be given. It is unfair to the rest of the class if some students take the quizes, midterm, or final exams at a different time. Plan to attend the exam or expect to receive a zero on the exam.

Policies on cheating, plagiarism, incomplete grades, attendance, discrimination, sexual harassment, and student grievances are described in the Student Information Guide ( http://www.CS.ColoState.EDU/advising/student-info.html). All other matters follow the policies set in the current Colorado State University General Catalog. Students are responsible for all the information in these documents.