Generalized multi‐stage connection networks

Networks - Tập 2 Số 3 - Trang 191-209 - 1972
Gerald M. Masson1, B. W. Jordan2
1University of Pittsburgh, Pittsburgh, Pennsylvania
2Northwestern University, Evanston, Illinois

Tóm tắt

AbstractThis paper develops multi‐stage connection networks in which each input terminal can be connected to any number of output terminals. Conditions are given such that these networks are strictly nonblocking or are rearrangeable. Rearrangement algorithms and upper bounds on the required number of moves are developed and it is shown that such networks have fewer cross‐points than the product of input and output terminals for a sufficiently large number of input and output terminals.

Từ khóa


Tài liệu tham khảo

10.1002/j.1538-7305.1953.tb01433.x

Beneš V. E., 1965, Mathematical Theory of Connecting Networks and Telephone Traffic

10.1002/j.1538-7305.1962.tb03990.x

Duguid A. M. “Structural Properties of Switching Networks ”Brown University Progress Report BTL‐7 1959.

10.1002/j.1538-7305.1962.tb00478.x

Masson G. M.andJordan B. W. “Realization of a Class of Multiple Connection Assignments With Asymmetrical Three‐Stage Connection Networks ”Proc. Fifth Ann. Princeton Conf. on Information Sciences and Systems 1971.

10.1112/jlms/s1-10.37.26

10.2307/2309032

Thông tin
Thông tin xuất bản

Networks

Tập 2 Số 3

191-209

Thông tin tác giả