提出基于層的方法來研究雙環(huán)網(wǎng)絡(luò)G(N ; h)路由特性; 給出基于層的路由策略; 給出了雙環(huán)網(wǎng)絡(luò)G( N ; h)直徑等于其樹型結(jié)構(gòu)的最大層數(shù)的重要結(jié)論; 研究了雙環(huán)網(wǎng)絡(luò)G( N ; h)的最短路徑問題, 給出了0節(jié)點(diǎn)到其它任意節(jié)點(diǎn)的最短路徑算法, 并利用面向?qū)ο蟮?a target='_blank' class='arckwlink_none'>Java 語言實(shí)現(xiàn)了這一算法.
關(guān)鍵詞: 雙環(huán)網(wǎng)絡(luò); 最短路徑; 樹模結(jié)構(gòu); 最優(yōu)路由; 層
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