Which routing algorithm, Dijkstra or Bellman-Ford, requires more link overhead to maintain? Link overhead means sending control /administrative, / non-data traffic versus information/data traffic.   Answer Format Write your choice (Bellman-Ford or Dijkstra): Provide your reason for your choice: (one or two sentences in text)

Consider an audio application that sends a VoIP payload (G.711 formatted audio message) using a network packet, as shown in the figure.   Consider an audio application that sends a VoIP payload (G.711 formatted audio message) using a network packet, as shown in the figure. Suppose we want 81% frame efficiency for the above packet. How many audio bytes must each packet carry? Answer FormatVoice payload Bytes = Bytes  (Enter an Integer, no decimals, no text)  

A router with IP address 138.76.29.7 manages a NAT translation table for a private network. The router uses ports starting from 8000. Each time a new connection is needed, it increments by one. For example, if a host in the private network with address 10.0.0.5:5000 sends a message to 132.239.8.45:80 then the entry in the NAT table would be filled in as below. The next time the router will use 8001 as the port to establish a new connection and so on.  All connections are TCP. Complete the NAT Table for the following events:a) 10.0.0.5:5000 sends a message to 132.239.8.45:80 (already filled in)b) 10.0.0.101:6000 sends a message to 206.190.36.45:80    Private Address Private Port External Address External Port Transport Protocol a) 10.0.0.5 5000 132.76.29.7 8000 TCP b) TCP  

Continuing the previous Bellman-Ford question… Suppose the link between node B and node C goes down. Thus, the link cost between B and C is updated to “infinity”. Continue the Bellman-Ford algorithm table from the previous problem. 1. The first row in the table for this question should be exactly the same as the last row of the previous question.  2. The second row in the table for this question should also be exactly the same as the last row of the previous question EXCEPT, increment the Iteration number and change the value of the cost from B  to C to “infinity” .  3. Now, continue the Bellman Ford algorithm using this new update from Node B.  Stop after 5 new rows have been added.  For Example: In other words, if  the last row in your previous answer was Iteration 14, then the first row in this question will be the exact same row, Iteration 14. The second row in this question will be the same as Iteration 14, EXCEPT increment the Iteration number to 15 and change the value for the cost in “(next node, cost)”  for the column B  to C to infinity.  Then, continue the iterations according to the Bellman-Ford algorithm. Stop at Iteration 19.     Answer format:Choose “Table” in the question editing menu and enter the table values accordingly. Except for the first column (Iteration), each entry should have the format  (Next node, Cost). There should not be any blank entries.  

Use the Bellman-Ford algorithm to find the set of shortest paths to destination node C. Provide the table showing each iteration of the algorithm. Begin with initial conditions for Iteration 0 (row 0). Stop when you reach a stable route, meaning when the last row repeats the previous row. The last two rows of your table should be identical, except for the iteration number.    Answer format:Choose “Table” in the question editing menu and enter the table values accordingly. Except for the first column (Iteration), each entry should have the format  (Next node, Cost). There should not be any blank entries.  

In the previous question, will it converge to a stable route a second time?(This includes the cases where 1) it did converge again in your second table, or 2) you think it will converge again at some iteration after your table. ) Give a reason for your answer. Answer Format a) Will the algorithm converge to a stable route a second time? Write YES or NO: b) Repeat iteration number = .       If you answered YES, enter the number of the first repeat Iteration, i.e., the first       iteration after the break between B and C, where the row values do not change       from the previous iteration. (Integer, no text)       If you answered NO, enter “it never repeats” c) Enter a reason for your answer:   (one to two sentences of text)  

Consider the figure below. Assuming the IP address of R1 is R = 165.100.0.0, and the subnet mask for the network is subnet.IP = 255.255.240.0 a) Assign (make up your own) appropriate IP addresses for router $2 subnet F, subnet G and host H5(“H”). Appropriate means the addresses should not violate the protocols we have discussed for IP addresses and subnets. Note: Each of the subnets should be able to host a maximum of 280 nodes. Answer format Decimal Integer form CIDR IP address. Example 333.333.333.333/20 Chosen address for node R2: Chosen address for node F: Chosen address for node G: Chosen address for node H5:    

What is a Clos, or multi-stage switch? How does it affect switching performance compared to a switch where all inputs are connected to all outputs?

towel

no one; nobody; not anyone