You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither SPIE nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the SPIE website.
3 December 2015A dual-routing strategy on scale-free networks
The most important function of a network is for transporting traffic. Due to the low traffic capacity of network systems under the shortest path routing algorithm, plenty of heuristic routing algorithms are emerging. In this paper, we propose a dual-routing algorithm model for network system. The overall traffic capacity of a network system can be evaluated by the critical packet generating rate. When this routing algorithm is adopted on BA scale-free networks with an appropriate parameter p, it can achieve larger traffic capacity compared with the single-routing algorithm.
The alert did not successfully save. Please try again later.
Xuan He, Kai Niu, Zhiqiang He, Jiaru Lin, "A dual-routing strategy on scale-free networks," Proc. SPIE 9794, Sixth International Conference on Electronics and Information Engineering, 979411 (3 December 2015); https://doi.org/10.1117/12.2203466