|
Algorithmic process used
for routing traffic that surmises information by assuming symmetrical network
conditions. For example, if node A receives a packet from node B through
intermediate node C, the backward-learning routing algorithm will assume that A
can optimally reach B through C.
|