A Semantic Addressable Network

P2P networks were invented with the idea of sharing resources available on the Internet. Their advantages include robustness in failures, extensive resource-sharing, self-organization, load balancing, data persistence, anonymity, etc. Today structured P2P networks are beginning to become more important because they make subsequent queries more efficient and in an internet like scale, query response time is very important. There are two main types of structured overlays: Distributed Hash Table based (DHT) and non-DHT based networks. HyperCup is an example of a non-DHT based structured overlay which is a symmetric overlay based on hypercubes. It has some problems in scalability from the network traffic point of view. DHT-based systems such as Content Addressable Network (CAN) have received a lot of attention and a lot of research has been done on them but still have a few problems, for example the lost indexing problem in CAN. Each of these two types also has its own advantages. In this paper we present a Semantic Addressable Network (SAN) which is a combination of both types. We will focus on CAN and HyperCup. We group nodes in communities based on their main domain ontology concept. SAN helps solve the following problems: semantic unawareness, unnecessary traffic caused by common broadcast methods, and the lost indexing problem in CAN.