We consider the efficient and robust numerical solution of elliptic problems with jumping coefficients occuring on a network of fractures. These thin geometric structures are resolved by anisotropic trapezoidal elements. We present an iterative solution concept based on a hierarchical separation of the fractures and the surrounding rock matrix. Upper estimates for the convergence rates are independent of the the jump of coefficients and of the width of the fractures and depend only polynomially on the number of refinement steps. The theoretical results are illustrated by numerical experiments
