QoS Routing Algorithm Using Competitive PCNN
The solution of the multi-constrained QoS routing is translated into a shortest path problem for a weighted graph, and the problem of multi-constrained QoS routing is successfully solved using the properties of pulse wave parallel propagation of the competitive PCNN. The number of iteration of our algorithm is dependent of the length of the globally optimal multi-constrained QoS routing between source node and destination node and independent of the number of nodes and edges and the complexity of network distribution structure. The method shows better computational performance and dominance and has important significance in both theory and applications.
D. M. Zhou and H. Cai, "QoS Routing Algorithm Using Competitive PCNN", Applied Mechanics and Materials, Vols. 229-231, pp. 1908-1912, 2012