Although the encryption of network packets significantly increases privacy, the density of the raffic can still provide useful information to the observer, and maybe results in the breach of confidentiality. In this paper, we address issues related to hiding information in self-similar network, which is proved to be similar with modern communication network. And a statistical hiding algorithm is proposed for traffic padding. The figures and the comparison of Hurst Parameters before and after traffic padding, show the effective performance of the algorithm.