基于SDN的最短路径算法(dijkstra)实现.docx

基于SDN的最短路径算法(dijkstra)实现
基于SDN的最短路径算法〔dijkstra〕实现

把路由算法作为APP参加到限制器中，使SDN网络实现依据拓扑状况自动选择路14 页


dst=00:00:00:00:00:00:00:01],
port=2], port=2], port=2],
switchPorts=[[id=00:00:00:00:00:00:00:07, [id=00:00:00:00:00:00:00:05, [id=00:00:00:00:00:00:00:03, Route
[id=RouteId
[id=00:00:00:00:00:00:00:07,
[id=00:00:00:00:00:00:00:05, [id=00:00:00:00:00:00:00:03,
[id=00:00:00:00:00:00:00:01, port=2], [id=00:00:00:00:00:00:00:01, port=1]]]
[src=00:00:00:00:00:00:00:01
port=1],
port=2], port=2],
dst=00:00:00:00:00:00:00:07],
port=2], port=5], port=5],
switchPorts=[[id=00:00:00:00:00:00:00:01, [id=00:00:00:00:00:00:00:03, [id=00:00:00:00:00:00:00:05,
[id=00:00:00:00:00:00:00:01,
[id=00:00:00:00:00:00:00:03, [id=00:00:00:00:00:00:00:05,
[id=00:00:00:00:00:00:00:07, port=2], [id=00:00:00:00:00:00:00:07, port=1]]]
输出的route中，每条完整路径由id确定〔源节点和目的节点〕。完整路径包括了路径所经过的每个端口的信息〔所属交换机、端口号〕。










上面输出的route信息中，路径节点包括〔1，3，5，7〕，即该路径经过了s1、s3、s5、s7交换机，结果和路由算法题中的结果相同，说明该模块胜利完成了上题中的路由算法功能。
〔4〕修改输入数据，再次进展路径分析测试
：
leftnodeID,rightnodeID,bandwidth 1,3,80 1,4,101 2,3,60 2,4,101 3,4,101 3,5,95 3,6,101 4,5,80 4,6,110 5,6,90 5,7,120 5,8,101 6,7,95 6,8,101
5

;
srcNodeID,dstNodeID,bandwidth 3,8,90
再次输入吩咐如下列图所示：测试主机h1与h7能否通信并获得经过的路径信息。

elcipse限制台中输出的信息〔整条路径〕如下：
Route
[id=RouteId
[src=00:00:00:00:00:00:00:07










port=1],
port=5], port=2], port=6], port=6],
dst=00:00:00:00:00:00:00:01],
port=2], port=6], port=3], port=3], port=2],
switchPorts=[[id=00:00:00:00:00:00:00:07, [id=00:00:00:00:00:00:00:05, [id=00:00:00:00:00:00:00:08, [id=00:00:00:00:00:00:00:06, [id=00:00:00:00:00:00:00:04, Route