摘要：

针对RapidIO路由网络枚举问题,提出一种基于最小隔离块的流量驱动机制。在基本RapidIO路由拓扑结构上给出最小隔离块的概念,对路由网络进行隔离块划分,并以隔离块为基础,深度优先遍历整个RapidIO路由网络。同时引入流量驱动机制,通过流量驱动能耗算法和流量 路径分配算法对隔离前后的能耗值、功耗值以及RapidIO交换机的平均工作时间进行比较,从而验证算法的可靠性。实验结果表明,该机制可以减少RapidIO交换机的枚举数量,避免重复枚举,而且随着路由结构层数的拓展,隔离效果越明显。

关键词: RapidIO路由网络, 最小隔离块, 深度优先遍历, 流量驱动, 重复枚举, 能耗, 功耗

Abstract:

Aiming at the enumeration problem of RapidIO routing network,a flow driven mechanism based on minimum isolation block is proposed.The concept of minimum separation block is given,and the isolation block is divided into the routing network.Then a depth first traversal search is carried out for the entire RapidIO routing network.And the flow driven mechanism is introduced to compare the energy consumption value,power consumption value and the average operation time of the RapidIO switches before and after isolation,to verify the reliability of the algorithm through the flow driven energy algorithm and flow path allocation algorithm.Experimental results show that the enumeration number of RapidIO switches can be reduced and repeated enumeration can be avoided.With the expansion of the routing structure layer,the isolation effect is more obvious.

Key words: RapidIO routing network, minimum isolation block, depth-first traversal, flow driving, repeated enumeration, energy consumption, power consumption

中图分类号: 

• TP393