COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Distance vector
|
|
|
Link state
|
|
|
Path vector
|
|
|
All the mentioned
|
Detailed explanation-1: -Least Cost Routing, or LCR, is a process to find the most inexpensive way to route phone calls. It is the process of analyzing, selecting and directing the path of outbound and inbound communications traffic depending on which path delivers the best rates.
Detailed explanation-2: -The types of adaptive routing algorithm, are Centralized, isolation and distributed algorithm. The types of Non Adaptive routing algorithm are flooding and random walks.
Detailed explanation-3: -Border Gateway Protocol (BGP) is an example of a path vector protocol. In BGP, the autonomous system boundary routers (ASBR) send path-vector messages to advertise the reachability of networks. Each router that receives a path vector message must verify the advertised path according to its policy.
Detailed explanation-4: –Path vector routing is a computer network routing protocol which maintains the path information that gets updated dynamically.