论文部分内容阅读
提出一种基于Spidergon的通用三维拓扑结构及其拓扑生成方法。该方法在三维拓扑结构原型基础上,通过该拓扑的延时模型建立拓扑结构和延时时间的关系,并以此确定最小化延时时间条件下的拓扑结构。同时设计了针对该结构的自适应路由算法。该算法以纵向路由为优先方向,通过自适应寻找源节点和目的节点的等效最短路径提高网络吞吐量。仿真结果表明,同等规模的3-D Spidergon与3-Dmesh结构相比,在网络近似饱和的情况下,该拓扑的延时时间比3-Dmesh低17%,吞吐量高16.7%。
A generic 3D topology based on Spidergon and its topology generation method are proposed. Based on the prototype of 3D topology, this method establishes the relationship between topological structure and delay time through the delay model of the topology and determines the topological structure under the condition of minimized delay time. At the same time, an adaptive routing algorithm for this structure is designed. The algorithm takes the longitudinal route as the priority direction and improves the network throughput by adaptively finding the equivalent shortest path between the source node and the destination node. The simulation results show that compared with 3-Dmesh structure, the same-scale 3-D Spidergon has 17% lower latency and 16.7% higher throughput than the 3-Dmesh when the network is approximately saturated.