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.