Tagged with OSPF

Dijkstra’s algorithm

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. … Continue reading

Edsger W. Dijkstra

Edsger W. Dijkstra

Edsger Wybe Dijkstra, (May 11, 1930 – August 6, 2002) was a Dutch computer scientist. He received the 1972 Turing Award for fundamental contributions to developing programming languages, and was the Schlumberger Centennial Chair of Computer Sciences at The University of Texas at Austin from 1984 until 2000. Shortly before his death in 2002, he … Continue reading

BGP – The protocol that makes the Internet work

Service providers working with IP networks are very clear that the Border Gateway Protocol (BGP) is the most complex and difficult to configure Internet protocol. Its emphasis on security and scalability makes it essential, however. This guide offers you a detailed look at how and why BGP-enabled routers in core networks exchange information securely with … Continue reading