Results 1 - 10 of 20,123

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 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

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 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

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

Next century challenges: Scalable coordination in sensor networks

by Deborah Estrin, Ramesh Govindan, John Heidemann, Satish Kumar , 1999
"... Networked sensors-those that coordinate amongst them-selves to achieve a larger sensing task-will revolutionize information gathering and processing both in urban environments and in inhospitable terrain. The sheer numbers of these sensors and the expected dynamics in these environments present uniq ..."
Abstract - Cited by 1116 (37 self) - Add to MetaCart
Networked sensors-those that coordinate amongst them-selves to achieve a larger sensing task-will revolutionize information gathering and processing both in urban environments and in inhospitable terrain. The sheer numbers of these sensors and the expected dynamics in these environments present

Directed diffusion: a scalable and robust communication paradigm for sensor networks.

by Chalermek Intanagonwiwat , Ramesh Govindan , Deborah Estrin - In Mobicom ’00: Proceedings of the 6th annual international conference on mobile computing and networking , 2000
"... ..."
Abstract - Cited by 2320 (75 self) - Add to MetaCart
Abstract not found

TOSSIM: Accurate and Scalable Simulation of Entire TinyOS Applications

by Philip Levis, Nelson Lee, Matt Welsh, David Culler , 2003
"... Accurate and scalable simulation has historically been a key enabling factor for systems research. We present TOSSIM, a simulator for TinyOS wireless sensor networks. By exploiting the sensor network domain and TinyOS’s design, TOSSIM can capture network behavior at a high fidelity while scaling to ..."
Abstract - Cited by 784 (19 self) - Add to MetaCart
Accurate and scalable simulation has historically been a key enabling factor for systems research. We present TOSSIM, a simulator for TinyOS wireless sensor networks. By exploiting the sensor network domain and TinyOS’s design, TOSSIM can capture network behavior at a high fidelity while scaling

A Scalable, Commodity Data Center Network Architecture

by Mohammad Al-Fares, Alexander Loukissas, Amin Vahdat , 2008
"... Today’s data centers may contain tens of thousands of computers with significant aggregate bandwidth requirements. The network architecture typically consists of a tree of routing and switching elements with progressively more specialized and expensive equipment moving up the network hierarchy. Unfo ..."
Abstract - Cited by 466 (18 self) - Add to MetaCart
Today’s data centers may contain tens of thousands of computers with significant aggregate bandwidth requirements. The network architecture typically consists of a tree of routing and switching elements with progressively more specialized and expensive equipment moving up the network hierarchy

Memory Consistency and Event Ordering in Scalable Shared-Memory Multiprocessors

by Kourosh Gharachorloo, Daniel Lenoski, James Laudon, Phillip Gibbons, Anoop Gupta, John Hennessy - In Proceedings of the 17th Annual International Symposium on Computer Architecture , 1990
"... Scalable shared-memory multiprocessors distribute memory among the processors and use scalable interconnection networks to provide high bandwidth and low latency communication. In addition, memory accesses are cached, buffered, and pipelined to bridge the gap between the slow shared memory and the f ..."
Abstract - Cited by 730 (17 self) - Add to MetaCart
Scalable shared-memory multiprocessors distribute memory among the processors and use scalable interconnection networks to provide high bandwidth and low latency communication. In addition, memory accesses are cached, buffered, and pipelined to bridge the gap between the slow shared memory
Results 1 - 10 of 20,123