Hostname: page-component-5c6d5d7d68-txr5j Total loading time: 0 Render date: 2024-08-21T05:35:29.559Z Has data issue: false hasContentIssue false
  • English
  • Français

Rearrangeable three-stage Clos connecting networks

Published online by Cambridge University Press:  24 October 2008

J. P. A. Deutsch
J. P. A. Deutsch
Affiliation:
University of Oxford
Get access Rights & Permissions [Opens in a new window]

Extract

A cross-point switch is a device for connecting members of a set of links L with members of another (disjoint) set of links R. Each link of either set has possible connexions with every member of the other set, but in any actual state each link is connected either with no other links or with exactly one link in the other set. Unconnected links are called idle and connected links busy. A switch with p L-links and q R-links is called a,{p × q}-switch.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 60 , Issue 4 , October 1964 , pp. 939 - 948
Copyright
Copyright © Cambridge Philosophical Society 1964

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

(1)Appleby, J. S., Blake, D. V. and Newman, E. A.Techniques for producing school timetables on a computer and their application to other scheduling problems. Comput. J. 3 (1960/1961).Google Scholar
(2)Benteš, V. E.On rearrangeable 3-stage connecting networks. Bell System Tech. J. 41 (1962).Google Scholar
(3)Clos, C.A study of non-blocking switching networks. Bell System Tech. J. 32 (1953).CrossRefGoogle Scholar
(4)Duguid, A. M.Structural properties of switching networks (Brown University Progress Report BTL-7, 1959).Google Scholar
(5)Gotlieb, C. C. The construction of class-teacher time-tables, from The proceedings of the I.F.I.P. congress (Munich, 1962).Google Scholar
(6)Paull, M. C.Reswitching of connection networks. Bell System Tech. J. 41 (1962).CrossRefGoogle Scholar
(7)Slepian, D.Two theorems on a particular crossbar switching network (unpublished manuscript, 1952; referred to in (2)).Google Scholar