Talk:Shortest path routing: Difference between revisions
Jump to navigation
Jump to search
imported>David MacQuigg (New page: {{subpages}}) |
imported>Howard C. Berkowitz (→SPF runs in small routing domains: new section) |
||
| Line 1: | Line 1: | ||
{{subpages}} | {{subpages}} | ||
== 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. [[User:Howard C. Berkowitz|Howard C. Berkowitz]] 22:32, 24 December 2009 (UTC) | |||
Revision as of 16:32, 24 December 2009
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)