NETWORK LAYER
UNICAST ROUTING
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which of the following is not a least cost algorithm?
|
|
Distance vector
|
|
|
Link state
|
|
|
Path vector
|
|
|
All the mentioned
|
Explanation:
Detailed explanation-1: -BGP is a path vector protocol, which offers several attributes to a route to help administrators provide additional information that can be used to route traffic.
Detailed explanation-2: -A path-vector routing protocol is a network routing protocol which maintains the path information that gets updated dynamically. Updates that have looped through the network and returned to the same node are easily detected and discarded.
Detailed explanation-3: -Centralized algorithm − It finds the least-cost path between source and destination nodes by using global knowledge about the network. So, it is also known as global routing algorithm.
There is 1 question to complete.