Cover
Vol. 11 No. 2 (2015)

Published: November 30, 2015

Pages: 202-207

Original Article

Modified ECMP Routing Using Adapted Cost Disjoint Multiple Paths ACDMP

Abbas A. Jasim 1
1Computer Engineering Department University of Basrah Basrah, Iraq
History
  • Received: September 30, 2015
  • Available Online: November 30, 2015
DOI

https://doi.org/10.37917/ijeee.11.2.7

Abstract

Computer network routing is performed based on routing protocol decisions. Open Shortest Path First OSPF is the most known routing protocol. It suffers from congestion problem since it generally uses single (least cost) path to deliver information. Some times OSPF delivers information using more than one path in the case of more than one path have the same cost value. This condition is rarely achieved in normal cases. In this work OSPF is developed to distribute information load across multiple paths and makes load distribution as general case for the routing protocol. The modification supposes no protocol replacement and uses the existing protocol facilities. This makes faster information delivery, load balancing, less congestion, and with little modification on the built in OSPF functions. Disjoint paths are calculated then the costs of the best set of them are adapted using approporate ratio.

Keywords

References

  1. H. Han, S. Shakkottai, C. V. Hollot, R. Srikant, and D. Towsley, “Multipath tcp: A joint congestion control and routing scheme to exploit path diversity in the internet,” Networking, IEEE/ACM Transactions on,vol. 14, pp. 1260 –1271, Dec. 2006.
  2. A. Jasim, “Wavenet-Based Computer Network Routing with Congestion Control”, Ph. D. Thesis in Electrical Engineering, University of Basrah, 2012.
  3. R. Banner and A. Orda, “Multipath Routing Algorithms for Congestion Minimization”, 15, no. 2, pp.413-424, 2007 .
  4. I. Mangal, D. Bajaj “A Review of MultiProtocol Label Switching: Protocol for Traffic Engineering on Internet”, International Journal of Computer Trends and Technology (IJCTT) vol. 11, no. 3, 2014.
  5. A. Mellouk, S. Larynouna, and S. Hoceïni, “Adaptive Probabilistic Routing Schemes for Real Time Traffic in High Speed Dynamic Networks”, IJCSNS International Journal of Computer Science and Network Security, vol.6 no.5B, pp. 36-42, 2006.
  6. X. Xiao A. Hannan, B. Bailey, and L. Ni “Traffic Engineering with MPLS in The 28-33, 2000.
  7. J. Macfarlane, “Network Routing Basics”, Wiley Publishing, Inc., 2006.
  8. C. Jian and L. Chin-Tau, “Optimal link weights for ip-based networks supporting hose-model vpns,” Networking, IEEE/ACM Transactions on, vol. 17, pp. 778 –788, June 2009.
  9. M. Dzida, et al., "Optimization of the shortestpath routing with equal-cost multi path load balancing,” in Proceedings of Conference on Transparent Optical Networks International Conference, Nottingham,pp. 9-, 12, 2006.
  10. A. Lappetelainen, “Equal Cost Multipath Routing M.Sc. Thesis Communications and Networking, Aalto University School of Science and Technology, 2011.
  11. M. Sniedovich, “Dijkstra’s Algorithm Revisited: The Dynamic Programming Connexion, Department of Mathematics and Statistics", vol. 35 no. 3, Department of Mathematics and Statistics, The University of Melbourne, Australia, 2006.
  12. K. Jaroenrat, S. Chimmanee, and P. Charnkeitkong, “ Algorithms for IP networks design with ECMP routing enable ”,The 7th Convergence Technology (ICCCT), pp. 420425, 2012.