title: Efficient path routing strategy for flows with multiple priorities on scale-free networks.
abstract: In real networks, traffic flows are different in amount as well as their priorities. However, the latter priority has rarely been examined in routing strategy studies. In this paper, a novel routing algorithm, which is based on the efficient path routing strategy (EP), is proposed to overcome network congestion problem caused by large amount of traffic flows with different priorities. In this scheme, traffic flows with different priorities are transmitted through different routing paths, which are based on EP with different parameters. Simulation results show that the traffic capacity for flows with different priorities can be enhanced by 12% with this method, compared with EP. In addition, the new method contributes to more balanced network traffic load distribution and reduces average transmission jump and delay of packets.
authors.affiliation: School of Management, Xi'an Jiaotong University, No. 28, Xi'an, P. R. China.
authors.forename: Xi
authors.identifier: http://orcid.org/0000-0002-1958-032X
authors.initials: X
authors.lastname: Zhang
authors.affiliation: School of Management, Xi'an Jiaotong University, No. 28, Xi'an, P. R. China.
authors.forename: Zhili
authors.initials: Z
authors.lastname: Zhou
authors.affiliation: School of Management, Xi'an Jiaotong University, No. 28, Xi'an, P. R. China.
authors.forename: Dong
authors.initials: D
authors.lastname: Cheng
mesh_terms: D000465:Algorithms; D003195:Computer Communication Networks; D008962:Models, Theoretical