Abstract: This paper presents an adaptive routing algorithm based on the 3D Mesh structure. On the one hand，the algorithm avoids the shortcomings of the dimensional order algorithm， which first goes in a certain direction and then turns，and realizes data packet diversion from multiple directions to avoid congestion at subsequent nodes. On the other hand，based on the idea of the greedy algorithm，the data packet with the least number of hops and the output port with the lowest demand is selected to achieve local optimization. Simulation results show that the throughput of this algorithm is higher and the average end-to-end delay is lower than that of the DOR algorithm in the uniform traffic mode.

Key words: 3D network-on-chip（NoC）, routing algorithm, priority, self-adaption