In this paper we study the fault-tolerant routing of Benes network, which is achieved due to the existence 'of redundant switches in the network. The faults considered are stuck~at faults. A 2x2 switch in the network is faulty if it is permanently stuck at one of its two states: straight or cross. We propose an algorithm, which is modified from the Looping Algorithm reported in the literature, to derive the switch setting for the Benes network with stuck-at faults to realize any arbitrary permutation in one pass.