Download now Free registration required
Routing in a computer network refers to the task of finding a path from a source node to a destination node. Given a particular network, it is very likely that there is more than one path that can be used. The task of a routing algorithm is to find the shortest path. Shortest path routing algorithms such as Dijkstra's algorithm and Bellman-Ford algorithm are commonly used in computer network nowadays. Even though shortest path routing algorithms are already well established, there are researchers who are trying to find alternative methods to find shortest paths through a network.
- Format: PDF
- Size: 322.7 KB