ass3solution

ass3solution - SIT202 Computer Networks ASSIGNMENT 3 This...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
1 SIT202 Computer Networks ASSIGNMENT 3 This assignment is worth 15% of your final unit grade. Due on 29, September, 2010 (9.00 am) Total: 50 points This assignment is designed to test, your basic understanding of computer networks through problem solving, simple protocol and algorithm analysis. IMPORTANT Assignment Rules and Submission Policy This assignment is an individual assignment. Collaborative learning is encouraged but copying/plagiarism is not permitted and will be penalised according to university and faculty guidelines. It should be completed in its entirety (i.e., all questions must be attempted.) The submission date for the assignment is Wednesday, 29 September, 2010 (9.00 am). The assignment should be submitted with an assignment cover sheet through DSO. Assignments without a cover sheet will not be accepted or marked. Hard-copy and e-mail submissions are not acceptable and will not be marked. Any queries/clarifications relating to this assignment must be posted under the ASSIGNMENT 3 discussion on DSO. Please check that your query has not already been addressed prior to starting a new thread . Students who do not submit by the due date will have their mark reduced in accordance with faculty policy. This states: Work submitted late without documented approval of the Unit Chair will be penalised. Assignments that are submitted after the submission date will be subject to a mark penalty equal to 10% of the marks per day of the marks available for the piece of work, up to and including three days after the published due date. Assignments submitted more than three days after the published submission date will not be marked.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 ASSIGNMENT TASKS All working must be shown for numerical and analytical problems. 1. Consider the following network. With the indicated link costs, show how Djikstra’s shortest path algorithm works to compute the shortest path from X to all network nodes. You should present your solution using a table similar to Table 4.3 in the textbook. (Hint : Review section 4.5.1 Link State Routing Algorithm) . ........................................................................... (10 points) Step N’ D(s),p(s) D(t),p(t) D(u),p(u) D(v),p(v) D(w),p(w) D(y),p(y) D(z),p(z) 1 x 3,x 6,x 6,x 2 xv 7,v 6,v 3,x 6,x 4,v 3 xvy 7,v 6,v 3,x 6,x 4,v 16,y 4 xvyw 7,v 6,v 3,x 6,x 4,v 16,y 5 xvywu 8,u 7,v 6,v 3,x 6,x 4,v 16,y 6 xvywut 8,u 7,v 6,v 3,x 6,x 4,v 12,t 7 xvywuts 8,u 7,v 6,v 3,x 6,x 4,v 12,t 8 xvywutsz 8,u 7,v 6,v 3,x 6,x 4,v 12,t POINT 1 : Different variations are possible in the steps (1-7) and the order in which nodes are included in N’ – however all different variations will lead to the same least cost. POINT 2
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/03/2011 for the course SIT 202 taught by Professor Robindoss during the Three '09 term at Deakin.

Page1 / 8

ass3solution - SIT202 Computer Networks ASSIGNMENT 3 This...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online