| | HIERARCHICAL NETWORK ROUTING |
 | | Area routing schemes (when destination names are structured corresponding to the network topology) allow nodes to reduce the size of routing tables, by recording only one entry for an entire region rather than one for each node in the region. |
 | | We describe a general hierarchical routing scheme that allows all nodes to participate in a distributed routing network, using close to optimal paths, with short routing tables, and a reduction of topology information for minor nodes. |
 | | When the network starts, the local details are automatically propagated within the visible region, and the nearest neighbors supply sufficient topology information for the new node to route messages to the rest of the network. |
| www.cs.usyd.edu.au /~piers/papers/Routing/routing.html (5537 words) |