Distance Vector (RIP) and Link State (OSPF) Routing Protocols

This flashcard set covers key terminology and concepts related to Distance Vector (RIP) and Link State (OSPF) routing protocols.

Distance Vector

A type of routing protocol that knows only the routing information from its neighbors, not the entire network topology.

Link-State Protocol

A routing protocol that maintains a complete map of the network and computes the best path using the Shortest Path First (SPF) algorithm.

Convergence

The process when all routers in a network learn about all the networks attached to their neighbors.

RIP

Routing Information Protocol, a distance vector routing protocol that uses hop count as its metric.

RIPv1 Limitations

Does not support discontiguous networks, Variable Length Subnet Masking (VLSM), or Classless Inter-Domain Routing (CIDR).

Hello Packets

Small packets exchanged between routers to establish and maintain a neighbor relationship in link-state protocols.

Link-State Packet (LSP)

A packet that contains the state of each directly connected link, used in link-state routing protocols.

Broadcasting

The process of sending data packets to all nodes on a network segment, used by RIPv1 to update its routing tables.

Triggered Update

An update that occurs immediately when a router detects a topology change, rather than at regular intervals.

Dijkstra's Algorithm

An algorithm used to find the shortest paths between nodes in a graph, utilized in link-state routing protocols.

Routing Table

A data table stored in a router or a networked computer that lists the routes to particular network destinations.

OSPF

Open Shortest Path First, a link-state routing protocol used for routing IP packets within an intranet.

True or False: Distance Vector protocols maintain a complete map of the entire network topology.

False

True or False: Link-State Protocols utilize the Shortest Path First (SPF) algorithm to compute the best paths.

True

True or False: RIPv1 supports Variable Length Subnet Masking (VLSM).

False

True or False: Hello packets are exchanged in link-state protocols to establish and maintain neighbor relationships.

True

True or False: A Triggered Update occurs at regular, predefined intervals, even without topology changes.

False

True or False: OSPF is an example of a distance vector routing protocol.

False