You are presented with multiple paper abstracts, alongside the associated literature review and chapter titles. Given the provided information, you are going to do a literature review. Please generate a coherent literature review that synthesizes the content, draws connections between different works, highlights major findings, and identifies any gaps in the existing research.

Literature Review Title: A survey on self‐organized semantic storage 
Chapter Title:  Edutella 
1. Abstract of Cited Paper (BIB001):  We present Tapestry, a peer-to-peer overlay routing infrastructure offering efficient, scalable, location-independent routing of messages directly to nearby copies of an object or service using only localized resources. Tapestry supports a generic decentralized object location and routing applications programming interface using a self-repairing, soft-state-based routing layer. The paper presents the Tapestry architecture, algorithms, and implementation. It explores the behavior of a Tapestry deployment on PlanetLab, a global testbed of approximately 100 machines. Experimental results show that Tapestry exhibits stable behavior and performance as an overlay, despite the instability of the underlying network layers. Several widely distributed applications have been implemented on Tapestry, illustrating its utility as a deployment infrastructure.

Literature Review:
The Edutella system proposes an RDF-based P2P network infrastructure designed from a use case for improved networking between educational institutions BIB001 . Even though the name suggests a conceptual relationship to the unstructured Gnutella protocol, Edutella uses the JXTA framework developed by Sun Microsystems as its networking layer. JXTA in turn is based on the Tapestry concept of a distributed hash table (DHT) in the particular form of a prefix tree (trie)  ). Tapestry provides de-centralized object location using a hash function to map stored objects and participating nodes to an opaque identifier BIB002 . Each node is responsible for resolving a certain hash prefix based on its node identifier. In order to route requests, each node also keeps a list of neighboring nodes and their prefixes.