A. Network-specific method
B. Network-specific motion
C. Network-specific maintaining
D. Network-specific membership
Explanation: In the network specific forwarding method, there is only one record, the destination of the packet, in the routing table and not the other hosts of the network. The other two forwarding methods are the default method and the next-hop method.
A. Revolving table
B. Rotating table
C. Routing table
D. Re-allocate table
Explanation: In the next-hop forwarding method, the routing table of each router in the path contains the address of only the next hop in the path of packet. This method is suitable for short distances only.
A. Maturity
B. Error reporting
C. Tunneling
D. Security
Explanation: The size of the routing table in the technique must be manageable for the network nodes i.e. it must not be too big. Security of the forwarding packet is the highest priority for a technique and must be high enough so that only authorized senders and receivers can access the packet’s content.
A. Network measures
B. Security measures
C. Routing measures
D. Delivery measures
Explanation: In host-specific routing, the route of the packet is defined based on the exact match of the packet’s IP with the routing table entry of the host. It provides the best security for the packet as the packet is forwarded only to routers in the pre-defined path.
A. Stable
B. Reversed
C. Guaranteed
D. Forward
Explanation: In Unicast routing, there is only sender and one receiver. So, if there is instability between three nodes, in which one is sender, one is receiver and one is the router in the path, there is no other path available for the packet and the stability of the network is not guaranteed.
A. Graph
B. Tree
C. Network
D. Link
Explanation: The Djikstra’s shortest path algorithm is the fastest among the algorithms for finding the shortest path in a graph. But it is a greedy method based algorithm so it does not guarantee the shortest path every time.
A. Gaps
B. Loops
C. Holes
D. Links
Explanation: In multicast routing, there is one sender and many receivers. So flooding is the most basic method to forward packets to many receivers. The one issue with flooding is that it creates routing loops. One loop prevention method is that the routers will not send the packet to a node where the packet has been received before.
A. Reverse path forwarding
B. Reverse path failure
C. Reverse packet forwarding
D. Reverse protocol failure
Explanation: Reverse Path Forwarding is a loop-free forwarding method for multi-cast routing in modern systems. The method focuses on forwarding the packet away from the source IP in each iteration to make sure there is no loops.
A. Link stable packet
B. Link state packet
C. Link state protocol
D. Link state path
Explanation: A Link State Packet is a packet created by a router that lists its neighboring nodes and routers in link state routing protocol. It is shared with other routers to find the shortest path from a source to the destination.