9 Consider the computer network with nodes and communication links as shown below Each link has...
Consider the communication network shown in the figure below and suppose that each link can fail with probability p. Assume that failures of different links are independent Link 1 Link 2 B A Link 5 Link 3 Link 4 1. Assume that p = 1/3. Find the probability that there exists a path from A to Balong which no link has failed. (Give a numerical answer.) 2. Given that exactly one link in the network has failed, find the probability...
computer networking help 4. 120 points) Consider a network with the following topology (1) Use Djikistra shortest path algorithm to find the spanning tree which contains all form router A to the rest of the routers the network. Show the first 4 steps of the results of the algorithm. (Note that unless specified in figure, all link metrics are 1.) Answer: Step N LA 3.A 2.A (2) Assume that RIP is used as the routing protocol and all link metrics...
The next three questions are related to the local area network shown below. In this network computers attached to links 1 & 2 send data to the server attached to link 3. The three devices are connected through a router. Link 1 Link 2 Link 3 Following parameters of the network have been provided. Propagation delay in link 1-138 micro seconds Propagation delay in link 2-309 micro seconds Propagation delay in link 3-216 micro seconds Frame size 1432 bytes ACK...
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...
Consider the network shown below. The numbers shown for each link are the delays between nearest neighbors for that link. Apply Dijkstra’s algorithm to this network starting at node 1, and label each node with the shortest path route to node 1. 2 Al 3 5
Question 1 (20 points: Events, counting, and properties f probabniny Consider the network shown below. There are two kinds of links in the network. Each link of kind o-p +0 fails with probability p and that of kind O 4+0 fails with probability q. Each link is assumed to fail independently of the other. We say that a path is successful if no link in the path fails. For example, the path S-B-T succeeds if none of the links S...
4. Given a network of 8 nodes and the distance between each node as shown in Figure 1: 4 1 7 0 4 4 6 6 Figure 1: Network graph of 8 nodes a) Find the shortest path tree of node 1 to all the other nodes (node 0, 2, 3, 4, 5, 6 and 7) using Dijkstra's algorithm. b) Design the Matlab code to implement Dijkstra's algorithm 4. Given a network of 8 nodes and the distance between each...
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...
1. (20 points) Consider the network shown below, and assume that each node initially knows the costs to each of its neighbors. Consider the distance-vector algorithm and show the distance table entries at each node iteration by iteration until the algorithm converges at all nodes. 10 Iteration 0 Iteration 1 Iteration 2 Iteration n (trust me, n won't be crazily too large)
9) Forwarding Tables Suppose we have the forwarding tables shown below for nodes A and F, in a network where all links have cost 1. Give a diagram of the smallest network consistent with these tables Nod (6 Points) Cost Next Hop Forwarding table for host A Nod Cost Next Hop Forwarding table for host F