- In Link State Routing The Calculation Of The Least Cost Path Is Carried Out In An Iterative Distributed Manner With E 1 (17.29 KiB) Viewed 20 times
- In Link State Routing The Calculation Of The Least Cost Path Is Carried Out In An Iterative Distributed Manner With E 2 (38.3 KiB) Viewed 20 times
- In Link State Routing The Calculation Of The Least Cost Path Is Carried Out In An Iterative Distributed Manner With E 3 (29.99 KiB) Viewed 20 times
In link state routing, the calculation of the least-cost path is carried out in an iterative, distributed manner, with each node having the knowledge of only its immediate neighbours. Select one: O True O False
- Suppose three active nodes (n1, n2, and n3) are competing for access to a channel using slotted ALOHA. The channel is capable of transmitting a given frame at the full channel rate of R Mbps (R = 27Mbps). Assume each node has an infinite number of packets to send; assume node 3 attempts to transmit in each slot with a probability p = 0.2, and nodes 1 and 2 attempt with a probability p. The value of p that maximizes the throughput is: O a. 0.333 O b. 0.2 c. 0.666 O d. 0.428
A router receives an IP packet containing 600 bytes of data in its payload. The router has to forward this packet over a network with an MTU of 200 bytes. Assume the IP header is 20 bytes long and that the data length of each fragment must be a multiple of 8 bytes. The fragment offset field of the last fragment is: a. 66 O b. 65 O c. 64 O d. None of the others