4(1) :
ALGORITHM : function Dijkstra(Graph, source): dist[source] := 0 // Distance from source to source is set to 0 for each vertex v in Graph: // Initializations if v ≠ source dist[v] := infinity // Unknown distance function from source to each node set to infinity add v to Q // All nodes initially in Q while Q is not empty: // The main loop v := vertex in Q with min dist[v] // In the first run-through, this vertex is the source node remove v from Q for each neighbor u of v: // where neighbor u has not yet been removed from Q. alt := dist[v] + length(v, u) if alt < dist[u]: // A shorter path to u has been found dist[u] := alt // Update distance of u return dist[] end function
computer networking help 4. 120 points) Consider a network with the following topology (1) Use Djikistra shortest...
1. (8 pts) Consider a network with the following topology. Unless indicated otherwise, all links have distance = 1. (a) Use the first four steps of using the Dijkistra shortest path algorithm to find the shortest paths from A to the rest of the nodes. (b) Let's assume the distance vector routing algorithm is used. At t = 0, each node only knows the distances to its neighbors. The distances to the other nodes will be set to infinity. Nodes...
CHAPTER 4: CONTINUE ll. Multicast Routing Consider the network topology in Figure-2 below H1 NET- Router R1 R3 R2 R10 R4 R5 R6 R7 R8 R9 NET-4 NET-3 NET-2 H3 H5 H4 Figure 2: Multicast/Broadcast Topology CHAPTER 4: CONTINUE I. Multicast Routing - Continue Q3. Assume the host H1 is willing to multicast a message to the hosts H3, H4, and H5. Assume a center-based tree approach is used for multicast, R5 is selected as the center, and number-of-hops is...
Consider the following network.
a. (16 pt.)
With the indicated link costs, use Dijkstra’s shortest-path
algorithm to compute the shortest path from “w” to
all network nodes. Show how the algorithm works by computing the
table below. Note: If there exists any tie in each step, choose the
left-most column first.
Step
N’
D(s),
p(s)
D(t),
p(t)
D(u),
p(u)
D(v),
p(v)
D(x),
p(x)
D(y),
p(y)
D(z),
p(z)
0
1
2
3
4
5
6
7
b. (7 pt.)
Construct the...
PLEASE ATTACH A SCREENSHOT OF YOUR SUCCESSFUL PING IN
PACKET TRACER FOR THE END!!!!!!!!!!! THANK YOU!
Objectives Part A: Configure a simple static routing . Part B: Configure a simple RIP routing Part A: Configure a simple static routing 1. Create the following network topology on Packet Tracer Router-PT Router-PT Addressing Table Device Interface IP Address Subnet Mask Default Gatewa 10.0.0.1 20.0.0.1 30.0.0.1 20.0.0.2 0.0.0.10 30.0.0.10 N/A 255.0.0.0 255.0.0.0 255.0.0.0 255.0.0.0 255.0.0.0 255.0.0.0 Routero 2/0 NIA NIA NIA 10.0.0.1 30.0.0.1...
Figure 1: Network for Problem 4 and 5 4. [10 pointsj: Link-state routing: (a) Explain how link-state routing works. Give an example of an Internet routing protocol based on link-state routing. b) Apply Dijkstra's algorithm to obtain the routing table for node a in the network given in Figure 1 5. [10 points Apply distance-vector routing to the subnetwork of the network shown in Figure 1 con sisting of only nodes fa, b, c, d (a) Write the initial distance-vector...
12 8 4 6 4 6 2. Consider the same network as in Problem 1. Assume node r is the only destination in the network. Use a table to show the computation process of the Bellman-Ford algorithm. Each row in the table corresponds to one iteration of the algorithm, and each column is a pair (D (A), H(A)) where D,(A) is the cost from node i to A and Hi(A) is the next hop on the path from i to...
2) IP and MAC addressing. True or False. One point for each correct answer, zero points for each incorrect answer. Many of the questions refer to the following network consisting of three 10Mbps Ethernet segments, one switch, and one router. Assume all ARP tables are up-to-date unless otherwise stated. a) Consider a network consisting of Ethernets, hubs, switches, and routers. Suppose one of the hubs is replaced with a switch. Then the network administrator must redefine some IP addresses. True...
Computer Communication Networking
3. Given the following network with assigned weights (10 Points) 3 1 4 1 Using Dijkstra's algorithm, show shortest path from node u to node z. (Hint, make a table)
Q1 Error detection/correction Can these schemes correct bit errors: Internet checksums, two-dimendional parity, cyclic redundancy check (CRC) A. Yes, No, No B. No, Yes, Yes c. No, Yes, No D. No, No, Yes E. Ho, hum, ha Q2 CRC vs Internet checksums Which of these is not true? A. CRC's are commonly used at the link layer B. CRC's can detect any bit error of up to r bits with an r-bit EDC. c. CRC's are more resilient to bursty...
PART A 21 MARKS
SHORT ANSWER QUESTIONS Answer ALL questions from this part. Write
your answers in the Examination Answer Booklet. Each question is
worth 1.5 marks (14 x 1.5 = 21 marks).
Question 1
An organisation has been granted a block of addresses with the mask
/22. If the organisation creates 8 equal-sized subnets, how many
addresses (including the special addresses) are available in each
subnet? Show your calculations.
Question 2
Give an example of a valid classful address...