Q. In Hierarchical routing for N router subnet, the optimal number of levels is ..............

View solution

Q. The router algorithm takes the decision to changes the route when .................

View solution

Q. If route from router I to router J is computed on line based on the current statistics, then it is called as ....................

View solution

Q. If the subnet uses virtual circuits internally, routing decisions are made only when a new virtual circuit is being setup. This is called as.................

View solution

Q. ................. change their routing decisions to reflect changes in the topology.

View solution

Q. If router J is on the optimal path from router I to router K, then the path from J to K along the same route is ..................

View solution

Q. If router J is on the optimal path from router I to router K, then the optimal path from J to K also falls along the same route is known as ....................

View solution

Q. If a datagram router goes down then ..............

View solution

Q. In datagram subnet new route is chosen .....................

View solution

Q. The PSTN is an example of a ..................... network.

View solution

Q. Each packet is routed independently in ...................

View solution

Q. A station in a network forwards incoming packets by placing them on its shortest output queue. What routing algorithm is being used?

View solution

Q. Eight stations are competing for the use of a shared channel using the 'Adaptive tree Walk Protocol'. If the stations 7 and 8 are suddenly become ready at once, how many bit slots are needed to resolve the contention?

View solution

Q. Which of the following is the address of the router?

View solution

Q. Establishing a virtual connection is functionally equivalent to

View solution

Q. Which of the following characteristics is not true of NetBEUI?

View solution

Q. The Routing Information Protocol (RIP) cannot have more than 15 hops if infinity is defined as

View solution

Q. In Reverse Path Forwarding (RPF), the router receives a packet and extracts the

View solution

Q. A routing table for classless addressing has a minimum of

View solution

Q. Each node uses the shortest path tree protocol to construct its

View solution