期刊文献+

关于WDM双环网络网络负荷的研究

Research on network loads of WDM double-loop networks
下载PDF
导出
摘要 针对WDM网络的结构特征,选择具有代表性的有向双环网络G(N;r,s)进行研究。给出一组同余方程,用于快速计算其L-型瓦图的四个参数。根据L-型瓦的结构,给出了计算有向双环网络的网络负荷公式。实验结果分析表明:有向双环网络的一个无限族中可能存在多个负荷平衡的网络。对于有向双环网络G(N;r,s)的任意一个无限族中,其网络负荷的分布呈轴对称图形。网络负荷存在上界和下界,负荷达到下界值的网络称为最优负荷网络。该研究成果对于设计最优双环网络和提高网络通信效率起到决定性的作用。 Based on analyzing the structure feature of WDM networks, this paper chooses some representative directed double-loop networks to study. It also provides the solutions of some congruence equations to compute the parameter values of L-shaped tile. According to the structure of L-shaped tile, it provides a formula to compute its network load. The experiment results demonstrate that there may be many load-balanced networks. For anyone of infinite families for G(N;r,s) , the distribution of loads is axis symmetric figure, and there is a upper bound and a lower bound for loads. The network is called optimal load network when its load equals the lower bound. These results are important to design optimal double net-works and improve transmission efficiency about networks.
作者 李颖 陈业斌
出处 《计算机工程与应用》 CSCD 2014年第18期122-125,共4页 Computer Engineering and Applications
基金 国际科技合作项目(No.2011DFB61530) 安徽省高校级自然科学基金资助重点项目(No.KJ2012A262 No.KJ2013A058)
关键词 波分复用(WDM)网络 有向双环网络 网络负荷 L-型瓦 最短路径 无限族 Wavelength Division Multiplexing(WDM)networks directed double-loop networks network load L-shaped tile shortest path infinite family
  • 相关文献

参考文献15

  • 1Wilfong G,Winkler P.Ring routing and wavelength trans- lation[C]//Proceedings of the 9th Annual ACM-SIAM Sym- posium on Discrete Algorithms, 1998:333-341. 被引量:1
  • 2Heydemann M, Meyer J C, Sotteau D.On forwarding indices of networks[J].Discrete Applied Mathematics, 1989,23 (2) : 103-123. 被引量:1
  • 3Hou X M,Xu M,Xu J M.Forwarding indices of consis- tent routings and their complexity[J].Networks, 1994,24: 75-82. 被引量:1
  • 4Gargano L, Vaccaro U.Routing in all-optical networks:algo- rithmic and graph-theoretic problems[C]//Numbers, Infor- mation and Complexity,2000:555-578. 被引量:1
  • 5Wong C K, Coppersmith D.A combinatorial problem related to multimodule organizations[J].Journal of Association Computer, 1974,21 (3) : 392-402. 被引量:1
  • 6Chen C Y, Hwang F K.The minimum distance diagram of double-loop networks[J].IEEE Transactions on Com- puters, 2000,49 (9) : 977-979. 被引量:1
  • 7Chen C Y, James K L, Tang W S.An efficient algorithm to find a double-loop network that realizes a given L-shape[J].Theoretical Computer Science,2006,359(1/3): 69-76. 被引量:1
  • 8Chen C Y, Hwang F K.Equivalent L-shapes of double- loop networks for the degenerate case[J].Journal of Inter- connection Networks, 2000, 1 : 47-60. 被引量:1
  • 9Chan C F, Chen C Y, Hong Z X.A simple algorithm to find the steps of double-loop networks[J].Diserete Applied Mathematics, 2002,121 ( 1/3) : 61-72. 被引量:1
  • 10李颖,陈业斌.有向双环网络G(N;r,s)的寻径策略[J].华中科技大学学报(自然科学版),2009,37(5):45-48. 被引量:4

二级参考文献34

共引文献31

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部