2. Given the 4-node topology shown below with the indicated link costs, compute the distance tables after the initialization step and after each iteration of a synchronous version of the distance-vector algorithm (as in Figure 5.6). q 2 8 + r S 10 3 t 3. Given the 4-node topology in Problem #2, do the following. (a) Give a link-cost change for either c(q, r) or c(q, s) such that q will inform its neighbors of a new minimum-cost path to t as a result of executing the distance-vector algorithm. (b) Give a link-cost change for either c(q, r) or c(q, s) such that q will not inform its neighbors of a new minimum-cost path to t as a result of executing the distance-vector algorithm.

2. Given the 4-node topology shown below with the indicated link costs, compute the distance tables after the initialization step and after each iteration of a synchronous version of the distance-vector algorithm (as in Figure 5.6). q 2 8 + r S 10 3 t 3. Given the 4-node topology in Problem #2, do the following. (a) Give a link-cost change for either c(q, r) or c(q, s) such that q will inform its neighbors of a new minimum-cost path to t as a result of executing the distance-vector algorithm. (b) Give a link-cost change for either c(q, r) or c(q, s) such that q will not inform its neighbors of a new minimum-cost path to t as a result of executing the distance-vector algorithm.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter8: Network Models

Section8.3: Maximum-flow Problems

Problem 11P

See similar textbooks

Similar questions

IN PYTHON Given the following six-node wide area network for which the numbers attached to the links are a measure of the “delay” in using that link (e.g., some lines could be more heavily used than others and therefore have a longer wait time), answer the following question. What is the shortest path from node A to node D, where shortest path is defined as the path with the smallest sum of the delays on each individual link? Explain exactly how you went about finding that path.
1. Develop a system of linear equations for the network by writing an equation for each router (A, B, C, D, and E). Make sure to write your final answer as Ax=b where A is the 5x5 coefficient matrix, x is the 5x1 vector of unknowns, and b is a 5x1 vector of constants. 2. construct the augmented matrix [A b] and then perform row reduction using the rref() function. Write out your reduced matrix and identify the free and basic variables of the system. 3. Use MATLAB to compute the LU decomposition of A, i.e., find A = LU. For this decomposition, find the transformed set of equations Ly = b, where y = Ux. Solve the system of equations Ly = b for the unknown vector y. 4. Compute the inverse of U using the inv() function. 5. Compute the solution to the original system of equations by transforming y into x, i.e., compute x = inv(U)y 6. Check your answer for x1 using Cramer’s Rule. Use MATLAB to compute the required determinants using the det() function.
Consider the following three-node topology, with link costs c(x,y)=2, c(y,z)=3, c(zx)=6. Compute the distance tables after the initialization step and after each iteration of a synchronous version of the distance-vector algorithm (as the slide #92 in network slides). N
Electrical Engineering In the network given below, delays between the routers are given in milliseconds. a) Apply Bellman-Ford algorithm for the Router 1. In applying the algorithm, establish a table in which the maximum number of hops is started from zero and incremented by one for each iteration (h=0, 1, 2, 3, ...). In the table you will establish, include the label values consisting of minimum delay and path definition from Router 1 to other routers for each value of h. b) Briefly explain how the iteration ends. c) Indicate which labels will be stored in the routing table of Router I at the end of the algorithm. 2
Computer Science The subject is teletraffic theory. The traffic load of 2 erl is offered to M/M/2. Calculate the mean A and the variance V of overflow calls.
d) Given graph G = (N, E), where N is the set of routers and E is the set of links. Using Bellman- Ford (BF) equation perform the following operation in Distance Vector Routing algorithm: i. Compute the least cost path from node S to node D.
Choose the correct statment(s) from the following. A. It is possible to design a broadcast algorithm for ring interconnect network with time complexity O(logp)O(log⁡p), where p is the number of nodes in the ring. B. The time complexity of broadcast in bus interconnect network is O(1)O(1). C. It is possible to design a broadcast algorithm for hypercube interconnect network with time complexity O(logp)O(log⁡p), where p is the number of nodes in the ring. D. The time complexity of broadcast in ring interconnect network is O(1)O(1).
Network Routing Analysis - Algorithms Consider the following network. With the indicated link costs, use Dijkstra’sshortest-path algorithm to compute the shortest path from x to all network nodes.Show how the algorithm works by computing a table similar to Table 4.3.
Computer Science This problem illustrates some of the difficulties facing network planners when they have to use OADMs that are constrained in what channels they can add and drop. Consider a four-node linear network with nodes A, B, C, and D in that order. We have three wavelengths lambda-1, lambda-2, and lambda-3 available. The OADMs given to us can drop two fixed channels i.e., we can put OADMs that drop either (lambda-1, lambda-2), or (lambda-2, lambda-3), or (lambda-1, lambda-3). Now consider the situation where we need to set up the following light paths – AB, BC, CD, AC, and BD. A) What OADMs would you deploy at each node? B) At a later point, the light path traffic changes and we need to replace light paths AC and BD with AD and BC. What changed would you have to make in order to support the new traffic.
Q1. Consider the network of Fig. 5-12(a). Distance vector routing is used, and the following vectors have just come in to router C: from B: (5, 0, 8, 12, 6, 2); from D: (16, 12, 6, 0, 9, 10); and from E: (7, 6, 3, 9, 0,4). The cost of the links from C to B, D, and E, are 6, 3, and 5, respectively. What is C's new routing table? Give both the outgoing line to use and the cost. A - 5 B2 C 6 E 8 F 3 7 D
Given the following network configuration (A,B... stand for node name, 1,2... stand for the length of the link), please apply Dijkstra's algorithm to calculate the shortest path from A to all the other nodes and answer following questions. B E 3 2 2 D F 5 A 5 H. G Simulate the execution of Dijkstra Algorithm round by round with fulfilling the following table. (6') Node Set B C D E G A 2, A 1,A 5, A INF INF 4,A INF AC 2, A 5, A INF INF 3,С INF 3.
a) Given the following undirected graph: 4 1 5 3 Represent the graph as: (i) Adjacency matrix (ii) Adjacency list (iii) Incidence matrix 5 9 A 6 15 20 2 10 7 3 درا 2