| 摘要 |
A method of using routing tables. In this method, routing differs from ordinary table routing in that the part of a destination address (e.g., DestinationID) used for a table lookup is variable. Networks using the full address space of a network node can be made by partitioning the network topology into several levels, such as a top topology and any number of sub-topologies. With a DestinationID of N-1 bits, a routing table of 2<n >entries is sufficient to support topologies using the full address space, wherein n<N-1.
|
