Networks With Shortest-Path Routing
Shortest-path routing algorithms have existed since two independent seminal works by Bellman [Bel58] and Ford [FF62], and Dijkstra [Dij59] in 1950’s. The difference between these two algorithms is the way information needed for computing the shortest-path is used. In the context of packet-switched networks and Internet routing, in particular, Bellman-Ford’s algorithm has enabled the development of distance-vector routing protocols while Dijkstra’s algorithm has paved the way to the introduction of link-state routing protocols [Hui00]. In this chapter, we focus on network design problems (NDPs) related to the latter type of routing protocols since they have gained popularity due to deployment of open ...
Get Routing, Flow, and Capacity Design in Communication and Computer Networks now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
