Sciweavers

223 search results - page 30 / 45
» Heterogeneity and load balance in distributed hash tables
Sort
View
ICPADS
2005
IEEE
15 years 3 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan
MOBILITY
2009
ACM
15 years 4 months ago
Feasibility evaluation of a communication-oriented P2P system in mobile environments
We present the feasibility evaluation of a structured communication-oriented Peer-to-Peer (P2P) system being used in mobile environments in this paper. The different levels of chu...
Zhonghong Ou, Erkki Harjula, Otso Kassinen, Mika Y...
INFOCOM
2003
IEEE
15 years 2 months ago
Turning Heterogeneity into an Advantage in Overlay Routing
Abstract— Distributed hash table (DHT)-based overlay networks, represented by Pastry, CAN, and Chord, offer an administration-free and fault-tolerant application-level overlay ne...
Zhichen Xu, Mallik Mahalingam, Magnus Karlsson
NOMS
2008
IEEE
139views Communications» more  NOMS 2008»
15 years 3 months ago
Fast similarity search in peer-to-peer networks
Abstract—Peer-to-peer (P2P) systems show numerous advantages over centralized systems, such as load balancing, scalability, and fault tolerance, and they require certain function...
Thomas Bocek, Ela Hunt, David Hausheer, Burkhard S...
SSD
2007
Springer
155views Database» more  SSD 2007»
15 years 3 months ago
MobiHide: A Mobilea Peer-to-Peer System for Anonymous Location-Based Queries
Abstract. Modern mobile phones and PDAs are equipped with positioning capabilities (e.g., GPS). Users can access public location-based services (e.g., Google Maps) and ask spatial ...
Gabriel Ghinita, Panos Kalnis, Spiros Skiadopoulos