The present research aims to recover network failure in networks with a complicated topology by focusing on tie-sets. A tie-set implies a set of links constituting a loop. The entire network is divided into smaller local units of tie-sets which encompass all network vertices and links. These units realize network management for quick and flexible failure recovery. This paper first introduces the concept of tie-sets, and then proposes a recovery method for single link failures. The latter half of the paper deals with the efficiency of failure recovery in different spanning trees. Since a hypothesis is formed by a numerical evaluation the paper proposes a method of determining a spanning tree for quick link failure recovery.