Ch. 5 - Network Layer (Control Plane) Flashcards
What is OSPF?
Open Shortest Path First; intra-ISP routing protocol.
What is BGP?
Border Gateway Protocol; inter-ISP routing protocol.
What is SNMP?
Simple Network Management Protocol; network management standard.
What is YANG?
Data modeling language for network configuration.
What is NETCONF?
Network configuration protocol for managing devices.
Per-router Control
Traditional method with local routing algorithms.
Logically Centralized Control
SDN approach with remote controller managing routers.
Link State Algorithm
Routing method using complete topology information.
Distance Vector Algorithm
Routing method based on neighbor information exchange.
Dijkstra’s Algorithm
Finds least-cost paths in a network graph.
Link Cost
Cost associated with a direct link between routers.
Graph Abstraction
Modeling network as nodes (routers) and edges (links).
Routing Protocol Goal
Determine optimal paths through a network of routers.
Message Complexity
Total messages exchanged during routing updates.
Oscillations in Routing
Route instability due to changing link costs.
Cost Definition
Determined by network operator; affects routing decisions.
Routing Algorithm Classification
Categorizes algorithms based on information availability.
Network Management
Processes for configuring and monitoring network devices.
Routing Among ISPs
BGP handles routing between different Internet Service Providers.
Intra-ISP Routing
OSPF manages routing within a single ISP.
Control Plane Roadmap
Outline of topics in network layer control plane.
Routing Path
Sequence of routers packets traverse to reach destination.
Link State
Routing protocol that maintains a complete network map.
Distance Vector
Routing protocol based on neighbor distance estimates.
NETCONF/YANG
Protocols for network configuration and management.
Bellman-Ford Equation
Calculates least-cost paths in distance vector routing.
Dynamic Programming
Method used in Bellman-Ford for optimization.
Convergence
When distance vector estimates stabilize.
Local Link Cost Change
Change in cost of a direct link.
DV Update Message
Message sent to update distance vector estimates.
Distance Vector Example
Illustration of distance vector calculations.
Iteration
Process of updating distance vectors repeatedly.
Neighbor Notification
Informing neighbors of distance vector changes.
Local Distance Vector
Node’s current estimate of distances to neighbors.
Cost Calculation
Determining the least cost to reach a node.
Convergence Time
Time taken for all routers to agree on routing.
Count-to-Infinity Problem
Routing issue where incorrect cost circulates indefinitely.
Link-State Protocol
Routing protocol where routers share complete network state.
Routing Loop
Situation where packets circulate endlessly in the network.
Administrative Autonomy
Control over routing policies by individual network admins.
Path Vector Protocol
Routing protocol where paths to destinations are advertised.
