
10.6 Routing 789
10,6 ROUTING
Recall that the routing algorithm of
a
network determines which of the possible paths
from source to destination are used as routes and how the route followed by each
particular packet is determined. We have seen, for example, that in a Je-ary d-cube the
set of shortest routes is completely described by the relative address of the source
and destination, which specifies the number of links that need to be crossed in each
dimension. Dimension order routing restricts the set of legal paths so that there is
exactly one route from each source to each destination—the one obtained by first
traveling the correct distanc ...