基于包-电路交换的片上网络回退转向路由算法

采用包-电路交换的片上路由器,链路的建立通过发送请求包完成,而数据的传输则采用电路形式。传统的路由算法已经不能很好地适应基于包-电路交换的片上网络(NoC)新特性。该文根据包-电路交换的NoC的特点,提出了一种新的路由算法回退转向(RT)路由算法,以改善NoC性能。实验结果表明,与动态XY路由算法相比,回退转向路由算法使得网络平均吞吐量和平均包延迟最大分别改善26.7%和11.6%。     

TRACK: An algorithm for fault-tolerant,dynamic and scalable 2D mesh network-on-chip routing reconfiguration

Network-on-chip (NoC) is a reliable and scalable on-chip interconnect solution particularly used for MPSoCs and CMPs. Increasing susceptibility of NoC to failures is becoming a new research concern. Failures in components such as on-chip link or router may disrupt the underlying routing function. Reconfiguration of routing function is required to sustain network connectivity while maintaining deadlock-freedom in event of failure(s). Existing approaches either use routing tables or meta-data or involve all network nodes for participation in the reconfiguration process. This paper proposes TRACK, an algorithm for fast and scalable routing reconfiguration. It uses logic-based routing instead of tables and identifies affected nodes (i.e., rows/columns of mesh network) by single and double-link failures. In the proposed algorithm, reconfiguration is needed only for the affected nodes and the remaining network can continue to work. TRACK outperforms the existing one and reduces latency up to 42% and improves throughput up to 22% for single and double-link failures in 8 × 8 2D mesh network-on-chip. By employing logic-based routing, hardware cost is also reduced, i.e., 30% in area and 29.5% in power overhead for a 16 × 16 mesh router.     

片上网络节点编码的设计和在路由方面的应用

网络拓扑选择和路由算法设计是片上网络设计的关键问题.在比较现有的三种网络拓扑结构的基础上,提出了一种隐含着相邻节点以及节点之间链路关系并适合二维Torus拓扑结构的节点编码方法.该编码和Torus结构的结合能拓扑结果够简化路由算法的设计和实现,改善了网络路由性能.实验结果表明,提出的编码方法与二维Torus拓扑结构的结合有效地提高了片上网络通信性能.     

WMN多路径路由算法安全性分析与仿真

高效、安全的路由机制是保证无线网状网络(WMN)正常工作的一个重要因素。对WMN中的多径路由(MPR)算法进行了研究。由于MPR算法存在路由分离性约束,提出了一种基于转移概率的随机路由(SR)算法,并对这两种算法进行了仿真。仿真结果表明:在节点转发次数的标准方差和最高截获率两个性能指标方面,SR算法均优于MPR算法,这说明与MPR算法相比,所提算法进一步增强了WMN网络的路由安全性。     

基于网络监控器的专用片上网络动态容错路由

针对专用片上网络（Network on Chip,NoC）全局通信事务管理和可靠性设计问题,提出片上网络监控器的概念,用于获取全局网络实时状态信息及执行路径分配算法,基于此提出一种动态路由机制DyRS-NM.该机制能检测和定位NoC中的拥塞和故障链路,并能区分瞬时和永久性链路故障,采用重传方式避免瞬时故障,通过重新路由计算绕开拥塞和永久性故障.设计实现了RTL级网络监控器和与之通信的容错路由器模块,并将MPEG4解码器应用映射至基于网络监控器的4×4Mesh结构NoC体系结构中,验证了系统性能以及面积功耗开销.相比静态XY路由和容错动态路由FADR,DyRS-NM机制在可接受的开销代价下获得了更优的性能.     

WDM网状网中鲁棒选路算法研究

研究了WDM网状网在hose业务模型下基于Valiant负载平衡的鲁棒选路问题。借助业务量疏导的方法,以hose模型吞吐量最大化为优化目标,采用整数线性规划（ILP）加以解决,进而提出了2种快速的启发式算法——最短路径选路的最小跳数优先（SPR＆MHF）算法和平衡选路的最小跳数优先（BR＆MHF）算法。计算机仿真表明,SPR＆MHF算法适用于链路数较少的小规模WPM网状网,而RR＆MHF适用于链路数较多的大规模WDM网状网。     

光无线混合宽带接入网的路由技术研究

文章研究了光无线混合宽带接入网(HOW BAN)后端无源光网络(PON)采用的多点控制协议以及前端无线网状网(WMN)中的各种路由机制,重点研究了几种适用于HOW BAN前端WMN的路由算法:最小跳路由算法、最短路径路由算法、风险和时延感知的路由算法、感知时延路由算法、预测吞吐量路由算法、容量和时延感知的路由算法、能量感知的路由算法、流量限制路由算法、时延区分路由算法。对HOW BAN中的传输协议,文章指出保持服务公平性、保证健壮性、提高服务质量(QoS)、节约能源、保障安全性、适应多频道网络等问题值得深入研究。     

A multiobjective scatter search algorithm for fault-tolerant NoC mapping optimisation

Mapping IP cores to an on-chip network is an important step in Network-on-Chip (NoC) design and affects the performance of NoC systems. A mapping optimisation algorithm and a fault-tolerant mechanism are proposed in this article. The fault-tolerant mechanism and the corresponding routing algorithm can recover NoC communication from switch failures, while preserving high performance. The mapping optimisation algorithm is based on scatter search (SS), which is an intelligent algorithm with a powerful combinatorial search ability. To meet the requests of the NoC mapping application, the standard SS is improved for multiple objective optimisation. This method helps to obtain high-performance mapping layouts. The proposed algorithm was implemented on the Embedded Systems Synthesis Benchmarks Suite (E3S). Experimental results show that this optimisation algorithm achieves low-power consumption, little communication time, balanced link load and high reliability, compared to particle swarm optimisation and genetic algorithm.     

一种面向功耗免死锁三维全动态3DNoC路由算法

 随着近年来三维片上网络(3D NoC)技术的提出及不断发展,功耗问题已成为3D NoC设计中面临的严峻挑战之一.本文为3D NoC提出一种面向功耗免死锁三维全动态路由算法TFRA (Three-dimensional Full-adaptive Routing Algorithm).其以传统二维NoC奇偶拐弯模型为基础,将三维路由空间划分为8个象限,针对每个象限制定相应的路由策略,从而实现免死锁.采用SystemC系统级建模语言搭建的3D NoC仿真平台进行验证,结果显示TFRA算法在功耗性能指标方面较现有的三维路由算法有大幅提升.     

接口标记容错路由算法

随着片上系统(SoC)集成度的不断提高,IP核之间的通信故障成为亟待解决的问题,片上网络(NoC)是解决SoC通信问题的有效途径。容错路由算法是NoC设计中的关键技术,对NoC的通信效率有重要影响。在Valiant随机路由算法和源路由算法的基础上,提出了一种接口标记容错路由算法。该算法吸取了Valiant随机路由算法能平衡网络负载、降低拥塞概率的优良性能与源路由算法中路径不需要计算与查找的特点,减小了传输时延,提高了路由器的利用率。     

无线Mesh网络安全路由算法研究

从路由安全性的角度出发,对无线Mesh网络中的多径路由(MPR)算法和随机路由(SR)算法进行了研究.在分析这两种算法的思路、实现步骤和安全性的基础上,对MPR算法和SR算法进行了仿真.仿真结果表示SR算法在路由安全性能上优于MPR算法,但在网络时延性能上劣于MPR算法.     

Link-State-Based Algorithms for Dynamic Routing in All-Optical Networks with Ring Topologies

The increased usage of large bandwidth in optical networks raises the problems of efficient routing to allow these networks to deliver fast data transmission with low blocking probabilities. Due to limited optical buffering in optical switches and constraints of high switching speeds, data transmitted over optical networks must be routed without waiting queues along a path from source to destination. Moreover, in optical networks deprived of wavelength converters, it is necessary for each established path to transfer data from source to destination by using only one wavelength. To solve this NP-hard problem, many algorithms have been proposed for dynamic optical routing like Fixed-Paths Least Congested (FPLC) routing or Least Loaded Path Routing (LLR). This paper proposes two heuristic algorithms based on former algorithms to improve network throughput and reduce blocking probabilities of data transmitted in all-optical networks with regard to connection costs. We also introduce new criteria to estimate network congestion and choose better routing paths. Experimental results in ring networks show that both new algorithms achieve promising performance.     

On adaptive routing in urban vehicular networks

Efficient data delivery in vehicular networks has received increasing attention in recent years. Existing routing protocols for vehicular networks can be loosely divided into two classes: road based routing (RBR) and road oblivious routing (ROR). RBR finds a routing path along roads while ROR does not explicitly forward packets along roads. Our empirical study based on real trace-driven experiments shows that using either of an RBR algorithm or an ROR algorithm alone in a realistic vehicular network setting leads to deficiency. This results from the fact that network conditions can be different at different locations and evolving over time. Motivated by this important observation, this paper proposes an adaptive routing algorithm called RWR that adapts its routing strategy to network dynamics as the packet travels from the source to the destination. Extensive simulations based on a large dataset of real vehicular traces collected from around 2,600 taxis in Shanghai have been conducted. Comparison study shows that RWR produces higher delivery ratio than TSF and GPCR, representative routing algorithms of RBR and ROR, respectively. It achieves low delivery delay at the same time.     

On Multicast Routing for Wavelength-Routed WDM Networks with Dynamic Membership

Future broadband networks must support integrated services and offer flexible bandwidth usage. In our previous work in [1], we explored the optical link control (OLC) layer on the top of optical layer that enables the possibility of bandwidth on-demand (BoD) service directly over wavelength division multiplexed (WDM) networks. Today, more and more applications and services such as video-conferencing software and Virtual LAN service require multicast support over the underlying networks. Currently, it is difficult to provide wavelength multicast over optical switches without optical/electronic conversions although the conversion takes extra cost. In this paper, based on the proposed wavelength router architecture (equipped with ATM switches to offer O/E and E/O conversions when necessary), a dynamic multicast routing algorithm is proposed to furnish multicast services over WDM networks. The goal is to join a new group member into the multicast tree so that the cost, including the link cost and the optical/electronic conversion cost, is kept as low as possible. The same algorithm can be applied to other wavelength routing architectures with redefinition of electronic copy cost. The effectiveness of the proposed wavelength router architecture as well as the dynamic multicast algorithm is evaluated by simulation.     

Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks

We propose a class of algorithms for finding an optimal quasi-static routing in a communication network. The algorithms are based on Gallager's method [1] and provide methods for iteratively updating the routing table entries of each node in a manner that guarantees convergence to a minimum delay routing. Their main feature is that they utilize second derivatives of the objective function and may be viewed as approximations to a constrained version of Newton's method. The use of second derivatives results in improved speed of convergence and automatic stepsize scaling with respect to level of traffic input. These advantages are of crucial importance for the practical implementation of the algorithm using distributed computation in an environment where input traffic statistics gradually change.     

Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks

Multihop infrastructure wireless mesh networks offer increased reliability, coverage, and reduced equipment costs over their single-hop counterpart, wireless local area networks. Equipping wireless routers with multiple radios further improves the capacity by transmitting over multiple radios simultaneously using orthogonal channels. Efficient channel assignment and routing is essential for throughput optimization of mesh clients. Efficient channel assignment schemes can greatly relieve the interference effect of close-by transmissions; effective routing schemes can alleviate potential congestion on any gateways to the Internet, thereby improving per-client throughput. Unlike previous heuristic approaches, we mathematically formulate the joint channel assignment and routing problem, taking into account the interference constraints, the number of channels in the network, and the number of radios available at each mesh router. We then use this formulation to develop a solution for our problem that optimizes the overall network throughput subject to fairness constraints on allocation of scarce wireless capacity among mobile clients. We show that the performance of our algorithms is within a constant factor of that of any optimal algorithm for the joint channel assignment and routing problem. Our evaluation demonstrates that our algorithm can effectively exploit the increased number of channels and radios, and it performs much better than the theoretical worst case bounds     

一种基于排序蚁群算法的无线Mesh多径路由协议

无线Mesh网络因其较好的鲁棒性、可覆盖区域广、低成本、接入便利等优点,在临时布置通信网络逐渐得到了重用,在无线通信技术中扮演着越来越重要的角色。针对无线Mesh网络的特点,提出一种基于改进蚁群算法的多径路由协议Fortified Ant协议。与传统的蚁群算法路由协议相比,该协议对蚁群算法进行改进,在蚁群算法基础上加入排序算法,同时在该协议中加入多径传输,在主路由失效时马上启用备份路由,保证信息传输的时效性和可靠性。实验结果表明,与ADOV、DSR和ACO路由算法相比,该算法能迅速发现质量较优的多条路径,具有收敛快、开销少等优势。     

Multicast protection scheme based on Hamiltonian cycle in fault-tolerant optical mesh networks

The increase of multimedia service requirements results in the growing popularity of the multicast in Wavelength-Division Multiplexing (WDM) optical mesh networks. Multicast fault tolerance in WDM optical mesh networks is an important issue because failures caused by the traffic carried in WDM optical mesh networks may lead to huge data loss. Previous works have proposed multicast protection algorithms to address the single-fiber link failure dominant in current optical mesh networks. However, these existing algorithms are all mainly based on path protection or segment protection, which may lead to long restoration times and complicated protection switching procedures. This paper therefore proposes a new heuristic algorithm, called Enhanced Multicast Hamiltonian Cycle Protection (EMHCP), in which all working light-trees of multicast demands can be protected by a Hamiltonian cycle in the network. For each multicast demand, EMHCP computes a least-cost light-tree based on the presented link-cost function that considers load balancing and proper straddling link selection so that backup wavelengths on the Hamiltonian cycle can be reduced. Simulation results show that EMHCP can obtain significant performance improvement compared with the conventional algorithm.     

Resilient routing implementation in 2D mesh NoC

With the rapid shrinking of technology and growing integration capacity, the probability of failures in Networks-on-Chip (NoCs) increases and thus, fault tolerance is essential. Moreover, the unpredictable locations of these failures may influence the regularity of the underlying topology, and a regular 2D mesh is likely to become irregular. Thus, for these failure-prone networks, a viable routing framework should comprise a topology-agnostic routing algorithm along with a cost-effective, scalable routing mechanism able to handle failures, irrespective of any particular failure patterns. Existing routing techniques designed to route irregular topologies efficiently lack flexibility (logic-based), scalability (table-based) or relaxed switch design (uLBDR-based). Designing an efficient routing implementation technique to address irregular topologies remains a pressing research problem. To address this, we present a fault resilient routing mechanism for irregular 2D meshes resulting from failures. To handle irregularities, it avoids using routing tables and employs a few fixed configuration bits per switch resulting in a scalable approach. Experiments demonstrate that the proposed approach is guaranteed to tolerate all locations of single and double-link failures and most multiple failures. Also, unlike uLBDR it is not restricted to any particular switching technique and does not replicate any extra messages. Along with fault tolerance, the proposed mechanism can achieve better network performance in fault-free cases. The proposed technique achieves graceful performance degradation during failure. Compared to uLBDR, our method has 14% less area requirements and 16% less overall power consumption.