FOAF routing refers to routing based on the locations of Friends Of A Friend, rather than the locations of friends (peers). Without FOAF routing, nodes forward incoming requests that they are unable to satisfy to the peer (friend) whose location is closest to the request location. With FOAF routing, the node routes to the peer who has the peer with the closest location. Instead of a pure greedy optimization, it looks one hop ahead. Simulations and theoretical work suggest that FOAF routing should find shorter routes and therefore be more efficient.
