直线引导的Torus结构路由算法

为了提高片上网络在Torus拓扑结构下的路由通信效率,提出了一种基于直线引导思想的路由算法Tline。该路由算法将Torus拓扑结构的片上网络拓展为类似Mesh结构的坐标平面,以数据包的源节点和目的节点构成的直线为路由转发方向,并根据周围邻近节点的拥塞状况选择传输路径方向实现部分自适应路由。实验结果表明,与XY、OE路由算法相比,在热点流量模式下Tline路由算法具有较好的路由性能,且平均能耗降低约8%。     

基于802.11b MAC协议的Ad Hoc路由算法仿真与比较

主要利用NS2仿真分析了Ad Hoc网络模式中几个主要的路由（DSR、DSDV、TORA、AODV）算法进行研究.首先,利用NS-2测试4种路由协议的性能,讨论Ad Hoc模式下路由协议的设计.不同的路由协议,主要包括先验式和反应式两大类,有不同的适用场合,混合式的路由协议（AODV）有一定的优越性;然后,测试节点个数和数据包容量对无线网络MAC层性能（包括延迟、丢包率和吞吐率）的影响.结论为不同场合路由协议的进一步应用和优化提供理论依据.     

基于数据融合的路由算法在无线传感器网络中的分析和研究

将数据融合技术应用于路由协议中,可以有效减少数据通信量,从而降低能耗,延长网络的生存时间。对近几年比较新型的、基于数据融合的路由算法MLR、GRAN、MFST、GROUP等进行了详细的分析比较,总结出了其优缺点和应用范围。融合以上路由协议的优点．在数据融合基础上兼顾局部发送功率的最小化和能耗的均匀分布,构造出MEROUP算法模型。     

基于数据融合的路由算法在无线传感器网络中的分析和研究

将数据融合技术应用于路由协议中,可以有效减少数据通信量,从而降低能耗,延长网络的生存时间。对近几年比较新型的、基于数据融合的路由算法MLR、GRAN、MFST、GROUP等进行了详细的分析比较,总结出了其优缺点和应用范围。融合以上路由协议的优点,在数据融合基础上兼顾局部发送功率的最小化和能耗的均匀分布,构造出MEROUP算法模型。     

Congestion control based dynamic routing in ATM networks

In this paper we describe briefly a dynamic multi-path algorithm that has been considered for connection oriented asynchronous transfer mode (ATM) networks. Our scheme takes advantage of a cell multiplexing capability that has particular advantage in networks supporting variable bit rate (VBR) traffic. The fundamental objective of the scheme is to propose a congestion control based scheme that bridges the gap between routing and congestion control as the network becomes congested. The proposed routing scheme works as a shortest path first algorithm under light traffic conditions. However, as the shortest path becomes congested under unbalanced heavy traffic, the source uses multiple paths when and if available to distribute the calls and reduce cell loss. This mechanism will provide good Quality of Service for clients within the given constraints. We compare the performance of the proposed scheme with other competitive schemes. The throughput and cell loss performance are compared via simulations. These have been carried out concentrating on a five node network, each with varying traffic patterns, with the intention of gaining insight into the strengths and weaknesses of the various schemes.     

Towards objective measures of algorithm performance across instance space

This paper tackles the difficult but important task of objective algorithm performance assessment for optimization. Rather than reporting average performance of algorithms across a set of chosen instances, which may bias conclusions, we propose a methodology to enable the strengths and weaknesses of different optimization algorithms to be compared across a broader instance space. The results reported in a recent Computers and Operations Research paper comparing the performance of graph coloring heuristics are revisited with this new methodology to demonstrate (i) how pockets of the instance space can be found where algorithm performance varies significantly from the average performance of an algorithm; (ii) how the properties of the instances can be used to predict algorithm performance on previously unseen instances with high accuracy; and (iii) how the relative strengths and weaknesses of each algorithm can be visualized and measured objectively.     

Adaptive Routing on the New Switch Chip for IBM SP Systems

The IBM RS/6000 SP is one of the most successful commercially available multicomputers. SP owes its success partially to the scalable, high bandwidth, low latency network. This paper describes the architecture of Switch2 switch chip, the recently developed third generation switching element which future IBM RS/6000 SP systems may be based on. Switch2 offers significant enhancements over the existing SP switch chips by incorporating advances in both VLSI technology and interconnection network research. One of the major new features of Switch2 is the incorporation of adaptive routing support into it. We describe the adaptive source routing architecture of the Switch2 chip which is a unique feature of this chip. The performance of the adaptive source routing and oblivious routing for a wide range of system characteristics and traffic patterns is evaluated. It is shown that adaptive source routing outperforms or performs comparably with oblivious routing. We propose two novel algorithms for generating adaptive routes specifications required for enabling the usage of adaptive source routing. A comparison between the cost of these two algorithms and the performance improvement obtained from using these algorithms are discussed. We also propose different output selection functions to be used in switching elements for implementing the adaptive routing. We evaluate and compare the performance of these selection functions and discover that the best selection functions for BMINs are not dependent on the traffic pattern, message size, or system size.     

A global security architecture for operated hybrid WLAN mesh networks

Hybrid Wireless Mesh Network (HWMN) is a new wireless networking paradigm. Unlike traditional wireless networks, in HWMNs, hosts may rely on each other to keep the network connected. Operators and wireless internet service providers are choosing HWMNs to offer Internet connectivity, as it allows fast, easy and affordable network deployments. One main challenge in design of these networks is their vulnerability to security attacks. In this paper, we investigate the main security issues focusing on the most vulnerable part of the hybrid WLAN mesh infrastructure which concerns the ad hoc network part. Through our proposed architecture, Security Architecture for Operator’s Hybrid WLAN Mesh Network (SATHAME), we identify the new challenges and opportunities posed by this emerging networking environment and explore approaches to secure users, data and communications. From the analysis of strengths and weaknesses of secured routing protocols, we designed a new robust routing structure called MacroGraph (MG). MG structure is extracted from the mesh ad hoc network for each communication to be established between a source and a destination. Especially, MG is a robust structure based on node-disjoint path routing scheme and dynamic trust management that can be adapted to respond to applications’ security requirements. We present a performance analysis of our efficient, robust and scalable multipath reactive secured routing protocol. We investigate the behavior of our proposed scheme under two attack scenarios: Packet Dropping and Route Error attacks in dense network configurations.     

A Communication-Driven Routing Technique for Application-Specific NoCs

Networks on Chip (NoCs) have been shown as an efficient solution to the complex on-chip communication problems derived from the increasing number of processor cores. One of the key issues in the design of NoCs is the reduction of both area and power dissipation. As a result, two-dimensional meshes have become the preferred topology, since it offers low and constant link delay. Unfortunately, manufacturing defects or even real-time failures often make the resulting topology to become irregular, preventing the use of traditional routing algorithms. This scenario shows the need for topology-agnostic routing algorithms that provide a valid routing solution when applied over any topology. This paper proposes a new communication-driven routing technique that optimizes the network performance for Application-Specific NoCs. This technique combines a flexible, topology-agnostic routing algorithm with a communication-aware mapping technique that matches the traffic generated by the application with the available network bandwidth. Since the mapping technique can be pruned as needed in order to fit either quality function values or time constraints, this technique can be adapted to fit with different computational costs. The evaluation results show that it significantly improves network performance in terms of both latency and power consumption.     

Improved search methods for assessing Delay-Tolerant Networks vulnerability to colluding strong heterogeneous attacks

Increasingly more digital communication is routed among wireless, mobile computers over ad-hoc, unsecured communication channels. In this paper, we design two stochastic search algorithms (a greedy heuristic, and an evolutionary algorithm) which automatically search for strong insider attack methods against a given ad-hoc, delay-tolerant communication protocol, and thus expose its weaknesses. To assess their performance, we apply the two algorithms to two simulated, large-scale mobile scenarios (of different route morphology) with 200 nodes having free range of movement. We investigate a choice of two standard attack strategies (dropping messages and flooding the network), and four delay-tolerant routing protocols: First Contact, Epidemic, Spray and Wait, and MaxProp. We find dramatic drops in performance: replicative protocols (Epidemic, Spray and Wait, MaxProp), formerly deemed resilient, are compromised to different degrees (delivery rates between 24% and 87%), while a forwarding protocol (First Contact) is shown to drop delivery rates to under 5% — in all cases by well-crafted attack strategies and with an attacker group of size less than 10% the total network size. Overall, we show that the two proposed methods combined constitute an effective means to discover (at design-time) and raise awareness about the weaknesses and strengths of existing ad-hoc, delay-tolerant communication protocols against potential malicious cyber-attacks.     

多QoS约束的层次多播路由算法框架

为了解决网络路由的扩展性问题。大型网络通常被划分成若干个不同的域。拓扑聚集是对这些域的拓扑状态信息进行汇总的过程。在拓扑聚集的基础上,QoS层次多播路由算法用来构造满足QoS要求的域闻多播树。现有的QoS层次多播路由算法在其拓扑聚集和路径计算的过程中都只考虑了存在两个QoS特征值的情况。本文提出了一种具有多QoS约束的层次多播路由算法框架HMRMQ（Hierarchical Multicast Routing with Multiple QoS constraints）,此算法框架不仅为基于多QoS特征值的拓扑状态聚集和状态信息表示提供了新的方法,而且提出了一种适应于多QoS约束的层次多播路由新算法。我们提出的状态信息表示法和拓扑聚集算法都具有很好的扩展性,分布式的路由算法也便于某些安全性策略的实施。理论分析和实验结果不仅证明了HMRMQ的正确性和有效性,同时也表明了HMRMQ在网络路由的扩展性、路由成功率、网络代价以及报文负载等方面都具有良好的性能。     

基于平均传递概率的容迟网络路由算法的设计

为了提高容迟网络的传递率、降低传输延迟、对节点缓存进行更有效的管理, 结合已有的PROPHET和Spray and Wait算法, 提出了一种基于平均传递概率的容迟网络路由算法RAB-ADP。在该算法中设置了一个与时间有关的平均传递预测概率参数进行消息转发的决策, 解决了PROPHET算法容易产生路由抖动的缺点。算法综合利用了复制和知识两个属性, 采用{MOPR; FIFO}队列策略组, 通过消息传送完毕的ACK确认信息进行缓存管理和网络中冗余消息副本的删除。仿真实验表明, 该算法在节点缓存大小不同以及网络中节点数目不同的两种情况下, 传递率和路由开销比率的性能均优于其他经典路由算法。     

基于3D Mesh结构的一种静态路由算法

3D NoC在同构多核系统中相比2D NoC具有更为优越的性能.本文在研究3D Mesh结构的基础上,对拓扑结构中的平均延时和理想吞吐量进行了理论上的评估,并提出了一种基于3D Mesh的新的静态路由算法,最后运用NS2网络仿真软件对其进行仿真和比较.实验结果显示,新的路由算法可以有效地提高吞吐量,并在大规模数据传输时...     

Globally Adaptive Load-Balanced Routing on Tori

We introduce a new method of adaptive routing on k-ary n-cubes, Globally Adaptive Load-Balance (GAL). GAL makes global routing decisions using global information. In contrast, most previous adaptive routing algorithms make local routing decisions using local information (typically channel queue depth). GAL senses global congestion using segmented injection queues to decide the directions to route in each dimension. It further load balances the network by routing in the selected directions adaptively. Using global information, GAL achieves the performance (latency and throughput) of minimal adaptive routing on benign traffic patterns and performs as well as the best obliviously load-balanced routing algorithm (GOAL) on adversarial traffic.     

求解传感器网络生存时间最大化问题的遗传算法编码设计

求解传感器网络最大生存时间是设计高性能路由协议和拓扑控制协议的理论基础,在实践上有很重要的意义。目前主要通过近似算法求解,而且没有考虑到接收功耗。本文对生存时间优化问题进行了形式化描述,给出了最佳传输方案和最大生存时间的定义,从遗传算法角度给出了求解该问题的两个编码方案并进行了比较。     

移动Ad Hoe网络路由协议的分析与比较

介绍AdHoc网络路由协议的设计难点和已经提出一些经典的路由算法,基于ns2网络仿真平台,在不同的应用场景下,对已经提出的三种经典的AdHoc网络路由协议AdHoe按需距离矢量(AODV)、动态源路由(DSR)、目的序列距离矢量(DSDV)的性能进行比较和分析,得出不同的路由协议在不同的应用场合有其各自的优缺点,按需路由协议更适合于AdHoc网络的结论.     

三维片上网络研究综述

三维片上网络以其更短的全局互连、更高的封装密度、更小的体积等诸多优势,已引起国内外学术界和产业界的高度重视.对三维片上网络的研究,将直接影响一个国家未来三维集成电路和三维芯片产业的发展,也关系到国家安全.近年来,三维片上网络逐渐成为片上网络研究领域的一个重要方向,已取得了许多研究进展,但仍然存在许多挑战性的课题.对三维片上网络的基本问题作了简介;分析了三维片上网络在国内外的研究现状;讨论了三维片上网络研究中的关键问题,归纳出网络拓扑结构、路由机制、性能评估、通信容错、功耗、映射、测试、交换技术、服务质量、流量控制、资源网络接口等12类研究课题;分类综述了关键问题的研究进展;分析了三维片上网络存在的问题;指出,在三维片上网络拓扑结构方面:个性化拓扑结构设计、仿真平台研究开发、基于新型拓扑结构的三维芯片样片试制以及无线技术的引入等,在路由算法方面:适合3D Torus的路由算法、结合无关路由与自适应路由算法优点的新路由算法、适合各种新型拓扑结构的高效路由算法等,在性能评估方面:永久故障的容错、改进仿真程序增加对物理链路的建模、充分考虑通信的局部性等,在功耗方面:对拓扑结构/映射算法/路由算法和布局进行综合优化、动态和静态控制相结合、更为精确的3D NoC功耗模型等,在映射方面:发热均匀性、动态路由策略下映射评估模型的优化、低功耗映射算法、基于优化算法的组合映射等,都将是三维片上网络未来的重要研究课题.     

Performance evaluation of mesh-based NoCs: Implementation of a new architecture and routing algorithm

This paper presents the result of experiments conducted in mesh networks on different routing algorithms, traffic generation schemes and switching schemes. A new network on chip (NoC) topology based on partial interconnection of mesh network is proposed and a routing algorithm supporting the proposed architecture is developed. The proposed architecture is similar to standard mesh networks, where four extra bidirectional channels are added which remove the congestion and hotspots compared to standard mesh networks with fewer channels. Significant improvement in delay (60% reduction) and throughput (60% increase) was observed using the proposed network and routing when compared with the ideal mesh networks. An increase in number of channels makes the switches expensive and could increase the area and power consumption. However, the proposed network can be useful in high speed applications with some compromise on area and power.     

可充电无线传感网络能量均衡路由算法

针对可充电无线传感网络中的能量均衡路由问题,提出在稳定功率无线充电和监测数据收集网络场景下的多路径路由算法和机会路由算法,以实现网络的能量均衡。首先,通过电磁传播理论构建了无线传感节点的充电和接收功率关系模型;然后,考虑网络中无线传感节点的发送能耗和接收能耗,基于上述充电模型将网络能量均衡的路由问题转化为网络节点运行时间的最大最小化问题,通过线性规划得到的各链路流量用以指导路由中数据流量分配;最后,考虑一种更加现实的低功耗的场景,并提出了一种基于机会路由的能量均衡路由算法。实验结果表明,与最短路径路由（SPR）和期望周期最短路由（EDC）算法相比较,所提出的两种路由算法均能有效提高采集能量的利用率和工作周期内的网络生命周期。     

不同网络负载的Ad Hoc网络路由协议性能分析

通过实验对一种表驱动路由协议(DSDV)以及其中两种按需式路由协议(DSR和AODV)协议的性能进行比较和分析.利用NS-2仿真软件,设计了基于不同网络负载的多组仿真模型,并根据模型进行仿真.之后从分组投递率、时延和路由负荷三个性能指标参数对仿真结果进行了比较.实验结果表明:按需式路由协议DSR和AODV要优于基于表驱动的路由协议DSDV;在两种按需式路由协议之间,随着不同网络负载的加重,AODV协议比DSR协议的性能优势越来越明显.同时分析了造成不同协议之间性能差距的原因,针对AODV协议提出了今后的改进方向.