We propose a fault tolerant routing with its extensions based on a limited global information in dual-cube networks. It is based on an early work of Wu?s safety level and safety vector in cube networks. An r -connected dual-cube network consists of 2^{r +1} connected r-cubes (also called clusters). First, a depth-first search routing based on neighbor (fault) information is provided. And then, it is extended by using our limited global information model. We use limited-safety-level and limited-safety-vector to represent our limited global information in dual-cubes. Unlike many traditional models that assume all the nodes know global fault distribution, our routing needs only several rounds of neighbor information exchanges. The simulation results show the information model can help the routing process to generate a minimal path (or a sub-minimal path). Our results can be extended to dynamic systems and other cluster networks.