Routing Algorithms

Computer and Technology / April 23, 2015 / No Comments /
An insight to the mathematical algorithms of routing processes in network environments.

A router is used to manage network traffic and to find the best route for packets to be sent. This paper discusses the algorithms available in order to find the best route to destination for these packets in the network environment. The two main algorithms are “Global routing algorithms” and “Decentralized routing algorithms”. The paper evaluates in detail these two methodologies together with their bottlenecks and illustrates examples with diagrams, graphs, tables and code.
“In this step, routers should choose the best route for packets to every node. They do it by using an algorithm such as “Dijkstra Shortest Path Algorithm”. In this algorithm, router, based on information that has been collected from other routers, build a graph of network. This graph shows the location of routers in network and their links. Also every link will be labeled with a number that is called weight of link and is also known as cost of link. This number is a function of delay time, average traffic and sometimes simply, it is the number of hops between nodes. For example if there were two links between a node to destination, the router chooses the link with the least weight.”

Leave a Reply