墨尔本大学COMP90007 assignment2 课业解析

题意:

完成5道计算机网络问题


  解析: 

q1:求B到F的最短路径,利用Dijkstra算法,先求B到邻节点的最短路径,为3(BC),再将BC看成一个节点求他们到其他邻节点的最短路径,为5(BCE),重复步骤,求得B到F的最短路径为7,注意更新节点的权值变化 q2:对于A,2^n-2>=2000,n>=11,所以MASK最小为11,子网掩码取21位,159.27.0.0/21 q3:数据段主要是用来建立主机端到端连接,包括TCP和UDP连接,数据被分割,这样可对每个数据段进行排序,以便在接收端按发送顺序重组数据流 

更多可加微信讨论

微信号:tiamo-0620

涉及知识点: 最短路径,计算机网络计算

COMP90007 Internet Technologies

Assignment 2

Semester 2, 2019

Due date: Oct 18th Friday 11:30am

This assignment is worth 5% of the total marks for the subject. This assignment has 5 questions.

The weighting of each question is shown beside the question. Answers must be submitted as a

PDF file via the COMP90007 Assignment 2 submission form in the LMS which will open close to

the submission time. Late submissions will attract a penalty of 10% per day (or part thereof).

Please ensure your name, user name and id are clearly presented. Submission should only

contain the question number and the answer (do not repeat the text of questions in your

submission). Questions can be answered by studying the material covered. All work presented

should be your original individual effort/work.

Question 1 (1 mark)

Consider a subnet in the following figure, with the weight of each edge as shown in the label.

The shortest path routing is used.

1) Compute the sink tree for node B using Dijkstra’s algorithm. Show your calculation and the

steps of adding all nodes to the sink tree. (It is recommended to use a table similar to the

one as shown on the Slide 9 of Week 6’s lecture)

2) What is the shortest path from B to F and its distance?

Question 2 (1 mark)

Suppose that four organisations A, B, C and D request 2000, 1700, 900, and 4000 addresses

respectively, and in that order. There are a large number of consecutive IP addresses available

starting at 159.27.0.0, which can be assigned to these four organisations. For each of these

organisations, give the first IP address assigned, the last IP address assigned, the number of

addresses allocated and the mask in the w. x. y. z /s notation.

Question 3 (1 mark)

Different applications care about different aspects of a network transmission. For the following

applications please annotate each bucket/aspect with three values, Low, Medium, High, where

High means a high need for quality for that aspect.

Question 4 (1 mark)

At Transport layer we use segments to send data across. Argue for using larger segments by

discussing briefly why larger segments could be beneficial. Then also argue why using small

segments may be beneficial.

Question 5 (1 mark)

In the following security protocol that we saw in class, discuss briefly what could go wrong with

the protocol if RA was not sent across from Alice to Bob. What fails in the protocol?

最后编辑于
©著作权归作者所有,转载或内容合作请联系作者
  • 序言:七十年代末,一起剥皮案震惊了整个滨河市,随后出现的几起案子,更是在滨河造成了极大的恐慌,老刑警刘岩,带你破解...
    沈念sama阅读 221,635评论 6 515
  • 序言:滨河连续发生了三起死亡事件,死亡现场离奇诡异,居然都是意外死亡,警方通过查阅死者的电脑和手机,发现死者居然都...
    沈念sama阅读 94,543评论 3 399
  • 文/潘晓璐 我一进店门,熙熙楼的掌柜王于贵愁眉苦脸地迎上来,“玉大人,你说我怎么就摊上这事。” “怎么了?”我有些...
    开封第一讲书人阅读 168,083评论 0 360
  • 文/不坏的土叔 我叫张陵,是天一观的道长。 经常有香客问我,道长,这世上最难降的妖魔是什么? 我笑而不...
    开封第一讲书人阅读 59,640评论 1 296
  • 正文 为了忘掉前任,我火速办了婚礼,结果婚礼上,老公的妹妹穿的比我还像新娘。我一直安慰自己,他们只是感情好,可当我...
    茶点故事阅读 68,640评论 6 397
  • 文/花漫 我一把揭开白布。 她就那样静静地躺着,像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上,一...
    开封第一讲书人阅读 52,262评论 1 308
  • 那天,我揣着相机与录音,去河边找鬼。 笑死,一个胖子当着我的面吹牛,可吹牛的内容都是我干的。 我是一名探鬼主播,决...
    沈念sama阅读 40,833评论 3 421
  • 文/苍兰香墨 我猛地睁开眼,长吁一口气:“原来是场噩梦啊……” “哼!你这毒妇竟也来了?” 一声冷哼从身侧响起,我...
    开封第一讲书人阅读 39,736评论 0 276
  • 序言:老挝万荣一对情侣失踪,失踪者是张志新(化名)和其女友刘颖,没想到半个月后,有当地人在树林里发现了一具尸体,经...
    沈念sama阅读 46,280评论 1 319
  • 正文 独居荒郊野岭守林人离奇死亡,尸身上长有42处带血的脓包…… 初始之章·张勋 以下内容为张勋视角 年9月15日...
    茶点故事阅读 38,369评论 3 340
  • 正文 我和宋清朗相恋三年,在试婚纱的时候发现自己被绿了。 大学时的朋友给我发了我未婚夫和他白月光在一起吃饭的照片。...
    茶点故事阅读 40,503评论 1 352
  • 序言:一个原本活蹦乱跳的男人离奇死亡,死状恐怖,灵堂内的尸体忽然破棺而出,到底是诈尸还是另有隐情,我是刑警宁泽,带...
    沈念sama阅读 36,185评论 5 350
  • 正文 年R本政府宣布,位于F岛的核电站,受9级特大地震影响,放射性物质发生泄漏。R本人自食恶果不足惜,却给世界环境...
    茶点故事阅读 41,870评论 3 333
  • 文/蒙蒙 一、第九天 我趴在偏房一处隐蔽的房顶上张望。 院中可真热闹,春花似锦、人声如沸。这庄子的主人今日做“春日...
    开封第一讲书人阅读 32,340评论 0 24
  • 文/苍兰香墨 我抬头看了看天上的太阳。三九已至,却和暖如春,着一层夹袄步出监牢的瞬间,已是汗流浃背。 一阵脚步声响...
    开封第一讲书人阅读 33,460评论 1 272
  • 我被黑心中介骗来泰国打工, 没想到刚下飞机就差点儿被人妖公主榨干…… 1. 我叫王不留,地道东北人。 一个月前我还...
    沈念sama阅读 48,909评论 3 376
  • 正文 我出身青楼,却偏偏与公主长得像,于是被迫代替她去往敌国和亲。 传闻我的和亲对象是个残疾皇子,可洞房花烛夜当晚...
    茶点故事阅读 45,512评论 2 359

推荐阅读更多精彩内容