Sciweavers

263 search results - page 7 / 53
» Scalable Distributed Data Structures: A Survey
Sort
View
GI
2004
Springer
14 years 25 days ago
Comparison of Load Balancing Algorithms for Structured Peer-to-Peer Systems
Abstract: Among other things, Peer-to-Peer (P2P) systems are very useful for managing large amounts of widely distributed data. Distributed Hash Tables (DHT) offer a highly scalabl...
Simon Rieche, Leo Petrak, Klaus Wehrle
HIPC
2009
Springer
13 years 5 months ago
Highly scalable algorithm for distributed real-time text indexing
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...
Ankur Narang, Vikas Agarwal, Monu Kedia, Vijay K. ...
NSDI
2004
13 years 8 months ago
Structure Management for Scalable Overlay Service Construction
This paper explores the model of providing a common overlay structure management layer to assist the construction of large-scale wide-area Internet services. To this end, we propo...
Kai Shen
PAM
2005
Springer
14 years 28 days ago
Scalable Coordination Techniques for Distributed Network Monitoring
Abstract. Emerging network monitoring infrastructures capture packetlevel traces or keep per-flow statistics at a set of distributed vantage points. Today, distributed monitors in...
Manish R. Sharma, John W. Byers
PCI
2005
Springer
14 years 28 days ago
Storing and Locating Mutable Data in Structured Peer-to-Peer Overlay Networks
Structured peer-to-peer overlay networks or Distributed Hash Tables (DHTs) are distributed systems optimized for storage and retrieval of read-only data. In this paper we elaborate...
Antony Chazapis, Nectarios Koziris