Route Maps

Route Maps
Route maps are a bit like programs that use a �gif/then/else�h decision-making
capability. They match traffic against certain conditions, and then set specified
options for that traffic. Each statement has a sequence number, statements
are read from the lowest number to highest, and the router stops
reading when it gets a match. The sequence number can be used to insert or
delete statements. Like an access list, there is an implicit �gdeny�h at the end of
each route map; any traffic not matched with a route map statement is
denied. Some uses for route maps include:
�¡ Filtering redistributed routes.Use the route-map keyword in the
redistribute command.
�¡ Policy-based routing.To specify which traffic should be policy
routed, based on very granular controls.
�¡ BGP policy.To control routing updates and to manipulate path attributes.