Abstract
In this paper we propose a new design for rearrangeable multicast switching networks, which uses the minimum number of intermediate nodes and a comparable number of switches. The newly designed 3-stage N×N switching network has the minimum 2N intermediate nodes and O(N 5/3) switches and an efficient routing algorithm, while the best known wide-sense nonblocking (and hence rearrangeable) multicast 3-stage network uses O(N logN/loglogN) intermediate nodes and O(N 3/2 logN/loglogN) switches. The new design is constructed by adding switches to a rearrangeable unicast Clos network. The design and analysis of the design is done by a combinatorial approach, which represents a switching network as a multistage bipartite graph, and the middle stage as bipartite switch box, and routing requirements as hypergraph. The new routing algorithm is done by the edge ordering of regular hypergraphs, a technique originated from job scheduling.
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
Barany, I.: A Vector-Sum Theorem and Its Application to Improving Flow Guarantees. Mathematics of Operations Research 6, 445–455 (1981)
Chang, Y.W., Wong, D.F., Wong, C.K.: Universal Switch Modules for FPGA Design. ACM Transactions on Design Automation of Electronic Systems 1(1), 80–101 (1996)
Clos, C.: A Study of Nonblocking Switching Networks. Bell Systems Technical J. 22, 406–424 (1953)
Dolev, D., Dwork, C., Pippenger, N., Wigderson, A.: Superconcentrators, Generalizers and Generalized Connectors with Limited Depth. In: STOC, pp. 42–51 (1983)
Fan, H., Liu, J., Wu, Y.L.: General Models and a Reduction Design Technique for FPGA Switch Box Designs. IEEE Transactions on Computers 52(1), 21–30 (2003)
Fan, H., Wu, Y.L., Cheung, C., Liu, J.: Decomposition Design Theory and Methodology for Arbitrary-Shaped Switch Boxes. IEEE Transactions on Computers 55(4), 373–384 (2006)
Hall, P.: On Representatives of Subsets. J. London Math. Soc. 10, 26–30 (1935)
Hawang, F.K.: The Mathematical Theory of Nonblocking Switching Networks. World Scientific Publishing Co., Inc., River Edge (2004)
Hwang, F.K.: Rearrangeahility of Multiconnection Three-Stage Networks. Networks 2, 301–306 (1972)
Masson, G.M., Jordan, B.W.: Generalized Multi-Stage Connection Networks. Networks 2, 191–209 (1972)
Sevast’yanov, S.V.: On Approximate Solutions of Scheduling Problems. Metody Discretnogo Analiza 32, 66–75 (1978)
Yang, Y., Masson, G.M.: Nonblocking Broadcast Switching Networks. IEEE Trans. Comput. 40(9), 1005–1015 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fan, H., Wu, YL. (2009). A New Approach for Rearrangeable Multicast Switching Networks. In: Du, DZ., Hu, X., Pardalos, P.M. (eds) Combinatorial Optimization and Applications. COCOA 2009. Lecture Notes in Computer Science, vol 5573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02026-1_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-02026-1_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02025-4
Online ISBN: 978-3-642-02026-1
eBook Packages: Computer ScienceComputer Science (R0)