**Author**: Books Llc

**Publisher:** Books LLC, Wiki Series

**ISBN:** 9781155870540

**Size**: 49.13 MB

**Format:** PDF

**Category : **
**Languages : **en

**Pages : **106

**View:** 3606

Get Book

by Books Llc, Routing Algorithms Dijkstra S Algorithm A Search Algorithm Link State Routing Protocol Distance Vector Routing Protocol Books available in PDF, EPUB, Mobi Format. Download

**Routing Algorithms Dijkstra S Algorithm A Search Algorithm Link State Routing Protocol Distance Vector Routing Protocol books**, Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 27. Chapters: Dijkstra's algorithm, A* search algorithm, Link-state routing protocol, Distance-vector routing protocol, Floyd-Warshall algorithm, Optimized Link State Routing Protocol, B*, Max-min fairness, Diffusing update algorithm, Temporally-ordered routing algorithm, Wireless Routing Protocol, Geographic routing, Vehicular Reactive Routing protocol, Fairness measure, IDA*, Weighted fair queuing, Edge disjoint shortest pair algorithm, MENTOR routing algorithm, Administrative distance, Babel, Augmented Tree-based Routing, SMA*, Expected Transmission Count, Flooding, Credit-based fair queuing, Hierarchical state routing, ODMRP, Arc routing, MCOP. Excerpt: Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959, is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms. For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra's algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First). Dijkstra's original algorithm does not use a min-priority queue and runs in O(-V-...