Q. In the shortest path tree, root of a tree is a

View solution

Q. In Open Shortest Path First (OSPF) terminology, a connection is called a

View solution

Q. If the path from A to B is the shortest, then it is also the shortest from

View solution

Q. In classless addressing, we need at least

View solution

Q. We can create a sense of hierarchy in the routing tables, to solve the problems of

View solution

Q. The designated parent router can be the router with the shortest path to the

View solution

Q. In Unicast Routing, the first column in Routing Table defines the

View solution

Q. In a stub link, the link is

View solution

Q. If the multicast packet has just came from the hop defined in the table, the packet has traveled the

View solution

Q. Reverse Path Broadcasting (RPB) guarantees each network receives a copy of the multicast packet without formation of

View solution

Q. In distance vector routing, each node shares its routing table with its

View solution

Q. In path vector routing, the Internet is divided into hierarchical domains called

View solution

Q. In Unicast Routing, the timer set for periodic dissemination is normally in the range of

View solution

Q. In Unicast Routing, link state routing has a different philosophy from that of

View solution

Q. Multicast Link State Routing is a direct extension of

View solution

Q. The router sends a prune message to the upstream router so that it can exclude the corresponding

View solution

Q. A dynamic routing table is updated periodically by using one of the dynamic routing protocols such as RIP, OSPF, or

View solution

Q. A combination of rules and procedures that lets routers in the internet inform each other of changes, is

View solution

Q. In Unicast Routing, a node sends its two-column routing table to its neighbors anytime there is a change in its table, is known as

View solution

Q. To alleviate the problem of time needed for searching the table, the term was designed known as

View solution