Design and analysis of computer networks. Modeling and performance evaluation, queuing theory applied to computer networks. Traffic flow management and error control. Routing algorithms and protocols. Switch and router architectures. Selected issues in high-speed network design. Optical networks. More...
|Date/Time||TR 8:10 - 9:30 am, Kingsbury N133|
Office: Kingsbury N229, rbartos AT cs.unh.edu, http://www.cs.unh.edu/~rbartos
Office hours: TR 9:30 - 11 am and by appointment
|Prerequisite||CS 825 - Computer Networks or permission of the instructor|
|Teaching method||Lectures, homework projects, programming assignments, experiments with networks and networking equipment.|
|Assignments||Problems from the textbook and programming projects. Assignments are due at the beginning of a class. There will be 20% per-day penalty for late submissions. Assuming no major schedule disruption, the assignments will be due Feb. 14, Mar. 23, Mar. 23, Apr. 13, and May 4, 2017.|
|Exams||Two in-class exams (March 2 and April 6, 2017) and a final exam (May 11, 8-10 am). All exams are open-book, open-notes. While Internet-connected devices, such as laptops or smart phones, are permitted, however, use of such devices for human-to-human communication during the exam is strictly prohibited.|
|Grading||40% assignments, 30% in-class exams, 30% final exam. Grading scale: 94% and above: A, 90% and above: A-, 87% and above: B+, 84% and above: B, 80% and above: B-, 77% and above: C+, 74% and above: C, 70% and above: C-, etc. Students with a documented disability must register with the UNH Disability Services. More...|
|Text||Online resources. There is no required textbook for the course. Recommended books: William Stallings, Foundations of Modern Networking: SDN, NFV, QoE, IoT, and Cloud, First Edition, Addison-Wesley Professional, 2016, ISBN 0134175395; and James F. Kurose and Keith W. Ross: Computer Networking: A Top-Down Approach, Seventh Edition, Pearson, 2017, ISBN 0-13-359414-9.|
|Academic honesty||Unless explicitly stated otherwise, all work submitted in this course has to be yours and yours only. You can use resources available on the Internet but must acknowledge them in your submission. You are obviously prohibited from sharing solutions, however, it is permissible to discuss approaches on Piazza. Detected cases of cheating will have very serious consequences. If you have doubts whether a particular form collaboration is permissible, talk to me before you do it or describe and acknowledge it in your submission if it already happened. You are bound by the University Academic Honesty Policy. You are also encouraged to take UNH COLA Tutorial on Plagiarism.|
|Piazza||This course will be using Piazza (https://piazza.com/unh/spring2017/cs925) for class discussion. The system is designed getting you help fast and efficiently from classmates and the instructor. Rather than emailing questions to the teaching staff, you are encouraged you to post your questions on Piazza.|
© 2017 Radim Bartos.