Exploring Multiple Paths using Link Utilization in Computer Networks

Aggarwal, Shalini and Upadhyaya, Shuchita Exploring Multiple Paths using Link Utilization in Computer Networks. IJCSN - International Journal of Computer Science and Network, 2016, vol. 5, n. 5. [Journal article (Unpaginated)]

[img] Text
Exploring-Multiple-Paths-using-Link-Utilization-in-Computer-Networks.pdf

Download (310kB)

English abstract

Though the speed of the Internet is increasing day-by-day, yet there is need of much higher speed. A lot of research is going on to receive any information from Internet just on a click. One way to have more efficient and robust Internet is to identify multiple paths for routing so that routers could flexibly divide traffic over these paths. Often having one or two more paths is generally enough for significant gains in terms of security, performance, and reliability of a network. However, one of the first barriers in multipath routing is to explore the multiple paths over which traffic can be diverted. The principle objective of this paper is to explore the multiple paths using link utilization factor. For this purpose a multi-path routing algorithm has been proposed that identifies multiple loop-free paths from single source to single destination using local information. The link utilizations factor used in this algorithm takes into account various metrics such as load, capacity and delay etc. The proposed technique identifies multiple paths which may not be over utilized.

Item type: Journal article (Unpaginated)
Keywords: Link Utilization, Load, Capacity, Multipath Routing
Subjects: L. Information technology and library technology > LB. Computer networking.
Depositing user: IJCSN Journal
Date deposited: 29 Oct 2016 02:35
Last modified: 29 Oct 2016 02:35
URI: http://hdl.handle.net/10760/30167

References

"SEEK" links will first look for possible matches inside E-LIS and query Google Scholar if no results are found.

[1] Moy, J., OSPF Version 2, RFC2328, 1998. [2] Srinivas Vutukury, An Algorithm for Multipath Computation using Distance-Vectors with Predecessor Information [3] Martin, R., Menth, M. & Hemmkeppler, M., Accuracy and Dynamics of Hash-Based Load Balancing Algorithms for Multipath Internet Routing, IEEE, June, 2006 [4] Eppstein, D., Finding the k Shortest Paths, March 31, 1997 [5] Srinivas Vutukury, Multipath routing mechanisms for traffic engineering and quality of service in the Internet, Ph.D. thesis, University of California, Santa Cruz, March 2001 [6] Yen J.Y., Finding the K-shortest loopless paths in a Network, Management Sciences, Vol.17, No.11, July 1971. [7] Hershberger, J., Maxel, M. & Suri, S., Finding the K shortest paths: A New Algorithm and its Implementation, ACM Transactions on Algorithms, Vol. 3, No. 4, Article 45, Publication date: November 2007. [8] Devi Gaytri and Upadhyaya Shuchita, An Approach to Distributed Multi-Path QoS Routing, Indian Journal of Science and Technology, Vol 8(20), August 2015.. [9] Andrew S. Tanenbaum and David J. Wetherall. Computer Networks, Third Edition, Prentice Hall.


Downloads

Downloads per month over past year

Actions (login required)

View Item View Item