ed instead of being routed as it would normally. Here's an example of packets that did not match the route map and, as such, were routed normally: 04:52:35: IP: s=10.209.0.2 (FastEthernet0/1), d=10.201.0.1, len 100, FIB policy rejected(no match) - normal forwarding 04:52:35: IP: s=10.209.0.2 (FastEthernet0/1), d=10.201.0.1, len 100, FIB policy rejected(no match) - normal forwarding 04:52:35: IP: s=10.209.0.2 (FastEthernet0/1), d=10.201.0.1, len 100, FIB policy rejected(no match) - normal forwarding 04:52:35: IP: s=10.209.0.2 (FastEthernet0/1), d=10.201.0.1, len 100, FIB policy rejected(no match) - normal forwarding 04:52:35: IP: s=10.209.0.2 (FastEthernet0/1), d=10.201.0.1, len 100, FIB policy rejected(no match) - normal forwarding Again, I've highlighted the entry for a single packet. This time, we see the phrase FIB policy rejected( match) - normal forwarding, which indicates that the packet did not match any clauses in the route map and was forwarded by normal means. See Chapter 11 for another example of route maps in action. Policy Routing Example CHAPTER 15 Switching Algorithms in Cisco Routers The term switching, when used in the context of routers, describes the process of mov- ing packets from one interface to another within a router. Packets in transit arrive at one interface and must be moved to another, based on routing information stored in the router. Routing is the process of choosing paths and forwarding packets to destinations outside the physical router. Switching is the internal forwarding of packets between interfaces. Just as there are different routing protocols for determining the external paths for packets, there are different internal methods for switching. These switching algorithms, or paths, are a valuable way to increase (or decrease) a router's performance. One of the biggest factors in how fast a packet gets from its source to its destination is the processing delay present in each router along the way. Different switching methods have vastly different impacts on a router's performan