Question: (20 points) Use link-state algorithm to find the shortest path from node 0 to node 4 in the following graph representation of a network. 2.
(20 points) Use link-state algorithm to find the shortest path from node 0 to node 4 in the following graph representation of a network.

2. (20 points) In the following network abstraction, assume that the initial delays of links (1, 2), (2, 0) and (0, 1) are 9, 11, and 37 respectively. Assume that we increase the delay of (2,0) to 46. Show all iterations of distance-vector algorithm before it stabilizes.
3. (20 points) Assuming that we use CRC for error detection, if the bit-pattern generator is G =101101, calculate the error detection bits that the sender sends along with the following data: D=101101010101011
4. (20 points) Estimate the efficiency of CSMA assuming that maximum propagation delay is 240ns, transmission rate of the shared link is 15Mbps and maximum frame size is 2KB. How much should we increase the transmission rate of the shared link so that slotted ALOHA can compete with CSMA and have the same efficiency.
5. (10 points) Explain how symmetric cryptography different from asymmetric cryptography.
6. (10 points) Explain how RSA works.
4 0 9 4 3 5 7 6-6 2 8 1 7 4 0
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
