As a network engineer , what would be your conclusion of what a least cost algorithm serves with regards to packet transmission ? Hint : Think about hops and paths
To determine a cost-effective distance between source and destination ,Least cost path analysis is used to determine the pathe between the two locations with the least cost of travelling determined using cost path. A least cost algorithm is used in distributed algorithms to computer paths between source and destination using an iterative approach.
A distributed algorithm does not require information about the network hops in the process of calculating the least cost path to the destination. The direction or the route of a network hop through which the packet travels is required in distributed algorithm to determine the least cost.
The cost of a path between bidirectional nodes whose path and the total cost between the hops is determined can be termed as a Least cost algorithm.
Comments
Leave a comment