A new routing algorithm based on keynodes

A new multi-paths routing algorithm has been proposed in the work, which can solve the problem of congestion caused by overloads of links and provide a better environment compared with the traditional networking technologies. This methodology will call the routing mechanism when the links appear overloads, and it can adopt alternative path or multi-paths to complete data transmission in order to reduce congestion. Finally, our experiment shows that the algorithm can improve the throughput, decrease the packet loss ratio comparing to single path system, and achieve a new balance.

[1]  Oliver W. W. Yang,et al.  Load balancing of multipath source routing in ad hoc networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[2]  Srihari Nelakuditi,et al.  On selection of candidate paths for proportional routing , 2004, Comput. Networks.

[3]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Nicolas Lefebvre,et al.  Fast shortest path computation in time-dependent traffic networks , 2007 .

[5]  Mahesh K. Marina,et al.  On-demand multipath distance vector routing in ad hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[6]  Zheng Wang,et al.  Explicit routing algorithms for Internet traffic engineering , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[7]  Samir Ranjan Das,et al.  Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks , 2001, Mob. Networks Appl..

[8]  Wu Dong-ya.  Multipath Source Self Repair Routing Algorithm for Mobile Ad Hoc Networks , 2005 .