In this paper, we propose a new fault-tolerant and congestion-aware adaptive routingalgorithm for Networks-on-Chip (NoCs). The proposed algorithm is based on the ball-and-string model and employs a distributed approa...
详细信息
ISBN:
(纸本)9781424478354
In this paper, we propose a new fault-tolerant and congestion-aware adaptive routingalgorithm for Networks-on-Chip (NoCs). The proposed algorithm is based on the ball-and-string model and employs a distributed approach based on partitioning of the regular NoC architecture into regions controlled by local monitoring units. Each local monitoring unit runs a shortest path computation procedure to identify the best routing path so that highly congested routers and faulty links are avoided while latency is improved. To dynamically react to continuously changing traffic conditions, the shortest path computation procedure is invoked periodically. Because this procedure is based on the ball-and-string model, the hardware overhead and computational times are minimal. Experimental results based on an actual Verilog implementation demonstrate that the proposed adaptive routingalgorithm improves significantly the network throughput compared to traditional XY routing and DyXY adaptive algorithms.
In this paper, we proposed a routing model for distributing hot spots within on-chip networks. It takes advantage of both adaptive mininial path and non-minimal path algorithnis. To evaluate the efficiency of the itio...
详细信息
ISBN:
(纸本)0780397266
In this paper, we proposed a routing model for distributing hot spots within on-chip networks. It takes advantage of both adaptive mininial path and non-minimal path algorithnis. To evaluate the efficiency of the itiodel, a siniulator developed using C++ is ernployed to coinpare the inethods. The siniulation results show that in realistic traffic niodels, like first transpose traffic, and in dense traffics the proposed algorithin has lower average delays conipared to the pre%iously proposed niodels.
Different dynamicrouting and wavelength assignment algorithms for WDM optical networks are described in this paper.A new dynamicalgorithm based on the layered graph model and called Multi-object Optimal algorithm (M...
详细信息
Different dynamicrouting and wavelength assignment algorithms for WDM optical networks are described in this paper.A new dynamicalgorithm based on the layered graph model and called Multi-object Optimal algorithm (MOA) is proposed.A distinguished feature of MOA algorithm is that it employs more accurate network information than the existing algorithms on the availability of both the number of available wavelengths and the hops of the lightpath in deciding the routing and the wavelength *** this paper,the detailed information per link is analyzed and the allocation of network resources is optimized under dynamic service *** results show that the algorithm MOA performs much better than some proposed traditional algorithms with comparable computation time.
Different dynamicrouting and wavelength assignment algorithms for WDM optical networks are described in this paper. A new dynamicalgorithm based on the layered graph model and called Multi-object Optimal algorithm (...
详细信息
Different dynamicrouting and wavelength assignment algorithms for WDM optical networks are described in this paper. A new dynamicalgorithm based on the layered graph model and called Multi-object Optimal algorithm (MOA) is proposed. A distinguished feature of MOA algorithm is that it employs more accurate network information than the existing algorithms on the availability of both the number of available wavelengths and the hops of the lightpath in deciding the routing and the wavelength assignment. In this paper, the detailed information per link is analyzed and the allocation of network resources is optimized under dynamic service traffic. Simulation results show that the algorithm MOA performs much better than some proposed traditional algorithms with comparable computation time.
With the increase of the Internet service, it is more and more important to provide better performance and quality in the WDM network. The paper introduces a novel dynamicrouting (DR) algorithm based on OSPF with the...
详细信息
ISBN:
(纸本)0819451762
With the increase of the Internet service, it is more and more important to provide better performance and quality in the WDM network. The paper introduces a novel dynamicrouting (DR) algorithm based on OSPF with the balance parameter. Due to the limitation to the wavelength continuity, the problem of the routing and wavelength assignment (RWA) is also analyzed comprehensively. In designing the algorithm, RWA is considered, too. The protocol of OSPF may collect the network state information by flooding in WDM network. Furthermore, the algorithm can adapt to the traffic changes with rather little changes in transport performance and blocking probability. In order to prove the method efficient and robust, the simulation with two topologies is done and results are also analyzed and compared. At last, the conclusion and further work are given, too.
暂无评论