Routing information management for content oriented networks using Bloom Filters

Content oriented networks are proposed as a new network architecture that does not rely on IP addresses. In these networks, content queries are routed based on the content name itself instead of a destination address. However, one problem is the increased memory usage that occurs with content oriented networks. 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 has attracted attention because it employs a routing scheme using Bloom filters, which are data structures capable of compressing data. However, this technique can-not cope with content that moves or is deleted. To solve this problem, we propose a method that can cope with moving or deleted content by using two bloom filters. Simulations we conducted to evaluate the proposed scheme indicated the method was more effective than two other schemes.