Instead of assuming full loaded cells， dynamic traffic is considered。

BSs and users are spatially distributed based on two mutually independent Poisson point processs （PPPs）， respectively。 Requests of each user are trigged based on Poisson process。 Users request packets from library C。 Packet popularity distribution F。 Requests queue in the infinite buffer。 A part of users are cache-enabled。

The probability mass function of the number of users in the coverage of a BS is derived。 the probabilities of full-load， free-load and modest-load is calculated。 the packet loss rate is analyzed。