| 摘要 |
PROBLEM TO BE SOLVED: To reduce the distance of a network topology including three degree nodes by reducing the complexity of a routing algorithm for the network topology. SOLUTION: The configuration of a network topology can be divided into two main steps, that is, a naming step and a connecting step. In the naming step, a node in an unconstructed network is mapped into any of three link nodes which are erected or reversed and oriented. An address is generated by using a naming scheme based on a 2-tuple cardinal number (n) scheme to insure the inherent address of each of the three link nodes in a specified network by using a numerical equation. The respective three link nodes are interconnected with three adjacent link nodes to form a network topology of a specific structure by performing connecting through point-to-point connection using the mathematical reference of the three respective link nodes. |
