Abstract
Interconnection networks are emerging as an approach to solving system-level communication problems. An interconnection network is a programmable system that serves to transport data or messages between components/terminals in a network system. The hypercube is one of the most widely studied network structures for interconnecting a huge number of network components so that it is usually considered as the fundamental principle and method of network design. The unidirectional hypercube, which was proposed by Chou and Du (1990), is obtained by orienting the direction of each edge in the hypercube. Routing is crucial for almost all aspects of network functionalities. In this paper, we propose a dimension-ordered shortest-path routing scheme for unidirectional hypercubes and then analyze the incurred channel congestion from a worst-case point of view.
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
References
Akers, S.B., Krishnamurthy, B.: A group theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38(4), 555–566 (1989)
Andrews, M., Chuzhoy, J., Guruswami, V., Khanna, S., Talwar, K., Zhang, L.: Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. Combinatorica 30(5), 485–520 (2010)
Aroca, J.A., Anta, A.F.: Bisection (band)width of product networks with application to data centers. IEEE Trans. Parallel Distrib. Syst. 25(3), 570–580 (2014)
Chang, C.-P., Sung, T.-Y., Hsu, L.-H.: Edge congestion and topological properties of crossed cubes. IEEE Trans. Parallel Distrib. Syst. 11(1), 64–80 (2000)
Chekuri, C., Khanna, S., Shepherd, F.B.: Edge-disjoint paths in planar graphs with constant congestion. SIAM J. Comput. 39(1), 281–301 (2009)
Cheng, E., Lindsey, W.A., Stey, D.E.: Maximal vertex-connectivity of \(S_{n, k}\). Networks 46, 154–162 (2005)
Cheng, E., Lipman, M.J.: On the Day-Tripathi orientation of the star graphs: connectivity. Inf. Process. Lett. 73, 5–10 (2000)
Cheng, E., Lipman, M.J.: Orienting split-stars and alternating group graphs. Networks 5, 139–144 (2000)
Chern, S.C., Jwo, J.S., Tuan, T.C.: Uni-directional alternating group graphs. In: Lecture Notes in Computer Science, vol. 959, pp. 490–495 (1995)
Chou, C.H., Du, D.H.C.: Unidirectional hypercubes. In: Proceedings of the Supercomputing 1990, pp. 254–263 (1990)
Dally, W.J., Towles, B.: Principles and Practices of Interconnection Networks. Morgan Kaufmann, San Francisco (2004)
Day, K., Tripathi, A.: Arrangement graphs: a class of generalized star graphs. Inf. Process. Lett. 42(5), 235–241 (1992)
Day, K., Tripathi, A.: Unidirectional star graphs. Inf. Process. Lett. 45, 123–129 (1993)
Efe, K.: The crossed cube architecture for parallel computing. IEEE Trans. Parallel Distrib. Syst. 3, 513–524 (1992)
Fiduccia, C.M., Hedrick, P.J.: Edge congestion of shortest path systems for all-to-all communication. IEEE Trans. Parallel Distrib. Syst. 8(10), 1043–1054 (1997)
Flahive, M., Bose, B.: The topology of Gaussian and Eisenstein-Jacobi interconnection networks. IEEE Trans. Parallel Distrib. Syst. 21(8), 1132–1142 (2010)
Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays \(\cdot \) Trees \(\cdot \) Hypercubes. Morgan Kaufmann, San Mateo (1992)
Li, T.-K., Tan, J.J.M., Hsu, L.-H., Sung, T.-Y.: Optimum congested routing strategy on twisted cubes. J. Interconnection Netw. 1(2), 115–134 (2000)
Loh, P.K.K., Hsu, W.J., Pan, Y.: The exchanged hypercube. IEEE Trans. Parallel Distrib. Syst. 16(9), 866–874 (2005)
MartÃnez, C., Beivide, R., Stafford, E., Moretó, M., Gabidulin, E.M.: Modeling toroidal networks with the Gaussian integers. IEEE Trans. Comput. 57(8), 1046–1056 (2008)
Ostrovskii, M.I.: Minimal congestion trees. Discrete Math. 285, 219–226 (2004)
Saad, Y., Shultz, M.H.: Topological properties of hypercubes. IEEE Trans. Comput. 37, 867–872 (1988)
Xu, J.-M.: Topological Structure and Analysis of Interconnection Networks. Kluwer Academic Publishers, Dordrecht/Boston/London (2001)
Acknowledgements
This work is supported in part by the Ministry of Science and Technology, Taiwan, under Grands No: MOST 105-2221-E-468-015 and MOST 106-2221-E-468-003. The authors also gratefully acknowledge the helpful comments and suggestions of the reviewers, which have improved the quality of this paper significantly.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Kung, TL., Hung, CN., Teng, YH. (2019). On the Channel Congestion of the Shortest-Path Routing for Unidirectional Hypercube Networks. In: Barolli, L., Xhafa, F., Javaid, N., Enokido, T. (eds) Innovative Mobile and Internet Services in Ubiquitous Computing. IMIS 2018. Advances in Intelligent Systems and Computing, vol 773. Springer, Cham. https://doi.org/10.1007/978-3-319-93554-6_59
Download citation
DOI: https://doi.org/10.1007/978-3-319-93554-6_59
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-93553-9
Online ISBN: 978-3-319-93554-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)