Construct Optimal Diameter Network and D-Partition Routing Algorithm
Liu Hui-shan · Journal of Chinese Computer Systems · 2006
The maximum delay of network can be denoted by the diameter of the network. The problem of finding topological graphs of optimal diameter receives much attention from researchers due to its possible applications in network structure design. It is highly important to research how to construct an optimal diameter network and design the efficient routing algorithm. In this paper, by using graph-theoretical properties, the authors studied the method of constructing network with an optimal diameter and the routing problem when the degree-constrained was dealt with. The authors also presented an efficient and simple heuristic routing algorithm and analyzed its complexity. At the present time, we have finished the P2P worm defense system based on this algorithm.