DOI QR코드

DOI QR Code

A Nearly Optimal One-to-Many Routing Algorithm on k-ary n-cube Networks

  • Received : 2018.03.06
  • Accepted : 2018.05.21
  • Published : 2018.06.30

Abstract

The k-ary n-cube $Q^k_n$ is widely used in the design and implementation of parallel and distributed processing architectures. It consists of $k^n$ identical nodes, each node having degree 2n is connected through bidirectional, point-to-point communication channels to different neighbors. On $Q^k_n$ we would like to transmit packets from a source node to 2n destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $0{\leq}i{\leq}2n-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(n^3)$ routing algorithm on $Q^k_n$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.

Keywords

References

  1. Yali Lv, Jianxi Fan, D. Frank Hsu, Cheng-Kuan, "Structure connectivity and substructure connectivity of k-ary n-cube networks," Information Sciences, vol. 433, pp. 115-124, 2018.
  2. Y. Chen, S. Promparmote, F. Maire, "MDSM: Microarray database schema matching using the Hungarian method," Information Sciences, vol. 176, pp. 2771-2790, 2006. https://doi.org/10.1016/j.ins.2005.11.015
  3. D. Choi, O. Lee, I. Chung, "A parallel routing algorithm on recursive cube of rings networks employing Hamiltonian circuit Latin square," Information Sciences, vol. 178, pp. 1533-154, 2008.1 https://doi.org/10.1016/j.ins.2007.10.028
  4. I. Chung, "Application of the Special Latin Squares to the Parallel Routing Algorithm on Hypercube," J. of Korea Information Sciences Society, vol. 19, pp. 569-578, 1992.
  5. H. Kuhn, "The Hungarian Method for the Assignment Problem," Naval Res. Logist. Quart., vol. 2, pp. 83-97, 1995.
  6. H.S. Stone, Discrete Mathematical Structures and Their Applications, SRA, Chicago, 1973.
  7. Hee Kyoung Seo, "Development of component architecture to support IoT management," Smart Media Journal, Vol. 6, No. 2, pp.42-49, 2017
  8. Shiying Wang, Weiping Han, "The g-good-neighbor conditional diagnosability of n-dimensional hypercubes under the $MM{\square}$ model," Information Processing Letters, vol. 116, pp. 574-577, 2016. https://doi.org/10.1016/j.ipl.2016.04.005
  9. S. Zhang, X. Zhang, "Fault-free Hamiltonian cycles passing through prescribed edges in k-ary n-cubes with faulty edges," IEEE Trans. Parallel and Distributed Systems, vol. 26, pp. 434-443, 2015. https://doi.org/10.1109/TPDS.2014.2311794