The invention discloses a fair caching algorithm and device for content centric networking. The fair caching algorithm for content centric networking comprises: in a process of requesting for interestpackets, the requested interest packets and the times thereof are counted; furthermore, the interest packets are sorted according to the decreasing order of the requesting times; then, the interest packets are stored in an ITT (Interest Times Table), and transmitted to a next node; in a process of sending data, the ITT of the current node is directly assigned to a DTT (Data Times Table) at a dataprovider (a server); furthermore, the DTT is transmitted to other sub-nodes; in a non-data provision node, the DTT is obtained; the caching residual space C of the current node is calculated; previous L entries are cached; furthermore, the fact that the total data size of the L entries is less than or equal to 0.9C can be ensured; after caching is successful, cached entries are deleted from the DTT; sorting is carried out again; and the DTT is transmitted to other sub-nodes. By means of the fair caching algorithm and device for content centric networking disclosed by the invention, the content popularity is defined according to the requesting times; the caching threshold is set; therefore, the data redundancy of the content centric networking is reduced; the hit rate is increased; the hitrate variance is reduced; and thus, the caching fairness is realized.