提出基于层的方法来研究双环网络G(N ; h)路由特性; 给出基于层的路由策略; 给出了双环网络G( N ; h)直径等于其树型结构的最大层数的重要结论; 研究了双环网络G( N ; h)的最短路径问题, 给出了0节点到其它任意节点的最短路径算法, 并利用面向对象的Java 语言实现了这一算法.关键词: 双环网络; 最短路径; 树模结构; 最优路由; 层Abstract : A new routing method is presented to paint the double-loop networks G( N ; h). It was based on the layers of the tree-modal. It was educed that the diameter of the double-loop networks G(N ; h) equals to the maximal layer. The shortest path about the double-loop networks G( N ; h) were studied. The algorithm about shortest path for zero node to either node was given, and was executed with OO Java programming language.Key words : double-loop networks ; shortest path; tree-modal ; optimal routing; layer