In this paper, we propose a cycle-based rerouting scheme (CRS) for link restoration in wavelength-routed WDM networks. The CRS is based on a scalable set of P-cycles covering a mesh network. Instead of using these P-cycles as enhanced self-healing rings as in traditional approaches, the CRS decomposes these P-cycles into rerouting paths for the links that the P-cycles cover. In this way, flexible and cost-effective link restoration is achieved. Simulation results show that the rerouting performance of the CRS can be very close to the theoretical upper bound.