The revolution of the internet is based on the ability to transport data from source or origin to a destination. This revolution over the last three decades has seen unprecedented growth rate and it is expected to grow much higher especially with the emergence of smart mobile devices and internet penetration into the developing world. However, the transport of data has never been without challenges. Some of these challenges include: loss of data, collisions and delay in sending data and inefficient routing algorithms. In this work, the researcher proposes an algorithm that will not only find the shortest possible path but also able to find the most efficient path for data routing. The researcher seeks to use Dijkstra’s algorithm that will be used to find the shortest path from a named source to a destination and to explore the logic behind Carrier Sense Multiple Access with Collision Detection (CSMA/CD) to investigate how busy the shortest route or path may be.

">

An Algorithm To Determine The Most Efficient Network Route From A Source Node To A Destination Node

Salifu Abdul-Mumin*
* University for Development Studies, Faculty of Mathematical Sciences, Department of Computer Science, Navrongo, Ghana.
Periodicity:March - May'2013
DOI : https://doi.org/10.26634/jcom.1.1.2277

Abstract

The revolution of the internet is based on the ability to transport data from source or origin to a destination. This revolution over the last three decades has seen unprecedented growth rate and it is expected to grow much higher especially with the emergence of smart mobile devices and internet penetration into the developing world. However, the transport of data has never been without challenges. Some of these challenges include: loss of data, collisions and delay in sending data and inefficient routing algorithms. In this work, the researcher proposes an algorithm that will not only find the shortest possible path but also able to find the most efficient path for data routing. The researcher seeks to use Dijkstra’s algorithm that will be used to find the shortest path from a named source to a destination and to explore the logic behind Carrier Sense Multiple Access with Collision Detection (CSMA/CD) to investigate how busy the shortest route or path may be.

Keywords

Algorithm, Routing, Djikstra algorithm, CSMA/CD, LANs, WANs, MAC

How to Cite this Article?

Abdul-Mumin, S. (2013). An Algorithm to Determine the Most Efficient Network Route From a Source Node to a Destination Node. i-manager’s Journal on Computer Science, 1(1), 27-34. https://doi.org/10.26634/jcom.1.1.2277

References

[1]. Cisco. "Building Your Network Foundation: Routing and Switching Made Simple".
[2]. A. Boukerche, (2001). "Performance comparison and analysis of ad hoc routing algorithms," in Proc. of IEEE International Conference on Performance, Computing, and Communications, pp. 171-178, 2001.
[3]. I. D. Aron and S. K. S. Gupta, (2001). "On the scalability of on-demand routing protocols for mobile ad hoc networks: an analytical study," in Journal of Interconnection Networks, Vol. 2, No. 1, pp. 5-29.
[4]. Bob Albrightson, J.J. Garcia-Luna-Aceves, and Joanne Boyle. (1994). Eigrp - a fast routing protocol based on distance vectors. In Proc. Networld/Interop.
[5]. D. B. West, (2001). Introduction to Graph Theory, 2nd ed.. Upper Saddle River, NJ: Prentice Hall.
[6]. Edsger W. Dijkstra and Carel S. Scholten. (1980). Termination detection for diffusing computations. Inf. Process. Lett., pages 1-4.
[7]. J. J. Garcia-Lunes-Aceves. (1993). Loop-free routing using diffusing computations. IEEE/ACM Trans. Netw., 1(1):130{141.
[8]. J. J. Garcia-Luna-Aceves and Shree Murthy. (1997). A path-finding algorithm for loop-free routing. IEEE/ACM Trans. Netw., 5(1):148-160.
[9]. J. Moy, (1998). "OSPF Version 2," Internet Engineering Task Force RFC 2328, April 1998. Available at http://www.ietf.org/rfc/rfc2328.txt.
[10]. D. B. Johnson, D. A. Maltz, Y. C. Hu, and J. G. Jetcheva, (2002). "The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR)," Internet Engineering Task Force (IETF) draft, February 2002. Available at http://www.ietf.org/internet-drafts/draft-ietf-manet-dsr.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.