Optimizing multi-path routing by avoiding Key Nodes

In this paper, we propose a new routing algorithm which combines source routing and intermediate routing in order to meet the requirement of node disjointed path and scalability. We also discover the existing of Key Nodes which we call KN, KN are the transmission congestion host spots, also in multi-path routing, they will lead to a low performance in disjointed path. We give a simple, effective method to detect KN and avoid them. The result of simulation shows that this method can obtain a good performance on disjointed path, and can significantly improve network reliability.

[1]  Olivier Bonaventure,et al.  An evaluation of IP-based fast reroute techniques , 2005, CoNEXT '05.

[2]  Jennifer Rexford,et al.  MIRO: multi-path interdomain routing , 2006, SIGCOMM 2006.

[3]  Xiaowei Yang,et al.  NIRA: a new Internet routing architecture , 2003, FDNA '03.

[4]  Jennifer Rexford,et al.  Toward internet-wide multipath routing , 2008, IEEE Network.

[5]  David R. Cheriton,et al.  Feedback based routing , 2003, CCRV.

[6]  Jia-Shung Wang,et al.  Buffered multicast routing for video-on-demand systems , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[7]  Y.-T. Chen,et al.  An efficient two-layer irregular-channel router , 1990, Proceedings of the 33rd Midwest Symposium on Circuits and Systems.

[8]  Bassam Halabi,et al.  Internet Routing Architectures , 1997 .

[9]  David R. Cheriton,et al.  Loose source routing as a mechanism for traffic policies , 2004, FDNA '04.

[10]  Deborah Estrin,et al.  Highly-resilient, energy-efficient multipath routing in wireless sensor networks , 2001, MOCO.

[11]  A SunshineCarl Source routing in computer networks , 1977 .