Path Vector Routing
Key Points
- Uses path information in route advertisements
- Supports inter-domain routing decisions
- Helps prevent routing loops
- Foundation for BGP-like behavior
- Enables policy-based route acceptance and filtering
Definition
Path Vector Routing is a routing method in which route advertisements include path information so routers can make policy-based decisions and avoid loops.
Concept
Path Vector Routing is a networking term used for routing methods that carry the path a route has taken in its advertisements. It exists to support policy decisions and loop avoidance in larger routing domains. It is used in inter-domain routing, especially in BGP-style systems. Path information helps routers understand where a route has been and make better acceptance decisions based on administrative boundaries and operational policies.
Explainer
Path Vector Routing is a routing method in which route advertisements include path information so routers can make policy-based decisions and avoid loops. It works by attaching the history of the route, such as the domains or nodes traversed, so receiving routers can reject loops and apply policy based on the path. It is used in inter-domain routing and is the conceptual basis for BGP-like behavior. Constraints include path attribute length, policy complexity, route filtering, and the administrative boundaries between routing domains. Failure modes include route leaks, policy mistakes, path confusion, and instability if path information is incorrect or misused. Tradeoffs involve better loop avoidance and policy control versus more verbose routing information and more complex decision logic. Path Vector Routing matters because large inter-domain routing systems need to know more than just distance; they need path context. Cross-industry relevance is strong in internet routing, service provider networks, and autonomous system interconnection.