|
Computer Networks (231.312)
6 points / Semester 1
Handbook Description
The official Handbook entry Unit Synopsis
Today it is far more likely that a computer is connected to a computer
network than not. Moreover, as computer networks become increasingly
faster, more reliable, and more pervasive, the way in which we view
computer systems is rapidly changing. This unit takes a bottom-up
approach to explaining how current networking technologies work and
how we are making use of them. Starting with an explanation of how data
is packaged on physical media, such as on copper or optical cables, we
follow with an explanation of how errors are introduced and how they can
be both detected and corrected. We next introduce a series of increasingly
more reliable and efficient network protocols which provide guaranteed,
reliable message delivery on error-prone network connections. The use
of a very detailed network simulator in laboratory sessions enables us
to both implement these protocols and to evaluate their efficiency.
We next examine the subject of routing protocols which enable messages
to be both correctly and efficiently delivered between computers not
directly connected with a single cable. Again, the use of detailed
simulation enables us to implement robust routing algorithms and, in
particular, to develop strategies to overcome very congested sub-networks,
crashing nodes and severed cables.
Having addressed network protocols in some detail, we
turn our attention to local-area Ethernet, wireless, mobile, and ad-hoc
networks.
We next examine the motivation for and design of the Internet,
and the protocols and applications most frequently used. We continue
with a discusson of the design and implementation of client/server
applications using the Berkeley sockets API,
remote procedure calls, and Java's Remote Method Invocation.
Teaching Staff
Textbook
Computer Networks, 4/e
Andrew S. Tanenbaum, Vrije University, Amsterdam
Prentice Hall PTR, Copyright 2003,
pp912, ISBN 0-13-066102-3.
Recommended Reading
Computer Networks and Internets, with Internet Applications, 4/e
Douglas E. Comer, Purdue University,
Prentice-Hall, Copyright 2004,
pp720, ISBN 0-13-123627-X.
Contact Hours
This unit consists of
25 hours of lectures, 33 hours of laboratories, and 7 hours of tutorials.
The first two hours of each laboratory session will be supervised.
Tutorials are held in weeks 3,4,6,8,10, and 12, with a
revision tutorial in week 13. It is also expected that you will need to
undertake additional study to achieve satisfactory progress in this
unit. One additional hour per hour of formal contact is a reasonable
estimate (i.e, an additional 5 hours per week).
The 2005 timetable for IT312
Assessment
The assessment scheme for IT312 this year
consists of a mid-semester test, two practical projects,
and a final 2hr examination held in June.
Before undertaking this unit,
students are encouraged to read Section 6.11 of the
Guidelines for Academic Assessment.
In particular, students will be required to demonstrate satisfactory
progress in all practical components of assessment before being permitted
to sit the final examination.
| Assessment |
% of final mark |
Assessment Dates |
| 1st project |
20% |
12noon Mon Apr 18th (week 7) |
| Mid-semester test |
20% |
12noon Thu Apr 22nd (week 7) |
| 2nd project |
20% |
12noon Fri May 27th (week 12) |
| Examination |
40% |
2hrs, June Examination Period |
Unsatisfactory Progress
Any student who does not demonstrate satisfactory progress in this
unit, as defined in the FECM
Policy on Assessment Practices and Procedures, may be refused admission to the
final examinations. The final deadline for notification of unsatisfactory progress is the
last day of Week 10.
Penalties
The School of Computer Science and Software Engineering has adopted a policy on
minimum penalties for late items of assessment.
This is the default policy of all units unless indicated otherwise, in writing, by the
specific unit coordinator.
This policy shall apply to all items of continuous assessment, whether
submitted either physically or electronically. Immediately after the submission deadline for an item of continuous
assessment, a penalty of 20 percent will be applied PER DAY or PART THEREOF.
The minimum mark possible for late submission is zero. The
percentage is based on the item´s total contribution to the unit´s
assessment. For example, a project contributing 40% to the unit´s
assessment will incur a penalty of 8 marks for each day late until it is submitted or
a mark of zero results.
A more detailed description is given in this School´s Policy on
Late Submission. The Faculty does have an appeals procedure, the details of which can found at the Policy for Appeals.
Plagiarism
Plagiarism is broadly defined to be when any portion
of the work presented for assessment, can be attributed
to another party. The student making the submission should acknowledge
what aspects of the presented work is not directly derived by
them. For the purposes of plagiarism it is irrelevant that you
have been given permission by someone to copy their work
and present it as your own.
You are directed to the School of Computer Science and Software Engineering Policy on Plagiarism and the Faculty of Engineering,Computing and Mathematics Policy on Plagiarism.
Faculty Scaling
Final assessment is subject to the Faculty Scaling Policy.
This information is correct as at 28-Feb-2005, but is subject
to change from time to time. In particular, The University
reserves the right to change the content and/or method of
presentation and/or the method of assessment of any unit of
study, to withdraw any unit of study or programme, and/or to
vary arrangements for any programme.
Copyright© 2005
School of Computer Science, & Software Engineering
The University of Western Australia
CRICOS Provider Code: 00126G
Last updated: 28-Feb-2005 |
