Show the distance table entries at each node iteration

Assignment Help Data Structure & Algorithms
Reference no: EM132235173

Question 1. 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.

Question 2. Consider the network fragment shown below. Node x has only two attached neighbors, w and y. Node w has a minimum-cost path to destination u (not shown) of 5, and y has a minimum-cost path to u of 6. The complete paths from w and y to u (and between w and y) are not shown. All link costs in the network have strictly positive integer values (i.e. 1, 2, 3, ...).

a. Give x's distance vector for destinations w, x, y, and u. Also, give distance vectors x receives from its neighbors w and y.

 Dx U W X Y W X Y

a. Give all valid link-cost changes for either c(x, w) or c(x, y) such that x will inform its neighbors of a new minimum-cost path to u as a result of executing the distance-vector algorithm.

b. Give all valid link-cost changes for either c(x, w) or c(x, y) such that x will not inform its neighbors of a new minimum-cost path to u as a result of executing the distance-vector algorithm.

c. Give all valid updates received by X (with regard to the cost of the least-cost to U, i.e. either Dw(U) or Dy(U)) such that X will inform its neighbors of new least-cost path to U as a result of executing the DV algorithm.

d. Give all valid updates received by X (with regard to the cost of the least-cost to U, i.e. either Dw(U) or Dy(U)) such that X will NOT inform its neighbors of new least-cost path to U as a result of executing the DV algorithm.

Attachment:- Assignment.rar

Design algorithm that computes how many steps it will take

Will the viruses eventually kill all the bacteria? If so, design an algorithm that computes how many steps it will take. How does the running time of your algorithm depend o

Draw a hierarchy chart and then plan the logic for a program

Draw a hierarchy chart and then plan the logic for a program for the sales manager of The Couch Potato Furniture Company. The manager needs a program to determine the profit

Efficient algorithm to achieve goal using few base stations

Certain points along the road, so that every house is within four miles of one of the base stations. Give an efficient algorithm that achieves this goal using as few base stat

Write a pseudocode-function to count the number of items

Write a pseudocode/function that will delete from an unsorted linked list of integers the node that contains the smaller integer. Can you do this with a single traversal of

Is it better to use an arraylist or a linkedlist

What is the time complexity of this method? You need to write a program that frequently iterates through all the items in a list. Is it better to use an ArrayList or a Linked

Encryption algorithm that does not use the alphabet

Research and submit an encryption algorithm that does not use the alphabet or numbers in the encrypted text.  For instance, if you take a sentence like "I love this class"

Draw flowchart and execute the algorithm

Execute the algorithm below using 6 for "number" and Execute the algorithm below using 25 for "number" and draw a flowchart for the algorithm below and have it checked by the

Implement a queue as a circular array

Implement a queue as a circular array as follows: Use two index variables head and tail that contain the index of the next element to be removed and the next element to b

Write a Review

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!