Results 1 - 10 of 2,588

A Scalable Content-Addressable Network

by Sylvia Ratnasamy , Paul Francis, Mark Handley, Richard Karp, Scott Shenker - IN PROC. ACM SIGCOMM 2001 , 2001
"... Hash tables – which map “keys ” onto “values” – are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems. In this paper, we introduce the concept of a Content-Addressable Network (CAN) as a distributed infra ..."
Abstract - Cited by 3371 (32 self) - Add to MetaCart
Hash tables – which map “keys ” onto “values” – are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems. In this paper, we introduce the concept of a Content-Addressable Network (CAN) as a distributed

A Scalable Content-Addressable Network

by unknown authors
"... In this paper, we define the concept of a Content-Addressable Network; a system that essentially offers the same functionality as a hash table, i.e. it maps ”keys ” to ”values”. The novelty of a hash table in a Content-Addressable Network is that it may span millions of hosts across diverse administ ..."
Abstract - Add to MetaCart
In this paper, we define the concept of a Content-Addressable Network; a system that essentially offers the same functionality as a hash table, i.e. it maps ”keys ” to ”values”. The novelty of a hash table in a Content-Addressable Network is that it may span millions of hosts across diverse

A Scalable Content-Addressable Network

by Ley Richard Karp, Scott Shenker - Proceedings of the ACM SIGCOMM Conference 2001 , 2001
"... Hash tables { which map\keys " onto \values " { are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems. In this paper, we introduce the concept of a Content-Addressable Network (CAN) as a distri ..."
Abstract - Cited by 18 (0 self) - Add to MetaCart
Hash tables { which map\keys " onto \values " { are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems. In this paper, we introduce the concept of a Content-Addressable Network (CAN) as a

Application-Level Multicast Using Content-Addressable Networks

by Sylvia Ratnasamy, Mark Handley, Richard Karp, Scott Shenker , 2001
"... Most currently proposed solutions to application-level multicast organize the group members into an application-level mesh over which a DistanceVector routing protocol, or a similar algorithm, is used to construct source-rooted distribution trees. The use of a global routing protocol limits the s ..."
Abstract - Cited by 372 (8 self) - Add to MetaCart
model to a single source. Our scheme builds on recent work on Content-Addressable Networks (CANs). Extending the CAN framework to support multicast comes at trivial additional cost and, because of the structured nature of CAN topologies, obviates the need for a multicast routing algorithm. Given

On the Implementation of a Content-Addressable Network

by Alexandru Popescu , Dragos Ilie , Demetres Kouvatsos
"... Abstract-Over the last years, the Internet has evolved towards becoming the dominant platform for deployment of new services and applications such as real time and multimedia services, application-level multicast communication and large-scale data sharing. A consequence of this evolution is that fe ..."
Abstract - Add to MetaCart
is that features like robust routing, efficient search, scalability, decentralization, fault tolerance, trust and authentication have become of paramount importance. We consider in our paper the specific case of structured peer-to-peer (P2P) overlay networks with a particular focus on Content-Addressable Networks

A Scalable Content-Addressable Network

by Sylvia Ratnasamy Paul, Paul Francis, Mark H, Richard Karp, Scott Shenker, Written Vladimir Eske , 2001
"... Contents 1 Motivation 2 2 Basic CAN architecture 3 2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Data Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.3 Access Model . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.4 CAN routing . . . . . . ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
Contents 1 Motivation 2 2 Basic CAN architecture 3 2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Data Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.3 Access Model . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2.4 CAN routing

CAN Tree Routing for Content-Addressable Network

by Ifsa Publishing, Zhongtao Li, Torben Weis , 2013
"... Abstract: We propose a novel topology to improve the routing performance of Content-Addressable Network overlays while minimizing the maintenance overhead during nodes churn. The key idea of our approach is to establish a P2P tree structure (CAN tree) by means of equipping each node with a few long ..."
Abstract - Add to MetaCart
Abstract: We propose a novel topology to improve the routing performance of Content-Addressable Network overlays while minimizing the maintenance overhead during nodes churn. The key idea of our approach is to establish a P2P tree structure (CAN tree) by means of equipping each node with a few long

The Content-Addressable Network D2B

by Pierre Fraigniaud, Philippe Gauron , 2003
"... A content-addressable network (CAN) is a distributed lookup table that can be used to implement peer-to-peer (P2P) systems. A CAN allows the discovery and location of data and/or resources, identi ed by keys, in a distributed network (e.g., Internet), in absence of centralized server or any hier ..."
Abstract - Cited by 58 (2 self) - Add to MetaCart
A content-addressable network (CAN) is a distributed lookup table that can be used to implement peer-to-peer (P2P) systems. A CAN allows the discovery and location of data and/or resources, identi ed by keys, in a distributed network (e.g., Internet), in absence of centralized server or any

An Adaptive Approach to Enhance the Performance of Content-Addressable Networks

by Balazs Kovacs
"... Distributed Hash Table (DHT) algorithms structure peer-to-peer networks to provide nodes with fast and scalable lookups. In recent DHT solutions, such as Chord and Kademlia, the contacts of a node in the overlay network are determined so as to keep up with a lookup cost of O(logN) inanetworkofNnodes ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
Nnodes. As opposed to these, one of the first DHT solutions, called Content Addressable Network (CAN), has the drawback of limiting the lookup cost only in O(dN 1 d) where d is the number of dimensions in the coordinate space, a fixed network parameter. However, CAN has several merits to exploit. Thus, in this paper

An Optimal Broadcast Algorithm for Content-Addressable Networks

by Ludovic Henrio, Fabrice Huet, Justine Rochas
"... Abstract. Structured peer-to-peer networks are powerful underlying structures for communication and storage systems in large-scale setting. In the context of the Content-Addressable Network (CAN), this paper addresses the following challenge: how to perform an efficient broadcast while the local vie ..."
Abstract - Add to MetaCart
Abstract. Structured peer-to-peer networks are powerful underlying structures for communication and storage systems in large-scale setting. In the context of the Content-Addressable Network (CAN), this paper addresses the following challenge: how to perform an efficient broadcast while the local
Results 1 - 10 of 2,588