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

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.