Construct optimal diameter network and d-partition routing algorithm

This paper studies the topological structure of network using graph-theoretical properties and proposes a topology constructionmethod of regular directed graphs (or digraphs). The diameter of the topological digraph is ⌈logdn⌉. In this paper, we also propose a routing algorithm based thistopological structure and find its complexity is O(⌈logdn⌉).This algorithm has a smaller diameter and easier to construct than the existing algorithms, which can be used of downloading files and defending worms in structured peer-to-peer systems.