RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 1980 Volume 16, Issue 4, Pages 94–98 (Mi ppi1467)

Ņorrespondence

Asymptotically Optimal Batch Rearrangeable and Nonrearrangeable Switching Circuits

L. A. Bassalygo, M. S. Pinsker


Abstract: Unlike single switching circuits, where pairwise (single) connections of sites are established only, batch switching circuits allow one to establish connections between sites and groups of sites. We show how the former circuits can be used for constructing the latter ones, without a significant increase in the number of switching nodes.

UDC: 621.395.34:519.2

Received: 24.08.1979



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025