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

• 영문명: Design of an efficient routing algorithm on the WK-recursive network
• 발행기관: 한국스마트미디어학회
• 저자명: 정일용
• 간행물 정보: 『스마트미디어저널』Vol11, No.9, 39~46쪽, 전체 8쪽
• 주제분류: 공학 > 컴퓨터학
• 파일형태: PDF
• 발행일자: 2022.10.31

영문 초록

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

키워드

Routing Algorithm Design of algorithm Parallel computer architecture WK-recursive Networks