Shortest Path Routing Algorithm Based on Chaotic Neural Network

A shortest path routing algorithm based on transient chaotic neural network is proposed in this paper. Gam-pared with previous models adopting Hopfield neural network, this algorithm has a higher ability to overcome the local minimum, and achieves a better performance. By introducing a special post-processing technique for the output matrixes, our algorithm can obtain an optimal solution with a high probability even for the paths that need more hops in large-size networks.

A general communication performance evaluation model based on routing path decomposition

The network-on-chip (NoC) architecture is a main factor affecting the system performance of complicated multi-processor systems-on-chips (MPSoCs).To evaluate the effects of the NoC architectures on communication efficiency,several kinds of techniques have been developed,including various simulators and analytical models.The simulators are accurate but time consuming,especially in large space explorations of diverse network configurations;in contrast,the analytical models are fast and flexible,providing alternative methods for performance evaluation.In this paper,we propose a general analytical model to esti-mate the communication performance for arbitrary NoCs with wormhole routing and virtual channel flow control.To resolve the inherent dependency of successive links occupied by one packet in wormhole routing,we propose the routing path decomposition approach to generating a series of ordered link categories.Then we use the traditional queuing system to derive the fine-grained transmission latency for each network component.According to our experiments,the proposed analytical model provides a good approximation of the average packet latency to the simulation results,and estimates the network throughput precisely under various NoC configurations and workloads.Also,the analytical model runs about 10 5 times faster than the cycle-accurate NoC simulator.Practical applications of the model including bottleneck detection and virtual channel allocation are also presented.

M3FEC:Joint Multiple Description Coding and Forward Error Correction for Interactive Multimedia in Multiple Path Transmission

The best-effort internet has inherent limitations on the end-to-end performance for interactive multimedia communications. This paper presents a multiple description coding （MDC） and forward error correction （FEC） based multiple path transmission schemes for interactive multimedia （M3FEC）, which improves the end users’ experience by maximizing a rate-distortion （R-D） based optimization problem. The proposed model considers both the network diversity and the application’s stringent requirements, and combines the individual merits of the three promising technologies of multiple path overlay routing, MDC and FEC. Extensive numerical analysis and PlanetLab experiments demonstrate that M3FEC successfully combats packet losses, error propagation, and unpredictable network dynamics. This method also significantly increases distortion for interactive multimedia by over 10 dB than traditional IP-layer single path transmission in poor network environments, and outperforms the performance achieved by using MDC or FEC alone.