Content deleted Content added
m #REDIRECT Routing |
try to give this page a good start |
||
Line 1:
'''Routing tables''' are used in [[computer network]]s to direct [[forwarding]] by matching destination addresses to the network paths used to reach them. The construction of routing tables is the primary goal of [[routing protocols]].
In the simplest model, hop-by-hop routing, each routing table lists, for all reachable destinations, the address of the next device along the path to that destination; the ''next hop''. Assuming that the routing tables are consistent, the simple algorithm of relaying packets to their destination's next hop thus suffices to deliver data anywhere in a network. In practice, hop-by-hop routing is being increasingly abandoned in favor of layered architectures such as [[MPLS]].
The need to record routes to large numbers of devices using limited storage space represents a major challenge in routing table construction. Perhaps the fundamental assumptions of [[routing]] is that similar addresses are located near each other in the network, allowing groups of destination addresses to be matched by single routing table entries. The exact nature of how this grouping is done has changed over time and still represents an active area of networking research. In the Internet, the currently dominant address grouping technology is a bitwise prefix matching scheme called [[Classless Inter-Domain Routing]].
Routing tables must be consistent among the various nodes in a network, or routing loops can develop. This is particularly problematic in the hop-by-hop routing model, since each node may appear to possess a valid routing table, which the net effect of the tables in several different routers is to forward packets in a endless loop. Routing loops have historically plauged routing, and their avoidance is a major design goal of routing protocols.
| |||