Heuristic routing

From Wikipedia, the free encyclopedia

Heuristic routing: Routing in which data, such as time delay, extracted from incoming messages, during specified periods and over different routes, are used to determine the optimum routing for transmitting data back to the sources.

Note: Heuristic routing allows a measure of route optimization based on recent empirical knowledge of the state of the network.

Source: From Federal Standard 1037C

‹The stub template below is included via a redirect that has been proposed for deletion. See stub types for deletion to help reach a consensus on what to do.›