Finding information in a peer-to-peer system cur- rently requires either a costly and vulnerable central in- dex, or flooding the network with queries. In this pa- per we introduce the concept of Routing Indices (RIs), which allow nodes to forward queries to neighbors that are more likely to have answers. If a node cannot an- swer a query, it forwards the query to a subset of its neighbors, based on its local RI, rather than by select- ing neighbors at random or by flooding the network by forwarding the query to all neighbors. We present three RI schemes: the compound, the hop-count, and the ex- ponential routing indices. We evaluate their perfor- mance via simulations, and find that RIs can improve performance by one or two orders of magnitude vs. a flooding-based system, and by up to 100% vs. a ran- dom forwarding system. We also discuss the tradeos between the dierent RI schemes and highlight the ef- fects of key design variables on system performance.