30 likes | 178 Vues
This module provides an overview of routing information management through routing tables, which can be updated manually or automatically. It covers distance vector algorithms, which share tables with neighbors, and link-state algorithms, which maintain a topology database for routers to understand distant connections. It also discusses hybrid routing algorithms that integrate both approaches. Key routing protocols such as RIP for small networks, EIGRP for diverse topologies, and OSPF for classless link-state routing are highlighted, along with the use of Variable Length Subnet Masks (VLSMs).
E N D
Module Summary • Routing information takes the form of entries in a routing table, with one entry for each identified route. The routing table can be updated manually or automatically to accommodate network changes. • Distance vector routing algorithms enable each router to send all or some portion of its routing table to its neighbors. • Link-state routing algorithms maintain a complex database of topology information, which routers use to maintain full knowledge of distant routers. Balanced hybrid routing algorithms combine aspects of both distance vector and link-state routing.
Module Summary (Cont.) • RIP is used in small, homogeneous networks. • EIGRP is used in many different topologies and media. EIGRP provides quick convergence times with minimal overhead. • OSPF is a classless link-state routing protocol that is widely deployed in many networks. • VLSMs allow multiple levels of subnetworked IP addresses within a single network.