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

• 발행기관: 한국스마트미디어학회
• 저자명: Dongmin Choi Ilyong Chung
• 간행물 정보: 『스마트미디어저널』Vol7, No.2, 9~14쪽, 전체 6쪽
• 주제분류: 공학 > 컴퓨터학
• 파일형태: PDF
• 발행일자: 2018.06.30

영문 초록

The k-ary n-cube is widely used in the design and implementation of parallel and distributed processing architectures. It consists of identical nodes, each node having degree is connected through bidirectional, point-to-point communication channels to different neighbors. On we would like to transmit packets from a source node to destination nodes simultaneously along paths on this network, the packet will be transmitted along the path, where . In order for all packets to arrive at a destination node quickly and securely, we present an O( ) routing algorithm on 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.

목차

I. INTRODUCTION

II. DESIGN OF THE SHORTEST PATH

III. A ONE-TO-MANY PARALLEL ROUTING ALOGITHM ON

IV. CONCLUSION

키워드

k-ary n-cube network node-disjoint paths parallel routing algorithm Hungarian method