Smart Media Journal (스마트미디어저널)

THE KOREAN INSTITUTE OF SMART MEDIA (한국스마트미디어학회)
권호 표지

Design of an efficient routing algorithm on the WK-recursive network

  • Received : 2022.07.26
  • Accepted : 2022.09.06
  • Published : 2022.10.31
Download PDF
⟨ Previous Next ⟩

Abstract

The WK-recursive network proposed by Vecchia and Sanges[1] is widely used in the design and implementation of local area networks and parallel processing architectures. It provides a high degree of regularity and scalability, which conform well to a design and realization of distributed systems involving a large number of computing elements. In this paper, the routing of a message is investigated on the WK-recursive network, which is key to the performance of this network. We present an efficient shortest path algorithm on the WK-recursive network, which is simpler than Chen and Duh[2] in terms of design complexity.

Keywords

Acknowledgement

This study was supported by research fund from Chosun University, 2022.

References

  1. G. Vecchia, C. Sanges, "A recursively scalable network VLSI implementation," Future Generation Computer System, Vol. 4, No. 3, pp. 235-243, Oct. 1988. https://doi.org/10.1016/0167-739X(88)90007-6
  2. G. Chen, D. Duh, "Topological Properties, Communication, and Computation on WK-Recursive Networks," Networks, Vol. 24, No. 6, pp. 303-317, Sep. 1994. https://doi.org/10.1002/net.3230240602
  3. Lantao You, Jianxi Fan, Yuejuan Han, "Super spanning connectivity on WK-recursive networks," Theoretical Computer Science, Vol. 713, No. 22, pp. 42-55, Feb. 2018. https://doi.org/10.1016/j.tcs.2017.12.023
  4. S. Tang, Y. Wang, C. Li, "Generalized recursive circulant graphs," IEEE Transactions on Parallel and. Distributed Systems, Vol. 23, No. 1, pp. 87-93, Jan. 2012. https://doi.org/10.1109/TPDS.2011.109
  5. I. Chung, "Design of a set of one-to-many node-disjoint and nearly shortest paths on recursive circulant networks," Journal of Korea Multimedia Soci ety, Vol. 16, No. 7, pp. 897-903, Jul. 2013. https://doi.org/10.9717/kmms.2013.16.7.897
  6. Fu-Hsing Wang, Shuo-I Wang, "Independent spanning trees on WK-recursive networks and WK-recursive pyramids," The Journal of Supercomputing, Vol. 78, pp. 9879-9906, Jan. 2022. https://doi.org/10.1007/s11227-021-04296-0
  7. M. Farahabady, N. Imani, H. Sarbazi-Azad, "Some topological and combina torial properties of WK-recursive mesh and WK-pyramid interconnection networks," Journal of Systems Architecture, Vol. 54, No. 10, pp. 967-976, Oct. 2008. https://doi.org/10.1016/j.sysarc.2008.04.005
  8. Jung-Sheng Fu, "Hamiltonian connectivity of the WK-recursive network with faulty nodes," Information Science, Vol. 178, No. 12, pp. 2573-2584, Jun. 2008. https://doi.org/10.1016/j.ins.2008.02.011
  9. S. Basse, "Computer Algorithms : Introduction to Design and Analysis," Addition-Wesley, Reading, MA, 1978.
  10. W. Stallings, "Data and Computer Communications. Macmillan Publishing Company," Pearson, 1985.
  11. S.L. Johnson and C-T. Ho, "Optimum Broadcasting and Personalized Com munication in Hypercube," IEEE Transactions on Computers, Vol. 38, No. 9, pp. 1249-1268, Sep. 1989. https://doi.org/10.1109/12.29465