Best Path First (BPF) is a routing algorithm that always chooses the best available path to the destination network first for data transport. In contrast, the Shortest Path First (SPF) routing algorithm always takes the shortest routing path. This can refer to the number of hops or the delay.
Informationen zum Artikel
|Englisch:||best path first - BPF|