Use the Tab and Up, Down arrow keys to select menu items.
The course studies important Internet technologies and protocols, including IP routing and IP Multicasting. Furthermore, the course introduces students to the theoretical underpinnings (Markov chain and queueing models) and practical work in network performance modelling and traffic engineering.
This course continues the study of networking begun in COSC 264 and has a special emphasis on Internet protocols and (general) performance engineering. We will study these both theoretically and using practical experiments in the lab. A tentative list of course topics is:• First term o UDP and TCP o IP routing mechanisms and protocols (e.g. OSPF, BGP) o IP Multicast and IP mobility support• Second term o Performance analysis: the big picture o Markov chains o Queueing modelsIn the lab and the tutorials you will work on problem sheets and perform own practical experiments and measurements.
After attending this course students:can explain the operation and major design issues of IP, TCP, UDP and their relation to Internet congestion phenomenacan explain the operation and major design issues for IP routing and IP multicastcan recognise the importance of performance modeling and know main performance assessment approachescan explain elementary Markov chain and queueing models and are able to justify why, when (and how) Internet devices can be modelled by such queueing systemsFurthermore, through lab work and own work on problem sheets the course will develop the following skills:The ability to capture and analyse network traces from IP networks.The ability to con_gure and test router setups under Linux.The ability to develop and numerically evaluate Markov chain or queueing models for simple networking protocols or systems
(1) COSC264; (2) COSC261; (3) 30 points of EMTH or 15 points of MATH/STAT (STAT101 recommended). MATH101 is not acceptable. RP: It is recommended that COSC362 and COSC364 be taken together.
COSC331, COSC327
It is recommended that COSC362 and COSC364 be taken together.
Depending on final student numbers, some of the advertised lab/tutorial streams may not run. Final lab/tutorial options will be available for self-allocation closer to the start of the semester through My Timetable.
For further information see Computer Science and Software Engineering Head of Department
There is no single textbook upon which this course is based. Some of the books used in the preparation of this course are listed below. The lecture slides (which you will find on the UC learn platform) will contain additional references. The most important reference for the first term is the book of Medhi and Ramasamy [2], of which the library possesses a few hard copies.[1] Raj Jain. The Art of Computer Systems Performance Analysis - Techniques for Experimental Design, Measurement, Simulation, and Modeling. Wiley Professional Computing. John Wiley and Sons, New York, Chichester, 1991.[2] Deepankar Medhi and Karthikeyan Ramasamy. Network Routing - Algorithms, Protocols, and Architectures. Morgan Kaufmann, San Francicso, California, 2007.[3] William Stallings. Data and Computer Communications. Prentice Hall, Englewood Cliffs, New Jersey, fourth edition, 2006.[4] Kishor S. Trivedi. Probability and Statistics with Reliability, Queueing and Computer Science Applications. John Wiley & Sons, New York, second edition, 2002.
There are several important documents available online about departmental regulations, policies and guidelines at the following site. We expect all students to be familiar with these. Notices about this class will be posted to the class forum in the Learn system.COSC students will also be made members of a class called “CSSE Notices”, where general notices will be posted that apply to all classes (such as information about building access or job opportunities).
The Computer Science department's grading policy states that in order to pass a course you must meet two requirements:1. You must achieve an average grade of at least 50% over all assessment items.2. You must achieve an average mark of at least 45% on invigilated assessment items.If you satisfy both these criteria, your grade will be determined by the following University- wide scale for converting marks to grades: an average mark of 50% is sufficient for a C- grade, an average mark of 55% earns a C grade, 60% earns a B- grade and so forth. However if you do not satisfy both the passing criteria you will be given either a D or E grade depending on marks. Marks are sometimes scaled to achieve consistency between courses from year to year. AegrotatsIf factors beyond your control (such as illness or family bereavement) prevent you from completing some item of course work (including laboratory sessions), or prevent you from giving your best, then you may be eligible for aegrotat, impaired performance consideration or an extension on the assessment. Details of these may be found in the University Calendar. Supporting evidence, such as a medical certificate, is normally required. If in doubt, talk to your lecturer.
Domestic fee $778.00
International fee $3,450.00
* All fees are inclusive of NZ GST or any equivalent overseas tax, and do not include any programme level discount or additional course-related expenses.
For further information see Computer Science and Software Engineering .