Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
