Inside Out Library · Explore

ARPANET Routing Algorithm Improvements, Volume 2 (1982)

Defense Technical Information Center · leaf 130

An illustration from ARPANET Routing Algorithm Improvements, Volume 2, 1982, leaf 130
Report No. 4931 Bolt Beranek and Newman Inc. metric. We can also visualize why very small numerical errors can destroy the ability of FD to converge to a solution. If we are in a relatively flat portion of the solution space, small roundoff errors can cause the assumptions of the FD algorithm to be… … Figure 11 . Effects of Roundoff Error The "desired flow" is the value that would be calculated if no roundoff error was involved in the FD algorithm. It improves the network performance slightly (i.e., it is "below" the initial and

Haverty, J F · Bolt beranek and newman inc cambridge ma · Algorithms · Communications networks · Computer communications · Routing · Addressing · Computerized simulation · Data transmission systems · Interfaces · Multipath transmission · Nodes · Predictions · Queueing theory

Internet Archive · Defense Technical Information Center · Public domain (US government work). Free to use for anything.

More pictures from ARPANET Routing Algorithm Improvements, Volume 2

More like this