论文信息 - On rearrangeable three-stage connecting networks

On rearrangeable three-stage connecting networks

A class of three-stage connecting networks proven rearrangeable by D. Slepian is considered. Bounds on the number of calls that must be moved are obtained by some simple new methods.

V. Benes

[1] Charles Clos,et al. A study of non-blocking switching networks , 1953 .

[2] D. Gale. A theorem on flows in networks , 1957 .

[3] V. E. Benes,et al. Algebraic and topological properties of connecting networks , 1962 .

[4] M. Paull. Reswitching of connection networks , 1962 .