CS 5283 Computer Network Programming
Spring 2004
Teaching Assistant: Mr. Sudheer Krishna
Course Goals:
The last few years have witnessed an unprecedented growth of the WWW. The Internet has been widely accepted as a prospective commercial infrastructure, rather than a network dedicated for research activities alone. It is very hard to come across a person who is not accustomed to the Internet! Yet, only a small percentage of the population understands how the net works. This course is designed for understanding the latest network technologies that make the Internet what it is today. Problems that confront the network engineer today are the need to support multimedia and real-time traffic, the need to control congestion, and the need to provide different levels of quality of service (QoS) to different applications. We will discuss the above issues in detail in this course.Prerequisites:
Since this is an advanced graduate course in computer networks, the student is expected to know the basics of networking such as the TCP/IP protocol stack, routing basics, elementary graph theory, probability theory, Calculus and Algebra.Required text:
"High speed Networks and Internets - Performance and Quality of Service", 2nd ed., by William Stallings, Prentice Hall, 2002. ISBN 0130322210 Additional references such as Journal, and Conference Papers will supplement the text book for the course material. These will be made available on the class home page at the appropriate times.Course Content
The following is a tentative list of topics we will cover in this course (updated on 02/17/04):Lecture Slides
FINAL PROJECT
Here is the final project description with the grading split-up. Updated on April 08.
Due to the high running time, it is enough if you run the program
for file sizes from 1MB to 5MB. YOU NEED NOT RUN IT FOR FILE SIZES 6MB to
10 MB. - Updated on April 08.
Please sign up for the project demonstration. The
time slots available
are put up on the door of the instructor's office (212 MSCS). You to have
enter your name(s)
against the time slot you want. Slots will be allocated on a first-come
first-serve basis. This sign up sheet is only for Stillwater students.
Tulsa students can e-mail the TA directly and set up the demo time.
Remote site students need not give a demo. - Updated on April 14.
Assignments
Evaluation and Grading
The class evalution policy is as follows:
Policy on attendance
Students are expected to attend all the classes. They are responsible for all the materials covered in the class in their presence and absence. The students are expected to check the class home page often. Since the class meets only once a week, if needed, important communication from the instructor will be posted in the class web page.Policy on late assignments
Assignments are due on the specified date before the start of the class. All assignments submitted after this will be penalized at 10% per day. Submissions beyond a delay of three days will not be accepted.Policy on Drop/Add
Students will be allowed to drop as long as the university permits them to do so. A grade of W or F will be determined on the basis of points earned until that time. For a list of the relevant important dates, please visit http://www.okstate.edu/acadaffr/facultystaff/spring_04_syllabus_attachment.htm .Policy on Plagiarism/Academic mis-conduct
As a good rule of thumb, you may discuss any problem in the course as long as no one is using a writing implement (computers included) nor looking at any source code for the assignment. That is, any group work must be verbal only. Obviously you may look at the textbook or class handouts/class notes together. One exception to this rule is that when a friend is having trouble with a small bug, and you notice a typo or other "silly little mistake", you may point it out to them. More substantive assistance is definitely not allowed, from any source whatsoever, including tutors or friends not enrolled in the course. The professor or teaching assistants will be able to give more help if you are stuck with concepts. A student attempting to gain unfair advantage by keeping an examination paper longer than the time permitted is guilty of academic misconduct. Any misrepresentation of fact in order to gain advantage or to avoid a penalty, either for one's self or another, is academic dishonesty.All academic work must be your own. Collaboration, usually evidenced by unjustifiable similarity in assignments, is never allowed. The departmental policy for academic misconduct and dishonesty applies to this class. For a copy of the university policy on academic mis-conduct/dis-honesty, please visit http://home.okstate.edu/policy.nsf/0/3222fe17f2bfca56862562e0005edef6?OpenDocument . The students are expected to go through the above policy. Please meet with the instructor if you have any questions.
Students with disabilities
OSU's policy on accomodating students with disabilities will be followed in this class. Any student who needs special accomodation on account of a disability should meet with the instructor at the earliest possible opportunity.The instructor and the computer science department reserve the right to change any of the above without notice at any time.