Journal Homepage: www.ijcst.org

Abstract — Content oriented networks have been proposed as a new network architecture that does not rely on IP addresses, and these networks, content queries are routed based on the content name itself instead of a destination address. However, one problem that occurs with content oriented networks is the increased memory usage. This is because a huge amount of content exists in the network, and an entry is created in the routing table for each content item. One technique to address this problem is a routing scheme using Bloom filters, which are data structures capable of compressing data. However, this technique cannot cope with content that is moved or deleted. To solve this problem, we propose a method that can cope with moved or deleted content by using two Bloom filters. Simulations we conducted to evaluate the proposed scheme indicated the method was more effective than conventional schemes