INF4032 Networking: Routing Concepts

RIP uses the number of hops as a metric to determine the best route.

OSPF uses a cost based on cumulative bandwidth to determine the best route.

EIGRP uses bandwidth, delay, load, and reliability to determine the best route.

A dynamic routing protocol allows routers to learn about networks and update their routing tables automatically.

A router uses dynamic routing protocols to exchange routing information with other routers on the network.

A router learns about directly connected networks by adding the IP addresses of its interfaces to its routing table.

A router uses routing updates to discover remote networks and update its routing table.

When a router starts up, it uses its configuration to learn about its directly connected networks and then begins to exchange routing updates with other routers.

The shortest path and total cost to reach identified destinations from R4's perspective. This table is used to illustrate how routing protocols like OSPF work.

The process of how link-state routing protocols like OSPF determine the best routes in a network by sharing information about connected networks and link costs.

The initial step where each router learns about its directly connected networks. This sets the stage for the entire link-state routing process.

A message sent by a router to find out whether other routers are present on the same network, effectively establishing a connection.

A connection between two routers that have successfully exchanged Hello packets, confirming they are active neighbors.

A packet containing the state of all links directly connected to a router. It's a key component of the link-state routing process.

The process where routers use their connection status and link costs to build a map of the entire network. This map is used to make informed routing decisions.

The process of sending LSPs across the network to update each router's view of the network topology. This ensures all routers have the latest information about the network.

A distance-vector routing protocol that is easy to configure and uses a hop count metric. It broadcasts routing updates every 30 seconds to all devices on the network using a specific broadcast address.

An enhanced version of RIP that supports features such as variable length subnet masking (VLSM) and Classless Inter-Domain Routing (CIDR). It uses a specific multicast address for updates to reduce network traffic.

The IPv6 version of RIP. It supports a hop count limit of 15 and has an administrative distance of 120.

A Cisco-developed distance-vector routing protocol that uses the DUAL (Diffusing Update Algorithm) for routing decisions.

An enhanced version of IGRP, introduced by Cisco in 1992. It features triggered updates, hello messages for neighbor discovery, a topological table for all routes, and supports multiple network layer protocols.

A method of routing that utilizes link-state information to create a complete map of the network. It allows routers to calculate the optimal paths to destinations based on the current network topology instead of relying on hop counts.

A metric that represents the cost of a route in routing calculations. It is used by routing protocols to determine the best route to a destination.

A table that stores information about all known routes in a network, including their destinations, costs, and next hops. It is used by routing protocols to make routing decisions.

A session between two BGP routers in different autonomous systems (AS). eBGP is used for routing information between different networks.

A session between two BGP routers within the same autonomous system (AS). iBGP is used for routing information within the same network.

A router that can connect to other BGP routers in different autonomous systems.

A group of routers that share the same routing information and policies.

eBGP neighbors must be directly connected. This means that there must be a physical link between the two routers.

A Link-State Packet (LSP) is a message exchanged between routers in a link-state routing protocol. It contains information about the router's directly connected networks, the cost to reach them, and other routing information. LSPs are essential for creating a comprehensive network map and finding the best paths to destinations.

Each router running a link-state protocol creates a Link-State Packet (LSP) that contains information about its directly connected networks and associated costs. It also includes information about any other routers it's aware of.

Once an LSP is created, it is flooded or broadcast to all of the router's neighboring routers. This ensures that all routers have a complete picture of the network topology.

Each router periodically builds and updates its Link-State Database (LSDB). This database contains all of the LSPs received from other routers, effectively creating a complete picture of the network topology.

Link-state routing algorithms, like OSPF, use Dijkstra's algorithm to calculate the shortest path between routers based on the information in the Link-State Database, which is a collection of LSPs.

Link-state routing uses a Shortest Path First (SPF) tree algorithm to calculate the most efficient path to each destination network. SPF tree helps to build a route tree based on shortest paths.

A Link-State Routing protocol's goal is to find the best path for data packets, similar to a GPS system, by building a network map using LSPs and finding the shortest paths with SPF.

The main difference between routing protocols is how they discover network information and share it. Distance Vector routing protocols share information through messages about the distance to destinations, while Link-State protocols share information through network topology maps.

Dijkstra's algorithm is a greedy algorithm that finds the shortest path between two nodes in a graph. It works by iteratively selecting the node with the smallest distance from the source node and updating the distances of its neighbors. The algorithm continues until all nodes have been visited.

The algorithm starts by initializing the distance to the source node to 0 and the distances to all other nodes to infinity. It then creates a set of visited nodes, initially containing only the source node.

The algorithm iteratively selects the node with the smallest distance from the source node that has not been visited yet. It then updates the distances of its neighbors by calculating the distance from the source node through the current node.

The algorithm terminates when all nodes have been visited. The shortest path from the source node to any other node can then be obtained by tracing back through the predecessor nodes.

The algorithm updates the distances of the neighbors of the current node by calculating the sum of the distance to the current node and the distance from the current node to the neighbor. If this sum is smaller than the current distance to the neighbor, the distance to the neighbor is updated.

The algorithm uses a set of visited nodes to keep track of which nodes have already been explored. The set is initially empty and is updated with each iteration of the algorithm.

The algorithm uses a set of unvisited nodes to identify the next node to be visited. The node with the smallest distance from the source node that has not been visited yet is selected.

Dijkstra's algorithm is widely used in network routing, finding the shortest path in a map, and other applications where the optimal path needs to be determined.