3Com CoreBuilder 9000, Руководство пользователя

Страница: 341 / 468

Planning a Network with E-IISP 341
Figure 14 Hierarchical Switch Addressing in Tree Topology
After you have set up the addressing scheme in this manner, the routing
algorithm ensures that any switch in this network can find every tree in it
(and therefore the location of every other switch) by first accessing the
root node of its own tree. From there it can approach the destination
switch of any other tree in the network in descending order of levels. For
details about the routing algorithm, see “E-IISP Hierarchic Routing
Algorithm” on page 368.
An address with two significant
nibbles is one level lower in the
tree hierarchy than one significant
nibble.
Three significant nibbles
indicate a third level address.
Note that the higher-order
nibbles are the second-level
address.
X significant nibbles
indicate an X level address.
Note that the higher-order
nibbles are the X-1 level
address.
A
A5 A2
A53
A531
A536
A27