In this paper, we present a hierarchical butterfly communication model, which is applied to an asynchronous distributed ADMM algorithm. The goal is to minimize the communication overhead of the distributed ADMM algorithm in the fully connected network. We give a theoretical analysis of the convergence of the algorithm with hierarchical butterfly communication model. Experiments show that hierarchical butterfly communication model does not have a great impact on the convergence of the algorithm with the increase of computing nodes and thus effectively improve the performance and scalability of the algorithm.