期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Modelling of a WDM Network Using Graph Theory and Dijkstra Algorithm for Traffic Redirection
1
作者 Eric Michel Deussom Djomadji Ebude Carine Awasume Eloundou Boris Donald 《Journal of Computer and Communications》 2024年第7期78-93,共16页
Optical transport networks are now the basic infrastructure of modern communications systems, including the SDH and WDM backbone network of local network operators, in the case of Cameroon. Given the colossal investme... Optical transport networks are now the basic infrastructure of modern communications systems, including the SDH and WDM backbone network of local network operators, in the case of Cameroon. Given the colossal investments required to deploy these networks, particularly related to the cost of equipment (optical fibers, transponders and multiplexers), the optimization of bandwidth and dynamic allocation of resources is essential to control operating costs and ensure continuity of service. Automatic switching technology for optical networks brings intelligence to the control plane to fully facilitate bandwidth utilization, traffic redirection, and automatic configuration of end-to-end services. This paper considers a local network operator’s WDM network without the implementation of the automatic switching technology, develops a network modeling software platform called Graphic Networks and using graph theory integrates a particularity of the automatic switching technology, which is the automatic rerouting of traffic in case of incident in the network. The incidents considered here are those links or route failures and node failures. 展开更多
关键词 Graph Theory Backbone Network WDM djikstra Algorithm
下载PDF
基于电脑鼠实验平台的Dijstra算法和Floor-fill算法比较研究 被引量:1
2
作者 薛盼为 王玉平 余鹰 《武汉理工大学学报(交通科学与工程版)》 2016年第4期750-754,共5页
介绍了迷宫环境的建模和2个路径规划算法,Djikstra和Flood-fill算法,并进一步通过流程图和仿真来阐述如何使用该算法在任意的迷宫环境中导航,以最佳路径从起始位置到达目标位置.结合实物实验来验证算法的正确性和分析其相对优缺点.
关键词 电脑鼠 djikstra Flood-fill
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部