3Com CoreBuilder 9000 User Manual page 341

Figure 14 Hierarchical Switch Addressing in Tree Topology
A
A2 A5
A27
A536
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.
Planning a Network with E-IISP
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.
A53
Note that the higher-order
nibbles are the second-level
address.
X significant nibbles
indicate an X level address.
A531
Note that the higher-order
nibbles are the X-1 level
address.
341