상세검색
최근 검색어 전체 삭제
다국어입력
즐겨찾기0
스마트미디어저널 Vol11, No.9.jpg
KCI등재후보 학술저널

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

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

DOI : 10.30693/SMJ.2022.11.9.39
  • 33

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.

Ⅰ. Introduction

Ⅱ. some definitions of the WK-recursive network

Ⅲ. An efficient shortest path routing algorithm on WK-recursive networks

Ⅳ. Conclusion

REFERENCES

로딩중