O'Reilly logo
  • Hirofumi Takahashi thinks this is interesting:

  • Any time an input event occurs, perform a local calculation.

  • If one or more feasible successors are found in the topology table, take the ones with the lowest metric cost as the successors.

  • If no feasible successor can be found, make the route active and query the neighbors for a feasible successor.

  • Keep the route active until all queries are answered by reply or by the expiration of the active timer.

  • If the diffusing calculation does not result in the discovery of a feasible successor, declare the destination unreachable.

  • From

    Cover of Routing TCP/IP, Volume 1, 2/e


    Notes on diffusing computation