Computer Network

Quesion 1 Soalan 1) CO2, PO2, C4) 17 31 E B 15 23 23 19 13 22 29 D F 22 13 17 12 H 15 Figure 1 Rajah 1] Referring to Figure 1, answer the following questions Merujuk kepada rajah 1. jawab soalan-soalan dibawah a compute the operation of Dijkstra's (LinkState) algorithm from node A to all destination Kirakan operasi Dijkstra's (LinkState) algorithm daripada nod A ke semua destinasi.] [10 marks/markah] b. Compute and list the least cost path from A to nodes B-J. List the steps. Kirakan dan senarailan least cost path daripada A ke nad BI. Senaraikan langkah-langkahnya [7 marks/markon c. Compute the distance vectors in nodesc Kirakon distance vectors dinod [6 marks/markah] d. Consider a network in which all nodes are connected to four other nodes. In a single time step, a node can receive all transmitted broadcast packets from its neighbors, duplicate the packets, and send them to all of its neighbors (except to the node that sent a given packet). At the next time step, neighboring nodes can receive, duplicate, and forward these packets, and so on. Suppose that uncontrolled flooding is used to provide broadcast in such a network. At time step t, calculate copies of the broadcast packet will be transmitted, assuming that during time step 1, a single broadcast packet is transmitted by the source node to its three neighbors. Pertimbangkan rangkalan di mana semua nod disambungkan ke empot nod lain. Dalam satu langkah, satu nod dapat menerima semua paket siaran yang dihantar dari Wannya, menduplikasi poket tersebut, dan mengirimkannya ke semua rannya (kecual ke simpul yang mengirim paket tertentul. Poda langkah seterusnya, nod tetangga dapat menerima, menduo, dan meneruskan paket ini dan seterusnya. Anggoplah banjir yang tidak terkawal digunakan untuk menyediakan siaran dalam rangkaian seperti itu. Pada langkah waktu t kirakan solinan poket slaran yang akan dihantar, dengan anggopon bahawa semasa langkah 1 sotu paket siaran dihantar oleh simpul sumber ke tigo jirannya./ [7 marks/markah