双环网络的［ Z］边优先寻径策略.doc

双环网络的［ Z］边优先寻径策略.doc双环网络的[+/Z]边优先寻径策略1赵保华安徽合肥,230027)安徽马鞍山,243002)「2方木云】屈玉贵(中国科学技术大学(女徽丁业大学计算机学院Emai1:******@ahut・e(摘要捉出一种先走[+力]边、当走[+幻边不利时才走[+1]边的[+方]边优先寻径策略;得出[+方]边优先最遵径和双环网络的“竹筏”(一种新厶形瓦)型空间解;“竹筏”中节点Z间的[+方]边优先最短路径存在递扌隹关系:山节点的[+仇]边优先最短路径推出双环网络的巴径公式;•了[+方]边优先J径策略;文献[9]屮的[+1][+幻双边寻径策略是固定路径、J找节点,而[+方]边优先寻径策略是固定节点、寻找路径;传统L形瓦难于构造、易于求H曾价双环网络的丸径,而新L形瓦易构造、难J:求其等价双环网络的宜径;指出了文献[1]中的儿个错谋。关键词双环网络;[+方]边优先J•径;[+力]边优先最短路径:“竹筏”;厶形瓦分类号(中图),TP302;文献标识码:A[+h]-LinkPriorRoutingStrategyforDouble-work1,2Mu-yunFangYu-guiQulBao-huaZhao1(Dept・pliterScienceUniversityofScienceandTechnologyofChinaHeifei,Anhui230027)(Dept,puterScienceAnhuiUniversityofTechnologyanshan,Anhui243002)Abstract:A[+%]■linkpriorroutingstrategy*that[+h]-1inkischosenprioruntilitisnotfavourable,then[+1]-linkischosen,isproposed・TheshortesI[+h]-linkpriorpathandthebambooraft(anewkind()「厶一sh;i])(、dTile)fd)ublc-・Thediameterofadouble-workcanbederivedfromtheshortest[+力]「2()()0seIect('(1tosimulatethe|+/?]-[+1][+创loutingstrategyproposedindocument[9]isfixingpaththenseekingnodes,whilethe[+h]~1inkpriorroutingstrategvisfixingnodes(-shapedTileisdifficulttobeconstructedbutiseasytocalculatethediameterofitsequivalentdouble-work,whilethenewL-shapedTileiseasyl()beconstructedbulisdifficulttoc