Link state routing: Difference between revisions
John Leach (talk | contribs) No edit summary |
John Leach (talk | contribs) m (Text replacement - "[[" to "") |
||
| Line 1: | Line 1: | ||
{{PropDel}}<br><br>{{subpages}} | {{PropDel}}<br><br>{{subpages}} | ||
'''Link state routing''' is a paradigm for establishing the optimal topology of a network. It uses a distributed computation model, where the direct connections of all | '''Link state routing''' is a paradigm for establishing the optimal topology of a network. It uses a distributed computation model, where the direct connections of all router]]s in a given locality of networks|scope]] is flooded to all the other routers in that scope. Each then computes the shortest path to destinations from its position and connections. | ||
For reasons of scaling, networks using link state routing, when of any appreciable size, use a hierarchical model, such that routers exist in a set of scopes, usually called '''areas''', of which they know the complete topology. They also know how to get to some shared backbone, through which all or most inter-area traffic passes. The routing domain also may have means of finding routers that can connect to destinations external to the domain. | For reasons of scaling, networks using link state routing, when of any appreciable size, use a hierarchical model, such that routers exist in a set of scopes, usually called '''areas''', of which they know the complete topology. They also know how to get to some shared backbone, through which all or most inter-area traffic passes. The routing domain also may have means of finding routers that can connect to destinations external to the domain. | ||
Revision as of 15:18, 30 March 2024
| This article may be deleted soon. | ||
|---|---|---|
 Link state routing is a paradigm for establishing the optimal topology of a network. It uses a distributed computation model, where the direct connections of all router]]s in a given locality of networks|scope]] is flooded to all the other routers in that scope. Each then computes the shortest path to destinations from its position and connections. For reasons of scaling, networks using link state routing, when of any appreciable size, use a hierarchical model, such that routers exist in a set of scopes, usually called areas, of which they know the complete topology. They also know how to get to some shared backbone, through which all or most inter-area traffic passes. The routing domain also may have means of finding routers that can connect to destinations external to the domain. |
||
