Sciweavers

36 search results - page 5 / 8
» Range Queries in Trie-Structured Overlays
Sort
View
ICPADS
2005
IEEE
14 years 4 months ago
HON-P2P: A Cluster-based Hybrid Overlay Network for Multimedia Object Management
Abstract— Multimedia centric P2P must take into consideration the main characteristics and the complex relationships among multimedia objects. In this paper, we propose a cluster...
Mouna Kacimi, Kokou Yétongnon, Yinghua Ma, ...
GIR
2006
ACM
14 years 4 months ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai
VLDB
2005
ACM
226views Database» more  VLDB 2005»
14 years 4 months ago
BATON: A Balanced Tree Structure for Peer-to-Peer Networks
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure caus...
H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu
P2P
2009
IEEE
122views Communications» more  P2P 2009»
14 years 5 months ago
Virtual Direction Routing for Overlay Networks
The enormous interest for peer-to-peer systems in recent years has prompted research into finding scalable and robust seeding and searching methods to support these overlay netwo...
Bow-Nan Cheng, Murat Yuksel, Shivkumar Kalyanarama...
AINA
2006
IEEE
14 years 5 months ago
SENS: A Scalable and Expressive Naming System using CAN Routing Algorithm
Abstract— We design a scalable and expressive naming system called SENS, which can retrieve information of computing and content resources distributed widely on the Internet by e...
Hoaison Nguyen, Toshio Oka, Hiroyuki Morikawa, Tom...