On switching networks with rearrangement or repacking

This paper deals with recent results on non-blocking three-stage switching networks with rearrangement or repacking. Simple reswitching algorithms are suggested which are applicable in systems where several connections can be reswitched simultaneously as well as in systems where connections can only be reswitched sequentially, i.e., one at a time. Furthermore, an efficient class of networks with repacking is presented where new calls can always be switched immediately, i.e., without preceding reswitching of existing connections.