Adaptive or dynamic directory used in packet routing changes
A. | within each user session |
B. | with each user session |
C. | at system generation time only |
D. | both (a) and (b) |
Option: A Explanation : Click on Discuss to view users comments. |
A networking system has an n layers. Application generated message of length M bytes. At each of the layer, a h-byte header is added, what fraction of the network bandwidth is filled with headers ?
A. | M / (n x M) bytes |
B. | h x n x M bytes |
C. | (n x h) / M bytes |
D. | M / (n x m) |
Option: C Explanation : Click on Discuss to view users comments. |
Let the clock-driven scheme for generating initial sequence numbers is used with a 15-bit wide clock counter. The clock ticks once every 100 msec, and the maximum poacket lifetime is 60 sec.
How often need resynchronization take place in the worst case ?
A. | 2216.8 sec |
B. | 2816.8 sec |
C. | 3216.8 sec |
D. | 3416.8 sec |
Option: C Explanation :
The clock takes 32768 ticks, i.e., 32768 sec to cycle around. Click on Discuss to view users comments. |
For a 1-Gbps network operating over 4000 km, the delay is the limiting factor, not the bandwidth. Consider a MAN with the average source and destination 20 km apart. At what data rate does the round-trip delay due to the speed of light equal the transmision delay for a1-KB packet ?
A. | 24 Mbps |
B. | 36 Mbps |
C. | 40 Mbps |
D. | 48 Mbps |
Option: C Explanation :
Speed ight in fiber and copper = 200 km/msec. Click on Discuss to view users comments. |
A group of 2n - 1 routers are interconnected in a centralised binary tree, with a router at each tree node. Router i communicates with router j by sending a message to the root of the tree. The root then sends the message back down to j. The mean number of hops per message for large n, assuming that all router pairs are equally likely will be
A. | n - 4 |
B. | 2n - 1 |
C. | n - 2 |
D. | 2n - 4 |
Option: D Explanation : Mean router-router path is twice the mean router-root path.
Number levels of the tree with the root as 1 and the deepest level as n.
Path from the root to level n requires n - 1 hops, and 0.50 of the routers are at this level. Path from root to level n - 1 has 0.25 of the routers, and a length of n – 2 hops. therefore, Mean path length l = 0.5 x (n-1) + 0.25 x (n-2) + 0.125 x (n-3) +....
The expression reduces to l = n – 2
Mean router-router path = 2n – 4. Click on Discuss to view users comments. |