A performance model of compressionless routing in k-ary n-cube networks

Several analytical models of fully adaptive routing in wormhole-routed networks have recently been reported in the literature. All these models, however, have been discussed for routing algorithms with deadlock avoidance. Recent studies have revealed that deadlocks are quite rare in the network, especially when enough routing freedom is provided. Thus, the hardware resources, e.g. virtual channels, dedicated for deadlock avoidance are not utilised most of the time. This consideration has motivated researchers to introduce fully adaptive routing algorithms with deadlock-recovery. This paper proposes a new analytical model to predict message latency in k-ary n-cubes with compressionless routing, a fully adaptive algorithm that uses deadlock-recovery. The proposed model uses results from queueing systems with impatient customers to capture the effects of the timeout mechanism used in this routing algorithm to deal with message deadlock. The validity of the model is demonstrated by comparing results predicted by the analytical model against those obtained through simulation experiments.     

Compressionless routing: a framework for adaptive andfault-tolerant routing

Compressionless routing (CR) is an adaptive routing framework which provides a unified framework for efficient deadlock free adaptive routing and fault tolerance. CR exploits the tight coupling between wormhole routers for flow control to detect and recover from potential deadlock situations. Fault tolerant compressionless routing (FCR) extends CR to support end to end fault tolerant delivery. Detailed routing algorithms, implementation complexity, and performance simulation results for CR and FCR are presented. These results show that the hardware for CR and FCR networks is modest. Further, CR and FCR networks can achieve superior performance to alternatives such as dimension order routing. Compressionless routing has several key advantages: deadlock free adaptive routing in toroidal networks with no virtual channels, simple router designs, order preserving message transmission, applicability to a wide variety of network topologies, and elimination of the need for buffer allocation messages. Fault tolerant compressionless routing has several additional advantages: data integrity in the presence of transient faults (nonstop fault tolerance), permanent fault tolerance, and elimination of the need for software buffering and retry for reliability. The advantages of CR and FCR not only simplify hardware support for adaptive routing and fault tolerance, they also can simplify software communication layers     

支持确定性/自适应路由的低延迟片上路由器设计

自适应路由可以有效地提高片上网络性能,却导致网络中的数据传输乱序.设计了一个两级流水虚拟通道虫孔交换路由器,通过修改数据包的标记位和路由计算单元,使路由器支持确定性和自适应路由算法,简化了数据传输乱序问题;同时,将流经路由器的数据流分为东西和南北2个部分;在此基础上从经典的部分自适应路由出发,增加虚拟通道允许原本禁止的转向,实现了无死锁的自适应路由,并降低了网络延迟与硬件开销.     

一个2D-Mesh路由器模型系统

自适应路由器是ＭＰＰ研究领域中的一个重要研究课题。本文实现了一个路由器模型系统,介绍了几种自适应无死锁路由算法,并利用模型系统对路由算法进行了测试。     

DTN中一种基于分离时间的改进路由算法*

提出一种DTN中基于分离时间的副本受限的路由协议——EPI-T。EPI-T基于传染路由思想,根据历史路由信息进行路由选择,限制信息的洪泛范围,节约了网络资源。仿真分析结果表明,新协议提高了交付率和降低了时延。     

LCFAA:一个低代价的完全自适应路由算法

大规模并行处理机系统（ＭＰＰ）中路由算法对互联网络通信性能和系统性能起着重要作用。自适应路由算法具有灵活性好、网络的通道利用率高和网络容错能力强等优点,但其实现难度较大,因而目前仅在少数ＭＰＰ系统中得以实现。文中在ｍｅｓｈ结构上提出了一个低代价无死锁的安全自适应最短虫孔路由算法ＬＣＦＡＡ,该算法所需虚通道数少,具有代价低、自适应性强的特点。文中证明了算法的无死锁、无活锁性和完全自适应性,并模拟验证     

Dynamically configurable message flow control for fault-tolerantrouting

Fault-tolerant routing protocols in modern interconnection networks rely heavily on the network flow control mechanisms used. Optimistic flow control mechanisms, such as wormhole switching (WS), realize very good performance, but are prone to deadlock in the presence of faults. Conservative flow control mechanisms, such as pipelined circuit switching (PCS), ensure the existence of a path to the destination prior to message transmission, achieving reliable transmission at the expense of performance. This paper proposes a general class of flow control mechanisms that can be dynamically configured to trade-off reliability and performance. Routing protocols can then be designed such that, in the vicinity of faults, protocols use a more conservative flow control mechanism, while the majority of messages that traverse fault-free portions of the network utilize a WS like flow control to maximize performance. We refer to such protocols as two-phase protocols. This ability provides new avenues for optimizing message passing performance in the presence of faults. A fully adaptive two-phase protocol is proposed, and compared via simulation to those based on WS and PCS. The architecture of a network router supporting configurable flow control is also described     

一个高效完全自适应路由器的设计

路由器在大规模并行处理机（MPP）系统中对互连网络通信性能和系统性能的发挥起着关键作用。根据全自适应路由算法BNP设计框架,给出Mesh上一类基于BNP的全自适应路由算法BBFAM（thBNR-based fully adaptive algorithms on mesh);同时提出并采用动态优先级流控,“自由度”通道选择策略,设计了一个基于BNR,简洁,低代价的高效完全自适应路由器BFR（the BNR-based fully adaptive router),并采用Aletera CPLD器件构造了原型系统。     

移动传感网中基于虚拟货币的路由策略

移动无线传感器网络中,针对节点基于随机运动模型的路由问题,提出一种基于虚拟货币的低能耗路由策略——DTVC。根据节点的属性和数据消息的属性进行买方和卖方的定价并据此选择转发节点。为了提升网络性能,通过控制数据消息的副本数以及对节点的缓存队列中的数据消息排序,把网络中的节点分为源节点和中继节点,只有数据消息的源节点可以复制该数据消息,并依据数据消息的延迟容忍度对消息进行排序,延迟容忍度越小则优先级越高。为了减少网络中的能量消耗,根据sink节点广播的消息删除缓存队列中已经传输成功的数据消息。在Matlab上的仿真实验结果表明,与基于消息容错的自适应数据传输算法（FAD）、基于距离和能量感知模糊逻辑的路由算法（FLDAER）和基于能耗自选演进机制的路由算法相比,DTVC的数据消息投递率至少提高2.5%,平均副本数至少减少25%。     

可重构网络中基于相似度的自适应路由算法研究

传统IP网络中采用了基于IP地址的路由协议,而各种实时应用程序的出现,对网络性能提出了更高的要求。为了使各个节点在网络拓扑结构发生变化时仍能正确传输消息,提出了一种在可重构网络中使用的路由算法。该算法以内容中心网络中的发布／预订系统为原型,通过在代理节点之间发送查询请求和匹配响应消息,基于代理节点的相似度来确定消息传输的下一跳节点,同时避免了网络产生环路。实验表明该算法可以减少传输延时和跳数,具有动态性、实时性的特点。     

虚网叠加构造自适应路由算法的有效框架

大规模并行处理机系统中路由算法对互联网络通信性能和系统性起着重要作用。     

k元n—立方体网络的死锁特征剖析

研究死锁形成几率随网络参数的变化规律 ,对于选择合适的寻径算法、改良网络设计方案都具有重要意义 .环形等多种网络都是 k元 n-立方体网络系列的拓扑同构体 .因此 ,k元 n-立方体网络死锁特征的研究结果具有一定的普遍适用性 .本文根据刻画死锁特征的死锁循环密度属性划分死锁类型 .利用死锁类型分析寻径适应性、物理通道、虚拟通道、缓冲区大小 ,消息长度以及缓冲区结构等参数对死锁形成几率的影响     

Fuzzy-based Adaptive Routing Algorithm for Networks-on-Chip

In this paper, we propose two adaptive routing algorithms to alleviate congestion in the network. In the first algorithm, the routing decision is assisted by the number of occupied buffer slots at the corresponding input buffer of the next router and the congestion level of that router. Although this algorithm performs better than the conventional method, DyXY, in some cases the proposed algorithm leads to non-optimal decisions. Fuzzy controllers compensate for ambiguities in the data by giving a level of confidence rather than declaring the data simply true or false. To make a better routing decision, we propose an adaptive routing algorithm based on fuzzy logic for Networks-on-chip where the routing path is determined based on the current condition of the network. The proposed algorithm avoids congestion by distributing traffic over the routers that are less congested or have a spare capacity. The output of the fuzzy controller is the congestion level, so that at each router, the neighboring router with the lowest congestion value is chosen for routing a packet. To evaluate the proposed routing method, we use two multimedia applications and two synthetic traffic profiles. The experimental results show that the fuzzy-based routing scheme improves the performance over the DyXY routing algorithm by up to 25% with a negligible hardware overhead.     

BWR——带缓冲的虫孔路由技术

MPP互联网中通常使用虫孔路由WR（Wormhole Routing)交换技术来提高网络性能,采用该技术,每个结点所需的通信缓冲小;并且当消息长度远远大于微片长度时,消息的传输延迟时间与传输距离无关。但WR技术也具有容易阻塞和产生刹车问题的缺点。该文在WR技术的基础上,提出了带缓冲的虫孔路由BWR（Buffered Wormhole Routing)交换技术,并对采用BWR技术的k-ary n-mesh的消息平均传输延迟进行理论分析与模型模拟。结果均表明BWR技术可以较好地解决WR技术带来的问题,可以较好地提高网络的性能。     

Adaptive routing in wormhole-switched necklace-cubes: Analytical modelling and performance comparison

The necklace hypercube has recently been introduced as an attractive alternative to the well-known hypercube. Previous research on this network topology has mainly focused on topological properties, VLSI and algorithmic aspects of this network. Several analytical models have been proposed in the literature for different interconnection networks, as the most cost-effective tools to evaluate the performance merits of such systems. This paper proposes an analytical performance model to predict message latency in wormhole-switched necklace hypercube interconnection networks with fully adaptive routing. The analysis focuses on a fully adaptive routing algorithm which has been shown to be the most effective for necklace hypercube networks. The results obtained from simulation experiments confirm that the proposed model exhibits a good accuracy under different operating conditions.     

An accurate analytical model of adaptive wormhole routing in k-ary n-cubes interconnection networks

Many fully adaptive algorithms have been proposed in the literature over the past decade. The performance characteristics of most of these algorithms have been analysed by means of software simulation only. This paper proposes an analytical model to predict message latency in wormhole-routed k-ary n-cubes with fully adaptive routing. The analysis focuses Duato’s fully adaptive routing algorithm [IEEE Trans. Parall. Distrib. Syst. 4 (2) (1993) 320], which is widely accepted as the most general algorithm for achieving adaptivity in wormhole-routed networks while allowing for an efficient router implementation. The proposed model is general in that it exhibits a good degree of accuracy for various network sizes and under different operating conditions.     

改进遗传算法的WSN节点最优路由选择策略

针对无线传感器节点数据传输过程中的能量消耗问题,为了提高节点数据传输实时性,提出一种改进遗传算法的无线传感器网络节点最优路由选择策略。根据无线传感器网络的拓扑结构将监测区域划分不同大小的簇,并根据节点剩余能量选择每一个簇的簇头节点,然后将簇头节点编码成遗传算法的个体,根据数据转发能量耗能和延迟时间构建个体的适应度函数,并通过模拟自然界生物进化过程中的选择、交叉、变异等操作,找到节点数据转发的最优路径,在Matlab 2012平台上对数据路由算法的性能进行仿真测试。仿真结果表明,相对其他路由选择策略,提出的路由选择策略不仅可以均衡各个传感器节点的剩余能量,而且大幅度减少了数据转发路由过程中的能量消耗和延迟时间。     

在分裂的机会网络中多个消息摆渡的路由设计

针对机会网络中节点分布不规则造成分割的网络区域相隔较远的情况, 提出了一种基于全局消息摆渡和节点中继的多摆渡路由算法（GMF-NRA）。该算法使用一个全局消息摆渡节点和各个区域内的中继节点为运行于区域内部的局部消息摆渡节点中继消息, 共同完成区域间的信息传输。摆渡节点在中继节点处交互区域间的信息, 以至于不再需要摆渡节点之间实现在线协作转发消息。最后, 仿真结果表明GMF-NRA较现有的节点中继算法在网络的平均传输时延和数据交付率方面能获得更好的网络性能。     

组播协议在OPNET中的建模与仿真

该文以IP组播技术为重点,结合网络仿真软件OPENT Modeler,分析该软件环境下IP组播网络的建模机制,包括参考标准、组的管理、支持的应用、组播路由协议的选择,节点加入组播组与发送源发送组播数据的流程。以校园网视频会议和FTP传输应用为例,构建网络仿真模型,一方面比较单播与组播方式下的网络性能,分析了视频流量的发送情况、视频会议分组的端到端延时,FTP传输的响应时间,骨干网络点到点链路吞吐量;另一方面比较了组播方式采用共享树机制和由共享树切换到最短路径树在网络性能上的改进,包括分组延迟的降低、汇合点路由器上拥塞发生的减少等。同时,也对无线移动通信网络环境下的组播技术提出更多需要考虑的因素。     

片上网络中面向报文有序传输的自适应路由算法研究

与确定性路由算法相比,自适应路由算法可以提高片上网络的通信性能,但是报文可能会无序到达。在目的节点对报文排序将会导致严重的面积和计算开销,甚至可能会抵消采用自适应路由算法带来的性能增益。为此,本文首先提出一种部分自适应路由算法,以满足报文的有序到达。然后,描述了对本文算法提供支持的路由器硬件结构。最后,在二维片上网络下对本文算法及确定性和自适应路由算法进行了性能评估和比较。与XY算法相比,本文算法显著降低了报文延时,提升了饱和点。同时讨论了对路由器面积和功耗影响。虽然路由器的功耗有所上升,但是由于报文交付性能提升,因此每个flit的能耗增长可忽略不计。