Talk:Shortest path routing

From Citizendium
Revision as of 17:32, 24 December 2009 by imported>Howard C. Berkowitz (→‎SPF runs in small routing domains: new section)
Jump to navigation Jump to search
This article is developed but not approved.
 Main Article
 Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
Catalogs [?]
 
To learn how to update the categories for this article, see here. To update categories, edit the metadata template.
 Definition:  finding the shortest path through a network [d] [e]
Checklist and Archives
 Workgroup category:  Computers [Please add or review categories]
 Talk Archive:  none  English language variant:  American English

SPF runs in small routing domains

We should not be suggesting that SPF is the Internet-wide routing algorithm, or, indeed, that there is any one algorithm. SPF is quite effective in networks, or hierarchical subareas of networks. Even real-world intradomain routing protocols such as OSPF use distance vector routing for their inter-area and external routes. The overall Internet (and large private system) Border Gateway Protocol uses path vector routing with a considerable number of policy extensions, the policy so dominating that BGP is not infrequently called a reachability protocol rather than a routing protocol. Howard C. Berkowitz 22:32, 24 December 2009 (UTC)

Retrieved from "https://citizendium.org/wiki/index.php?title=Talk:Shortest_path_routing&oldid=714047"