Abstract
If nothing ever changed, this would be a simpler world; not a particularly interesting world but a simpler one. Consider that there are n nodes. These nodes may represent people, computers, ports, or anything that wishes to send and receive information. If node i always wants to communicate with node j, node k with l, and so on, then our data engineering task is simple. We connect i with j, k with l, and so on for the other pairs. But suppose i tired of j and k with l and that i wished to discourse with k andj with l. If so, we would have to disconnect these nodes and then reconnect them. This is motivation for considering the network shown in Figure 13.1.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beneš, V. (1962), On Rearrangeable Three-Stage Connecting Networks, The Bell System Technical Journal, Vol. 41, pp. 1481–1492.
Beneš, V. (1965), Mathematical Theory of Connecting Networks, Academic Press, New York.
Clos, C. (1953), A Study of Nonblocking Switching Networks, The Bell System Technical Journal, Vol. 32, 406–424.
Jajszczyk, A. and J. Rajski (1980), Effects of Choosing the Switches for Rearrangements in Switching Networks, IEEE Transactions on Communications, Vol. 28, pp. 1832–1834.
Jajszczyk, A. (1985), A Simple Algorithm for the Control of Rearrangeable Switching Networks, IEEE Transactions on Communications, Vol. 33, pp. 169–171.
Kappel, J. (1967), Nonblocking and Nearly Nonblocking Multistage Switching Arrays, in Proceedings of the 5th International Teletraffic Congress, pp. 238–241.
Keister, W. (1967), Unpublished work.
Lawrie, D. (1975), Access and Alignment of Data in an Array Processor, IEEE Transactions on Computers, Vol. 24, pp. 1145–1155.
Marcus, M. (1977), The Theory of Connecting Networks and Their Complexity: A Review, Proceedings of the IEEE, pp. 1263–1271.
Melas, C. (1983), Path Rearranging in a Data Switching Network, IEEE Transactions on Communications, Vol. 31, pp. 155 - 157.
Nassimi, D. and S. Sahni, Parallel Algorithms to Set-Up the Beneš Permutation Network, in Proceedings of the Workshop on Interconnection Networks for Parallel and Distributed Processing, pp. 70-71, IEEE Pub. No. 80CH1560-2. Conference date: April 1980.
O’Donnell, M. and C. Smith (1982), A Combinatorial Problem Concerning Processor Interconnection Networks, IEEE Transactions on Computers, Vol. 31, pp. 163’164.
Paull, M. (1962), Reswitching of Connection Networks, The Bell System Technical Journal, Vol. 41, pp. 833–855.
Stone, H. (1971), Parallel Processing with the Perfect Shuffle, IEEE Transactions on Computers, Vol. 20, pp. 153–161.
Waksman, A. (1968), A Permutation Network, Journal of the Association for Computing Machinery, Vol. 15, pp. 159–163.
Wu, C-L. and T-Y. Feng (1981), The Universality of the Shuffle-Exchange Network, IEEE Transactions on Computers, Vol. 30, pp. 324–332.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Plenum Press, New York
About this chapter
Cite this chapter
Hershey, J.E., Rao Yarlagadda, R.K. (1986). Space Division Connecting Networks. In: Data Transportation and Protection. Applications of Communications Theory. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-2195-8_13
Download citation
DOI: https://doi.org/10.1007/978-1-4613-2195-8_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-9290-6
Online ISBN: 978-1-4613-2195-8
eBook Packages: Springer Book Archive