Sciweavers

4438 search results - page 97 / 888
» On the Distribution of Keys by Hashing
Sort
View
VLDB
2005
ACM
132views Database» more  VLDB 2005»
16 years 6 months ago
Hash-based labeling techniques for storage scaling
Scalable storage architectures allow for the addition or removal of storage devices to increase storage capacity and bandwidth or retire older devices. Assuming random placement of...
Shu-Yuen Didi Yao, Cyrus Shahabi, Per-Åke Larson
ICNP
2006
IEEE
16 years 9 days ago
Vault: A Secure Binding Service
— Binding services are crucial building blocks in networks and networked applications. A binding service (e.g., the Domain Name System (DNS)) maps certain information, namely, bi...
Guor-Huar Lu, Changho Choi, Zhi-Li Zhang
INFOCOM
2006
IEEE
16 years 9 days ago
Improving Lookup Performance Over a Widely-Deployed DHT
— During recent years, Distributed Hash Tables (DHTs) have been extensively studied by the networking community through simulation and analysis, but until recently were not adopt...
Daniel Stutzbach, Reza Rejaie
SEM
2004
Springer
15 years 11 months ago
PlanetSim: A New Overlay Network Simulation Framework
Abstract. Current research in peer to peer systems is lacking appropriate environments for simulation and experimentation of large scale overlay services. This has led to a plethor...
Pedro García López, Carles Pairot, R...
ALGORITHMICA
2002
93views more  ALGORITHMICA 2002»
15 years 6 months ago
Improved Algorithms for Uniform Partitions of Points
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
Pankaj K. Agarwal, Binay K. Bhattacharya, Sandeep ...