Master this deck with 21 terms through effective study methods.
Generated from uploaded pdf
A routing algorithm determines the best path for data packets to travel across a network. It makes decisions based on pre-configured information or data obtained from routing protocols.
The required properties include simplicity, robustness, stability, fairness, and optimality. However, some properties may contradict each other, necessitating prioritization.
A routing table maintains records in the format: <Destination(network+mask), outgoing-interface/next_hop, metric>. It uses destination addresses or network prefixes to route packets.
In IP networks, the routing table must be checked for the record that matches the most bits of the destination address to ensure accurate packet routing, which can be a time-consuming process.
Differences include the utilized metric, the level of routers' knowledge of network topology, the scheme of routing information propagation, and the technical implementation of sending routing information.
The two main classes are Distance Vector protocols, which are older and easier to implement, and Link State protocols, which are more complex but offer faster convergence.
In DVA, routers do not have knowledge of the entire network topology; they only know the outgoing interfaces for individual destinations and share this information with neighboring routers.
The Count-to-Infinity problem occurs when routers continuously increase the metric of a route to a destination, leading to incorrect routing information that can propagate indefinitely.
It can be mitigated by limiting the maximum value of a route's metric to a finite value that represents infinity, and by implementing the Split Horizon rule, which prevents routes from being advertised out of the interface they were learned from.
A default gateway serves as an access point or IP router that a networked device uses to send data to a destination outside its local subnet.
Hierarchical routing organizes routers into a hierarchy to reduce the complexity of routing tables and improve scalability, allowing for more efficient routing in large networks.
Route aggregation reduces the number of routes in a routing table by combining multiple routes into a single entry, which simplifies routing and improves efficiency.
A routing protocol is used to exchange routing information between routers, allowing them to dynamically update their routing tables and adapt to changes in the network topology.
Link State protocols maintain a complete view of the network topology and share this information with all routers, leading to faster convergence and more reliable routing compared to Distance Vector protocols.
The scheme of routing information propagation affects how quickly routers learn about changes in the network, influencing the overall convergence time and stability of the routing tables.
The need to check all records in the routing table for each packet can lead to increased latency and reduced performance, especially in large networks with extensive routing tables.
Metrics are used to determine the cost of a route, influencing the decision-making process of routing algorithms to select the most efficient path for data transmission.
Routing protocols achieve fast convergence by quickly disseminating routing information and updating routing tables in response to changes in the network topology.
In packet-switched networks, the routing table is used to determine the next hop for data packets based on their destination addresses, ensuring efficient data delivery.
Using various address prefixes allows for more flexible routing and can optimize the use of IP address space, but it also requires careful management of routing tables.
Prioritizing certain properties is necessary because some properties, such as optimality and robustness, may conflict with each other, requiring a balance based on the specific needs of the network.