Skip to search formSkip to main contentSkip to account menu

Content addressable network

Known as: Can 
The Content Addressable Network (CAN) is a distributed, decentralized P2P infrastructure that provides hash table functionality on an Internet-like… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Bootstrapping nodeContent-addressable memoryDistributed hash tableHash table

Broader (1)

Routing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Integrated service discovery architecture for heterogeneous networks
The discovery and management of desired network services present significant challenges for mobile networks. Based on the Service… 
2014
2014
CAN Tree Routing for Content-Addressable Network
We propose a novel topology to improve the routing performance of Content-Addressable Network overlays while minimizing the… 
Review
2010
Review
2010
On hashing techniques in networking systems
With more applications move to the Internet, scalability, both in time and space, has become one of the biggest concerns. There… 
2008
2008
A content-addressable network for similarity join in metric spaces
Similarity join is an interesting complement of the well-established similarity range and nearest neighbors search primitives in… 
2007
2007
KZCAN: A Kautz Based Content-Addressable Network
The topological properties of peer-to-peer (P2P) overlay networks are critical factors that dominate the performance of these… 
2007
2007
FCAN: Fastmap-based Content Addressable Network
The existing DHT-based file storage systems are suffering the problems of being restricted to exact match and lacking semantic… 
2004
2004
TLS: A Tree-Based DHT Lookup Service for Highly Dynamic Networks
The P2P paradigm is increasingly receiving attention in many contexts such as Cooperative Information Systems. In this paper we… 
2004
2004
Kache : Peer-to-Peer Web Caching Using Kelips
To achieve high performance, the emerging generation of Web-based database and Web Services systems will need to take full… 
2004
2004
Distributed algorithms for balanced zone partitioning in content-addressable networks
In this paper, we propose several distributed zone partitioning schemes for content-addressable networks (CAN), that is known as… 
2004
2004
MCAN:A Scalable Modified Content-Addressable Network
A fundamental problem that confronts peer-to-peer application is to efficient locate the node that stored a particular data item… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)