The recursive circulant network G(N,d) can be widely used in the design and implementation of parallel processing architectures. It consists of N identical nodes, each node is connected through bidirectional, point-to-point communication channels to different neighbors by jumping d i , where 0 ≤ i ≤ ⌈logd N⌉− 1. In this paper, we investigate the routing of a message on G(2 m ,4), a special kind of RCN, that is key to the performance of this network. On G(2 m ,4) we would like to transmit k packets from a source node to k destination nodes simultaneously along paths on this network, the i th packet will be transmitted along the i th path, where 1≤k≤m−1, 0≤i