This paper presents a set of deadlock-free routing constraints in hypercubes based on the buffer technique, and describes their corresponding deadlock-free routing algorithms. The performance evaluation shows that the routing efficiency is dependent on both self-adaptability and complexity of the algorithms.