A Novel Multi-Next Hop Routing Algorithm based on Node Potential

Single next hop routing algorithm which widely used centralize the transmission paths and leads to a waste of network resources and transmission congestion. For better performance, recently researches focus on multi next hop routing algorithm. In this paper, a multi-next hop routing algorithm based on node potential is proposed. With this method, each node forwards packets to multiple neighbor nodes and parallel data transmission can be implemented easily. Simulation results show that this algorithm makes better use of network resources, reduces transmission congestion, and improves network performance effectively.

[1]  Mark Handley,et al.  TCP Extensions for Multipath Operation with Multiple Addresses , 2020, RFC.

[2]  J. J. Garcia-Luna-Aceves,et al.  MDVA: a distance-vector multipath routing protocol , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[3]  J. J. Garcia-Luna-Aceves,et al.  A simple approximation to minimum-delay routing , 1999, SIGCOMM '99.

[4]  Mark Handley,et al.  TCP Extensions for Multipath Operation with Multiple Addresses , 2011 .

[5]  Srinivas Naga Vutukury,et al.  Multipath routing mechanisms for traffic engineering and quality of service in the internet , 2001 .

[6]  Rodney Van Meter,et al.  MARA: Maximum Alternative Routing Algorithm , 2009, IEEE INFOCOM 2009.

[7]  Fernando Paganini,et al.  Stability of node-based multipath routing and dual congestion control , 2008, 2008 47th IEEE Conference on Decision and Control.

[8]  J.J. Garcia-Luna-Aceves,et al.  A distributed algorithm for multipath computation , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[9]  Md. Saidur Rahman,et al.  Proposal for st-Routing Protocol , 2004, Telecommun. Syst..

[10]  Toshihide Ibaraki,et al.  Computing Edge-Connectivity in Multigraphs and Capacitated Graphs , 1992, SIAM J. Discret. Math..

[11]  Diego Perino,et al.  Evaluating the performance of multi-path routing and congestion control in presence of network resource management , 2009, 2009 International Conference on Ultra Modern Telecommunications & Workshops.

[12]  Ke Xu,et al.  LBMP: A Logarithm-Barrier-Based Multipath Protocol for Internet Traffic Management , 2011, IEEE Transactions on Parallel and Distributed Systems.

[13]  Laurent Massoulié,et al.  Control of communication networks: welfare maximization and multipath transfers , 2008, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[14]  Jun Murai,et al.  Drouting Architecture: Improvement of Failure Avoidance Capability Using Multipath Routing , 2008, IEICE Trans. Commun..

[15]  Yasuhiro Ohara,et al.  Routing Architecture for the Dependable Internet , 2008 .

[16]  Toshihide Ibaraki,et al.  Graph connectivity and its augmentation: applications of MA orderings , 2002, Discret. Appl. Math..

[17]  Donald F. Towsley,et al.  Path Selection and Multipath Congestion Control , 2007, INFOCOM.

[18]  Diego Perino,et al.  Towards real implementations of dynamic robust routing exploiting path diversity , 2009, 2009 International Conference on Ultra Modern Telecommunications & Workshops.

[19]  J. J. Garcia-Luna-Aceves,et al.  An algorithm for multipath computation using distance-vectors with predecessor information , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[20]  Thomas Voice.  Stability of multi-path dual congestion control algorithms , 2007, TNET.