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

Q. In the Border Gateway Protocol (BGP), the criterion of the policy is set by the

View solution

Q. A network can receive a multicast packet from a particular source only through a

View solution

Q. In periodic update, a node sends its routing table normally after every

View solution

Q. To convert broadcasting to multicasting, the protocol uses

View solution

Q. The network layer supervises the handling of the packets by

View solution

Q. The technique to simplify routing is called the

View solution

Q. The idea of aggregation is similar to

View solution

Q. Well-known mandatory attributes of Border Gateway Protocol (BGP) is

View solution

Q. In multicast communication, the relationship is

View solution

Q. In multiple unicasting, the packets are created with a relative delay in

View solution

Q. Reverse Path Forwarding (RPF) does not guarantees that each network receives

View solution

Q. DVMRP stands for

View solution

Q. The graft message forces the upstream router to resume sending the

View solution

Q. The telephone line is an example of

View solution

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