Optimal Routing Strategy Based on Specifying Shortest Path | Zendy

Fei Shao | Zendy; Cheng Binghua | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Optimal Routing Strategy Based on Specifying Shortest Path

Author(s) -

Fei Shao,

Cheng Binghua

Publication year - 2014

Publication title -

international journal of computers communications and control

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.422

H-Index - 33

eISSN - 1841-9844

pISSN - 1841-9836

DOI - 10.15837/ijccc.2014.5.1279

Subject(s) - computer science , shortest path problem , betweenness centrality , routing (electronic design automation) , node (physics) , static routing , equal cost multi path routing , path (computing) , transfer (computing) , enhanced data rates for gsm evolution , link state routing protocol , multipath routing , path vector protocol , computer network , mathematical optimization , routing protocol , mathematics , artificial intelligence , theoretical computer science , centrality , graph , structural engineering , combinatorics , parallel computing , engineering

How to enhance the transfer capacity of weighted networks is of great importance. The network transfer capacity, which is often evaluated by the critical packet generation rate, is proved to be inversely proportional to the highest node betweenness. By specifying the shortest path according to the different node characteristics, two different routing strategies are proposed to reduce the high node betweenness for the different node delivery capability schemes. Simulations on both computer-generated networks and real world networks show that our routing strategies can improve the network transfer capacity greatly. Especially, the greater the new added edge number is, the more efficient our routing strategies are.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research