Optimal Routing Strategy Based on Specifying Shortest Path

Abstract

How to enhance the transfer capacity of weighted networks is of greatimportance. The network transfer capacity, which is often evaluated by the criticalpacket generation rate, is proved to be inversely proportional to the highestnode betweenness. By specifying the shortest path according to the different nodecharacteristics, two different routing strategies are proposed to reduce the high nodebetweenness for the different node delivery capability schemes. Simulations on bothcomputer-generated networks and real world networks show that our routing strategiescan improve the network transfer capacity greatly. Especially, the greater thenew added edge number is, the more efficient our routing strategies are

    Similar works