A data processing method, applied to a named data networking, NDN, system and comprising: when data is received, obtaining, by a local end router, a priority attribute of the data; setting, by the local end router, a life cycle attribute for the data according to a correspondence between the priority attribute and the life cycle attribute; and storing, by the local end router, in a local cache, the data having the life cycle attribute, wherein the life cycle attribute comprises a first life cycle and a second life cycle, wherein the second life cycle is longer than the first life cycle, characterized in that the storing, in a local cache, the data having the life cycle attribute comprises: determining, according to a size of the data, that the local cache does not have storage space used for storing the data; releasing storage space of the local cache according to a life cycle attribute of existing data in the local cache; and storing, in the local cache, the data having the life cycle attribute, wherein the releasing storage space of the local cache according to a life cycle attribute of existing data in the local cache comprises: generating a first replacement queue and a second replacement queue by using a preset replacement algorithm according to the life cycle attribute of the existing data in the local cache, wherein the first replacement queue comprises data of which a life cycle attribute is the first life cycle in the local cache, and the second replacement queue comprises data of which a life cycle attribute is the second life cycle in the local cache; and if a size of the data to be cached is less than or equal to a total sum of sizes of all data in the first replacement queue, deleting existing data in the first replacement queue according to the size of the data; or if the size of the data to be cached is greater than the total sum of sizes of all the data in the first replacement queue, deleting all the data in the first replacement queue, and deleting existing data in the second replacement queue according to a difference between the size of the data and the total sum of sizes of all the data in the first replacement queue. when data is received, obtaining, by a local end router, a priority attribute of the data; setting, by the local end router, a life cycle attribute for the data according to a correspondence between the priority attribute and the life cycle attribute; and storing, by the local end router, in a local cache, the data having the life cycle attribute, wherein the life cycle attribute comprises a first life cycle and a second life cycle, wherein the second life cycle is longer than the first life cycle, characterized in that the storing, in a local cache, the data having the life cycle attribute comprises: determining, according to a size of the data, that the local cache does not have storage space used for storing the data; releasing storage space of the local cache according to a life cycle attribute of existing data in the local cache; and storing, in the local cache, the data having the life cycle attribute, determining, according to a size of the data, that the local cache does not have storage space used for storing the data; releasing storage space of the local cache according to a life cycle attribute of existing data in the local cache; and storing, in the local cache, the data having the life cycle attribute, wherein the releasing storage space of the local cache according to a life cycle attribute of existing data in the local cache comprises: generating a first replacement queue and a second replacement queue by using a preset replacement algorithm according to the life cycle attribute of the existing data in the local cache, wherein the first replacement queue comprises data of which a life cycle attribute is the first life cycle in the local cache, and the second replacement queue comprises data of which a life cycle attribute is the second life cycle in the local cache; and if a size of the data to be cached is less than or equal to a total sum of sizes of all data in the first replacement queue, deleting existing data in the first replacement queue according to the size of the data; or if the size of the data to be cached is greater than the total sum of sizes of all the data in the first replacement queue, deleting all the data in the first replacement queue, and deleting existing data in the second replacement queue according to a difference between the size of the data and the total sum of sizes of all the data in the first replacement queue. generating a first replacement queue and a second replacement queue by using a preset replacement algorithm according to the life cycle attribute of the existing data in the local cache, wherein the first replacement queue comprises data of which a life cycle attribute is the first life cycle in the local cache, and the second replacement queue comprises data of which a life cycle attribute is the second life cycle in the local cache; and if a size of the data to be cached is less than or equal to a total sum of sizes of all data in the first replacement queue, deleting existing data in the first replacement queue according to the size of the data; or if the size of the data to be cached is greater than the total sum of sizes of all the data in the first replacement queue, deleting all the data in the first replacement queue, and deleting existing data in the second replacement queue according to a difference between the size of the data and the total sum of sizes of all the data in the first replacement queue.