Home
Call For Papers
Submission
Author
Registration
Publications
About
Contact Us

  Exploring Multiple Paths using Link Utilization in Computer Networks  
  Authors : Shalini Aggarwal; Shuchita Upadhyaya
  Cite as:

 

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.

 

Published In : IJCSN Journal Volume 5, Issue 5

Date of Publication : October 2016

Pages : 755-762

Figures :05

Tables : --

 

Shalini Aggarwal : is currently doing her Doctoral Degree in the field of Computer Networks. She has done her MCA in 2005 and M.Sc. in Computer Science (Software) in 1998 from Kurukshetra University, Kurukshetra. She is currently working as an Assistant Professor in Computer Science at Govt.(PG) College for Women, Karnal. She is having teaching experperience of more than 12 years.She has presented papers at various National and International conferences.

Shuchita Upadhyaya : is currently working as a Professor in the Department of Computer Science & Applications, Kurkshetra University, Kurukshetra. She has done her Ph.D. in Computer Science & Applications from Kurkshetra University, Kurukshetra. She is having teaching & research experience of more than 28 years. She has published more than 100 papers in international and national journals.She is life member of Indian Society of Information Theory and Applications (national) and international Forum for Interdisciplinary Mathematics.She has been awarded Kunj Ratan, Award of Honour, for exemplary Achievement in the field of Academics.

 

 

 

 

 

 

 

Link Utilization, Load, Capacity, Multipath Routing

In this paper first discuss about OSI Model Network architecture and its drawbacks for wireless mobile ad hoc networks. And it is decided that cross layer network design is suitable for wireless mobile ad hoc networks. A survey has done against various cross layer design proposals, its performance of the protocol stack and enhancement methodology. These surveys gives us the need for paradigm change from strictly layered protocol stacks to cross – layer design is clear from the benefits from cross layer design. Future work may replace entire layered architecture completely. But it is not possible due to compatibility issue. Hence revolutionary approach is applicable. By leaving redundant part of layered structure and protocol will prove increase in network performance like optimization, efficient power utilization, delay in MANET.

 

[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.